Explore a cutting-edge cryptography paper presented at Crypto 2017 by Shota Yamada, focusing on asymptotically compact adaptively secure lattice-based Identity-Based Encryption (IBE) systems and Verifiable Random Functions (VRFs). Delve into advanced cryptographic concepts and their applications in secure communication and randomness generation. Gain insights into the latest developments in lattice-based cryptography and their potential impact on future security protocols.
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalize
Overview
Syllabus
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalize
Taught by
TheIACR
Related Courses
-
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
-
Fair Sequencing: Using Verifiable Random Functions for Rollup Transaction Ordering
-
Lattice Cryptography
-
Lattice Based Fully Dynamic Multi Key FHE with Short Ciphertexts
-
Partitioning via Non Linear Polynomial Functions - More Compact IBEs from Ideal Lattices
-
One Shot Verifiable Encryption from Lattices
