Linked e-resources
Details
Table of Contents
Intro
Preface
Organization
Contents
Part II
Multi-party Computation
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election
1 Introduction
1.1 Leader Election: Another Formulation of Multi-party Coin Toss
1.2 Our Results and Contributions
1.3 Motivating Applications and Scope of Our Work
2 Technical Overview
2.1 Leader Election Protocol
2.2 Non-sequential Approximate Fairness
2.3 A Strawman Scheme
2.4 Warmup: A Game Theoretically Fair, RO-Based Protocol
2.5 Final Construction: Removing the Random Oracle
3 Defining Sequential Approximate Fairness
3.1 Sequential Approximate Fairness
3.2 Fairness of the Tournament Tree Protocol
4 Formal Description of Our Scheme
4.1 Description of Our Scheme Assuming Idealized Cryptography
4.2 Instantiating the Scheme with Real-World Cryptography
5 Proofs for the Ideal-World Protocol
5.1 Bounding the Preliminary Committee's Size
5.2 Terminology and Notations
5.3 Composition of the Final Committee
5.4 Maximin Fairness
References
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
1 Introduction
1.1 Our Contribution
1.2 Prior Works
1.3 Technical Overview
2 Preliminaries
3 Fair Coin-Tossing Protocol in the f-hybrid Model
4 Proof of Theorem 3
4.1 Properties of Functionalities
4.2 Notations and the Technical Theorem
4.3 Inductive Proof of Theorem 4
5 Black-Box Uses of Public-Key Encryption is Useless for Optimal Fair Coin-Tossing
5.1 Public-Key Encrytion Oracles
5.2 Our Results
5.3 Reduction from PKE Oracle to Image Testable Random Oracle
5.4 Extending the Proof of ch2C:MajWan20 to Image Testable Random Oracle
6 Open Problems
References
YOSO: You Only Speak Once
1 Introduction
1.1 The YOSO Model
1.2 MPC in the YOSO Model
1.3 Related Work
2 YOSO for the Working Cryptographer
2.1 YOSO Wrappers
2.2 Random Corruptions
2.3 YOSO Security
2.4 Common Features, Functionalities, and Models
3 The Information-Theoretic t 3.1 Information Theoretic and Homomorphic MAC
3.2 Future Broadcast
3.3 Homomorphic IT-SIG
3.4 Distributed Commitment (DC)
3.5 Duplicate DC
3.6 Verifiable Secret Sharing Scheme
3.7 Duplicate VSS
3.8 Augmented VSS
3.9 Duplicate AugVSS
3.10 Proof of Local Multiplication (PLM)
3.11 YOSO MPC
References
Fluid MPC: Secure Multiparty Computation with Dynamic Participants
1 Introduction
1.1 Our Contributions
1.2 Related Work
2 Technical Overview
3 Fluid MPC
3.1 Modeling Dynamic Computation
3.2 Committees
3.3 Security
4 Results in Full Version of the Paper
References
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration
1 Introduction
1.1 Complete Channels
1.2 Our Results
1.3 Why Base on One-Way Noisy Communication?
Preface
Organization
Contents
Part II
Multi-party Computation
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election
1 Introduction
1.1 Leader Election: Another Formulation of Multi-party Coin Toss
1.2 Our Results and Contributions
1.3 Motivating Applications and Scope of Our Work
2 Technical Overview
2.1 Leader Election Protocol
2.2 Non-sequential Approximate Fairness
2.3 A Strawman Scheme
2.4 Warmup: A Game Theoretically Fair, RO-Based Protocol
2.5 Final Construction: Removing the Random Oracle
3 Defining Sequential Approximate Fairness
3.1 Sequential Approximate Fairness
3.2 Fairness of the Tournament Tree Protocol
4 Formal Description of Our Scheme
4.1 Description of Our Scheme Assuming Idealized Cryptography
4.2 Instantiating the Scheme with Real-World Cryptography
5 Proofs for the Ideal-World Protocol
5.1 Bounding the Preliminary Committee's Size
5.2 Terminology and Notations
5.3 Composition of the Final Committee
5.4 Maximin Fairness
References
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
1 Introduction
1.1 Our Contribution
1.2 Prior Works
1.3 Technical Overview
2 Preliminaries
3 Fair Coin-Tossing Protocol in the f-hybrid Model
4 Proof of Theorem 3
4.1 Properties of Functionalities
4.2 Notations and the Technical Theorem
4.3 Inductive Proof of Theorem 4
5 Black-Box Uses of Public-Key Encryption is Useless for Optimal Fair Coin-Tossing
5.1 Public-Key Encrytion Oracles
5.2 Our Results
5.3 Reduction from PKE Oracle to Image Testable Random Oracle
5.4 Extending the Proof of ch2C:MajWan20 to Image Testable Random Oracle
6 Open Problems
References
YOSO: You Only Speak Once
1 Introduction
1.1 The YOSO Model
1.2 MPC in the YOSO Model
1.3 Related Work
2 YOSO for the Working Cryptographer
2.1 YOSO Wrappers
2.2 Random Corruptions
2.3 YOSO Security
2.4 Common Features, Functionalities, and Models
3 The Information-Theoretic t
3.2 Future Broadcast
3.3 Homomorphic IT-SIG
3.4 Distributed Commitment (DC)
3.5 Duplicate DC
3.6 Verifiable Secret Sharing Scheme
3.7 Duplicate VSS
3.8 Augmented VSS
3.9 Duplicate AugVSS
3.10 Proof of Local Multiplication (PLM)
3.11 YOSO MPC
References
Fluid MPC: Secure Multiparty Computation with Dynamic Participants
1 Introduction
1.1 Our Contributions
1.2 Related Work
2 Technical Overview
3 Fluid MPC
3.1 Modeling Dynamic Computation
3.2 Committees
3.3 Security
4 Results in Full Version of the Paper
References
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration
1 Introduction
1.1 Complete Channels
1.2 Our Results
1.3 Why Base on One-Way Noisy Communication?