Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
From MaRDI portal
Recommendations
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2081087 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- A provably secure group signature scheme from code-based assumptions
- Adapting Lyubashevsky's signature schemes to the ring signature setting
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Automata, Languages and Programming
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Bonsai trees, or how to delegate a lattice basis
- Classical hardness of learning with errors
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Confined guessing: new signatures from standard assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Efficient concurrent zero-knowledge in the auxiliary string model
- Efficient lattice (H)IBE in the standard model
- Fully homomorphic encryption using ideal lattices
- Generating shorter bases for hard random lattices
- Group Encryption
- Group Signatures
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Group Signatures with Efficient Concurrent Join
- Group encryption: non-interactive realization in the standard model
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Lattice-based blind signatures
- Lattice-based group signature scheme with verifier-local revocation
- Lattice-based group signatures with logarithmic signature size
- Mediated traceable anonymous encryption
- New bounds in some transference theorems in the geometry of numbers
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- On lattices, learning with errors, random linear codes, and cryptography
- Predicate encryption for circuits from LWE
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Public-key cryptosystems from the worst-case shortest vector problem
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Simpler efficient group signatures from lattices
- The knowledge complexity of interactive proof-systems
- Toward practical group encryption
- Traceable group encryption
- 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
(8)- Zero-knowledge proofs of knowledge for group homomorphisms
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Zero-knowledge arguments for subverted RSA groups
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Fully dynamic attribute-based signatures for circuits from codes
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
This page was built for publication: Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1711842)
