Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
From MaRDI portal
Publication:4916004
Recommendations
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Advances in Cryptology - CRYPTO 2003
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
Cites work
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1775382 (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
- Adaptively secure identity-based identification from lattices without random oracles
- Advances in Cryptology - CRYPTO 2003
- Bonsai trees, or how to delegate a lattice basis
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Efficient lattice (H)IBE in the standard model
- Efficient public key encryption based on ideal lattices (extended abstract)
- Foundations of Cryptography
- Fully Anonymous Attribute Tokens from Lattices
- Generating shorter bases for hard random lattices
- Group Signatures
- Identity-based cryptosystems and signature schemes
- Improved identification schemes based on error-correcting codes
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Lattice-based Cryptography
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Public-key cryptosystems from the worst-case shortest vector problem
- Security proofs for identity-based identification and signature schemes
- Semi-homomorphic encryption and multiparty computation
- Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
- The Knowledge Complexity of Interactive Proof Systems
- The complexity of the covering radius problem
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Unifying Zero-Knowledge Proofs of Knowledge
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
Cited in
(59)- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Covert authentication from lattices
- Revocable hierarchical attribute-based signatures from lattices
- Forward-secure revocable secret handshakes from lattices
- Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Toward non-interactive zero-knowledge proofs for NP from LWE
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- A lattice-based group signature scheme with message-dependent opening
- Group signature from lattices preserving forward security in dynamic setting
- Zero-knowledge proofs for committed symmetric Boolean functions
- One-shot verifiable encryption from lattices
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Forward-Secure Group Encryptions from Lattices
- On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation
- Efficient code-based fully dynamic group signature scheme
- Secure Stern Signatures in Quantum Random Oracle Model
- Memory lower bounds of reductions revisited
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Multimodal private signatures
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Lattice-based group signatures with verifier-local revocation: achieving shorter key-sizes and explicit traceability with ease
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Compact privacy protocols from post-quantum and timed classical assumptions
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Policy-based signature scheme from lattices
- Verifiable decryption in the head
- Traceable policy-based signatures and instantiation from lattices
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- A lattice-based group signature scheme with verifier-local revocation
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Traceable ring signatures: general framework and post-quantum security
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- A gapless code-based hash proof system based on RQC and its applications
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Multi-theorem preprocessing NIZKs from lattices
- How to prove knowledge of small secrets
- More efficient amortization of exact zero-knowledge proofs for LWE
- A framework for cryptographic problems from linear algebra
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Adaptive oblivious transfer with access control from lattice assumptions
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Polytopes in the Fiat-Shamir with aborts paradigm
- A multi-group signature scheme from lattices
- Short code-based one-out-of-many proofs and applications
- M\&M's: mix and match attacks on Schnorr-type blind signatures with repetition
- Fully dynamic attribute-based signatures for circuits from codes
- Bicameral and auditably private signatures
This page was built for publication: Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916004)
