Black-box accumulation based on lattices
From MaRDI portal
Publication:2149798
DOI10.1007/978-3-030-92641-0_11zbMATH Open1492.94101OpenAlexW4206812958MaRDI QIDQ2149798FDOQ2149798
Markus Raiber, Sebastian H. Faller, Alexander K. Koch, Michael Klooß, Pascal Baumer, Astrid Ottenhues
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92641-0_11
Recommendations
- Lattice-based universal accumulator with nonmembership arguments
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Lattice-based accumulator with constant time list update and constant time verification
- Lattice cryptography for the internet
learning with errorslattice-based cryptographysecurity and privacyshort integer solutionblack-box accumulation (BBA)electronic funds transfer
Cites Work
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating Shorter Bases for Hard Random Lattices
- Predicting Lattice Reduction
- New bounds in some transference theorems in the geometry of numbers
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- A new paradigm for public key identification
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Compact E-Cash
- Lossy trapdoor functions and their applications
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Bonsai trees, or how to delegate a lattice basis
- On the concrete hardness of learning with errors
- Title not available (Why is that?)
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Divisible e-cash from constrained pseudo-random functions
- Lattice-based e-cash, revisited
Cited In (1)
This page was built for publication: Black-box accumulation based on lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149798)
