Reading the Crypto Classics
Feige, Lapidot and Shamir: “Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String” (FOCS 1990)
2022/09/20 10:00-11:00
Moderator: Felix Rohrbach (TU Darmstadt, Cryptoplexity Group) | Location: online
Organizer: Christian Janson, TU Darmstadt, Cryptography and Information Security Group
Abstract
This talk is the fourth 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
Feige, Lapidot and Shamir: “Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String” (FOCS 1990) available at https://ieeexplore.ieee.org/document/89549
with the following abstract:
“In this paper we solve the two major open problems associated with non-interactive zero knowledge proofs, as stated by Blum, De Santis, Micali and Persiano: How to enable polynomially many provers to prove in writing polynomially many theorems based on a single random string, and how to construct such proofs under general (rather than number-theoretic) assumptions. Our new constructions can be used in cryptographic applications in which the prover is restricted to polynomial time, and are much simpler than earlier (and less capable) proposals. ”
Further information on the virtual format
For participation the following meeting link is required:
https://tu-darmstadt.zoom.us/j/68052479201?pwd=ZlIreEJYc0VMeEYyQ1QvTzNXamk5dz09
More information
