More efficient techniques for adaptively-secure cryptography / David Niehues, M.Sc. Wuppertal, September 28, 2021
Inhalt
- Acronyms
- Introduction
- Preliminaries
- Notation
- Computational Model
- Cryptographic Primitives
- Complexity Assumptions
- Sequence of Games Arguments
- Partitioning Arguments for Adaptive Security
- Efficient Verifiable Random Functions
- Motivation and Overview
- Admissible Hash Functions and their Limitations
- Defining Admissible Hash Functions
- Instantiating Admissible Hash Functions
- Efficiency Bounds for Admissible Hash Functions from Coding Theory
- Verifiable Random Functions from Computational Admissible Hash Functions
- Computational Admissible Hash Functions from Truncation Collision Resistance
- Verifiable Random Functions from Computational Admissible Hash Functions
- More Efficient Verifiable Random Functions from Blockwise Partitioning
- Blockwise Partitioning via Near-Collision Resistance
- Verifiable Random Functions from Blockwise Partitioning
- Comparison of VRF Instantiations
- Conclusion and Discussion
- Verifiable Random Functions with Optimal Tightness
- Motivation
- Technical Overview
- Impossibility of VUFs and VRFs with Tight Reductions
- Achieving Optimal Tightness for Verifiable Random Functions
- Conclusion and Open Problems
- Efficient Identity-Based Key-Encapsulation Schemes from Lattices
- Motivation and Overview
- Balanced Programmable Hash Functions for Lattices
- Balanced Programmable Hash Functions from Blockwise Partitioning
- Hash Functions with Exponential Collision Resistance
- Concrete Exponential Hardness of SIS
- Constructing ECR Hash Functions from eSIS
- Instantiating Multiple ECR Hash Functions in Parallel
- Constant-Size Balanced PHFs
- Balanced Programmable Hash Functions with Small-Norm Trapdoors
- Efficient Lattice-Based Identity-Based Key-Encapsulation
- Conclusion and Open Questions
- Bibliography
- The Program Used to find Parameters of BCH Codes