Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
暂无分享,去创建一个
Eli Ben-Sasson | Eran Tromer | Alessandro Chiesa | Madars Virza | E. Ben-Sasson | A. Chiesa | Eran Tromer | M. Virza | Eli Ben-Sasson
[1] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[2] Claus-Peter Schnorr. Satisfiability Is Quasilinear Complete in NQL , 1978, JACM.
[3] Nicholas Pippenger,et al. On the Evaluation of Powers and Monomials , 1980, SIAM J. Comput..
[4] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[5] E. Szemerédi,et al. O(n LOG n) SORTING NETWORK. , 1983 .
[6] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[7] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[8] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[9] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[10] Matthijs J. Coster,et al. Addition Chain Heuristics , 1989, CRYPTO.
[11] Saharon Shelah,et al. Nearly Linear Time , 1989, Logic at Botik.
[12] S. Micali,et al. Noninteractive Zero-Knowledge , 1990, SIAM J. Comput..
[13] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[14] John Michael Robson,et al. An O (T log T) Reduction from RAM Computations to Satisfiability , 1991, Theor. Comput. Sci..
[15] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[16] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[17] Joe Kilian,et al. A note on efficient zero-knowledge proofs and arguments (extended abstract) , 1992, STOC '92.
[18] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[19] Mihir Bellare,et al. On Defining Proofs of Knowledge , 1992, CRYPTO.
[20] Ernest F. Brickell,et al. Fast Exponentiation with Precomputation (Extended Abstract) , 1992, EUROCRYPT.
[21] Madhav V. Marathe,et al. On Approximation Algorithms for the Minimum Satisfiability Problem , 1996, Inf. Process. Lett..
[22] R. Cramer,et al. Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .
[23] Uriel Feige,et al. Making games short (extended abstract) , 1997, STOC '97.
[24] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[25] Silvio Micali,et al. Computationally Sound Proofs , 2000, SIAM J. Comput..
[26] Bruno Beauquier,et al. On Arbitrary Size Waksman Networks and Their Vulnerability , 2002, Parallel Process. Lett..
[27] Steven D. Galbraith,et al. Implementing the Tate Pairing , 2002, ANTS.
[28] Paulo S. L. M. Barreto,et al. Constructing Elliptic Curves with Prescribed Embedding Degrees , 2002, SCN.
[29] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.
[30] Jerome A. Solinas,et al. ID-based Digital Signature Algorithms , 2003 .
[31] Paulo S. L. M. Barreto,et al. Compressed Pairings , 2004, CRYPTO.
[32] Dan Boneh,et al. Secure Identity Based Encryption Without Random Oracles , 2004, CRYPTO.
[33] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System , 2004, USENIX Security Symposium.
[34] Rosario Gennaro,et al. Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks , 2004, CRYPTO.
[35] 田端 利宏,et al. Network and Distributed System Security Symposiumにおける研究動向の調査 , 2004 .
[36] Paulo S. L. M. Barreto,et al. Efficient Implementation of Pairing-Based Cryptosystems , 2004, Journal of Cryptology.
[37] Eli Ben-Sasson,et al. Short PCPs verifiable in polylogarithmic time , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[38] Paulo S. L. M. Barreto,et al. Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.
[39] Michael Scott,et al. Computing the Tate Pairing , 2005, CT-RSA.
[40] Manuel Blum,et al. Checking the correctness of memories , 2005, Algorithmica.
[41] U. Feige,et al. Making Games Short , 2006 .
[42] Nigel P. Smart,et al. On Computing Products of Pairings , 2006, IACR Cryptol. ePrint Arch..
[43] Samuele Pedroni,et al. PyPy's approach to virtual machine construction , 2006, OOPSLA '06.
[44] H. Edwards. A normal form for elliptic curves , 2007 .
[45] Rafail Ostrovsky,et al. Efficient Arguments without Short PCPs , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[46] M. Scott. Implementing cryptographic pairings , 2007 .
[47] Paul Valiant,et al. Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency , 2008, TCC.
[48] Michael Scott,et al. On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves , 2009, Pairing.
[49] Jacques Sakarovitch,et al. The universal automaton , 2008, Logic and Automata.
[50] Benny Pinkas,et al. FairplayMP: a system for secure multi-party computation , 2008, CCS.
[51] Mason Chang,et al. Trace-based just-in-time type specialization for dynamic languages , 2009, PLDI '09.
[52] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[53] Tanja Lange,et al. Faster Computation of the Tate Pairing , 2009, IACR Cryptol. ePrint Arch..
[54] Michael Scott,et al. Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions , 2009, IACR Cryptol. ePrint Arch..
[55] Yael Tauman Kalai,et al. Probabilistically Checkable Arguments , 2009, CRYPTO.
[56] Jens Groth,et al. Short Pairing-Based Non-interactive Zero-Knowledge Arguments , 2010, ASIACRYPT.
[57] Frederik Vercauteren,et al. Optimal Pairings , 2010, IEEE Transactions on Information Theory.
[58] Yuval Ishai,et al. From Secrecy to Soundness: Efficient Verification via Secure Computation , 2010, ICALP.
[59] Yael Tauman Kalai,et al. Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..
[60] Jens Groth,et al. Short Non-interactive Zero-Knowledge Proofs , 2010, ASIACRYPT.
[61] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[62] Francisco Rodríguez-Henríquez,et al. High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves , 2010, Pairing.
[63] Laura Fuentes-Castañeda,et al. Faster Hashing to G 2 , 2011 .
[64] Andrew J. Blumberg. Toward Practical and Unconditional Verification of Remote Computations , 2011, HotOS.
[65] Francisco Rodríguez-Henríquez,et al. Faster Hashing to ${\mathbb G}_2$ , 2011, Selected Areas in Cryptography.
[66] Ran Canetti,et al. Practical delegation of computation using multiple servers , 2011, CCS '11.
[67] Ran Canetti,et al. Two Protocols for Delegation of Computation , 2012, ICITS.
[68] Benjamin Braun,et al. Taking Proof-Based Verified Computation a Few Steps Closer to Practicality , 2012, USENIX Security Symposium.
[69] Nir Bitansky,et al. Succinct Non-Interactive Arguments via Linear Interactive Proofs , 2013, Journal of Cryptology.
[70] Helger Lipmaa,et al. Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments , 2012, TCC.
[71] Tanja Lange,et al. High-speed high-security signatures , 2011, Journal of Cryptographic Engineering.
[72] Graham Cormode,et al. Practical verified computation with streaming interactive proofs , 2011, ITCS '12.
[73] Hanspeter Pfister,et al. Verifiable Computation with Massively Parallel Interactive Proofs , 2012, HotCloud.
[74] Srinath T. V. Setty,et al. Making argument systems for outsourced computation practical (sometimes) , 2012, NDSS.
[75] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[76] Yael Tauman Kalai,et al. Reusable garbled circuits and succinct functional encryption , 2013, STOC '13.
[77] Craig Gentry,et al. Pinocchio: Nearly Practical Verifiable Computation , 2013, 2013 IEEE Symposium on Security and Privacy.
[78] Benjamin Braun,et al. Verifying computations with state , 2013, IACR Cryptol. ePrint Arch..
[79] Benjamin Braun,et al. Resolving the conflict between generality and plausibility in verified computation , 2013, EuroSys '13.
[80] Eli Ben-Sasson,et al. Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract , 2013, ITCS '13.
[81] Eli Ben-Sasson,et al. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge , 2013, CRYPTO.
[82] Justin Thaler,et al. Time-Optimal Interactive Proofs for Circuit Evaluation , 2013, CRYPTO.
[83] Eli Ben-Sasson,et al. On the concrete efficiency of probabilistically-checkable proofs , 2013, STOC '13.
[84] Srinath T. V. Setty,et al. A Hybrid Architecture for Interactive Verifiable Computation , 2013, 2013 IEEE Symposium on Security and Privacy.
[85] Nir Bitansky,et al. Recursive composition and bootstrapping for SNARKS and proof-carrying data , 2013, STOC '13.
[86] Jung Hee Cheon,et al. On the Final Exponentiation in Tate Pairing Computations , 2013, IEEE Transactions on Information Theory.
[87] Yael Tauman Kalai,et al. Delegation for bounded space , 2013, STOC '13.
[88] Helger Lipmaa,et al. Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes , 2013, IACR Cryptol. ePrint Arch..
[89] David Evans,et al. Circuit Structures for Improving Efficiency of Security and Privacy Tools , 2013, 2013 IEEE Symposium on Security and Privacy.
[90] Eli Ben-Sasson,et al. Zerocash: Decentralized Anonymous Payments from Bitcoin , 2014, 2014 IEEE Symposium on Security and Privacy.
[91] Eli Ben-Sasson,et al. Scalable Zero Knowledge Via Cycles of Elliptic Curves , 2014, Algorithmica.
[92] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[93] Eran Tromer,et al. Cluster Computing in Zero Knowledge , 2015, EUROCRYPT.
[94] Eli Ben-Sasson,et al. Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs , 2015, 2015 IEEE Symposium on Security and Privacy.