Efficient Asynchronous Accumulators for Distributed PKI
From MaRDI portal
Publication:2827725
DOI10.1007/978-3-319-44618-9_16zbMath1416.94056OpenAlexW2405633850MaRDI QIDQ2827725
Leonid Reyzin, Sophia Yakoubov
Publication date: 21 October 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/2144/14494
Related Items (5)
SoK: blockchain light clients ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice ⋮ On the (Ir)replaceability of global setups, or how (not) to use a global ledger ⋮ Efficient Asynchronous Accumulators for Distributed PKI
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Efficient Asynchronous Accumulators for Distributed PKI
- On the Impossibility of Batch Update for Cryptographic Accumulators
- Universal Accumulators with Efficient Nonmembership Proofs
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: Efficient Asynchronous Accumulators for Distributed PKI
