A composable security treatment of ECVRF and batch verifications

DOI10.1007/978-3-031-17143-7_2zbMath1527.94016OpenAlexW4296831757MaRDI QIDQ6109455

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

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

verifiable random functionsproof-of-stake blockchainspseudorandom lotteries

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-knowledge proofs of knowledge for group homomorphisms
• Efficient signature generation by smart cards
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Batch verification of short signatures
• Universal composition with global subroutines: capturing global setup within plain UC
• Faster Batch Forgery Identification
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Universal Composition with Responsive Environments
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Universally Composable Security

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