Short identity-based signatures with tight security from lattices

DOI10.1007/978-3-030-81293-5_19zbMath1485.94145OpenAlexW3182064934MaRDI QIDQ2118556

Benedikt Wagner, Jia-xin Pan

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_19

zbMATH Keywords

latticesidentity-based signaturestight securityshort integer solution assumption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Identity-based interactive aggregate signatures from lattices

Uses Software

• Falcon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More efficient (almost) tightly secure structure-preserving signatures
• Kurosawa-Desmedt meets tight security
• Simple and more efficient PRFs with tight security from LWE and matrix-DDH
• Practical and tightly-secure digital signatures and authenticated key exchange
• More efficient digital signatures with tight multi-user security
• Key-homomorphic pseudorandom functions from LWE with small modulus
• Tight security for the generic construction of identity-based signature (in the multi-instance setting)
• A generic construction of tightly secure signatures in the multi-user setting
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Unbounded HIBE with tight security
• Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• Tightly-Secure Signatures from Lossy Identification Schemes
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Lattice Signatures without Trapdoors
• Tightly Secure Signatures and Public-Key Encryption
• Tightly-Secure Signatures from Chameleon Hash Functions
• Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
• Identity-Based Cryptosystems and Signature Schemes
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Hierarchical ID-Based Cryptography
• Strong Key-Insulated Signature Schemes
• Hierarchical Identity-Based Encryption with Tight Multi-challenge Security
• Tightly-Secure Authenticated Key Exchange
• Advances in Cryptology - EUROCRYPT 2004
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Efficient Non-interactive Proof Systems for Bilinear Groups
• On lattices, learning with errors, random linear codes, and cryptography
• Tighter security proofs for GPV-IBE in the quantum random oracle model
• Tightly secure hierarchical identity-based encryption

This page was built for publication: Short identity-based signatures with tight security from lattices