Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
暂无分享,去创建一个
Rafail Ostrovsky | Alessandra Scafuro | Muthuramakrishnan Venkitasubramaniam | R. Ostrovsky | Alessandra Scafuro | Muthuramakrishnan Venkitasubramaniam
[1] Yuval Ishai,et al. The round complexity of verifiable secret sharing and secure multicast , 2001, STOC '01.
[2] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[3] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[4] Tal Malkin,et al. Simple, Black-Box Constructions of Adaptively Secure Protocols , 2009, TCC.
[5] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[6] Iftach Haitner,et al. Semi-honest to Malicious Oblivious Transfer - The Black-Box Way , 2008, TCC.
[7] Rafail Ostrovsky,et al. 4-Round Resettably-Sound Zero Knowledge , 2014, TCC.
[8] Yehuda Lindell,et al. Resettably-sound zero-knowledge and its applications , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[9] Rafael Pass,et al. New and improved constructions of non-malleable cryptographic protocols , 2005, STOC '05.
[10] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[11] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[12] Luca Trevisan,et al. Notions of Reducibility between Cryptographic Primitives , 2004, TCC.
[13] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[14] Shai Halevi. Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings , 2009, CRYPTO.
[15] Rafail Ostrovsky,et al. Constructing Non-malleable Commitments: A Black-Box Approach , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[16] Rafael Pass,et al. Black-Box Constructions of Composable Protocols without Set-Up , 2012, CRYPTO.
[17] Tal Malkin,et al. Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments , 2013, ASIACRYPT.
[18] Hoeteck Wee,et al. Black-Box Constructions of Two-Party Protocols from One-Way Functions , 2009, TCC.
[19] 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.
[20] Yael Tauman Kalai,et al. Securing Circuits against Constant-Rate Tampering , 2012, CRYPTO.
[21] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[22] Eli Ben-Sasson,et al. On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs , 2012, Electron. Colloquium Comput. Complex..
[23] Yehuda Lindell,et al. Black-box constructions for secure computation , 2006, STOC '06.
[24] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[25] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[26] Joe Kilian,et al. A note on efficient zero-knowledge proofs and arguments (extended abstract) , 1992, STOC '92.
[27] Kai-Min Chung,et al. Non-black-box simulation from one-way functions and applications to resettable security , 2013, STOC '13.
[28] Ralph C. Merkle,et al. A Certified Digital Signature , 1989, CRYPTO.
[29] Rafail Ostrovsky,et al. Black-box non-black-box zero knowledge , 2014, IACR Cryptol. ePrint Arch..
[30] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[31] Yehuda Lindell,et al. More Efficient Constant-Round Multi-Party Computation from BMR and SHE , 2016, IACR Cryptol. ePrint Arch..
[32] 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).
[33] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[34] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[35] Yehuda Lindell,et al. A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation , 2015, Journal of Cryptology.
[36] Nir Bitansky,et al. On the impossibility of approximate obfuscation and applications to resettable cryptography , 2013, STOC '13.
[37] Eli Ben-Sasson,et al. Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.
[38] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[39] Russell Impagliazzo,et al. Limits on the Provable Consequences of One-way Permutations , 1988, CRYPTO.
[40] Ran Canetti,et al. Advances in Cryptology – CRYPTO 2012 , 2012, Lecture Notes in Computer Science.
[41] Rafael Pass,et al. On the Composition of Public-Coin Zero-Knowledge Protocols , 2009, CRYPTO.
[42] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[43] Vipul Goyal,et al. Constant round non-malleable protocols using one way functions , 2011, STOC '11.
[44] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[45] Marcin Wójcik,et al. Does My Device Leak Information? An a priori Statistical Power Analysis of Leakage Detection Tests , 2013, ASIACRYPT.