Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Micali, Silvio"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rational proofs
Pablo Daniel Azar
,
Silvio Micali
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 1017-1028
A new approach to auctions and resilient mechanism design
Jing Chen
,
Silvio Micali
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 503-512
Independent zero-knowledge sets
Rosario Gennaro
,
Silvio Micali
Lecture Notes in Computer Science
4052
, 2006, pp. 34-45
Local zero knowledge
Silvio Micali
,
Rafael Pass
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 306-315
Collusion-free protocols
Matt Lepinksi
,
Silvio Micali
,
Abhi Shelat
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 543-552
Resettable zero-knowledge
Ran Canetti
,
Oded Goldreich
,
Shafi Goldwasser
,
Silvio Micali
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 235-244
Reducibility and completeness in private computations
Joe Kilian
,
Eyal Kushilevitz
,
Silvio Micali
,
Rafail Ostrovsky
SIAM Journal on Computing
29
(4), 2000, pp. 1189-1208
Computationally sound proofs
Silvio Micali
SIAM Journal on Computing
30
(4), 2000, pp. 1253-1298
Computationally-sound checkers
Silvio Micali
Lecture Notes in Computer Science
1450
, 1998, pp. 94-116
An optimal probabilistic protocol for synchronous Byzantine agreement
Pesech Feldman
,
Silvio Micali
SIAM Journal on Computing
26
(4), 1997, pp. 873-933
Reducibility and completeness in multi-party private computations
Eyal Kushilevitz
,
Silvio Micali
,
Rafail Ostrovsky
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 478-489
CS (computationally-sound) proofs
Silvio Micali
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 436-453
Noninteractive zero-knowledge
Manuel Blum
,
Alfredo de Santis
,
Silvio Micali
,
Giuseppe Persiano
SIAM Journal on Computing
20
(6), 1991, December, pp. 1084-1118
Randomization in Byzantine agreement
Benny Chor
,
Cynthia Dwork
Advances in Computing Research
5
, 1989, pp. 443-497
The knowledge complexity of interactive proof systems
Shafi Goldwasser
,
Silvio Micali
,
Charles Rackoff
SIAM Journal on Computing
18
(1), 1989, February, pp. 186-208
How to sign given any trapdoor function
Mihir Bellare
,
Silvio Micali
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 32-42
Non-interactive zero-knowledge and its applications
Manuel Blum
,
Paul Feldman
,
Silvio Micali
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 103-112
Optimal algorithms for Byzantine agreement
Paul Feldman
,
Silvio Micali
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 148-161
An
O(EV\log V)
algorithm for finding a maximal weighted matching in general graphs
Zvi Galil
,
Silvio Micali
,
Harold Gabow
Technical Report (CUCS-100-84), 1984, February