On the impossibility of batch update for cryptographic accumulators

DOI10.1007/978-3-642-14712-8_11MaRDI QIDQ3584982zbMATH OpenOpenAlexFDO

Authors Philippe Camacho, Alejandro Hevia

Publication date 31 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14712-8_11

zbMATH Keywords

batch updatecryptographic accumulators

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A New Dynamic Accumulator for Batch Updates
• Efficient Asynchronous Accumulators for Distributed PKI
• Cryptanalysis of a dynamic universal accumulator over bilinear groups
• Universal Accumulators with Efficient Nonmembership Proofs
• Dynamic universal accumulator with batch update over bilinear groups

Cited in

(10)

• Dynamic universal accumulator with batch update over bilinear groups
• KVaC: key-value commitments for blockchains and beyond
• Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
• Efficient Asynchronous Accumulators for Distributed PKI
• Zero-Knowledge Accumulators and Set Algebra
• A New Dynamic Accumulator for Batch Updates
• Limits on revocable proof systems, with implications for stateless blockchains
• Oblivious accumulators
• Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
• Lower bounding update frequency in short accumulators and vector commitments

This page was built for publication: On the impossibility of batch update for cryptographic accumulators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584982)