vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases
暂无分享,去创建一个
Jonathan Katz | Daniel Genkin | Charalampos Papamanthou | Dimitrios Papadopoulos | Yupeng Zhang | Jonathan Katz | Charalampos Papamanthou | Daniel Genkin | Dimitrios Papadopoulos | Yupeng Zhang | D. Papadopoulos
[1] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.
[2] Michael Gertz,et al. Flexible authentication of XML documents , 2001, CCS '01.
[3] Michael Gertz,et al. A General Model for Authenticated Data Structures , 2004, Algorithmica.
[4] Carlo Zaniolo,et al. Query Languages and Data Models for Database Sequences and Data Streams , 2004, VLDB.
[5] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[6] Feifei Li,et al. Dynamic authenticated index structures for outsourced databases , 2006, SIGMOD Conference.
[7] Yin Yang,et al. Authenticated join processing in outsourced databases , 2009, SIGMOD Conference.
[8] Michael T. Goodrich,et al. Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems , 2009, Algorithmica.
[9] Jens Groth,et al. Short Pairing-Based Non-interactive Zero-Knowledge Arguments , 2010, ASIACRYPT.
[10] Ian Goldberg,et al. Constant-Size Commitments to Polynomials and Their Applications , 2010, ASIACRYPT.
[11] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[12] Roberto Tamassia,et al. Optimal Verification of Operations on Dynamic Sets , 2011, CRYPTO.
[13] Yael Tauman Kalai,et al. Memory Delegation , 2011, CRYPTO.
[14] Yevgeniy Vahlis,et al. Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..
[15] Ran Canetti,et al. Practical delegation of computation using multiple servers , 2011, CCS '11.
[16] Benjamin Braun,et al. Taking Proof-Based Verified Computation a Few Steps Closer to Practicality , 2012, USENIX Security Symposium.
[17] Rosario Gennaro,et al. Publicly verifiable delegation of large polynomials and matrix computations, with applications , 2012, IACR Cryptol. ePrint Arch..
[18] Nir Bitansky,et al. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again , 2012, ITCS '12.
[19] Graham Cormode,et al. Practical verified computation with streaming interactive proofs , 2011, ITCS '12.
[20] Shouhuai Xu,et al. Efficient query integrity for outsourced dynamic databases , 2012, CCSW '12.
[21] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[22] Benjamin Braun,et al. Verifying computations with state , 2013, IACR Cryptol. ePrint Arch..
[23] Benjamin Braun,et al. Resolving the conflict between generality and plausibility in verified computation , 2013, EuroSys '13.
[24] Rafael Pass,et al. Limits of Extractability Assumptions with Distributional Auxiliary Input , 2015, ASIACRYPT.
[25] Michael Backes,et al. Verifiable delegation of computation on outsourced data , 2013, CCS.
[26] Craig Gentry,et al. Pinocchio: Nearly Practical Verifiable Computation , 2013, IEEE Symposium on Security and Privacy.
[27] Elaine Shi,et al. Signatures of Correct Computation , 2013, TCC.
[28] Omer Paneth,et al. Verifiable Set Operations over Outsourced Databases , 2014, IACR Cryptol. ePrint Arch..
[29] Eli Ben-Sasson,et al. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge , 2013, CRYPTO.
[30] Justin Thaler,et al. Time-Optimal Interactive Proofs for Circuit Evaluation , 2013, CRYPTO.
[31] George Danezis,et al. ZQL: A Compiler for Privacy-Preserving Data Processing , 2013, USENIX Security Symposium.
[32] Srinath T. V. Setty,et al. A Hybrid Architecture for Interactive Verifiable Computation , 2013, 2013 IEEE Symposium on Security and Privacy.
[33] Jonathan Katz,et al. ALITHEIA: Towards Practical Verifiable Graph Processing , 2014, CCS.
[34] Rosario Gennaro,et al. Generalizing Homomorphic MACs for Arithmetic Circuits , 2014, IACR Cryptol. ePrint Arch..
[35] Eli Ben-Sasson,et al. Scalable Zero Knowledge Via Cycles of Elliptic Curves , 2014, Algorithmica.
[36] Stavros Papadopoulos,et al. Taking Authenticated Range Queries to Arbitrary Dimensions , 2014, CCS.
[37] Shafi Goldwasser,et al. Functional Signatures and Pseudorandom Functions , 2014, Public Key Cryptography.
[38] Elaine Shi,et al. TRUESET: Faster Verifiable Set Computations , 2014, USENIX Security Symposium.
[39] Eli Ben-Sasson,et al. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture , 2014, USENIX Security Symposium.
[40] Nir Bitansky,et al. On the existence of extractable one-way functions , 2014, SIAM J. Comput..
[41] Elaine Shi,et al. Authenticated data structures, generically , 2014, POPL.
[42] Yael Tauman Kalai,et al. Delegating RAM Computations , 2016, TCC.
[43] Jonathan Katz,et al. IntegriDB: Verifiable SQL for Outsourced Databases , 2015, CCS.
[44] Yael Tauman Kalai,et al. Delegating computation: interactive proofs for muggles , 2008, STOC.
[45] Jon Howell,et al. Geppetto: Versatile Verifiable Computation , 2015, 2015 IEEE Symposium on Security and Privacy.
[46] Roberto Tamassia,et al. Practical Authenticated Pattern Matching with Optimal Proof Size , 2015, Proc. VLDB Endow..
[47] Zuocheng Ren,et al. Efficient RAM and control flow in verifiable outsourced computation , 2015, NDSS.
[48] Michael Backes,et al. ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data , 2015, 2015 IEEE Symposium on Security and Privacy.
[49] Jens Groth,et al. On the Size of Pairing-Based Non-interactive Arguments , 2016, EUROCRYPT.
[50] Ahmed E. Kosba,et al. C ∅ C ∅ : A Framework for Building Composable Zero-Knowledge Proofs , 2016 .
[51] Ran Canetti,et al. Adaptive Succinct Garbled RAM or: How to Delegate Your Database , 2016, TCC.
[52] Cédric Fournet,et al. Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data , 2016, CCS.
[53] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.