BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Greece
11 × USA
2 × Italy
Collaborated with:
S.Goldwasser P.Feldman M.Bellare O.Goldreich R.Ostrovsky P.D.Azar J.Chen R.Gennaro R.Pass M.Lepinski A.Shelat D.Beaver P.Rogaway M.Blum A.Wigderson C.Rackoff A.C.Yao R.Canetti M.Ben-Or R.L.Rivest
Talks about:
knowledg (7) zero (6) protocol (4) complex (3) probabilist (2) algorithm (2) agreement (2) interact (2) byzantin (2) mental (2)

Person: Silvio Micali

DBLP DBLP: Micali:Silvio

Contributed to:

STOC 20122012
STOC 20092009
ICALP (2) 20062006
STOC 20062006
STOC 20052005
STOC 20002000
STOC 19901990
ICALP 19891989
STOC 19881988
STOC 19871987
ICALP 19851985
STOC 19851985
STOC 19831983
STOC 19821982

Wrote 18 papers:

STOC-2012-AzarM #proving
Rational proofs (PDA, SM), pp. 1017–1028.
STOC-2009-ChenM #approach #design
A new approach to auctions and resilient mechanism design (JC, SM), pp. 503–512.
ICALP-v2-2006-GennaroM #independence #set
Independent Zero-Knowledge Sets (RG, SM), pp. 34–45.
Local zero knowledge (SM, RP), pp. 306–315.
STOC-2005-LepinksiMS #protocol
Collusion-free protocols (ML, SM, AS), pp. 543–552.
Resettable zero-knowledge (RC, OG, SG, SM), pp. 235–244.
STOC-1990-BeaverMR #complexity #protocol
The Round Complexity of Secure Protocols (DB, SM, PR), pp. 503–513.
STOC-1990-BellareMO #constant
Perfect Zero-Knowledge in Constant Rounds (MB, SM, RO), pp. 482–493.
STOC-1990-BellareMO90a #complexity #statistics
The (True) Complexity of Statistical Zero Knowledge (MB, SM, RO), pp. 494–502.
ICALP-1989-FeldmanM #algorithm #probability
An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement (PF, SM), pp. 341–378.
STOC-1988-BellareM #how
How to Sign Given Any Trapdoor Function (MB, SM), pp. 32–42.
Non-Interactive Zero-Knowledge and Its Applications (MB, PF, SM), pp. 103–112.
STOC-1988-FeldmanM #algorithm
Optimal Algorithms for Byzantine Agreement (PF, SM), pp. 148–161.
STOC-1987-GoldreichMW #game studies #how #protocol #theorem
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority (OG, SM, AW), pp. 218–229.
ICALP-1985-Ben-OrGMR #contract #protocol
A Fair Protocol for Signing Contracts (MBO, OG, SM, RLR), pp. 43–52.
STOC-1985-GoldwasserMR #complexity #interactive
The Knowledge Complexity of Interactive Proof-Systems (SG, SM, CR), pp. 291–304.
Strong Signature Schemes (SG, SM, ACCY), pp. 431–439.
STOC-1982-GoldwasserM #encryption #game studies #how #probability
Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information (SG, SM), pp. 365–377.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.