From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
暂无分享,去创建一个
Nir Bitansky | Ran Canetti | Eran Tromer | Alessandro Chiesa | A. Chiesa | Eran Tromer | R. Canetti | Nir Bitansky
[1] Justin M. Reyneri,et al. Coin flipping by telephone , 1984, IEEE Trans. Inf. Theory.
[2] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[3] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[4] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..
[5] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[6] Ralph C. Merkle,et al. A Certified Digital Signature , 1989, CRYPTO.
[7] Eiji Okamoto,et al. Key distribution system based on identification information , 1989, IEEE J. Sel. Areas Commun..
[8] Ivan Damgård,et al. Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks , 1991, CRYPTO.
[9] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[10] Joe Kilian,et al. A note on efficient zero-knowledge proofs and arguments (extended abstract) , 1992, STOC '92.
[11] Alexander A. Razborov,et al. Natural Proofs , 2007 .
[12] V. Nechaev. Complexity of a determinate algorithm for the discrete logarithm , 1994 .
[13] Miklós Ajtai,et al. Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.
[14] Oded Goldreich,et al. Collision-Free Hashing from Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[15] R. Cramer,et al. Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .
[16] Miklós Ajtai,et al. Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[17] Victor Shoup,et al. Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.
[18] Ivan Damgård,et al. Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments , 1997, STOC '97.
[19] Oded Goldreich,et al. On the Complexity of Interactive Proofs with Bounded Communication , 1998, Inf. Process. Lett..
[20] Toshiaki Tanaka,et al. On the Existence of 3-Round Zero-Knowledge Protocols , 1998, CRYPTO.
[21] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[22] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[23] Silvio Micali,et al. Computationally Sound Proofs , 2000, SIAM J. Comput..
[24] Rafail Ostrovsky,et al. Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP , 2000, ICALP.
[25] Moni Naor,et al. Communication preserving protocols for secure function evaluation , 2001, STOC '01.
[26] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[27] Avi Wigderson,et al. On interactive proofs with a laconic prover , 2001, computational complexity.
[28] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[29] Moni Naor,et al. On Cryptographic Assumptions and Challenges , 2003, CRYPTO.
[30] Daniele Micciancio,et al. Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[31] Mihir Bellare,et al. The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols , 2004, CRYPTO.
[32] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[33] Oded Regev,et al. New lattice based cryptographic constructions , 2003, STOC '03.
[34] Craig Gentry,et al. Single-Database Private Information Retrieval with Constant Communication Rate , 2005, ICALP.
[35] Eli Ben-Sasson,et al. Short PCPs verifiable in polylogarithmic time , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[36] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[37] Hoeteck Wee,et al. On Round-Efficient Argument Systems , 2005, ICALP.
[38] Dan Suciu,et al. Journal of the ACM , 2006 .
[39] Yael Tauman Kalai,et al. Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[40] Alexander W. Dent,et al. The Hardness of the DHK Problem in the Generic Group Model , 2006, IACR Cryptol. ePrint Arch..
[41] Omer Reingold,et al. Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions , 2006, ICALP.
[42] Steven D. Galbraith,et al. Hidden Pairings and Trapdoor DDH Groups , 2006, ANTS.
[43] Serge Fehr,et al. Perfect NIZK with Adaptive Soundness , 2007, TCC.
[44] Paul Valiant,et al. Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency , 2008, TCC.
[45] Madhur Tulsiani,et al. Dense Subsets of Pseudorandom Sets , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[46] Ran Canetti,et al. Extractable Perfectly One-Way Functions , 2008, ICALP.
[47] Thilo Mie,et al. Polylogarithmic two-round argument systems , 2008, J. Math. Cryptol..
[48] Stefan Dziembowski,et al. Leakage-Resilient Cryptography , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[49] Eli Ben-Sasson,et al. Short PCPs with Polylog Query Complexity , 2008, SIAM J. Comput..
[50] Nicolas Gama,et al. Predicting Lattice Reduction , 2008, EUROCRYPT.
[51] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[52] Giovanni Di Crescenzo,et al. Succinct NP Proofs from an Extractability Assumption , 2008, CiE.
[53] Daniele Micciancio,et al. On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem , 2009, CRYPTO.
[54] Manoj Prabhakaran,et al. Statistically Hiding Sets , 2009, CT-RSA.
[55] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[56] Ramzi Ronny Dakdouk. Theory and application of extractable functions , 2009 .
[57] Yevgeniy Dodis,et al. Salvaging Merkle-Damgard for Practical Applications , 2009, IACR Cryptol. ePrint Arch..
[58] Ran Canetti,et al. Towards a Theory of Extractable Functions , 2009, TCC.
[59] Yael Tauman Kalai,et al. Probabilistically Checkable Arguments , 2009, CRYPTO.
[60] Jens Groth,et al. Short Pairing-Based Non-interactive Zero-Knowledge Arguments , 2010, ASIACRYPT.
[61] Eran Tromer,et al. Proof-Carrying Data and Hearsay Arguments from Signature Cards , 2010, ICS.
[62] Yuval Ishai,et al. From Secrecy to Soundness: Efficient Verification via Secure Computation , 2010, ICALP.
[63] Yael Tauman Kalai,et al. Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..
[64] Hugo Krawczyk,et al. Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead , 2010, ACNS.
[65] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[66] Graham Cormode,et al. Verifying Computations with Streaming Interactive Proofs , 2011, Proc. VLDB Endow..
[67] Roberto Tamassia,et al. Optimal Verification of Operations on Dynamic Sets , 2011, CRYPTO.
[68] Craig Gentry,et al. Separating succinct non-interactive arguments from all falsifiable assumptions , 2011, STOC '11.
[69] Ran Canetti,et al. Two 1-Round Protocols for Delegation of Computation , 2011, IACR Cryptol. ePrint Arch..
[70] Yael Tauman Kalai,et al. Memory Delegation , 2011, CRYPTO.
[71] Vinod Vaikuntanathan,et al. Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[72] Yael Tauman Kalai,et al. Leaky Pseudo-Entropy Functions , 2011, ICS.
[73] Yevgeniy Vahlis,et al. Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..
[74] Shafi Goldwasser,et al. Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs , 2011, IACR Cryptol. ePrint Arch..
[75] Rafail Ostrovsky,et al. Efficient Non-interactive Secure Computation , 2011, EUROCRYPT.
[76] Ivan Damgård,et al. Secure Two-Party Computation with Low Communication , 2012, IACR Cryptol. ePrint Arch..
[77] Brent Waters,et al. Targeted malleability: homomorphic encryption for restricted computations , 2012, ITCS '12.