Universally composable security with global setup

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

Volumn 4392 LNCS, Issue , 2007, Pages 61-85

  Canetti, Ran ^a   Dodis, Yevgeniy ^b   Pass, Rafael ^c   Walfish, Shabsi ^b  

^a IBM RESEARCH   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c Department of Molecular Biology and Genetics

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CRYPTOGRAPHY; KNOWLEDGE MANAGEMENT; NETWORK PROTOCOLS;

DENIABILITY CONCERN; SECURITY GUARANTEES; SET-UP ASSUMPTIONS; ZERO KNOWLEDGE;

SECURITY OF DATA;

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

References (32)

1. M. Abe, and S. Fehr. Perfect NIZK with Adaptive Soundness. In Proc. of TCC, 2007.
2. G. Ateniese and B. de Medeiros. Identity-based Chameleon Hash and Applications. Proc. of Financial Cryptography, 2004. Available at http://eprint.iacr.org/2003/167/.
3. D. Beaver. Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority, in J. Cryptology, vol 4., pp. 75-122, 1991.
4. B. Barak, R. Canetti, Y. Lindell, R. Pass and T. Rabin. Secure Computation Without Authentication. In CRYPTO 2005, Springer-Verlag (LNCS 3621), pages 361-377, 2005.
5. B. Barak, R. Canetti, J. Nielsen and R. Pass. Universally composable protocols with relaxed set-up assumptions. In Proc. of FOCS, 2004.
6. D. Boneh, and M. Franklin. Identity Based Encryption from the Weil Pairing. In Proc. of Crypto, 2001.
7. B. Barak and Y. Lindell. Strict Polynomial-time Simulation and Extraction. In SIAM J. Comput., 33(4), pp. 783-818, 2004.
8. B. Barak and A. Sahai, How To Play Almost Any Mental Game Over the Net - Concurrent Composition via Super-Polynomial Simulation. In Proc. of FOCS, 2005.
9. R. Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, Vol. 13, No. 1, winter 2000.
10. R. Canetti. Universally Composable Security: A New paradigm for Cryptographic Protocols. In Proc. of FOCS, pages 136-145, 2001.
11. R. Canetti. Universally Composable Security: A New paradigm for Cryptographic Protocols. In Cryptology ePrint Archive, Report 2000/067, revised edition from Dec. 2005. Available at: http://eprint.iacr.org/ 2000/067
12. R. Canetti. Universally Composable Signature, Certification, and Authentication. In Proc. of CSFW, p. 219, 2004.
13. R. Canetti, Y. Dodis, R. Pass, and S. Walfish. Universally Composable Security with Global Setup. In Cryptology ePrint Archive, Report 2006/432. Available at: http://eprint.iacr.org/2006/432
14. R. Cramer, I. Damgard, B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Proc. of CRYPTO, pp. 174-187, 1994.
15. R. Canetti and M. Fischlin. Universally Composable Commitments. In Proc. of Crypto, pages 19-40, 2001.
16. R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. In Proc. of Eurocrypt, Springer-Verlag (LNCS 2656), pp. 68-86, 2003.
17. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation. In Proc. of STOC, pp. 494-503, 2002.
18. R. Canetti and T. Rabin. Universal Composition with Joint State. In Proc. of Crypto 2003, Springer-Verlag, pp. 265-281, 2003.
19. I. Damgard and J. Nielsen. Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. In Proc. of Crypto, Springer-Verlag, pp. 581-596, 2002.
20. Y. Dodis and S. Micali. Parallel Reducibility for Information- Theoretically Secure Computation. In Proc. of Crypto, Springer-Verlag (LNCS 1880), pp. 74-92, 2000.
21. U. Feige. Alternative Models for Zero Knowledge Interactive Proofs. Ph.D. thesis, Weizmann Institute of Science, Rehovot, Israel, 1990.
22. U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String. In Proc. of FOCS, 1990.
23. S. Goldwasser, and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. CRYPTO '90, LNCS 537, 1990.
24. O. Goldreich, S. Micali, and A. Wigderson. How to Solve any Protocol Problem. In Proc.of STOC, 1987.
25. D. Hofheinz, J. Muller-Quade, and D. Unruh. Universally Composable Zero-Knowledge Arguments and Commitments from Signature Cards. In Proc. of the 5th Central European Conference on Cryptology MoraviaCrypt 2005, June 2005.
26. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated Verifier Proofs and their Applications. In Proc. of Eurocrypt, Springer-Verlag, 1996.
27. S. Micali and P. Rogaway. Secure Computation. unpublished manuscript, 1992. Preliminary version in CRYPTO '91, LNCS 576, 1991.
28. R. Pass. On Deniabililty in the Common Reference String and Random Oracle Model. In Proc. of Crypto, LNCS 2729, pp. 216-337, 2003.
29. R. Pass. Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In Proc. of STOC, pp. 232-241, 2004.
30. M. Prabhakaran and A. Sahai. New Notions of Security: Achieving Universal Composability without Trusted Setup. In Proc. of STOC, 2004.
31. B. Pfitzmann and M. Waidner. Composition and Integrity Preservation of Secure Reactive Systems. In Proc. of ACM CCS, pages 245-254, 2000.
32. F. Zhang, R. Safavi-Naini and W. Susilo. ID-Based Chameleon Hashes from Bilinear Pairings. Available at http://eprint.iacr.org/2003/208/.