article Open access
Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions
Michel Ferreira Abdallaa b c d✉, Dario Catalanoe f, Dario Fioreg h
- aDépartement d’Informatique, Ecole Normale Supérieure, Paris, France
- bCASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (France)
- cENS-PSL - École normale supérieure - Paris (45, Rue d'Ulm - 75230 Paris cedex 05 - France)
- dLIENS - Laboratoire d'informatique de l'école normale supérieure (45 Rue d'Ulm 75230 PARIS CEDEX 05 - France)
- eDipartimento di Matematica e Informatica, Università di Catania, Catania, Italy
- fDMI - Dipartimento di Matematica e Informatica (Dipartimento di Matematica e Informatica Università di Catania Viale Andrea Doria 6 95125 Catania - Italy)
- gMax Planck Institute for Software Systems (MPI-SWS), Saarbrücken, Germany
- hInstitute IMDEA Software [Madrid] (Campus de Montegancedo 28223 Pozuelo de Alarcón Madrid - Spain)
- ✉Corresponding author
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRA relation between the notions of verifiable random functions (VRFs) and identity-based key encapsulation mechanisms (IB-KEMs) is shown and a direct construction of VRFs from VRF-suitable IB-K EMs is proposed. (Semantic Scholar)