On Secure Two-Party Computation in Three Rounds
暂无分享,去创建一个
[1] Moni Naor,et al. Zaps and their applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[2] Brent Waters,et al. How to use indistinguishability obfuscation: deniable encryption, and more , 2014, IACR Cryptol. ePrint Arch..
[3] Brent Waters,et al. Constrained Pseudorandom Functions and Their Applications , 2013, ASIACRYPT.
[4] Yael Tauman Kalai,et al. From Obfuscation to the Security of Fiat-Shamir for Proofs , 2017, CRYPTO.
[5] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[7] Sanjam Garg,et al. The Exact Round Complexity of Secure Computation , 2016, EUROCRYPT.
[8] Toshiaki Tanaka,et al. On the Existence of 3-Round Zero-Knowledge Protocols , 1998, CRYPTO.
[9] Yuval Ishai,et al. Randomizing polynomials: A new representation with applications to round-efficient secure computation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[10] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.
[11] Shafi Goldwasser,et al. Functional Signatures and Pseudorandom Functions , 2014, Public Key Cryptography.
[12] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[13] Allison Bishop,et al. Indistinguishability Obfuscation for Turing Machines with Unbounded Memory , 2015, IACR Cryptol. ePrint Arch..
[14] Yael Tauman Kalai,et al. 3-Message Zero Knowledge Against Human Ignorance , 2016, TCC.
[15] Adi Shamir,et al. Publicly Verifiable Non-Interactive Zero-Knowledge Proofs , 1990, CRYPTO.
[16] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[17] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[18] Hugo Krawczyk,et al. On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.
[19] Yuval Ishai,et al. Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.
[20] Adi Shamir,et al. Witness indistinguishable and witness hiding protocols , 1990, STOC '90.
[21] Craig Gentry,et al. Succinct Randomized Encodings and their Applications. , 2014 .
[22] Nir Bitansky,et al. On the existence of extractable one-way functions , 2014, SIAM J. Comput..
[23] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[24] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[25] Mihir Bellare,et al. The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols , 2004, CRYPTO.
[26] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.
[27] Abhishek Jain,et al. Indistinguishability Obfuscation from Compact Functional Encryption , 2015, CRYPTO.
[28] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[29] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[30] Aggelos Kiayias,et al. Delegatable pseudorandom functions and applications , 2013, IACR Cryptol. ePrint Arch..
[31] Ran Canetti,et al. Indistinguishability Obfuscation of Iterated Circuits and RAM Programs , 2014, IACR Cryptol. ePrint Arch..
[32] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[33] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[34] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[35] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[36] Yuval Ishai,et al. Protecting data privacy in private information retrieval schemes , 1998, STOC '98.
[37] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[38] Nico Döttling,et al. Two-Message, Oblivious Evaluation of Cryptographic Functionalities , 2016, CRYPTO.