Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques

DOI10.1007/978-3-319-63697-9_6zbMath1406.94084OpenAlexW2593367459MaRDI QIDQ1675199

Publication date: 27 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63697-9_6

Related Items (19)

Generic Constructions of Revocable Identity-Based Encryption ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ More efficient adaptively secure lattice-based IBE with equality test in the standard model ⋮ Adaptive-Secure VRFs with Shorter Keys from Static Assumptions ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Lattice-based programmable hash functions and applications ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ 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 ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Two Efficient Tag-Based Encryption Schemes on Lattices ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ 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 ⋮ Adaptively secure constrained pseudorandom functions in the standard model

This page was built for publication: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques