Accueil
Connexion
DENIF –
Documents d’Enseignement Numériques en Informatique Fondamentale
Thèmes
Cursus
Enseignants
Advanced Topics in Cryptography
Thème :
Cryptographie
–
Cursus :
MIT
Spring 2003
Lecture Notes
Interactive Proofs and Zero-Knowledge Proofs
The Notion of Zero-Knowledgeness
Zero-Knowledge Proofs (cont.)
ZK Proofs and Proofs of Knowledge
ZK Proofs for all of NP
Power and Efficiency of ZK
Variations on ZK
Communication Efficiency for NP Arguments
A Bounded NIZK Proof System for a Special Language
Non-Interactive ZK Proofs for all of NP
Generalizing Non-Interactive Zero-Knowledge Proofs
Improved Non-Interactive Zero-Knowledge
NIZK and the Lunchtime Attack
Lunchtime and Chosen Ciphertext Security
A Practical CCA-2 PK Cryptosystem
Defining ZK Proofs of Knowledge
Mutually Independent Commitments
Concurrent Zero-Knowledge
Concurrent Zero-Knowledge in Polylogarithmic Rounds
Secure Multi-Party Computation in the HBC Model
Compiling an Honest but Curious Protocol
Multi-Party Computation with Perfect Channels