Efficient Asynchronous Accumulators for Distributed PKI
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1941253
- scientific article; zbMATH DE number 1583939
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Aggregatable distributed key generation
- Information Security and Cryptology - ICISC 2005
- Asynchronous secure multiparty computation in constant time
Cites work
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Efficient Asynchronous Accumulators for Distributed PKI
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- scientific article; zbMATH DE number 1424194 (Why is no real title available?)
- On the impossibility of batch update for cryptographic accumulators
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Topics in Cryptology – CT-RSA 2005
- Universal Accumulators with Efficient Nonmembership Proofs
Cited in
(10)- On the (Ir)replaceability of global setups, or how (not) to use a global ledger
- Efficient Asynchronous Accumulators for Distributed PKI
- Zero-Knowledge Accumulators and Set Algebra
- On the impossibility of batch update for cryptographic accumulators
- SoK: blockchain light clients
- Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice
- Universal vector commitments
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
- Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
- Lower bounding update frequency in short accumulators and vector commitments
This page was built for publication: Efficient Asynchronous Accumulators for Distributed PKI
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827725)
