Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
From MaRDI portal
Publication:4916004
DOI10.1007/978-3-642-36362-7_8zbMATH Open1314.94087OpenAlexW147565578MaRDI QIDQ4916004FDOQ4916004
Authors: San Ling, Hoa Nguyen, Damien Stehlé, Huaxiong Wang 
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_8
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
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- Identity-Based Cryptosystems and Signature Schemes
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Efficient public key encryption based on ideal lattices (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Cryptography
- Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
- Lattice-based Cryptography
- Title not available (Why is that?)
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- Semi-homomorphic encryption and multiparty computation
- Title not available (Why is that?)
- Group Signatures
- The Knowledge Complexity of Interactive Proof Systems
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Anonymous Attribute Tokens from Lattices
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Lattice-Based Identification Schemes Secure Under Active Attacks
- The complexity of the covering radius problem
- Security proofs for identity-based identification and signature schemes
- Title not available (Why is that?)
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Generating shorter bases for hard random lattices
- Title not available (Why is that?)
- Improved identification schemes based on error-correcting codes
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Unifying Zero-Knowledge Proofs of Knowledge
- Adaptively secure identity-based identification from lattices without random oracles
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
Cited In (58)
- Bicameral and auditably private signatures
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Fully dynamic attribute-based signatures for circuits from codes
- Short code-based one-out-of-many proofs and applications
- M\&M's: mix and match attacks on Schnorr-type blind signatures with repetition
- Polytopes in the Fiat-Shamir with aborts paradigm
- A multi-group signature scheme from lattices
- Group signature from lattices preserving forward security in dynamic setting
- A gapless code-based hash proof system based on RQC and its applications
- Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- A framework for cryptographic problems from linear algebra
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Zero-knowledge proofs for committed symmetric Boolean functions
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions
- Toward non-interactive zero-knowledge proofs for NP from LWE
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
- Memory lower bounds of reductions revisited
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- A lattice-based group signature scheme with verifier-local revocation
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease
- Forward-secure revocable secret handshakes from lattices
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Policy-based signature scheme from lattices
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- More efficient amortization of exact zero-knowledge proofs for LWE
- Multimodal private signatures
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- How to Prove Knowledge of Small Secrets
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Traceable policy-based signatures and instantiation from lattices
- Traceable ring signatures: general framework and post-quantum security
- Multi-theorem preprocessing NIZKs from lattices
- Adaptive oblivious transfer with access control from lattice assumptions
- Efficient code-based fully dynamic group signature scheme
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Forward-Secure Group Encryptions from Lattices
- On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation
- Secure Stern Signatures in Quantum Random Oracle Model
- A Lattice-Based Group Signature Scheme with Message-Dependent Opening
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Verifiable decryption in the head
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Secret handshakes: full dynamicity, deniability and lattice-based design
- One-Shot Verifiable Encryption from Lattices
- Covert authentication from lattices
- Revocable hierarchical attribute-based signatures from lattices
- BLOOM: bimodal lattice one-out-of-many proofs and applications
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)
