Lattice-based e-cash, revisited
From MaRDI portal
Publication:2692386
DOI10.1007/978-3-030-64834-3_11OpenAlexW3037945028MaRDI QIDQ2692386
Amit Deo, Benoît Libert, Olivier Sanders, Khoa Nguyen
Publication date: 21 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64834-3_11
Related Items
Black-box accumulation based on lattices ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices
- More efficient commitments from structured lattice assumptions
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Divisible e-cash from constrained pseudo-random functions
- Hardness of SIS and LWE with Small Parameters
- Learning with Rounding, Revisited
- Key Homomorphic PRFs and Their Applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
- Pseudorandom Functions and Lattices
- Divisible E-Cash Made Practical
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Compact E-Cash and Simulatable VRFs Revisited
- Efficient Lattice (H)IBE in the Standard Model
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Compact E-Cash
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Watermarking cryptographic functionalities from standard lattice assumptions
