Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
From MaRDI portal
Publication:3600386
DOI10.1007/978-3-540-89255-7_23zbMath1206.94076OpenAlexW139987668MaRDI QIDQ3600386
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
Publication date: 10 February 2009
Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_23
identification schemeslattice-based cryptographyconcurrent securityad hoc anonymous identification schemes
Related Items (42)
Lattice-based key exchange on small integer solution problem ⋮ A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ 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 ⋮ Tightly secure signatures from lossy identification schemes ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Black-box accumulation based on lattices ⋮ Memory lower bounds of reductions revisited ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Message-Restriction-Free Commitment Scheme Based on Lattice Assumption ⋮ Lattice-based secret handshakes with reusable credentials ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Multimodal private signatures ⋮ Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation ⋮ Verifiable decryption in the head ⋮ Efficient unique ring signatures from lattices ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Speeding-up verification of digital signatures ⋮ Grid-Obstacle Representations with Connections to Staircase Guarding ⋮ 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 ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Improved Zero-Knowledge Identification with Lattices ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ The Geometry of Lattice Cryptography ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Efficient Threshold Encryption from Lossy Trapdoor Functions ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Survey of Lattice-Based Group Signature ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Collision-Free Hashing from Lattice Problems
- A new paradigm for public key identification
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- SWIFFT: A Modest Proposal for FFT Hashing
- Trapdoors for hard lattices and new cryptographic constructions
- Generalized Compact Knapsacks Are Collision Resistant
- Foundations of Cryptography
- Statistical secrecy and multibit commitments
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Information Security
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
