vRAM: Faster Verifiable RAM with Program-Independent Preprocessing
暂无分享,去创建一个
Jonathan Katz | Daniel Genkin | Charalampos Papamanthou | Dimitrios Papadopoulos | Yupeng Zhang | Jonathan Katz | Charalampos Papamanthou | Daniel Genkin | Dimitrios Papadopoulos | Yupeng Zhang
[1] Silvio Micali,et al. Computationally Sound Proofs , 2000, SIAM J. Comput..
[2] Cédric Fournet,et al. Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data , 2016, CCS.
[3] Nir Bitansky,et al. Succinct Non-Interactive Arguments via Linear Interactive Proofs , 2013, Journal of Cryptology.
[4] Andrew J. Blumberg,et al. Verifying computations without reexecuting them , 2015, Commun. ACM.
[5] Allan L. Fisher,et al. Flattening and parallelizing irregular, recurrent loop nests , 1995, PPOPP '95.
[6] George Danezis,et al. Square Span Programs with Applications to Succinct NIZK Arguments , 2014, ASIACRYPT.
[7] Eli Ben-Sasson,et al. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture , 2014, USENIX Security Symposium.
[8] Elaine Shi,et al. Signatures of Correct Computation , 2013, TCC.
[9] R. Cramer,et al. Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .
[10] Srinath T. V. Setty,et al. Making argument systems for outsourced computation practical (sometimes) , 2012, NDSS.
[11] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.
[12] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..
[13] Rafail Ostrovsky,et al. Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP , 2000, ICALP.
[14] Nir Bitansky,et al. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again , 2012, ITCS '12.
[15] Eli Ben-Sasson,et al. Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract , 2013, ITCS '13.
[16] Nir Bitansky,et al. On the existence of extractable one-way functions , 2014, SIAM J. Comput..
[17] Eli Ben-Sasson,et al. Scalable Zero Knowledge Via Cycles of Elliptic Curves , 2014, Algorithmica.
[18] Ariel J. Feldman,et al. Verifying computations with state ( extended version ) , 2013 .
[19] Eran Tromer,et al. Cluster Computing in Zero Knowledge , 2015, EUROCRYPT.
[20] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[21] Vinod Vaikuntanathan,et al. How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption , 2012, IACR Cryptol. ePrint Arch..
[22] Benjamin Braun,et al. Resolving the conflict between generality and plausibility in verified computation , 2013, EuroSys '13.
[23] Helger Lipmaa,et al. Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes , 2013, IACR Cryptol. ePrint Arch..
[24] Eli Ben-Sasson,et al. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge , 2013, CRYPTO.
[25] Benjamin Braun,et al. Taking Proof-Based Verified Computation a Few Steps Closer to Practicality , 2012, USENIX Security Symposium.
[26] Eli Ben-Sasson,et al. Computational Integrity with a Public Random String from Quasi-Linear PCPs , 2017, EUROCRYPT.
[27] Rafael Pass,et al. Limits of Extractability Assumptions with Distributional Auxiliary Input , 2015, ASIACRYPT.
[28] Graham Cormode,et al. Practical verified computation with streaming interactive proofs , 2011, ITCS '12.
[29] Zuocheng Ren,et al. Efficient RAM and control flow in verifiable outsourced computation , 2015, NDSS.
[30] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.