메뉴 건너뛰기




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

Universally composable security with global setup

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CRYPTOGRAPHY; KNOWLEDGE MANAGEMENT; NETWORK PROTOCOLS;

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

References (32)
  • 1
    • 70349294770 scopus 로고    scopus 로고
    • Perfect NIZK with Adaptive Soundness
    • M. Abe, and S. Fehr. Perfect NIZK with Adaptive Soundness. In Proc. of TCC, 2007.
    • (2007) Proc. of TCC
    • Abe, M.1    Fehr, S.2
  • 2
    • 33645398404 scopus 로고    scopus 로고
    • Identity-based Chameleon Hash and Applications
    • Available at
    • 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/.
    • (2004) Proc. of Financial Cryptography
    • Ateniese, G.1    de Medeiros, B.2
  • 3
    • 33746365751 scopus 로고
    • Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority
    • D. Beaver. Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority, in J. Cryptology, vol 4., pp. 75-122, 1991.
    • (1991) J. Cryptology , vol.4 , pp. 75-122
    • Beaver, D.1
  • 4
    • 33745126318 scopus 로고    scopus 로고
    • Secure Computation Without Authentication
    • CRYPTO 2005, Springer-Verlag
    • 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.
    • (2005) LNCS , vol.3621 , pp. 361-377
    • Barak, B.1    Canetti, R.2    Lindell, Y.3    Pass, R.4    Rabin, T.5
  • 5
    • 17744381610 scopus 로고    scopus 로고
    • Universally composable protocols with relaxed set-up assumptions
    • B. Barak, R. Canetti, J. Nielsen and R. Pass. Universally composable protocols with relaxed set-up assumptions. In Proc. of FOCS, 2004.
    • (2004) Proc. of FOCS
    • Barak, B.1    Canetti, R.2    Nielsen, J.3    Pass, R.4
  • 6
    • 0012970453 scopus 로고    scopus 로고
    • Identity Based Encryption from the Weil Pairing
    • D. Boneh, and M. Franklin. Identity Based Encryption from the Weil Pairing. In Proc. of Crypto, 2001.
    • (2001) Proc. of Crypto
    • Boneh, D.1    Franklin, M.2
  • 7
    • 4544230984 scopus 로고    scopus 로고
    • Strict Polynomial-time Simulation and Extraction
    • B. Barak and Y. Lindell. Strict Polynomial-time Simulation and Extraction. In SIAM J. Comput., 33(4), pp. 783-818, 2004.
    • (2004) SIAM J. Comput , vol.33 , Issue.4 , pp. 783-818
    • Barak, B.1    Lindell, Y.2
  • 8
    • 33748619223 scopus 로고    scopus 로고
    • How To Play Almost Any Mental Game Over the Net - Concurrent Composition via Super-Polynomial Simulation
    • 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.
    • (2005) Proc. of FOCS
    • Barak, B.1    Sahai, A.2
  • 9
    • 0000731055 scopus 로고    scopus 로고
    • Security and composition of multi-party cryptographic protocols
    • winter
    • R. Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, Vol. 13, No. 1, winter 2000.
    • (2000) Journal of Cryptology , vol.13 , Issue.1
    • Canetti, R.1
  • 10
    • 0035163054 scopus 로고    scopus 로고
    • Universally Composable Security: A New paradigm for Cryptographic Protocols
    • R. Canetti. Universally Composable Security: A New paradigm for Cryptographic Protocols. In Proc. of FOCS, pages 136-145, 2001.
    • (2001) Proc. of FOCS , pp. 136-145
    • Canetti, R.1
  • 11
    • 38049077676 scopus 로고    scopus 로고
    • 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
    • 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
    • 4944266340 scopus 로고    scopus 로고
    • Universally Composable Signature, Certification, and Authentication
    • R. Canetti. Universally Composable Signature, Certification, and Authentication. In Proc. of CSFW, p. 219, 2004.
    • (2004) Proc. of CSFW , pp. 219
    • Canetti, R.1
  • 13
    • 38049064718 scopus 로고    scopus 로고
    • 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
    • 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
    • 85016672373 scopus 로고
    • Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
    • 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.
    • (1994) Proc. of CRYPTO , pp. 174-187
    • Cramer, R.1    Damgard, I.2    Schoenmakers, B.3
  • 15
    • 84880897758 scopus 로고    scopus 로고
    • Universally Composable Commitments
    • R. Canetti and M. Fischlin. Universally Composable Commitments. In Proc. of Crypto, pages 19-40, 2001.
    • (2001) Proc. of Crypto , pp. 19-40
    • Canetti, R.1    Fischlin, M.2
  • 16
    • 35248854495 scopus 로고    scopus 로고
    • On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions
    • Proc. of Eurocrypt, Springer-Verlag
    • 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.
    • (2003) LNCS , vol.2656 , pp. 68-86
    • Canetti, R.1    Kushilevitz, E.2    Lindell, Y.3
  • 17
    • 0036038991 scopus 로고    scopus 로고
    • Universally Composable Two-Party and Multi-Party Secure Computation
    • 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.
    • (2002) Proc. of STOC , pp. 494-503
    • Canetti, R.1    Lindell, Y.2    Ostrovsky, R.3    Sahai, A.4
  • 18
    • 35248819315 scopus 로고    scopus 로고
    • Universal Composition with Joint State
    • Springer-Verlag, pp
    • R. Canetti and T. Rabin. Universal Composition with Joint State. In Proc. of Crypto 2003, Springer-Verlag, pp. 265-281, 2003.
    • (2003) Proc. of Crypto 2003 , pp. 265-281
    • Canetti, R.1    Rabin, T.2
  • 19
    • 84937437506 scopus 로고    scopus 로고
    • Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
    • Springer-Verlag, pp
    • 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.
    • (2002) Proc. of Crypto , pp. 581-596
    • Damgard, I.1    Nielsen, J.2
  • 20
    • 84974597111 scopus 로고    scopus 로고
    • Parallel Reducibility for Information- Theoretically Secure Computation
    • Proc. of Crypto, Springer-Verlag
    • Y. Dodis and S. Micali. Parallel Reducibility for Information- Theoretically Secure Computation. In Proc. of Crypto, Springer-Verlag (LNCS 1880), pp. 74-92, 2000.
    • (2000) LNCS , vol.1880 , pp. 74-92
    • Dodis, Y.1    Micali, S.2
  • 22
    • 0003651428 scopus 로고
    • Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String
    • U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String. In Proc. of FOCS, 1990.
    • (1990) Proc. of FOCS
    • Feige, U.1    Lapidot, D.2    Shamir, A.3
  • 23
    • 84955564077 scopus 로고
    • Fair Computation of General Functions in Presence of Immoral Majority. CRYPTO '90
    • S. Goldwasser, and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. CRYPTO '90, LNCS 537, 1990.
    • (1990) LNCS , vol.537
    • Goldwasser, S.1    Levin, L.2
  • 26
    • 0002914851 scopus 로고    scopus 로고
    • Designated Verifier Proofs and their Applications
    • Springer-Verlag
    • M. Jakobsson, K. Sako, and R. Impagliazzo. Designated Verifier Proofs and their Applications. In Proc. of Eurocrypt, Springer-Verlag, 1996.
    • (1996) Proc. of Eurocrypt
    • Jakobsson, M.1    Sako, K.2    Impagliazzo, R.3
  • 27
    • 0002187139 scopus 로고
    • Secure Computation. unpublished manuscript, 1992. Preliminary version in CRYPTO '91
    • S. Micali and P. Rogaway. Secure Computation. unpublished manuscript, 1992. Preliminary version in CRYPTO '91, LNCS 576, 1991.
    • (1991) LNCS , vol.576
    • Micali, S.1    Rogaway, P.2
  • 28
    • 35248825608 scopus 로고    scopus 로고
    • On Deniabililty in the Common Reference String and Random Oracle Model
    • Proc. of Crypto
    • R. Pass. On Deniabililty in the Common Reference String and Random Oracle Model. In Proc. of Crypto, LNCS 2729, pp. 216-337, 2003.
    • (2003) LNCS , vol.2729 , pp. 216-337
    • Pass, R.1
  • 29
    • 4544250511 scopus 로고    scopus 로고
    • Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority
    • R. Pass. Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In Proc. of STOC, pp. 232-241, 2004.
    • (2004) Proc. of STOC , pp. 232-241
    • Pass, R.1
  • 30
    • 32844473663 scopus 로고    scopus 로고
    • New Notions of Security: Achieving Universal Composability without Trusted Setup
    • M. Prabhakaran and A. Sahai. New Notions of Security: Achieving Universal Composability without Trusted Setup. In Proc. of STOC, 2004.
    • (2004) Proc. of STOC
    • Prabhakaran, M.1    Sahai, A.2
  • 31
    • 0034447081 scopus 로고    scopus 로고
    • Composition and Integrity Preservation of Secure Reactive Systems
    • B. Pfitzmann and M. Waidner. Composition and Integrity Preservation of Secure Reactive Systems. In Proc. of ACM CCS, pages 245-254, 2000.
    • (2000) Proc. of ACM CCS , pp. 245-254
    • Pfitzmann, B.1    Waidner, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.