all InfoSec news
MUSEN: Aggregatable Key-Evolving Verifiable Random Functions and Applications
April 26, 2024, 2:30 a.m. |
IACR News www.iacr.org
ePrint Report: MUSEN: Aggregatable Key-Evolving Verifiable Random Functions and Applications
Bernardo David, Rafael Dowsley, Anders Konring, Mario Larangeira
A Verifiable Random Function (VRF) can be evaluated on an input by a prover who holds a secret key, generating a pseudorandom output and a proof of output validity that can be verified using the corresponding public key. VRFs are a central building block of committee election mechanisms that sample parties to execute tasks in cryptographic protocols, e.g. generating blocks in a …
applications can eprint report function functions input key mario proof random report secret secret key verified
More from www.iacr.org / IACR News
Blink: An Optimal Proof of Proof-of-Work
1 day, 4 hours ago |
www.iacr.org
PN-based Attacks in the White-box Setting
1 day, 4 hours ago |
www.iacr.org
Succinct Functional Commitments for Circuits from k-Lin
1 day, 10 hours ago |
www.iacr.org
Levin–Kolmogorov Complexity is not in Linear Time
1 day, 10 hours ago |
www.iacr.org
Unstructured Inversions of New Hope
1 day, 10 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Product Regulatory Compliance Specialist
@ Avery Dennison | Oegstgeest, Netherlands
Cyber Security Analyst
@ FinClear | Melbourne, Australia
Senior Application Security Manager, United States-(Virtual)
@ Stanley Black & Decker | New Britain CT USA - 1000 Stanley Dr
Vice President - Information Security Management - FedRAMP
@ JPMorgan Chase & Co. | Chicago, IL, United States
Vice President, Threat Intelligence & AI
@ Arctic Wolf | Remote - Minnesota
Cybersecurity Analyst
@ Resource Management Concepts, Inc. | Dahlgren, Virginia, United States