Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
From MaRDI portal
Publication:4916004
DOI10.1007/978-3-642-36362-7_8zbMath1314.94087OpenAlexW147565578MaRDI QIDQ4916004
Khoa Nguyen, Damien Stehlé, San Ling, 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
Related Items
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Policy-based signature scheme from lattices ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Memory lower bounds of reductions revisited ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Multimodal private signatures ⋮ Verifiable decryption in the head ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Forward-secure revocable secret handshakes from lattices ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Efficient code-based fully dynamic group signature scheme ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Group signature from lattices preserving forward security in dynamic setting ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease ⋮ Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ One-Shot Verifiable Encryption from Lattices ⋮ A framework for cryptographic problems from linear algebra ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ How to Prove Knowledge of Small Secrets ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Revocable hierarchical attribute-based signatures from lattices ⋮ Covert authentication from lattices ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- The complexity of the covering radius problem
- Security proofs for identity-based identification and signature schemes
- Improved identification schemes based on error-correcting codes
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
- Fully Anonymous Attribute Tokens from Lattices
- Identity-Based Cryptosystems and Signature Schemes
- Semi-homomorphic Encryption and Multiparty Computation
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- 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
- Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Adaptively Secure Identity-Based Identification from Lattices without Random Oracles
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Lattice-based Cryptography
- Unifying Zero-Knowledge Proofs of Knowledge
- Efficient Public Key Encryption Based on Ideal Lattices
- The Knowledge Complexity of Interactive Proof Systems
- Group Signatures
- Foundations of Cryptography
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - CRYPTO 2003
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications