File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Book Chapter: Practical Verifiable Random Function with RKA Security

TitlePractical Verifiable Random Function with RKA Security
Authors
Keywordsuniversal composability
Verifiable random function
VRF
Issue Date5-Jul-2023
PublisherSpringer
Abstract

A verifiable random function (VRF) allows the generation of a random number with publicly verifiable proof, showing that the random number is honestly generated. The practical VRF used in real-world applications considers the security of uniqueness, pseudorandomness, and unpredictability under malicious key generation. In this paper, we propose the security model of related-key attack to VRF for capturing attacks like tampering attacks. We propose a new construction of VRF that satisfies the RKA security together with the existing security requirements. We implement our VRF construction and demonstrate that our scheme is practical for real-world applications.


Persistent Identifierhttp://hdl.handle.net/10722/337170
ISBN
ISSN
2023 SCImago Journal Rankings: 0.606

 

DC FieldValueLanguage
dc.contributor.authorYuen, Tsz Hon-
dc.contributor.authorPan, Shimin-
dc.contributor.authorHuang, Sheng-
dc.contributor.authorZhang, Xiaoting-
dc.date.accessioned2024-03-11T10:18:38Z-
dc.date.available2024-03-11T10:18:38Z-
dc.date.issued2023-07-05-
dc.identifier.isbn9783031354854-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/337170-
dc.description.abstract<p> A verifiable random function (VRF) allows the generation of a random number with publicly verifiable proof, showing that the random number is honestly generated. The practical VRF used in real-world applications considers the security of uniqueness, pseudorandomness, and unpredictability under malicious key generation. In this paper, we propose the security model of <em>related-key attack</em> to VRF for capturing attacks like tampering attacks. We propose a new construction of VRF that satisfies the RKA security together with the existing security requirements. We implement our VRF construction and demonstrate that our scheme is practical for real-world applications. <br></p>-
dc.languageeng-
dc.publisherSpringer-
dc.relation.ispartofInformation Security and Privacy-
dc.subjectuniversal composability-
dc.subjectVerifiable random function-
dc.subjectVRF-
dc.titlePractical Verifiable Random Function with RKA Security-
dc.typeBook_Chapter-
dc.identifier.doi10.1007/978-3-031-35486-1_22-
dc.identifier.scopuseid_2-s2.0-85164723977-
dc.identifier.volume13915 LNCS-
dc.identifier.spage503-
dc.identifier.epage522-
dc.identifier.eissn1611-3349-
dc.identifier.eisbn9783031354861-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats