Lattice-based accumulator with constant time list update and constant time verification
From MaRDI portal
Publication:6057222
DOI10.1007/978-3-031-33017-9_14zbMath1522.94077OpenAlexW4377082041MaRDI QIDQ6057222
H. Miyaji, Atsuko Miyaji, Yuta Maeno
Publication date: 4 October 2023
Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33017-9_14
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More efficient commitments from structured lattice assumptions
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Trapdoors for hard lattices and new cryptographic constructions
- Universal Accumulators with Efficient Nonmembership Proofs
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Practical Signatures from the Partial Fourier Recovery Problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: Lattice-based accumulator with constant time list update and constant time verification