Towards optimal and efficient perfectly secure message transmission

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4392 LNCS, Issue , 2007, Pages 311-322

  Fitzi, Matthias ^a   Franklin, Matthew ^b   Garay, Juan ^c   Vardhan, S Harsha ^d  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c LUCENT TECHNOLOGIES   (United States)

^d INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MESSAGE PASSING; POLYNOMIALS; PROBLEM SOLVING;

COMMUNICATION COMPLEXITY; COMMUNICATION-OPTIMAL; MESSAGE TRANSMISSION; SYNCHRONOUS CHANNELS;

SECURITY OF DATA;

EID: 38049004833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_17     Document Type: Conference Paper

References (20)

1. S. Agarwal, R. Cramer, and R. de Haan. Asymptotically optimal two-round perfectly secure message transmission. In Advances in Cryptology: CRYPTO '06. Springer-Verlag, 2006.
2. M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing (PODC '83), pages 17-19. ACM, 1983.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88), pages 1-10. Springer-Verlag, 1988.
4. E. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470.
5. P. Berman, J. A. Garay, and K. J. Perry. Bit optimal distributed consensus. In Computer Science Research, pages 313-322. Plenum Publishing Corporation, 1992.
6. G. Bracha. An O(log n) expected rounds randomized Byzantine generals protocol. Journal of the Association for Computing Machinery, 34(4):910-920, Oct. 1987.
7. B. A. Coan and J. L. Welch. Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1):61-85, Mar. 1992.
8. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. Journal of the ACM, 40(0):17-47, Jan. 1993.
9. C. Dwork, D. Peleg, N. Pippinger, and E. Upfal. Fault tolerance in networks of bounded degree. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC '86), pages 370-379, 1986.
10. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC '87), pages 218-229, 1987.
11. M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31-60, Winter 2000.
12. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301): 13-30, Mar. 1963.
13. V. King, J. Saia, V. Sanwalani, and E. Vee. Towards secure and scalable computation in Peer-to-Peer networks. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS '06), 2006.
14. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. Syst., 4(3):382-401, July 1982.
15. R. Ostrovsky, S. Rajagopalan, and U. Vazirani. Simple and efficient leader election in the full information model. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC '94), pages 234-242, 1994.
16. A. Patra, A. Choudhary, K. Srinathan, and C. Pandu Rangan. Constant phase bit optimal protocols for perfectly secure message transmission. In Indocrypt '06, 2006.
17. H. Sayeed and H. Abu-Amara. Efficient perfectly secure message transmission in synchronous networks. Information and Communication, 126(1):53-61, 1996.
18. K. Srinathan, A. Narayanan, and C. Pandu Rangan. Optimal perfectly secure message transmission. In Advances in Cryptology: CRYPTO '04, volume 3152 of Lecture Notes in Computer Science, pages 545-561. Springer-Verlag, 2004.
19. A. C. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS '82), pages 160-164. IEEE, 1982.
20. D. Zuckerman. Randomness-optimal sampling, extractors, and constructive leader election. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC '96), pages 286-295, 1996.