Towards Tightly Secure Lattice Short Signature and Id-Based Encryption

DOI10.1007/978-3-662-53890-6_14zbMath1407.94091OpenAlexW2557163026MaRDI QIDQ2953784

Qinyi Li, Xavier Boyen

Publication date: 6 January 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (21)

Generic Constructions of Revocable Identity-Based Encryption ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Optimal tightness for chain-based unique signatures ⋮ Efficient laconic cryptography from learning with errors ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ A note on the post-quantum security of (ring) signatures ⋮ Lattice-based programmable hash functions and applications ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key ⋮ Generic construction of server-aided revocable hierarchical identity-based encryption ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness ⋮ IBE with tight security against selective opening and chosen-ciphertext attacks ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Short identity-based signatures with tight security from lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short signatures from the Weil pairing
• Bonsai trees, or how to delegate a lattice basis
• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
• A Framework for Identity-Based Encryption with Almost Tight Security
• Riding on Asymmetry: Efficient ABE for Branching Programs
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Improved Short Lattice Signatures in the Standard Model
• New and Improved Key-Homomorphic Pseudorandom Functions
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Lattice Signatures without Trapdoors
• New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
• Tightly Secure Signatures and Public-Key Encryption
• Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions
• Tightly-Secure Signatures from Chameleon Hash Functions
• Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
• Lattice-based FHE as secure as PKE
• Number-theoretic constructions of efficient pseudo-random functions
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Short and Stateless Signatures from the RSA Assumption
• Predicate Encryption for Circuits from LWE
• Efficient Pseudorandom Functions via On-the-Fly Adaptation
• Trapdoors for hard lattices and new cryptographic constructions
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• Efficient Lattice (H)IBE in the Standard Model
• Practical Identity-Based Encryption Without Random Oracles
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• Secure Hash-and-Sign Signatures Without the Random Oracle
• The Cramer-Shoup Strong-RSA Signature Scheme Revisited
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Practical Signatures from Standard Assumptions
• Public-key cryptosystems from the worst-case shortest vector problem
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Attribute-based encryption for circuits
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Towards Tightly Secure Lattice Short Signature and Id-Based Encryption