Exponent-VRFs and their applications with Yehuda Lindell | a16z crypto research talks
Source: YouTube · a16z crypto · published Oct 4, 2024 · 1:03:52
The talk introduces Exponent VRFs (eVRFs) as a simple cryptographic primitive that enables multiple applications 1:05. An eVRF is similar to a verifiable random function but outputs the result in the exponent 1:47, providing both correctness proofs and atomic operations for protocols 3:26.
Key Takeaways:
• Exponent VRFs enable two-round fully simulatable multi-party Schnorr signing 4:06 and two-party ECDSA signing 4:06
• Simulation-based security definitions provide advantages over game-based definitions, including better composability guarantees 14:25
• With eVRFs, one-round distributed key generation becomes possible by using a unique nonce/timestamp to prevent key biasing 39:02
• The protocols are universally composable and secure even when keys are related (e.g., through HD wallet derivation) 26:02
The talk demonstrates how this simple primitive can solve complex problems in threshold cryptography and multi-party computation more efficiently than generic approaches 5:55.
Sources:
Generate CPE Credits
Generate a professional CPE document from this video's transcript.
Estimated credit: 1 CPE hours
Estimate uses the video runtime (1 hour ≈ 1 CPE, rounded to the nearest 0.5, minimum 0.5, maximum 2.0). The final amount can be lower after review, never higher.
Topic: CISSP Domains. Commonly maps to: Security and Risk Management, Security Architecture and Engineering, Security Operations. Exact CISSP domains are assigned during generation.
Free account. One generation at a time, with a daily limit.
CPEBuddy is independent and not affiliated with or endorsed by ISC2, ISACA, or any certification body. Exports are formatted for common CPE submissions; acceptance is at your certification body's discretion.
Transcript Preview
First 800 characters of the transcript
my pleasure to introduce you HUD lindel uh he is a head of cryptography at coinbase and a CEO was a CEO at inbound security he's also a professor at barand University and he's going to talk today about exponent VFS and their applications thank you very much this is a joint work with Dan Bon and heitner the work really came out of looking at a number of different things that we wanted to do and then just observing that it turns out that all of these things and actually many other things can all be derived from a very from a single very very simple primitive simple in the sense that very simple to describe how simple it is to construct uh that I guess the future will see but my aim in this talk is to convince you that this is a very interesting primitive and you should work on finding a simp…