xJsnark: A Framework for Efficient Verifiable Computation
暂无分享,去创建一个
[1] Craig Gentry,et al. Pinocchio: Nearly Practical Verifiable Computation , 2013, IEEE Symposium on Security and Privacy.
[2] Elaine Shi,et al. BIND: a fine-grained attestation service for secure distributed systems , 2005, 2005 IEEE Symposium on Security and Privacy (S&P'05).
[3] Chris Peikert,et al. SWIFFT: A Modest Proposal for FFT Hashing , 2008, FSE.
[4] Markus Völter,et al. Towards User-Friendly Projectional Editors , 2014, SLE.
[5] Markus Völter,et al. Language and IDE Modularization and Composition with MPS , 2011, GTTSE.
[6] Abhi Shelat,et al. PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation , 2013, USENIX Security Symposium.
[7] Michael Hicks,et al. Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations , 2014, 2014 IEEE Symposium on Security and Privacy.
[8] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[9] Benny Pinkas,et al. Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!) , 2004 .
[10] Zuocheng Ren,et al. Efficient RAM and control flow in verifiable outsourced computation , 2015, NDSS.
[11] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[12] Benjamin Livshits,et al. ZØ: An Optimizing Distributing Zero-Knowledge Compiler , 2014, USENIX Security Symposium.
[13] Robert K. Brayton,et al. MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[14] Ryan Kastner,et al. Optimizing Polynomial Expressions by Algebraic Factorization and Common Subexpression Elimination , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[15] Jon Howell,et al. Geppetto: Versatile Verifiable Computation , 2015, 2015 IEEE Symposium on Security and Privacy.
[16] J. Boyar,et al. On The Multiplicative Complexity of Boolean Functions over the Basis $(\wedge, \oplus, 1)$ , 1998 .
[17] A. Juels. The Ring of Gyges : Using Smart Contracts for Crime , 2015 .
[18] Markus Völter,et al. JetBrains MPS as a tool for extending Java , 2013, PPPJ.
[19] Eli Ben-Sasson,et al. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge , 2013, CRYPTO.
[20] Bruno Beauquier,et al. On Arbitrary Size Waksman Networks and Their Vulnerability , 2002, Parallel Process. Lett..
[21] Bernhard Schätz,et al. mbeddr: an extensible C-based programming language and IDE for embedded systems , 2012, SPLASH '12.
[22] T-H. Hubert Chan,et al. C ∅ C ∅ : A Framework for Building Composable Zero-Knowledge Proofs , 2016 .
[23] Eli Ben-Sasson,et al. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture , 2014, USENIX Security Symposium.
[24] Michael Backes,et al. ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data , 2015, 2015 IEEE Symposium on Security and Privacy.
[25] Elaine Shi,et al. Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts , 2016, 2016 IEEE Symposium on Security and Privacy (SP).
[26] Stratis Ioannidis,et al. GraphSC: Parallel Secure Computation Made Easy , 2015, 2015 IEEE Symposium on Security and Privacy.
[27] Anatolij A. Karatsuba,et al. Multiplication of Multidigit Numbers on Automata , 1963 .
[28] Cédric Fournet,et al. A Certified Compiler for Verifiable Computing , 2016, 2016 IEEE 29th Computer Security Foundations Symposium (CSF).
[29] Eli Ben-Sasson,et al. Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract , 2013, ITCS '13.
[30] Eli Ben-Sasson,et al. Scalable Zero Knowledge Via Cycles of Elliptic Curves , 2014, Algorithmica.
[31] Cédric Fournet,et al. Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation , 2016, 2016 IEEE Symposium on Security and Privacy (SP).
[32] Eli Ben-Sasson,et al. Zerocash: Decentralized Anonymous Payments from Bitcoin , 2014, 2014 IEEE Symposium on Security and Privacy.
[33] George Danezis,et al. Pinocchio coin: building zerocoin from a succinct pairing-based proof system , 2013, PETShop '13.
[34] Benjamin Braun,et al. Verifying computations with state , 2013, IACR Cryptol. ePrint Arch..
[35] Kartik Nayak,et al. ObliVM: A Programming Framework for Secure Computation , 2015, 2015 IEEE Symposium on Security and Privacy.