Pseudo-signatures, Broadcast, and multi-party computation from correlated randomness

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

Volumn 3152, Issue , 2004, Pages 562-578

  Fitzi, Matthias ^a   Wolf, Stefan ^a   Wullschleger, Jürg ^b  

^a University of California   (United States)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Broadcast; Information theory; Multiparty computation; Pseudo signatures; Unconditional security

Indexed keywords

BROADCASTING; COMPUTATION THEORY; INFORMATION THEORY; MOBILE SECURITY;

JOINT DISTRIBUTIONS; MULTIPARTY COMPUTATION; PSEUDO-SIGNATURES; UNCONDITIONAL SECURITY; UNCONDITIONALLY SECURE;

NETWORK SECURITY;

EID: 35048830930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_34     Document Type: Article

References (27)

1. Donald Beaver. Multiparty protocols tolerating half faulty processors. Advances in Cryptology: CRYPTO '89, volume 435 of Lecture Notes in Computer Science, 560-572. Springer-Verlag, 1989.
2. Michael Ben-Or, Shaft Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88), 1-10. Springer-Verlag, 1988.
3. Richard E. Blahut. Principles and practice of information theory. Addison-Wesley, Reading, MA, 1988.
4. Jurjen Bos and Bert den Boer. Detection of disrupters in the DC protocol. Advances in Cryptology: EUROCRYPT '89, volume 434 of Lecture Notes in Computer Science, 320-327. Springer-Verlag, 1990.
5. David Chaum. The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology, l(1):65-75, 1988.
6. David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88), 11-19. ACM Press, 1988.
7. David Chaum and Sandra Roijakkers. Unconditionally-secure digital signatures. Advances in Cryptology: CRYPTO '90, volume 537 of Lecture Notes in Computer Science, 206-214. Springer-Verlag, 1990.
8. Richard Cleve. Limits on the security of coin flips when half the processors are faulty. ACM Symposium on Theory of Computing (STOC '86), 364-369, ACM Press, 1986.
9. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. WileyInterscience, New York, USA, 1991.
10. Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. Advances in Cryptology: EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, 311-326. Springer-Verlag, 1999.
11. Whitfield Diffie and Martin Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, 1976.
12. Danny Dolev and H. Raymond Strong. Polynomial algorithms for multiple processor agreement. Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC '82), 401-407, 1982.
13. Danny Dolev and H. Raymond Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656-666, 1983.
14. Michael J. Fischer, Nancy A. Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26-39, 1986.
15. Matthias Fitzi, Nicolas Gisin, and Ueli Maurer. Quantum solution to the Byzantine agreement problem. Physical Review Letters, 87(21):7901-l-7901-4, 2001.
16. Matthias Fitzi, Nicolas Gisin, Ueli Maurer, and Oliver von Rotz. Unconditional Byzantine agreement and multi-party computation secure against dishonest minorities from scratch. Advances in Cryptology: EUROCRYPT.'02, volume 2332 of Lecture Notes in Computer Science, 482-501. Springer-Verlag, 2002.
17. Matthias Fitzi and Ueli Maurer. From partial consistency to global broadcast. 32nd Annual Symposium on Theory of Computing, STOC '00, 494-503. ACM, 2000.
18. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game. Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC '87), 218-229. ACM Press, 1987.
19. Leslie Lamport. Constructing digital signatures from a one-way function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory, 1979.
20. Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
21. Ueli Maurer. Secret key agreement by public discussion. IEEE Transaction on Information'Theory, 39(3):733-742, 1993.
22. Ueli Maurer. Information-theoretically secure secret-key agreement by NOT authenticated public discussion. Advances in Cryptology: EUROCRYPT '97, volume 49 of Lecture Notes in Computer Science, 209-225. Springer-Verlag, 1997.
23. Ueli M. Maurer and Stefan Wolf. Secret-key agreement over unauthenticated public channels Part I: Definitions and a completeness result. IEEE Transactions on Information Theory, 49:822-831, 2003.
24. Ueli M. Maurer and Stefan Wolf. Secret-key agreement over unauthenticated public channels-Part II: The simulatability condition. IEEE Transactions on Information Theory, 49:832-838, 2003.
25. Birgit Pfitzmann and Michael Waidner. Information-theoretic pseudosignatures and Byzantine agreement for t >= n/3. Technical Report RZ 2882 (#90830), IBM Research, 1996.
26. Tal Rabin and Michael Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC '89), 73-85, 1989.
27. Andrew C. Yao. Protocols for secure computations. Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS '82), 160-164, 1982.