Главная
Study mode:
on
1
Introduction
2
RSA Models
3
verifiable delay functions
4
goal
5
decider
6
protocol blueprint
7
Bonnet Franklin framework
8
Diogenes protocol
9
Implementing secure multiplication
10
Compile full security
11
The coordinator
12
The threshold
13
Zero knowledge constraints
14
Zero knowledge protocol
15
Features
16
Implementation
17
Performance
18
Summary
Description:
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

IEEE
Add to list