On perfectly secure communication over arbitrary networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 193-202

  Ashwin Kumar, M V N ^a   Goundan, Pranava R ^a   Srinathan, K ^a   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Adversary structures; Information theoretic security; Secure communication; Secure multiparty computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; INTERCONNECTION NETWORKS; MAXIMUM PRINCIPLE; NETWORK PROTOCOLS; SECURITY OF DATA;

BYZANTINE ADVERSARY; COMMUNICATION COMPLEXITY; SECURE MESSAGE TRANSMISSION; SECURE MULTIPARTY COMPUTATION; THRESHOLD ADVERSARY MODEL;

TELECOMMUNICATION NETWORKS;

EID: 0036957420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. L. Babai, A. Gal, J. Kollar, L. Ronyai, T. Szabo, and A. Wigderson. Extremal bipartite graphs and superpolynomial lowerbounds for monotone span programs. In Proceedings of 28th ACM Symposium on Theory of Computing (STOC), pages 603-611, 1996.
2. A. Beimel. Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Department of Computer Science, Technion, 1996.
3. A. Beimel and Y. Ishai. On the power of nonlinear secret sharing. In Proceedings of the 16th Annual IEEE Structure in Complexity Theory, pages 188-202, 2001.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of 20th ACM Symposium on Theory of Computing (STOC), pages 1-10, 1988.
5. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proceedings of 20th ACM Symposium on Theory of Computing (STOC), pages 11-19, 1988.
6. R. Cramer, I. Damgard, and U. Maurer. Efficient general secure multiparty computation from any linear secret sharing scheme. In Advances in Cryptology, Eurocrypt2000, Lecture Notes in Computer Science. Springer-Verlag, 2000.
7. Y. Desmedt and Y. Wang. Perfectly secure message transmission revisited. In Advances in Cryptology Eurocrypt '02, Lecture Notes in Computer Science (LNCS). Springer-Verlag, 2002.
8. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. JACM, pages 17-47, 1993.
9. M. Franklin and R. N. Wright. Secure communication in minimal connectivity models. In Advances in Cryptology Eurocrypt '98, volume 1403 of Lecture Notes in Computer Science (LNCS), pages 346-360. Springer-Verlag, 1998.
10. M. Franklin and M. Yung. Secure hypergraphs: privacy from partial broadcast. In In Proceedings of 27th ACM Symposium on Theory of Computing (STOC), pages 36-44, 1995.
11. A. Gal. A characterization of span program size and improved lower bonds for monotone span programs. In Proceedings of 30th ACM Symposium on Theory of Computing (STOC), pages 429-437, 1998.
12. Rosario Gennaro, Michael O. Rabin, and Tal Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proceedings of 17th ACM Symposium on Principles of Distributed Computing (PODC), 1998.
13. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multiparty computation. In 16th ACM Symposium on Principles of Distributed Computing (PODC), pages 25-34, August 1997.
14. M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31-60, April 2000.
15. M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. In Proceedings of IEEE Globecom 87, pages 99-102. IEEE, 1987.
16. M. Karchmer and A. Wigderson. On span programs. In Proceedings of the 8th Annual IEEE Structure in Complexity Theory, pages 102-111, 1993.
17. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of 21st ACM Symposium on Theory of Computing (STOC), pages 73-85, 1989.
18. H. Sayeed and H. Abu-Amara. Efficient perfectly secure message transmission in synchronous networks. Information and Computation, 126(1):53-61, 1996.
19. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.