Efficient lattice-based blind signatures via Gaussian one-time signatures
From MaRDI portal
Publication:6113967
DOI10.1007/978-3-030-97131-1_17zbMath1519.94226MaRDI QIDQ6113967
Vadim Lyubashevsky, Maxime Plançon, Ngoc Khanh Nguyen
Publication date: 10 August 2023
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97131-1_17
Related Items
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- New bounds in some transference theorems in the geometry of numbers
- Security arguments for digital signatures and blind signatures
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical product proofs for lattice commitments
- Lattice-based blind signatures, revisited
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- \textsf{BLAZE}: practical lattice-based blind signatures for privacy-preserving applications
- Worst-case to average-case reductions for module lattices
- Asymptotically efficient lattice-based digital signatures
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Lattice-Based Blind Signatures
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On the (in)security of ROS
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
