Secure computability of functions in the it setting with dishonest majority and applications to long-term security

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

Volumn 5444 LNCS, Issue , 2009, Pages 238-255

  Künzler, Robin ^a   Müller Quade, Jörn ^b   Raub, Dominik ^a  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Corrupted majority; Information theoretic security; Long term security; Secure function evaluation

Indexed keywords

AUTHENTICATED CHANNEL; COMPUTATIONAL ASSUMPTIONS; CORRUPTED MAJORITY; INFORMATION-THEORETIC SECURITY; IT SECURITY; LONG-TERM SECURITY; POWER INCREASE; PROTOCOL EXECUTION; SECURE FUNCTION EVALUATION; SENSITIVE DATAS; THE STANDARD MODEL;

CRYPTOGRAPHY; FUNCTION EVALUATION; INFORMATION TECHNOLOGY; INFORMATION THEORY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 70350657209     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00457-5_15     Document Type: Conference Paper

References (28)

1. Ambainis, A., Buhrman, H., Dodis, Y., Röhrig, H.: Multiparty quantum coin flipping. In: IEEE Conference on Computational Complexity, pp. 250-259. IEEE, Los Alamitos (2004)
2. Beaver, D.: Perfect privacy for two-party protocols. In: Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography (1989)
3. Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In:Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 80-97. Springer, Heidelberg (1999)
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1-10 (1988)
5. Brassard, G., Crépeau, C., Mayers, D., Salvail, L.: Defeating classical bit commitments with a quantum computer. Los Alamos preprint archive quant-ph/9806031 (May 1999)
6. Broadbent, A., Tapp, A.: Information-theoretic security without an honest majority. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 410-426. Springer, Heidelberg (2007)
7. Cachin, C., Crépeau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: STOC 2002, pp. 493-502. ACM Press, New York (2002)
8. Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292-306. Springer, Heidelberg (1997)
9. Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. In: STOC 1989 (1989)
10. Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: STOC 1986, pp. 364-369. ACM Press, New York (1986)
11. Damgård, I., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantumstorage model. In: FOCS 2005, pp. 449-458. IEEE, Los Alamitos (2005)
12. Dolev, D., Strong, R.: Authenticated algorithms for byzantine agreement. SICOMP: SIAM Journal on Computing, 12 (1983)
13. Dziembowski, S., Maurer, U.: On generating the initial key in the bounded-storage model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 126-137. Springer, Heidelberg (2004)
14. Fitzi, M., Hirt, M., Holenstein, T., Wullschleger, J.: Two-threshold broadcast and detectable multi-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 51-67. Springer, Heidelberg (2003)
15. Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
16. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218-229 (1987)
17. Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: STOC 2008, pp. 413-422. ACM, New York (2008)
18. Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: STOC 2007, pp. 1-10. ACM, New York (2007)
19. Klian, J.: A general completeness theorem for two-party games. In: STOC 1991, pp. 553-560. ACM Press, New York (1991)
20. Kilian, J.:More general completeness theorems for secure two-party computation. In: STOC 2000, pp. 316-324. ACM Press, New York (2000)
21. Kraschewski, D., Müller-Quade, J.: Completeness theorems with constructive proofs for symmetric, asymmetric and general 2-party-functions (unpublished manuscript, 2008)
22. Künzler, R., Müller-Quade, J., Raub, D.: Secure computability of functions in the IT setting with dishonest majority and applications to long-term security. Cryptology ePrint Archive, Report 2008/264 (2008), http://eprint.iacr.org/2008/264
23. Kushilevitz, E.: Privacy and communication complexity. In: FOCS 1989, pp. 416-421. IEEE, Los Alamitos (1989)
24. Kushilevitz, E.: Privacy and communication complexity. SIAM Journal on Discrete Mathematics 5(2), 273-284 (1992)
25. Mayers, D.: Unconditionally secure bit commitment is impossible. Phys. Rev. Letters 78, 3414-3417 (1997)
26. Müller-Quade, J.: Temporary assumptions-quantum and classical. In: The 2005 IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, pp. 31-33 (2005)
27. Müller-Quade, J., Unruh, D.: Long-term security and universal composability. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 41-60. Springer, Heidelberg (2007)
28. Rabin, M.: Hyper-encryption by virtual satellite. Science Center Research Lecture Series (2003)