Linked e-resources
Details
Table of Contents
Intro
Preface
Organization
Contents
Part IV
Zero Knowledge
Witness Authenticating NIZKs and Applications
1 Introduction
1.1 Our Contributions
2 Syntax and Security Models
2.1 Defining Unpredictable Sampler
2.2 Entropic Zero-Knowledgeness
2.3 Soundness Definitions
2.4 Definitions with Auxiliary Inputs
3 Constructing Witness-Authenticating NIZKs
3.1 Warm-up Constructions
3.2 The Full-Fledged Construction for CRS-dependent Distributions
4 Applications
4.1 Non-malleable (Perfectly One-Way) Hash Functions from Standard Assumptions
4.2 Group Signatures with Verifier-Local Revocation with Auxiliary Input
4.3 Plaintext-Checkable Encryption in the Standard Model
References
Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs
1 Introduction
1.1 Our Results
2 Technical Overview
2.1 Black-Box Separation
2.2 Proof-Based One-Way Functions (and PRGs)
2.3 Proof-Based Collision-Resistant Hash Functions
2.4 Supporting Predicates
3 Preliminaries
4 The Impossibility Results
4.1 Meta-functionally Black-Box Constructions
4.2 The Main Theorem
4.3 Proof of Thm. 2
4.4 The Proof Sketch for Claim 5
5 Proof-Based One-Way Functions
5.1 Definition
5.2 Our Construction
5.3 Proof-Based Pseudo-random Generators
6 Proof-Based Collision-Resistant Hash Families
References
Compressing Proofs of k-Out-Of-n Partial Knowledge*-6pt
1 Introduction
1.1 Proofs of Partial Knowledge
1.2 Their Applications
1.3 Our Contributions
1.4 Extensions and Variations
1.5 Comparison with Other Approaches
1.6 Organization of the Paper
2 Preliminaries
2.1 Interactive Proofs
2.2 Multi-exponentiation and the Pedersen Vector Commitment Scheme
3 Proving Group Homomorphism Openings on Multi-exponentiations
3.1 The Standard -protocol for Opening Homomorphisms
3.2 Compression Mechanism
3.3 Compressed -protocol
3.4 Amortization Techniques
4 Proving Partial Knowledge
4.1 Partial Knowledge of DL's
4.2 Partial Knowledge of Commitment Openings
5 Extensions and Generalizations
5.1 Pairing Based Commitments to Reduce the Communication Complexity
5.2 Multi-exponentiations and Vector Commitments
5.3 Plug and Play with Circuit Zero-Knowledge
5.4 General Access Structures
References
A General View on the Compression
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions
1 Introduction
1.1 Our Approach: Mac'n'Cheese
1.2 Our Techniques
2 Interactive Proofs with Linear Oracle Verification
2.1 Definitions
2.2 Instantiating IPs with LOVe Using VOLE
3 Stackable Public Coin IPs with LOVe
3.1 Stacking with LOVe
3.2 Recursive Stacking
4 IPs with LOVe for Circuit Satisfiability
4.1 Defining C & P Protocols
4.2 C & P IP with LOVe for Arithmetic Circuits
4.3 Improved C & P IP with LOVe for Arithmetic Circuits
Preface
Organization
Contents
Part IV
Zero Knowledge
Witness Authenticating NIZKs and Applications
1 Introduction
1.1 Our Contributions
2 Syntax and Security Models
2.1 Defining Unpredictable Sampler
2.2 Entropic Zero-Knowledgeness
2.3 Soundness Definitions
2.4 Definitions with Auxiliary Inputs
3 Constructing Witness-Authenticating NIZKs
3.1 Warm-up Constructions
3.2 The Full-Fledged Construction for CRS-dependent Distributions
4 Applications
4.1 Non-malleable (Perfectly One-Way) Hash Functions from Standard Assumptions
4.2 Group Signatures with Verifier-Local Revocation with Auxiliary Input
4.3 Plaintext-Checkable Encryption in the Standard Model
References
Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs
1 Introduction
1.1 Our Results
2 Technical Overview
2.1 Black-Box Separation
2.2 Proof-Based One-Way Functions (and PRGs)
2.3 Proof-Based Collision-Resistant Hash Functions
2.4 Supporting Predicates
3 Preliminaries
4 The Impossibility Results
4.1 Meta-functionally Black-Box Constructions
4.2 The Main Theorem
4.3 Proof of Thm. 2
4.4 The Proof Sketch for Claim 5
5 Proof-Based One-Way Functions
5.1 Definition
5.2 Our Construction
5.3 Proof-Based Pseudo-random Generators
6 Proof-Based Collision-Resistant Hash Families
References
Compressing Proofs of k-Out-Of-n Partial Knowledge*-6pt
1 Introduction
1.1 Proofs of Partial Knowledge
1.2 Their Applications
1.3 Our Contributions
1.4 Extensions and Variations
1.5 Comparison with Other Approaches
1.6 Organization of the Paper
2 Preliminaries
2.1 Interactive Proofs
2.2 Multi-exponentiation and the Pedersen Vector Commitment Scheme
3 Proving Group Homomorphism Openings on Multi-exponentiations
3.1 The Standard -protocol for Opening Homomorphisms
3.2 Compression Mechanism
3.3 Compressed -protocol
3.4 Amortization Techniques
4 Proving Partial Knowledge
4.1 Partial Knowledge of DL's
4.2 Partial Knowledge of Commitment Openings
5 Extensions and Generalizations
5.1 Pairing Based Commitments to Reduce the Communication Complexity
5.2 Multi-exponentiations and Vector Commitments
5.3 Plug and Play with Circuit Zero-Knowledge
5.4 General Access Structures
References
A General View on the Compression
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions
1 Introduction
1.1 Our Approach: Mac'n'Cheese
1.2 Our Techniques
2 Interactive Proofs with Linear Oracle Verification
2.1 Definitions
2.2 Instantiating IPs with LOVe Using VOLE
3 Stackable Public Coin IPs with LOVe
3.1 Stacking with LOVe
3.2 Recursive Stacking
4 IPs with LOVe for Circuit Satisfiability
4.1 Defining C & P Protocols
4.2 C & P IP with LOVe for Arithmetic Circuits
4.3 Improved C & P IP with LOVe for Arithmetic Circuits