Silvio Micali
Micali, Silvio
Micali, Silvio 1954-
Silvio Micali Italian-American computer scientist
מיקאלי, סילביו
VIAF ID: 72965772 (Personal)
Permalink: http://viaf.org/viaf/72965772
Preferred Forms
-
-
100 1 _ ‡a Micali, Silvio
-
-
-
-
100 1 _ ‡a מיקאלי, סילביו
4xx's: Alternate Name Forms (24)
5xx's: Related Names (3)
- 551 _ _
‡a
Cambridge, Mass.
‡4
ortw
‡4
https://d-nb.info/standards/elementset/gnd#placeOfActivity
- 510 2 _
‡a
Massachusetts Institute of Technology
‡4
affi
‡4
https://d-nb.info/standards/elementset/gnd#affiliation
‡e
Affiliation
- 551 _ _
‡a
Palermo
‡4
ortg
‡4
https://d-nb.info/standards/elementset/gnd#placeOfBirth
Works
| Title | Sources |
|---|---|
| Algorand Agreement Super Fast and Partition Resilient Byzantine Agreement |
|
| Algorand: Scaling Byzantine Agreements For Cryptocurrencies |
|
| Computationally Private Information Retrieval with Polylogarithmic Communication |
|
| A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks |
|
| Everything Provable is Provable in Zero-Knowledge |
|
| How to construct random functions |
|
| 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 |
|
| Improving the exact security of digital signature schemes |
|
| The knowledge complexity of interactive proof systems |
|
| Non-interactive zero-knowledge and its applications |
|
| The Notion of Security for Probabilistic Cryptosystems |
|
| An O(v|v| c |E|) algoithm for finding maximum matching in general graphs |
|
| On-line/off-line digital signatures |
|
| On the Cryptographic Applications of Random Functions (Extended Abstract) |
|
| An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement |
|
| Probabilistic encryption & how to play mental poker keeping secret all partial information |
|
| Il procedimento per ingiunzione e per convalida di sfratto. Commento teorico-pratico per articoli al R.D. 7-8-1936 n. 1531. |
|
| Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems |
|
| Randomness versus hardness, 1983 |
|
| Sparse sign-consistent Johnson-Lindenstrauss matrices: compression with neuroscience-based constraints |
|
| Verifiable secret sharing and achieving simultaneity in the presence of faults |
|