Главная
Study mode:
on
1
Intro
2
Public Key Encryption (PKE)
3
Possible answers
4
Honest-Verifier Statistical Zero Knowledge
5
Example: Quadratic Non-Residuosity
6
Our Results: These Properties are Sufficient!
7
Instantiations
8
Perspective: Relaxing the Assumption
9
Characterization
10
Summary
11
Warmup: 2-Msg, Deterministic Prover
12
Weak Key Agreement
13
Claim: Weak Security
14
Coping with Randomized Provers
Description:
Explore a comprehensive presentation from Crypto 2018 on the connection between laconic zero-knowledge proofs and public key cryptography. Delve into topics such as Public Key Encryption (PKE), Honest-Verifier Statistical Zero Knowledge, and Quadratic Non-Residuosity. Learn about the sufficiency of certain properties, instantiations, and the relaxation of assumptions. Examine the characterization of these concepts, and investigate weak key agreement and security claims. Gain insights into coping with randomized provers and understand the progression from 2-message deterministic provers to more complex scenarios.

From Laconic Zero Knowledge to Public Key Cryptography

TheIACR
Add to list