Constructing Non-malleable Commitments: A Black-Box Approach
暂无分享,去创建一个
Rafail Ostrovsky | Ivan Visconti | Vipul Goyal | Chen-Kuei Lee | R. Ostrovsky | Ivan Visconti | Vipul Goyal | Chen-Kuei Lee
[1] Jonathan Katz,et al. Universally Composable Multi-party Computation Using Tamper-Proof Hardware , 2007, EUROCRYPT.
[2] Boaz Barak,et al. Constant-round coin-tossing with a man in the middle or realizing the shared random string model , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[3] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[4] Yuval Ishai,et al. The round complexity of verifiable secret sharing and secure multicast , 2001, STOC '01.
[5] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[6] Adi Shamir,et al. How to share a secret , 1979, CACM.
[7] Noam Nisan,et al. Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..
[8] Carmine Ventre,et al. Completely Non-malleable Encryption Revisited , 2008, Public Key Cryptography.
[9] Rafael Pass,et al. Constant-round non-malleable commitments from any one-way function , 2011, STOC '11.
[10] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[11] Zhenfu Cao,et al. On constant-round concurrent non-malleable proof systems , 2011, Inf. Process. Lett..
[12] Yehuda Lindell,et al. Black-box constructions for secure computation , 2006, STOC '06.
[13] Yehuda Lindell,et al. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, Journal of Cryptology.
[14] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.
[15] Omer Reingold,et al. Statistically-hiding commitment from any one-way function , 2007, STOC '07.
[16] Hoeteck Wee,et al. Black-Box Constructions of Two-Party Protocols from One-Way Functions , 2009, TCC.
[17] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Amit Sahai,et al. Concurrent zero knowledge with logarithmic round-complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[19] Vinod Vaikuntanathan,et al. Adaptive One-Way Functions and Applications , 2008, CRYPTO.
[20] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[21] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[22] Rafael Pass,et al. New and improved constructions of non-malleable cryptographic protocols , 2005, STOC '05.
[23] Rafael Pass,et al. Concurrent Non-malleable Commitments from Any One-Way Function , 2008, TCC.
[24] 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.
[25] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[26] Rafail Ostrovsky,et al. Simulation-Based Concurrent Non-malleable Commitments and Decommitments , 2009, TCC.
[27] Zhenfu Cao,et al. Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments , 2010, Public Key Cryptography.
[28] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[29] Yuval Ishai,et al. Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography , 2010, Electron. Colloquium Comput. Complex..
[30] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[31] Rafael Pass,et al. Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition , 2003, EUROCRYPT.
[32] Rafael Pass,et al. Concurrent Nonmalleable Commitments , 2008, SIAM J. Comput..
[33] Ran Canetti,et al. Universally composable protocols with relaxed set-up assumptions , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[34] Silvio Micali,et al. Input-Indistinguishable Computation , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[35] Rafail Ostrovsky,et al. Zero-Knowledge Proofs from Secure Multiparty Computation , 2009, SIAM J. Comput..
[36] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[37] Yuval Ishai,et al. On the Hardness of Information-Theoretic Multiparty Computation , 2004, EUROCRYPT.
[38] Amit Sahai,et al. New notions of security: achieving universal composability without trusted setup , 2004, STOC '04.
[39] Baruch Awerbuch,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[40] Rafael Pass,et al. Non-malleability amplification , 2009, STOC '09.
[41] Amit Sahai,et al. Concurrent Zero Knowledge without Complexity Assumptions , 2006, Electron. Colloquium Comput. Complex..
[42] Vipul Goyal,et al. Constant round non-malleable protocols using one way functions , 2011, STOC '11.
[43] Omer Reingold,et al. Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function , 2009, SIAM J. Comput..
[44] Rafail Ostrovsky,et al. Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge , 2010, TCC.
[45] Rafael Pass,et al. New and Improved Constructions of Nonmalleable Cryptographic Protocols , 2008, SIAM J. Comput..
[46] Mihir Bellare,et al. Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening , 2009, EUROCRYPT.
[47] Rafail Ostrovsky,et al. Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model , 2008, ICALP.
[48] Alon Rosen,et al. A Note on Constant-Round Zero-Knowledge Proofs for NP , 2004, TCC.
[49] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[50] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[51] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[52] Moni Naor,et al. Non-Malleable Cryptography (Extended Abstract) , 1991, STOC 1991.
[53] Silvio Micali,et al. Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing , 1996, CRYPTO.
[54] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[55] Rafael Pass,et al. A unified framework for concurrent security: universal composability from stand-alone non-malleability , 2009, STOC '09.
[56] Ran Canetti,et al. Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions , 2010, FOCS.
[57] Hoeteck Wee,et al. Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions , 2010, EUROCRYPT.
[58] 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).