Black-Box Constructions of Composable Protocols without Set-Up
暂无分享,去创建一个
[1] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[2] Yehuda Lindell,et al. Black-box constructions for secure computation , 2006, STOC '06.
[3] Yehuda Lindell,et al. Lower Bounds for Concurrent Self Composition , 2004, TCC.
[4] Tal Malkin,et al. Simple, Black-Box Constructions of Adaptively Secure Protocols , 2009, TCC.
[5] Martijn Stam. Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions , 2008, CRYPTO.
[6] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[7] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[8] Victor Shoup. Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings , 2005, CRYPTO.
[9] Jonathan Katz,et al. Universally Composable Multi-party Computation Using Tamper-Proof Hardware , 2007, EUROCRYPT.
[10] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[11] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[12] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[13] A. J. Menezes,et al. Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings , 2007, CRYPTO.
[14] Amit Sahai,et al. Concurrently Secure Computation in Constant Rounds , 2012, EUROCRYPT.
[15] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[16] Amit Sahai,et al. Concurrent zero knowledge with logarithmic round-complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[17] Hoeteck Wee,et al. Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[18] Rafael Pass,et al. Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition , 2003, EUROCRYPT.
[19] Yuval Ishai,et al. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.
[20] Joe Kilian,et al. A note on efficient zero-knowledge proofs and arguments (extended abstract) , 1992, STOC '92.
[21] Silvio Micali,et al. Input-Indistinguishable Computation , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[22] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[23] Vipul Goyal,et al. Constant round non-malleable protocols using one way functions , 2011, STOC '11.
[24] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[25] Joe Kilian,et al. On the Concurrent Composition of Zero-Knowledge Proofs , 1999, EUROCRYPT.
[26] Hoeteck Wee,et al. Black-Box Constructions of Two-Party Protocols from One-Way Functions , 2009, TCC.
[27] Adi Shamir,et al. Witness indistinguishable and witness hiding protocols , 1990, STOC '90.
[28] Ran Canetti,et al. Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[29] Iftach Haitner,et al. Semi-honest to Malicious Oblivious Transfer - The Black-Box Way , 2008, TCC.
[30] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[31] Moni Naor. Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings , 2007, EUROCRYPT.
[32] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[33] Tal Malkin,et al. Generalized Environmental Security from Number Theoretic Assumptions , 2006, TCC.
[34] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[35] Alon Rosen,et al. A Note on Constant-Round Zero-Knowledge Proofs for NP , 2004, TCC.
[36] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[37] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[38] Ilias Diakonikolas,et al. Testing for Concise Representations , 2007, FOCS 2007.
[39] Jacques Stern,et al. Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.
[40] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[41] Ran Canetti,et al. Universally composable protocols with relaxed set-up assumptions , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[42] Rafael Pass,et al. Concurrent Non-malleable Commitments from Any One-Way Function , 2008, TCC.
[43] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[44] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[45] Rafail Ostrovsky,et al. Cryptography in the Multi-string Model , 2007, Journal of Cryptology.
[46] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[47] Yehuda Lindell,et al. On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions , 2003, Journal of Cryptology.
[48] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[49] Amit Sahai,et al. New notions of security: achieving universal composability without trusted setup , 2004, STOC '04.
[50] Ran Canetti,et al. Universally composable signature, certification, and authentication , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..
[51] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[52] Amit Sahai,et al. How to play almost any mental game over the net - concurrent composition via super-polynomial simulation , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[53] Yehuda Lindell,et al. Concurrent general composition of secure protocols in the timing model , 2005, STOC '05.
[54] Rafael Pass,et al. A unified framework for concurrent security: universal composability from stand-alone non-malleability , 2009, STOC '09.
[55] Tal Malkin,et al. Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One , 2008, TCC.
[56] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[57] Abhi Shelat,et al. Cryptography from Sunspots: How to Use an Imperfect Reference String , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[58] David Xiao,et al. (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks , 2011, TCC.
[59] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[60] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[61] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.