List of works - Silvio Micali

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

article published in 1988

Algorand Agreement Super Fast and Partition Resilient Byzantine Agreement

document published in 2018

Algorand: Scaling Byzantine Agreements For Cryptocurrencies ⬇️

manuscript published in 2017

An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

scientific article (publication date: October 1980)

An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

Computationally Private Information Retrieval with Polylogarithmic Communication

article by Christian Cachin et al published 1999 in Lecture Notes in Computer Science

Everything Provable is Provable in Zero-Knowledge

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design ⬇️

Extended Abstract

How to construct random functions

scientific article (publication date: 10 August 1986)

Improving the exact security of digital signature schemes

scientific article published in 2002

Non-Interactive Zero-Knowledge Proof Systems ⬇️

scientific article

Non-interactive zero-knowledge and its applications

scientific article

Noninteractive Zero-Knowledge

On the Cryptographic Applications of Random Functions (Extended Abstract)

On-line/off-line digital signatures

Probabilistic encryption

scientific article (publication date: April 1984)

Probabilistic encryption & how to play mental poker keeping secret all partial information ⬇️

scientific article

Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems

scientific article

List of works by Silvio Micali

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

Algorand Agreement Super Fast and Partition Resilient Byzantine Agreement

Algorand: Scaling Byzantine Agreements For Cryptocurrencies ⬇️

An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

Computationally Private Information Retrieval with Polylogarithmic Communication

Everything Provable is Provable in Zero-Knowledge

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design ⬇️

How to construct random functions

Improving the exact security of digital signature schemes

Non-Interactive Zero-Knowledge Proof Systems ⬇️

Non-interactive zero-knowledge and its applications

Noninteractive Zero-Knowledge

On the Cryptographic Applications of Random Functions (Extended Abstract)

On-line/off-line digital signatures

Probabilistic encryption

Probabilistic encryption & how to play mental poker keeping secret all partial information ⬇️

Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Sparse sign-consistent Johnson-Lindenstrauss matrices: compression with neuroscience-based constraints ⬇️

The Notion of Security for Probabilistic Cryptosystems

The knowledge complexity of interactive proof systems ⬇️

Verifiable secret sharing and achieving simultaneity in the presence of faults