Reading the Crypto Classics

Organizer: Shan Chen, TU Darmstadt, Cryptoplexity Group

Abstract

This talk is the second one in the seminar series “Reading the Crypto Classics” for the very special summer term 2022. The idea of this seminar is to jointly read classical milestone papers in the area of cryptography, to discuss their impact and understand their relevance for current research areas. The seminar is running as an Oberseminar, but at the same time meant to be a joint reading group seminar of the CROSSING Special Interest Group on Advanced Cryptography with all interested CROSSING members being invited to participate.

This issue will cover the paper/talk

Ben-Or, Goldreich, Goldwasser, Håstad, Kilian, Micali and Rogaway: “Everything Provable is Provable in Zero-Knowledge” (CRYPTO 1988) available at https://dl.acm.org/doi/pdf/10.5555/88314.88333 with the following abstract:

“Assuming the existence of a secure probabilistic encryption scheme, we show that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof. This result extends the result of Goldreich, Micali and Wigderson, that, under the same assumption, all of NP admits zero-knowledge interactive proofs. Assuming envelopes for bit commitment, we show that every language that admits an interactive proof admits a perfect zero-knowledge interactive proof.”

Further information on the virtual format

For participation the following meeting link is required:
https://tu-darmstadt.zoom.us/j/86701175893?pwd=cVRiRTB3azVVMDZpOVFKTmczT0U1Zz09

More information

CROSSING Wiki