Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
From MaRDI portal
Recommendations
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Simpler efficient group signatures from lattices
Cites work
- A Framework for Universally Composable Non-committing Blind Signatures
- A new identification scheme based on syndrome decoding
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Classical hardness of learning with errors
- Confined guessing: new signatures from standard assumptions
- Efficent receipt-free voting based on homomorphic encryption
- Efficient lattice (H)IBE in the standard model
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Formal treatment of privacy-enhancing credential systems
- Fully Anonymous Attribute Tokens from Lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Group Signatures with Efficient Concurrent Join
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 1759783 (Why is no real title available?)
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Lattice signatures without trapdoors
- Lattice-based group signature scheme with verifier-local revocation
- Lattice-based group signatures with logarithmic signature size
- New bounds in some transference theorems in the geometry of numbers
- Oblivious transfer with hidden access control policies
- On the Non-malleability of the Fiat-Shamir Transform
- On the Portability of Generalized Schnorr Proofs
- One-shot verifiable encryption from lattices
- P-signatures and Noninteractive Anonymous Credentials
- Predicting Lattice Reduction
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Simpler efficient group signatures from lattices
- Simulatable Adaptive Oblivious Transfer
- Structure preserving CCA secure encryption and applications
- Structure-preserving signatures and commitments to group elements
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Cited in
(3)
This page was built for publication: Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108830)
