A composable security treatment of ECVRF and batch verifications

DOI10.1007/978-3-031-17143-7_2MaRDI QIDQ6109455zbMATH OpenOpenAlexFDO

Authors Christian Badertscher, Peter Gaži, Iñigo Querejeta-Azurmendi, Alexander Russell

Publication date 28 July 2023

Published in Computer Security – ESORICS 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-17143-7_2

zbMATH Keywords

proof-of-stake blockchainspseudorandom lotteriesverifiable random functions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Classical and quantum security of elliptic curve VRF, via relative indifferentiability
• The price of verifiability: lower bounds for verifiable random functions
• Public Key Cryptography - PKC 2005
• Verifiable random functions with optimal tightness
• Efficient construction of (distributed) verifiable random functions

Cites work

• Batch verification of short signatures
• Can D.S.A. be improved? Complexity trade-offs with the digital signature standard
• Efficient signature generation by smart cards
• Fast batch verification for modular exponentiation and digital signatures
• Faster batch forgery identification
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1818845 (Why is no real title available?)
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Proofs of partial knowledge and simplified design of witness hiding protocols
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Universal composition with global subroutines: capturing global setup within plain UC
• Universal composition with responsive environments
• Universally composable security
• Zero-knowledge proofs of knowledge for group homomorphisms

Cited in

(7)

• DCapBAC: embedding authorization logic into smart things through ECC optimizations
• Batch Computations Revisited: Combining Key Computations and Batch Verifications
• Theoretical Computer Science
• Classical and quantum security of elliptic curve VRF, via relative indifferentiability
• Practical verifiable random function with RKA security
• Unbiasable verifiable random functions
• MUSEN: aggregatable key-evolving verifiable random functions and applications

This page was built for publication: A composable security treatment of ECVRF and batch verifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109455)