Authenticated hash tables based on cryptographic accumulators
From MaRDI portal
Publication:262258
DOI10.1007/s00453-014-9968-3zbMath1336.68049OpenAlexW2127155618MaRDI QIDQ262258
Nikos Triandopoulos, Charalampos Papamanthou, Roberto Tamassia
Publication date: 29 March 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-014-9968-3
Cryptography (94A60) Data structures (68P05) Authentication, digital signatures and secret sharing (94A62)
Related Items
Database Outsourcing with Hierarchical Authenticated Data Structures ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Secure Authenticated Comparisons ⋮ Efficient authenticated data structures for graph connectivity and geometric search problems ⋮ Integrity and Consistency for Untrusted Services ⋮ Authenticated hash tables based on cryptographic accumulators
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Authenticated hash tables based on cryptographic accumulators
- Efficient authenticated data structures for graph connectivity and geometric search problems
- The design of dynamic data structures
- Maximum queue size and hashing with lazy deletion
- Checking the correctness of memories
- A general model for authenticated data structures
- Short signatures without random oracles and the SDH assumption in bilinear groups
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Optimal Authenticated Data Structures with Multilinear Forms
- How Efficient Can Memory Checking Be?
- Universal Accumulators with Efficient Nonmembership Proofs
- Efficient Content Authentication in Peer-to-Peer Networks
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Computational Complexity of Fourier Transforms Over Finite Fields
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Streaming Authenticated Data Structures
- Optimal Verification of Operations on Dynamic Sets
- Verifiable Set Operations over Outsourced Databases
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- A New Dynamic Accumulator for Batch Updates
- Super-Efficient Verification of Dynamic Outsourced Databases
- Topics in Cryptology – CT-RSA 2005
- Automata, Languages and Programming
- Data and Applications Security XIX
This page was built for publication: Authenticated hash tables based on cryptographic accumulators
