Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees
From MaRDI portal
Publication:2827721
DOI10.1007/978-3-319-44618-9_12zbMath1416.94051MaRDI QIDQ2827721
Roberto Tamassia, Olga Ohrimenko, Esha Ghosh, Michael T. Goodrich
Publication date: 21 October 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_12
Related Items
Chameleon-Hashes with Ephemeral Trapdoors, Protean Signature Schemes, Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees, Zero-Knowledge Accumulators and Set Algebra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees
- Computing on Authenticated Data
- Redactable Signatures for Independent Removal of Structure and Content
- Zero-Knowledge Accumulators and Set Algebra
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Redactable Signatures for Tree-Structured Data: Definitions and Constructions
- Statistically Hiding Sets
- Short Redactable Signatures Using Random Trees
- Foundations of Cryptography
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Vector Commitments and Their Applications
- On Updatable Redactable Signatures
- Anti-persistence
- Primary-Secondary-Resolver Membership Proof Systems
- Advances in Cryptology - EUROCRYPT 2004
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Updatable Zero-Knowledge Databases
- Zero-Knowledge Sets with Short Proofs
- Automata, Languages and Programming
