Explore a groundbreaking approach to RSA modulus generation in this 16-minute IEEE presentation. Delve into the Diogenes protocol, which offers a lightweight and scalable solution for generating RSA moduli even with a dishonest majority. Learn about verifiable delay functions, the protocol blueprint, and the Bonnet Franklin framework. Discover how secure multiplication is implemented, and understand the role of the coordinator and threshold in compiling full security. Examine zero-knowledge constraints and protocols, key features, implementation details, and performance metrics. Gain valuable insights into this innovative cryptographic technique that addresses challenges in distributed RSA key generation.
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority
Overview
Syllabus
Introduction
RSA Models
verifiable delay functions
goal
decider
protocol blueprint
Bonnet Franklin framework
Diogenes protocol
Implementing secure multiplication
Compile full security
The coordinator
The threshold
Zero knowledge constraints
Zero knowledge protocol
Features
Implementation
Performance
Summary
Taught by
IEEE Symposium on Security and Privacy
