Explore a cutting-edge cryptography research paper presented at Eurocrypt 2020 examining which languages possess 4-round fully black-box zero-knowledge arguments derived from one-way functions. Delve into the work of Carmit Hazay, Rafael Pass, and Muthuramakrishnan Venkitasubramaniam as they investigate this complex topic in a 31-minute conference talk. Gain insights into advanced cryptographic concepts and their implications for secure communication systems.
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions
Overview
Syllabus
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?
Taught by
TheIACR
Related Courses
-
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
-
Constant-Round Arguments from One-Way Functions
-
Statistical Concurrent Non-Malleable Zero Knowledge from One-Way Functions
-
Four Round Concurrent Non Malleable Commitments from One Way Functions
-
Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits
-
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance
