On the impossibility of batch update for cryptographic accumulators

DOI10.1007/978-3-642-14712-8_11zbMATH Open1286.94090OpenAlexW1851011214MaRDI QIDQ3584982FDOQ3584982

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

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

zbMATH Keywords

cryptographic accumulatorsbatch update

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (8)

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

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)