Computational Verifiable Secret Sharing Revisited
ASIACRYPT, Lecture Notes in Computer Science, Springer, vol. 7073, pp. 590-609, 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ashish Choudhury, Kaoru Kurosawa, Arpita Patra
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.
ACNS, Lecture Notes in Computer Science, vol. 6715, pp. 292-308, 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Arpita Patra
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity
OPODIS, Lecture Notes in Computer Science, Springer, vol. 7109, pp. 34-49, 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Arpita Patra and C. Pandu Rangan
Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience
ICITS, Lecture Notes in Computer Science, Springer, vol. 6673, pp. 206-226, 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ashish Choudhury, Kaoru Kurosawa, Arpita Patra
The Round Complexity of Perfectly Secure General VSS
ICITS, Lecture Notes in Computer Science, Springer, vol. 6673, pp. 143-162, 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, and C. Pandu Rangan
Secure message transmission in asynchronous networks
J. Parallel Distrib. Comput., vol. 71, no. 8, pp. 1067-1074, 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
© IACR | Springer | ACM | IEEE