Zero-Knowledge Accumulators and Set Algebra
From MaRDI portal
Publication:2953773
DOI10.1007/978-3-662-53890-6_3zbMath1407.94110OpenAlexW2554835359MaRDI QIDQ2953773
Dimitrios Papadopoulos, Olga Ohrimenko, Roberto Tamassia, Esha Ghosh, Nikos Triandopoulos
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_3
privacyintegritycloud privacyoutsourced computationbilinear accumulatorszero-knowledge dynamic and universal accumulatorszero-knowledge set algebrazero-knowledge updates
Related Items (5)
UC Updatable Databases and Applications ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Authenticated hash tables based on cryptographic accumulators
- Efficient set operations in the presence of malicious adversaries
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees
- Efficient Asynchronous Accumulators for Distributed PKI
- Redactable Signatures for Independent Removal of Structure and Content
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Zero-Knowledge Accumulators and Set Algebra
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- On the Impossibility of Batch Update for Cryptographic Accumulators
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Statistically Hiding Sets
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- The knowledge complexity of interactive proof-systems
- Fast accumulated hashing
- Vector Commitments and Their Applications
- Optimal Verification of Operations on Dynamic Sets
- Primary-Secondary-Resolver Membership Proof Systems
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Verifiable Set Operations over Outsourced Databases
- Privacy-Preserving Set Operations
- Updatable Zero-Knowledge Databases
- Zero-Knowledge Sets with Short Proofs
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: Zero-Knowledge Accumulators and Set Algebra
