Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
From MaRDI portal
Publication:6108830
DOI10.1007/978-3-319-99136-8_1zbMath1517.94183OpenAlexW2795307877MaRDI QIDQ6108830
Jan Camenisch, Cecilia Boschini, Gregory Neven
Publication date: 30 June 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-99136-8_1
rejection samplingzero-knowledge proofcommitment schemeCamenisch-Lysyanskaya signaturegeneralized Schnorr proofs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- Confined guessing: new signatures from standard assumptions
- Formal Treatment of Privacy-Enhancing Credential Systems
- Lattice-Based Group Signatures with Logarithmic Signature Size
- On the Non-malleability of the Fiat-Shamir Transform
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Fully Anonymous Attribute Tokens from Lattices
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Simpler Efficient Group Signatures from Lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Oblivious Transfer with Hidden Access Control Policies
- Structure Preserving CCA Secure Encryption and Applications
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Efficient Lattice (H)IBE in the Standard Model
- Structure-Preserving Signatures and Commitments to Group Elements
- On the Portability of Generalized Schnorr Proofs
- A Framework for Universally Composable Non-committing Blind Signatures
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A new identification scheme based on syndrome decoding
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Advances in Cryptology – CRYPTO 2004
- Group Signatures with Efficient Concurrent Join
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Advances in Cryptology - CRYPTO 2003
- Simulatable Adaptive Oblivious Transfer
- P-signatures and Noninteractive Anonymous Credentials
- Predicting Lattice Reduction
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Classical hardness of learning with errors
- One-Shot Verifiable Encryption from Lattices
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
This page was built for publication: Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs