On the necessity of rewinding in secure multiparty computation

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

Volumn 4392 LNCS, Issue , 2007, Pages 157-173

  Backes, Michael ^a   Müller Quade, Jörn ^b   Unruh, Dominique ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; INFORMATION THEORY; MATHEMATICAL MODELS; SECURITY OF DATA; STATISTICAL METHODS;

CONCURRENT COMPOSITION; NON-REWINDING SIMULATOR; STATISTICAL SECURITY;

COMPUTATION THEORY;

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

References (18)

1. M. Backes, B. Pfitzmann, and M. Waidner. Secure asynchronous reactive systems. IACR Cryptology ePrint Archive 2004/082, Mar. 2004.
2. D. Beaver. Secure multiparty protocols and zero knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2):75-122, 1991.
3. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 3(1):143-202, 2000.
4. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 136-145, 2001. Extended version in Cryptology ePrint Archive, Report 2000/67, http://eprint.iacr.org/.
5. Y. Dodis and S. Micali. Parallel reducibility for information- theoretically secure computation. In M. Bellare, editor, Advances in Cryptology, Proceedings of CRYPTO '00, volume 1880 of Lecture Notes in Computer Science, pages 74-92. Springer-Verlag, 2000.
6. O. Goldreich. Foundations of Cryptography - Volume 2 (Basic Applications). Cambridge University Press, May 2004. Previous version online available at http://www.wisdom.weizmann.ac.il/~oded/frag.html.
7. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - or - a completeness theorem for protocols with honest majority. In Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
8. S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. In Advances in Cryptology: CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 77-93. Springer, 1990.
9. D. Hofheinz, J. Müller-Quade, and D. Unruh. On the (im)possibility of extending coin toss. In S. Vaudenay, editor, Advances in Cryptology, Proceedings of EUROCRYPT '06, volume 4004 of Lecture Notes in Computer Science, pages 504-521. Springer-Verlag, 2006. Full version online available at http://eprint.iacr.org/2006/177.
10. D. Hofheinz and D. Unruh. Comparing two notions of simulatability. In J. Kilian, editor, Theory of Cryptography, Proceedings of TCC 2005, Lecture Notes in Computer Science, pages 86-103. Springer-Verlag, 2005. Online available at http://iaks-www.ira.uka.de/home/unruh/publications/hofheinz05comparing.html.
11. D. Hofheinz and D. Unruh. Simulatable security and polynomially bounded concurrent composition. In IEEE Symposium on Security and Privacy, Proceedings of SSP '06, pages 169-182. IEEE Computer Society, 2006. Full version online available at http://eprint.iacr.org/2006/130.ps.
12. E. Kushilevitz, Y. Lindell, and T. Rabin. Information-theoretically secure protocols and security under composition. In 38th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2006, pages 109-118. ACM Press, 2006. Online available at http://www.cs.biu.ac.il/~lindell/abstracts/IT- composition_ab s.html.
13. Y. Lindell. Bounded-concurrent secure two-party computation without setup assumptions. In 35th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2003, pages 683-692. ACM Press, 2003.
14. Y. Lindell. General composition and universal composability in secure multi-party computation. In 44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003, pages 394-403. IEEE Computer Society, 2003. Online available at http://eprint.iacr.org/2003/141.
15. Y. Lindell. Lower bounds for concurrent self composition. In M. Naor, editor, Theory of Cryptography, Proceedings of TCC 2004, volume 2951 of Lecture Notes in Computer Science, pages 203-222. Springer-Verlag, 2004.
16. S. Micali and P. Rogaway. Secure computation. In Advances in Cryptology: CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 392-404. Springer, 1991.
17. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. 7th ACM Conference on Computer and Communications Security, pages 245-254, 2000. Extended version (with Matthias Schunter) IBM Research Report RZ 3206, May 2000, http://www.semper.org/ sirene/publ/PfSW1_00ReactSimulIBM.pa.gz.
18. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. 22nd IEEE Symposium on Security & Privacy, pages 184-200, 2001. Extended version of the model (with Michael Backes) IACR Cryptology ePrint Archive 2004/082, http://eprint.iacr.org/.