Pinocchio: Nearly Practical Verifiable Computation
暂无分享,去创建一个
Craig Gentry | Jon Howell | Mariana Raykova | Bryan Parno | Bryan Parno | Jon Howell | Mariana Raykova | Craig Gentry
[1] Dan Boneh,et al. Architectural Support For Copy And Tamper-Resistant Software PhD Thesis , 2003 .
[2] Trent Jaeger,et al. Design and Implementation of a TCG-based Integrity Measurement Architecture , 2004, USENIX Security Symposium.
[3] Radu Sion,et al. To cloud or not to cloud?: musings on costs and viability , 2011, SOCC '11.
[4] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[5] Yihua Zhang,et al. Secure Computation on Floating Point Numbers , 2013, NDSS.
[6] Ivan Damgård,et al. Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks , 1991, CRYPTO.
[7] A. Sadeghi,et al. Token-Based Cloud Computing Secure Outsourcing of Data and Arbitrary Computations with Lower Latency , 2010 .
[8] David P. Anderson,et al. SETI@home: an experiment in public-resource computing , 2002, CACM.
[9] Helmut Veith,et al. Secure two-party computations in ANSI C , 2012, CCS.
[10] Dan Boneh,et al. Hierarchical Identity Based Encryption with Constant Size Ciphertext , 2005, EUROCRYPT.
[11] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[12] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[13] Craig Gentry,et al. Separating succinct non-interactive arguments from all falsifiable assumptions , 2011, STOC '11.
[14] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!) , 2004 .
[15] Benjamin Braun,et al. Taking Proof-Based Verified Computation a Few Steps Closer to Practicality , 2012, USENIX Security Symposium.
[16] Ivan Damgård,et al. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.
[17] Craig Gentry,et al. Homomorphic Evaluation of the AES Circuit , 2012, IACR Cryptol. ePrint Arch..
[18] Ghassan O. Karame,et al. Secure Remote Execution of Sequential Computations , 2009, ICICS.
[19] Silvio Micali,et al. Computationally Sound Proofs , 2000, SIAM J. Comput..
[20] Eli Ben-Sasson,et al. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture , 2014, USENIX Security Symposium.
[21] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[22] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System , 2004, USENIX Security Symposium.
[23] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[24] Ahmad-Reza Sadeghi,et al. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols , 2010, IACR Cryptol. ePrint Arch..
[25] Wenliang Du,et al. Searching for High-Value Rare Events with Uncheatable Grid Computing , 2005, ACNS.
[26] Benjamin Braun,et al. Resolving the conflict between generality and plausibility in verified computation , 2013, EuroSys '13.
[27] Rafail Ostrovsky,et al. Efficient Arguments without Short PCPs , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[28] Srinath T. V. Setty,et al. Making argument systems for outsourced computation practical (sometimes) , 2012, NDSS.
[29] Philippe Golle,et al. Uncheatable Distributed Computations , 2001, CT-RSA.
[30] Yael Tauman Kalai,et al. Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..
[31] Gediminas Adomavicius,et al. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.
[32] Alptekin Küpçü,et al. ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash , 2010, USENIX Security Symposium.
[33] Radu Sion,et al. Query Execution Assurance for Outsourced Databases , 2005, VLDB.
[34] R. Cramer,et al. Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .
[35] Jens Groth,et al. Short Pairing-Based Non-interactive Zero-Knowledge Arguments , 2010, ASIACRYPT.
[36] Graham Cormode,et al. Practical verified computation with streaming interactive proofs , 2011, ITCS '12.
[37] M. Backes. Automated Synthesis of Privacy-Preserving Distributed Applications , 2011 .
[38] D. Wolf-Gladrow. Lattice-Gas Cellular Automata and Lattice Boltzmann Models: An Introduction , 2000 .
[39] Ahmad-Reza Sadeghi,et al. A protocol for property-based attestation , 2006, STC '06.
[40] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[41] Radu Sion,et al. Uncheatable Reputation for Distributed Computation Markets , 2006, Financial Cryptography.
[42] Adrian Perrig,et al. Bootstrapping Trust in Modern Computers , 2011, Springer Briefs in Computer Science.
[43] Vinod Vaikuntanathan,et al. How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption , 2012, IACR Cryptol. ePrint Arch..
[44] Michael J. Fischer,et al. Relations Among Complexity Measures , 1979, JACM.
[45] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[46] LiskovBarbara,et al. Practical byzantine fault tolerance and proactive recovery , 2002 .
[47] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[48] Eli Ben-Sasson,et al. Zerocash: Decentralized Anonymous Payments from Bitcoin , 2014, 2014 IEEE Symposium on Security and Privacy.
[49] George Danezis,et al. Pinocchio coin: building zerocoin from a succinct pairing-based proof system , 2013, PETShop '13.
[50] Rosario Gennaro,et al. Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks , 2004, CRYPTO.
[51] Fabian Monrose,et al. Distributed Execution with Remote Audit , 1999, NDSS.
[52] Srinath T. V. Setty,et al. A Hybrid Architecture for Interactive Verifiable Computation , 2013, 2013 IEEE Symposium on Security and Privacy.
[53] Ruby B. Lee,et al. Architecture for protecting critical secrets in microprocessors , 2005, 32nd International Symposium on Computer Architecture (ISCA'05).
[54] Craig Gentry,et al. A fully homomorphic encryption scheme , 2009 .
[55] Joe Kilian,et al. A note on efficient zero-knowledge proofs and arguments (extended abstract) , 1992, STOC '92.
[56] Abhi Shelat,et al. Billion-Gate Secure Computation with Malicious Adversaries , 2012, USENIX Security Symposium.
[57] Paulo S. L. M. Barreto,et al. Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.
[58] Benjamin Braun,et al. Verifying computations with state , 2013, IACR Cryptol. ePrint Arch..
[59] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[60] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[61] Peter Schwabe,et al. New Software Speed Records for Cryptographic Pairings , 2010, LATINCRYPT.
[62] Justin Thaler,et al. Time-Optimal Interactive Proofs for Circuit Evaluation , 2013, CRYPTO.
[63] Brent Waters,et al. Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys , 2005, CRYPTO.
[64] George Danezis,et al. Privacy-preserving smart metering , 2011, WPES '11.
[65] Amit Sahai,et al. Efficient Non-interactive Proof Systems for Bilinear Groups , 2008, EUROCRYPT.
[66] Nicholas Pippenger,et al. On the evaluation of powers and related problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[67] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[68] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[69] Philippe Golle,et al. Secure Distributed Computing in a Commercial Environment , 2002, Financial Cryptography.
[70] Hanspeter Pfister,et al. Verifiable Computation with Massively Parallel Interactive Proofs , 2012, HotCloud.
[71] Mihir Bellare,et al. The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols , 2004, CRYPTO.
[72] SudanMadhu,et al. Proof verification and the hardness of approximation problems , 1998 .
[73] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[74] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[75] Moni Naor,et al. On Cryptographic Assumptions and Challenges , 2003, CRYPTO.