Linked e-resources
Details
Table of Contents
Intro
Preface
Organization
Contents
Part III
Models
A Rational Protocol Treatment of 51% Attacks
1 Introduction
1.1 Related Literature
1.2 Our Results
2 Preliminaries
2.1 The Bitcoin Backbone Protocol
2.2 Rational Protocol Design
2.3 Utility of the Attacker From ch1EC:BGMTZ18
3 Artifacts of Unbounded Incentives
3.1 Demonstrating the Artifact
3.2 A First Attempt to Eliminate the Artifact
3.3 The Source of the Artifact: Unbounded Incentives
4 An RPD Analysis of Forks
4.1 Addressing Technical Issue of Non-constant Payoff for Block Rewards
4.2 Optimal Utility of Front-Running, Passive Adversaries
5 Analyzing 51% Attacks
5.1 Time to Fork
5.2 Payoff of 51% Double-Spending Attacks
5.3 Visualizations with Concrete Values
6 Mitigating 51% Attacks
6.1 Budget to Vulnerability Period
6.2 Attack-Payoff Security
References
MoSS: Modular Security Specifications Framework
1 Introduction
2 Execution Process
2.1 ExecAP: An Adversary-Driven Execution Process
2.2 The Extendable Execution Process
2.3 Using X to Define Specification and Entity-Faults Operations
3 Models
3.1 Specifications
3.2 Model-Satisfying Adversary
3.3 Example: The Bounded-Clock-Drift Model M-drift-clk
4 Requirements
4.1 Model-Secure Requirements
4.2 Example: The No False Accusations Requirement R-NFA
4.3 Supporting Confidentiality and Indistinguishability
5 Modularity Lemmas
5.1 Asymptotic Security Model Modularity Lemmas
5.2 Asymptotic Security Requirement Modularity Lemmas
6 Using MoSS for Applied Specifications
6.1 AuthBroadcast: Authenticated Broadcast Protocol
6.2 Specifications for PKI Scheme
7 Concrete Security and Ensuring Polytime Interactions
7.1 The CS Compiler
7.2 Concrete Security
7.3 Ensuring Polytime Interactions
8 Conclusions and Future Work
References
Tight State-Restoration Soundness in the Algebraic Group Model
1 Introduction
1.1 Overview of Our Techniques
2 Preliminaries
3 Interactive Proofs and State-Restoration Soundness
4 Proofs of Knowledge in the AGM
4.1 The Basic Framework
4.2 The Fiat-Shamir Transform
5 Online srs-wee Security of Bulletproofs
5.1 Inner Product Argument InPrd
5.2 Online srs-wee Security of RngPf
5.3 Online srs-wee Security for ACSPf
6 Online srs-wee Security of Sonic
References
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model
1 Introduction
1.1 Streaming Against Adaptive Adversaries
1.2 Our Results
2 Preliminaries
2.1 Adaptive Data Analysis
2.2 Transcript Compressibility
2.3 Pseudorandom Generators in the Bounded Storage Model
3 The Streaming Adaptive Data Analysis (SADA) Problem
4 An Oblivious Algorithm for the SADA Problem
5 An Impossibility Result for Adaptive Streaming
6 A Computational Separation
6.1 The SADA2 Problem
Preface
Organization
Contents
Part III
Models
A Rational Protocol Treatment of 51% Attacks
1 Introduction
1.1 Related Literature
1.2 Our Results
2 Preliminaries
2.1 The Bitcoin Backbone Protocol
2.2 Rational Protocol Design
2.3 Utility of the Attacker From ch1EC:BGMTZ18
3 Artifacts of Unbounded Incentives
3.1 Demonstrating the Artifact
3.2 A First Attempt to Eliminate the Artifact
3.3 The Source of the Artifact: Unbounded Incentives
4 An RPD Analysis of Forks
4.1 Addressing Technical Issue of Non-constant Payoff for Block Rewards
4.2 Optimal Utility of Front-Running, Passive Adversaries
5 Analyzing 51% Attacks
5.1 Time to Fork
5.2 Payoff of 51% Double-Spending Attacks
5.3 Visualizations with Concrete Values
6 Mitigating 51% Attacks
6.1 Budget to Vulnerability Period
6.2 Attack-Payoff Security
References
MoSS: Modular Security Specifications Framework
1 Introduction
2 Execution Process
2.1 ExecAP: An Adversary-Driven Execution Process
2.2 The Extendable Execution Process
2.3 Using X to Define Specification and Entity-Faults Operations
3 Models
3.1 Specifications
3.2 Model-Satisfying Adversary
3.3 Example: The Bounded-Clock-Drift Model M-drift-clk
4 Requirements
4.1 Model-Secure Requirements
4.2 Example: The No False Accusations Requirement R-NFA
4.3 Supporting Confidentiality and Indistinguishability
5 Modularity Lemmas
5.1 Asymptotic Security Model Modularity Lemmas
5.2 Asymptotic Security Requirement Modularity Lemmas
6 Using MoSS for Applied Specifications
6.1 AuthBroadcast: Authenticated Broadcast Protocol
6.2 Specifications for PKI Scheme
7 Concrete Security and Ensuring Polytime Interactions
7.1 The CS Compiler
7.2 Concrete Security
7.3 Ensuring Polytime Interactions
8 Conclusions and Future Work
References
Tight State-Restoration Soundness in the Algebraic Group Model
1 Introduction
1.1 Overview of Our Techniques
2 Preliminaries
3 Interactive Proofs and State-Restoration Soundness
4 Proofs of Knowledge in the AGM
4.1 The Basic Framework
4.2 The Fiat-Shamir Transform
5 Online srs-wee Security of Bulletproofs
5.1 Inner Product Argument InPrd
5.2 Online srs-wee Security of RngPf
5.3 Online srs-wee Security for ACSPf
6 Online srs-wee Security of Sonic
References
Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model
1 Introduction
1.1 Streaming Against Adaptive Adversaries
1.2 Our Results
2 Preliminaries
2.1 Adaptive Data Analysis
2.2 Transcript Compressibility
2.3 Pseudorandom Generators in the Bounded Storage Model
3 The Streaming Adaptive Data Analysis (SADA) Problem
4 An Oblivious Algorithm for the SADA Problem
5 An Impossibility Result for Adaptive Streaming
6 A Computational Separation
6.1 The SADA2 Problem