Streaming Authenticated Data Structures
暂无分享,去创建一个
Elaine Shi | Roberto Tamassia | Ke Yi | Charalampos Papamanthou | E. Shi | Charalampos Papamanthou | R. Tamassia | K. Yi
[1] B. E. Eckbo,et al. Appendix , 1826, Epilepsy Research.
[2] Chris Peikert,et al. Hardness of SIS and LWE with Small Parameters , 2013, CRYPTO.
[3] Rosario Gennaro,et al. Publicly verifiable delegation of large polynomials and matrix computations, with applications , 2012, IACR Cryptol. ePrint Arch..
[4] Roberto Tamassia,et al. Authenticated Data Structures , 2003, ESA.
[5] Yevgeniy Vahlis,et al. Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..
[6] Roberto Tamassia,et al. Authenticated hash tables , 2008, CCS.
[7] Elaine Shi,et al. Signatures of Correct Computation , 2013, TCC.
[8] Keisuke Tanaka,et al. Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems , 2008, ASIACRYPT.
[9] Roberto Tamassia,et al. Optimal Verification of Operations on Dynamic Sets , 2011, CRYPTO.
[10] Claudio Soriente,et al. An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials , 2009, IACR Cryptol. ePrint Arch..
[11] George Varghese,et al. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice , 2003, TOCS.
[12] Yi Mu,et al. Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems , 2009, CT-RSA.
[13] Lan Nguyen,et al. Accumulators from Bilinear Pairings and Applications , 2005, CT-RSA.
[14] Mihir Bellare,et al. Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.
[15] Daniele Micciancio,et al. Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[16] Michael Gertz,et al. Flexible authentication of XML documents , 2001, CCS '01.
[17] Yael Tauman Kalai,et al. Memory Delegation , 2011, CRYPTO.
[18] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[19] Ralph C. Merkle,et al. A Certified Digital Signature , 1989, CRYPTO.
[20] Josh Benaloh,et al. One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract) , 1994, EUROCRYPT.
[21] Ninghui Li,et al. Universal Accumulators with Efficient Nonmembership Proofs , 2007, ACNS.
[22] Moni Naor,et al. Certificate revocation and certificate update , 1998, IEEE Journal on Selected Areas in Communications.
[23] Vinod Vaikuntanathan,et al. How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption , 2012, IACR Cryptol. ePrint Arch..
[24] Michael Gertz,et al. A General Model for Authenticated Data Structures , 2004, Algorithmica.
[25] Michael T. Goodrich,et al. Implementation of an authenticated dictionary with skip lists and commutative hashing , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.
[26] Dominique Schröder,et al. Verifiable data streaming , 2012, CCS '12.
[27] Feifei Li,et al. Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams , 2007, VLDB.
[28] Charanjit S. Jutla,et al. Parallelizable Authentication Trees , 2005, IACR Cryptol. ePrint Arch..
[29] Miklós Ajtai,et al. Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[30] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[31] Mihir Bellare,et al. XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions , 1995, CRYPTO.
[32] Graham Cormode,et al. Verifying Computations with Streaming Interactive Proofs , 2011, Proc. VLDB Endow..
[33] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[34] Yin Yang,et al. Continuous authentication on relational streams , 2009, The VLDB Journal.
[35] Tal Malkin,et al. Private search in the real world , 2011, ACSAC '11.
[36] Miklós Ajtai,et al. Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.
[37] Roberto Tamassia,et al. Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures , 2007, ICICS.
[38] Michael T. Goodrich,et al. Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems , 2009, Algorithmica.
[39] Mihir Bellare,et al. A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost , 1997, EUROCRYPT.
[40] Oded Regev,et al. On the Complexity of Lattice Problems with Polynomial Approximation Factors , 2010, The LLL Algorithm.
[41] Oded Goldreich,et al. Collision-Free Hashing from Lattice Problems , 1996, Electron. Colloquium Comput. Complex..
[42] Yuval Ishai,et al. From Secrecy to Soundness: Efficient Verification via Secure Computation , 2010, ICALP.
[43] G. Edward Suh,et al. Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking , 2003, ASIACRYPT.
[44] Manuel Blum,et al. Checking the correctness of memories , 2005, Algorithmica.
[45] Rosario Gennaro,et al. Improved Publicly Verifiable Delegation of Large Polynomials and Matrix Computations , 2012, IACR Cryptol. ePrint Arch..
[46] Jan Camenisch,et al. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials , 2002, CRYPTO.
[47] Roberto Tamassia,et al. Optimal Authenticated Data Structures with Multilinear Forms , 2010, Pairing.
[48] Graham Cormode,et al. Practical verified computation with streaming interactive proofs , 2011, ITCS '12.
[49] Birgit Pfitzmann,et al. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees , 1997, EUROCRYPT.