Reference : New Constructions of Verifiable Delay Functions
E-prints/Working papers : First made available on ORBilu
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/43789
New Constructions of Verifiable Delay Functions
English
Barthel, Jim Jean-Pierre mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Naccache, David mailto [Centre National de la Recherche Scientifique - CNRS > Ecole Normale Superieure - Information Security Group]
Rosie, Razvan mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Undated
No
[en] Verifiable Delay Function (VDF) ; Fully Homomorphic Encryption (FHE)
[en] A Verifiable Delay Function (VDF) is a cryptographic protocol thought to provide a proof of elapsed time. At the core of such a protocol lies a sequential task whose evaluation cannot be accelerated, even in the presence of massive parallel computational resources.

We introduce a novel sequentiality assumption, put forth a scheme that achieves
this sequentiality constraint by requiring its users to evaluate a function over (levelled) fully homomorphic ciphertexts and provide a heuristic security analysis.
Researchers
http://hdl.handle.net/10993/43789
FnR ; FNR10621687 > Sjouke Mauw > SPsquared > Security and Privacy for System Protection > 01/01/2017 > 30/06/2023 > 2016

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
NewVDFConstructions.pdfAuthor preprint561.58 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.