Privacy Preserving Shortest Path Computation in Presence of Convex Polygonal Obstacles. [Citation Graph (, )][DBLP]
Secured Multi-robotic Active Localization without Exchange of Maps: A Case of Secure Cooperation Amongst Non-trusting Robots. [Citation Graph (, )][DBLP]
Generalized Robust Combiners for Oblivious Transfer. [Citation Graph (, )][DBLP]
Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. [Citation Graph (, )][DBLP]
Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle. [Citation Graph (, )][DBLP]
Efficient single phase unconditionally secure message transmission with optimum communication complexity. [Citation Graph (, )][DBLP]
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. [Citation Graph (, )][DBLP]
Brief announcement: global consistency can be easier than point-to-point communication. [Citation Graph (, )][DBLP]