Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
From MaRDI portal
Publication:5739197
DOI10.1007/978-3-662-49896-5_2zbMath1369.94570OpenAlexW2460181994MaRDI QIDQ5739197
Publication date: 15 July 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_2
Related Items (10)
Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ Lattice-based programmable hash functions and applications ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Vector and functional commitments from lattices ⋮ 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 ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Implementation of lattice trapdoors on modules and applications
This page was built for publication: Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
