de
en
Close
Detailsuche
Bibliotheken
Projekt
Imprint
Privacy Policy
jump to main content
Search Details
Quicksearch:
OK
Result-List
Title
Title
Content
Content
Page
Page
Search the document
Efficient cryptographic constructions with strong security guarantees / Rafael Kurek. Wuppertal, September 2020
Content
Introduction
Preliminaries
Notation
Basic Primitives
Bilinear Pairings
Simple and Efficient PRFs with Tight Security via All-Prefix Universal Hash Functions
Introduction
All-Prefix Universal Hash Functions
First Construction (Almost-Universal)
Second Construction (Universal)
Augmented Cascade PRFs
The Augmented Cascade with Encoded Input
Preparation for the Security Proof
Security Proof
Proof of Lemma 3.6
Proof of Lemma 3.7
Applications
Efficient and Tightly-Secure PRF from Matrix Diffie-Hellman Assumptions
More Efficient LWE-based PRFs
Further Examples of Matrix Distributions
Discussions
Efficient Forward-Secure Threshold Signature and Public-Key Encryption Schemes
Introduction
Thresholds and Key Distribution
Adversary Types in the Threshold Setting.
Communication Model.
A Concrete Distributed Key Generation Protocol
Forward-Secure Signature Schemes
A Concrete Single User Scheme
Hierarchical Identity-Based Encryption Schemes (HIBE)
A Concrete HIBE Scheme
Forward-Secure Threshold Signature Schemes
New Forward-Secure Threshold Signature Scheme
Proof of Correctness.
Proof of Security.
Forward-Secure Threshold PKE Schemes
New Forward-Secure Threshold PKE Scheme
Proof of Correctness.
Proof of Security.
Discussions
Efficient Adaptively-Secure Cryptosystems via Near-Collision Resistance
Introduction
Blockwise Partitioning via Near-Collision Resistance
Blockwise Partitioning.
Blockwise Partitioning Via Near-Collision Resistance.
Adaptively Secure IB-KEM with Short Ciphertexts
Proof of Correctness
Proof of Security
A Digital Signature Scheme
Proof of Correctness
Proof of Security
Discussions
BIBLIOGRAPHY