Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
From MaRDI portal
Publication:1711842
DOI10.1016/j.tcs.2019.01.003zbMath1423.94085OpenAlexW2910059684WikidataQ122724166 ScholiaQ122724166MaRDI QIDQ1711842
Khoa Nguyen, San Ling, Fabrice Mouhartem, Huaxiong Wang, Benoît Libert
Publication date: 18 January 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01394087/file/groupenc.pdf
Related Items (1)
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
- A Provably Secure Group Signature Scheme from Code-Based Assumptions
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Toward Practical Group Encryption
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- 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
- A Group Signature Scheme from Lattice Assumptions
- Lattice-Based Blind Signatures
- A new paradigm for public key identification
- Predicate Encryption for Circuits from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Mediated Traceable Anonymous Encryption
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Group Encryption: Non-interactive Realization in the Standard Model
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- The knowledge complexity of interactive proof-systems
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Adapting Lyubashevsky’s Signature Schemes to the Ring Signature Setting
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Group Signatures with Efficient Concurrent Join
- Group Encryption
- Generating Shorter Bases for Hard Random Lattices
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Traceable Group Encryption
- Advances in Cryptology - CRYPTO 2003
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Classical hardness of learning with errors
- Automata, Languages and Programming
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
