Explore advanced cryptographic concepts in this 26-minute conference talk that delves into the construction of Universal One-Way Hash Functions (UOWHFs) from regular one-way functions. Learn about the latest developments in achieving near-optimal constructions and their implications for cryptographic security. Gain insights into the theoretical foundations and practical applications of these advanced hash functions, and discover how they extend beyond traditional one-way functions.
Almost Optimal Constructions of UOWHFs from 1 to 1, Regular One Way Functions and Beyond
Overview
Syllabus
Almost Optimal Constructions of UOWHFs from 1 to 1, Regular One way Functions and Beyond
Taught by
TheIACR
Related Courses
-
Statistical Concurrent Non-Malleable Zero Knowledge from One-Way Functions
-
Four Round Concurrent Non Malleable Commitments from One Way Functions
-
Hardness of Non Interactive Differential Privacy from One Way Functions and Risky Traitor Tracing
-
The Curious Case of Non-Interactive Commitments
-
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions
-
Constant Round Asynchronous Multi Party Computation Based on One Way Functions
