Black-box accumulation based on lattices

DOI10.1007/978-3-030-92641-0_11MaRDI QIDQ2149798zbMATH OpenOpenAlexFDO

Authors Sebastian H. Faller, Pascal Baumer, Michael Klooß, Astrid Ottenhues, Markus Raiber, Alexander K. Koch

Publication date 29 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-92641-0_11

zbMATH Keywords

learning with errorslattice-based cryptographysecurity and privacyshort integer solutionblack-box accumulation (BBA)electronic funds transfer

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• scientific article; zbMATH DE number 1842491 (Why is no real title available?)
• A new paradigm for public key identification
• Advances in Cryptology – CRYPTO 2004
• Bonsai trees, or how to delegate a lattice basis
• Compact E-Cash
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Divisible e-cash from constrained pseudo-random functions
• Efficient lattice (H)IBE in the standard model
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Fully homomorphic encryption using ideal lattices
• Generating shorter bases for hard random lattices
• Lattice-based e-cash, revisited
• Lossy trapdoor functions and their applications
• New bounds in some transference theorems in the geometry of numbers
• On lattices, learning with errors, random linear codes, and cryptography
• On the concrete hardness of learning with errors
• Predicting Lattice Reduction
• Revisiting post-quantum Fiat-Shamir
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• Trapdoors for hard lattices and new cryptographic constructions
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash

Cited in

(2)

• Towards a black box Lanczos program
• CTA: confidential transactions protocol with state accumulator

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)