Information-theoretic security without an honest majority

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

Volumn 4833 LNCS, Issue , 2007, Pages 410-426

  Broadbent, Anne ^a   Tapp, Alain ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Anonymous message transmission; Collision detection; Dining cryptographers; Election protocols; Information theoretic security; Multiparty computation

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; INFORMATION THEORY; MESSAGE PASSING; NETWORK PROTOCOLS;

ANONYMOUS BIT TRANSMISSION; AUTHENTIC PRIVATE CHANNELS; COLLISION DETECTION; DINING CRYPTOGRAPHERS; ELECTION PROTOCOLS; INFORMATION-THEORETIC SECURITY;

SECURITY OF DATA;

EID: 38149099254     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76900-2_25     Document Type: Conference Paper

References (14)

1. Adida, B., Neff, C.A.: Ballot casting assurance. In: EVT 2006. Proceedings of the First Usenix/ACCURATE Electronic Voting Technology Workshop (2006)
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the twentieth annual ACM Symposium on Theory of Computing (STOC), pp. 1-10. ACM Press, New York (1988)
3. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proceedings of the twentieth annual ACM Symposium on Theory of Computing (STOC), pp. 11-19. ACM Press, New York (1988)
4. Cramer, R., Fehr, S., Padró, C.: Combinatorial codes for detection of algebraic manipulation and their applications. Manuscript (2007)
5. Cramer, R., Franklin, M., Schoenmakers, B., Yung, M.: Multi-authority secret ballot elections with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 72-83. Springer, Heidelberg (1996)
6. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS), pp. 383-395 (1985)
7. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 84-88 (1981)
8. Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1, 65-75 (1988)
9. Cabello, S., Padró, C., Sáez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Designs, Codes and Cryptography 25, 175-188 (2002)
10. Hevia, A., Micciancio, D.: Simultaneous broadcast revisited. In: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pp. 324-333. ACM Press, New York (2005)
11. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the twenty-first annual ACM Symposium on Theory of Computing (STOC), pp. 73-85. ACM Press, New York (1989)
12. Sako, K., Kilian, J.: Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393-403. Springer, Heidelberg (1995)
13. Waidner, M., Pfitzmann, B.: The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, p. 690. Springer, Heidelberg (1990)
14. Waidner, M., Pfitzmann, B.: Unconditional sender and recipient untraceability in spite of active attacks -some remarks. Technical report, Universität Karlsruhe (1989)