Non-Interactive Publicly-Verifiable Delegation of Committed Programs

[1]  Ron D. Rothblum,et al.  Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge) , 2021, Empir. Softw. Eng..

[2]  Zvika Brakerski,et al.  Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control , 2020, Public Key Cryptography.

[3]  Chris Peikert,et al.  Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors , 2019, IACR Cryptol. ePrint Arch..

[4]  Ron Rothblum,et al.  Fiat-Shamir: from practice to theory , 2019, STOC.

[5]  Yael Tauman Kalai,et al.  How to delegate computations publicly , 2019, IACR Cryptol. ePrint Arch..

[6]  Yael Tauman Kalai,et al.  Succinct delegation for low-space non-deterministic computation , 2018, STOC.

[7]  Yael Tauman Kalai,et al.  Multi-collision resistance: a paradigm for keyless hash functions , 2018, IACR Cryptol. ePrint Arch..

[8]  Omer Paneth,et al.  On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments , 2017, TCC.

[9]  Yael Tauman Kalai,et al.  Non-interactive delegation and batch NP verification from standard computational assumptions , 2017, STOC.

[10]  Yael Tauman Kalai,et al.  Delegating RAM Computations , 2016, TCC.

[11]  Ron Rothblum,et al.  Constant-round interactive proofs for delegating computation , 2016, Electron. Colloquium Comput. Complex..

[12]  Daniel Wichs,et al.  On the Communication Complexity of Secure Function Evaluation with Long Output , 2015, IACR Cryptol. ePrint Arch..

[13]  R. Raz,et al.  How to delegate computations: the power of no-signaling proofs , 2014, Electron. Colloquium Comput. Complex..

[14]  Yael Tauman Kalai,et al.  Delegation for bounded space , 2013, STOC '13.

[15]  Nir Bitansky,et al.  Recursive composition and bootstrapping for SNARKS and proof-carrying data , 2013, STOC '13.

[16]  Craig Gentry,et al.  Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..

[17]  Craig Gentry,et al.  Pinocchio: Nearly Practical Verifiable Computation , 2013, 2013 IEEE Symposium on Security and Privacy.

[18]  Nir Bitansky,et al.  Succinct Non-Interactive Arguments via Linear Interactive Proofs , 2013, Journal of Cryptology.

[19]  Benjamin Braun,et al.  Taking Proof-Based Verified Computation a Few Steps Closer to Practicality , 2012, USENIX Security Symposium.

[20]  Helger Lipmaa,et al.  Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments , 2012, TCC.

[21]  Ivan Damgård,et al.  Secure Two-Party Computation with Low Communication , 2012, IACR Cryptol. ePrint Arch..

[22]  Vinod Vaikuntanathan,et al.  How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption , 2012, IACR Cryptol. ePrint Arch..

[23]  Hanspeter Pfister,et al.  Verifiable Computation with Massively Parallel Interactive Proofs , 2012, HotCloud.

[24]  Srinath T. V. Setty,et al.  Making argument systems for outsourced computation practical (sometimes) , 2012, NDSS.

[25]  Graham Cormode,et al.  Practical verified computation with streaming interactive proofs , 2011, ITCS '12.

[26]  Jens Groth,et al.  Short Pairing-Based Non-interactive Zero-Knowledge Arguments , 2010, ASIACRYPT.

[27]  Yael Tauman Kalai,et al.  Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..

[28]  Craig Gentry,et al.  Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.

[29]  Yael Tauman Kalai,et al.  Delegating computation: interactive proofs for muggles , 2008, STOC.

[30]  Silvio Micali,et al.  Computationally Sound Proofs , 2000, SIAM J. Comput..

[31]  R. Cramer,et al.  Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .

[32]  Ralph C. Merkle,et al.  A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.

[33]  Yael Tauman Kalai,et al.  Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P , 2021, IACR Cryptol. ePrint Arch..

[34]  Arka Rai Choudhuri,et al.  Non-Interactive Batch Arguments for NP from Standard Assumptions , 2021, IACR Cryptol. ePrint Arch..

[35]  Zhengzhong Jin,et al.  SNARGs for P from LWE , 2021, IACR Cryptol. ePrint Arch..

[36]  Luke Schaeffer,et al.  A Note on Key Agreement and Non-Interactive Commitments , 2019, IACR Cryptol. ePrint Arch..

[37]  Omer Paneth,et al.  On Publicly Verifiable Delegation From Standard Assumptions , 2018, IACR Cryptol. ePrint Arch..

[38]  Nir Bitansky,et al.  The Hunting of the SNARK , 2016, Journal of Cryptology.