scientific article; zbMATH DE number 1941253

MaRDI QIDQ4408458zbMATH OpenFDO

Authors Roberto Tamassia, Jasminka Hasić, Michael T. Goodrich

Publication date 29 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2433/24330372.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1942413
• A New Dynamic Accumulator for Batch Updates
• Publication:4945394
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Universal Accumulators with Efficient Nonmembership Proofs

Cited in

(20)

• Authenticated hash tables based on cryptographic accumulators
• scientific article; zbMATH DE number 1394309 (Why is no real title available?)
• scientific article; zbMATH DE number 1424194 (Why is no real title available?)
• scientific article; zbMATH DE number 2044545 (Why is no real title available?)
• Efficient authenticated data structures for graph connectivity and geometric search problems
• A New Dynamic Accumulator for Batch Updates
• Super-Efficient Verification of Dynamic Outsourced Databases
• Ensuring Authentication of Digital Information Using Cryptographic Accumulators
• scientific article; zbMATH DE number 907956 (Why is no real title available?)
• scientific article; zbMATH DE number 2089751 (Why is no real title available?)
• scientific article; zbMATH DE number 1942413 (Why is no real title available?)
• Database outsourcing with hierarchical authenticated data structures
• Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers?
• Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
• scientific article; zbMATH DE number 1689608 (Why is no real title available?)
• A symmetric cryptographic scheme for data integrity verification in cloud databases
• Fast accumulated hashing
• Universal Accumulators with Efficient Nonmembership Proofs
• Efficient Asynchronous Accumulators for Distributed PKI
• Statistically Hiding Sets

This page was built for publication:

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