WorldCat Identities

Micali, Silvio

Overview
Works: 21 works in 38 publications in 2 languages and 94 library holdings
Roles: Author
Classifications: QA274, 350
Publication Timeline
.
Most widely held works by Silvio Micali
Randomness and computation( Book )

4 editions published in 1989 in English and held by 36 WorldCat member libraries worldwide

An optimal algorithm for synchronous Byzantine agreement by Paul Feldman( Book )

5 editions published in 1990 in English and held by 11 WorldCat member libraries worldwide

An autoimmune mechanism for AIDS' T4 lymphopenia by Silvio Micali( Book )

4 editions published in 1991 in English and held by 8 WorldCat member libraries worldwide

Abstract: "We put forward a new model for the T4 lymphopenia occurring in AIDS. In essence, we present a mechanism whose net effect is blocking the generation of T4 cells during HIV infection. Supporting evidence for our mechanism is derived from experiments in the recent literature."
How to sign given any trapdoor permutation by Mihir Bellare( Book )

3 editions published in 1990 in English and held by 7 WorldCat member libraries worldwide

Randomness versus hardness by Silvio Micali( )

2 editions published in 1983 in English and held by 5 WorldCat member libraries worldwide

Secure computation : preliminaty report by Silvio Micali( Book )

1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide

Compendio di diritto amministrativo by Silvio Micali( Book )

3 editions published in 1941 in Italian and held by 3 WorldCat member libraries worldwide

Universal boolean judges and their characterization by Eyal Kushilevitz( Book )

1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide

Abstract: "We consider the classic problem of n honest (but curious) players will private inputs x₁ ..., x[subscript n] who wish to compute the value of some pre-determined function f(x₁ ..., x[subscript n]), so that at the end of the protocol every player knows the value of f(x₁ ..., x[subscript n]). The players have unbounded computational resources and they wish to compute f in a totally private (n-private) way. That is, after the completion of the protocol, which all players honestly follow, no coalition (of arbitrary size) can infer any information about the private inputs of the remaining players above of what is already been revealed by the value of f(x₁ ..., x[subscript n]). Of course, with the help of a trusted judge for computing f, players can trivially compute f in a totally private manner: every player secretly gives his input to the trusted judge and she announces the result. Previous research was directed towards implementing such a judge 'mentally' by the players themselves, and was shown possible under various assumptions. Without assumptions, however, it was shown that most functions can not be computed in a totally private manner and thus we must rely on a trusted judge. If we have a trusted judge for f we are done. Can we use a judge for a 'simpler' function g in order to compute f n-privately? In this paper we initiate the study of the complexity of such judges needed to achieve total privacy for arbitrary f. We answer the following two questions: How complicated such a judge should be, compared to f? and Does there exists [sic] some judge which can be used for all f? We show that there exists universal boolean judges (i.e. the ones that can be used for any f) and give a complete characterization of all the boolean functions which describe universal judges. In fact, we show, that a judge computing any boolean function g which itself cannot be computed n-privately (i.e., when there is no judge available) is universal. Thus, we show that for all boolean functions, the notions of universality and n-privacy are complimentary. On the other hand, for non-boolean functions, we show that this [sic] two notions are not complimentary. Our result can be viewed as a strong generalization of the two-party case, where Oblivious Transfer protocols were shown to be universal."
Tavole di Diritto Romano by Silvio Micali( Book )

2 editions published in 1941 in Italian and held by 3 WorldCat member libraries worldwide

Any non-private boolean function is complete for private multi- party computations by Eyal Kushilevitz( Book )

2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide

Abstract: "Let g be an n-argument boolean function. Suppose we are given a black-box for g, to which n honest-but-curious players can secretly give inputs and it broadcasts the result of operating g on all these inputs to all the players. We say that g is complete (for multi- party private computations) if for every function f, the n players can compute the function f n-privately, given the black-box for g. In this paper, we characterize the boolean functions which are complete: we show that a boolean function g is complete if and only if g itself cannot be computed n-privately (when there is no black-box available). Namely, for boolean functions, the notions of completeness and n-privacy are complementary. On the other hand, for non-boolean functions, we show that this [sic] two notions are not complementary. Our result can be viewed as a generalization (for multi-party protocols and for (n [> or =] 2)-argument functions) of the two-party case, where it was known that two-argument functions which contain 'embedded-OR' are complete."
Il procedimento per ingiunzione e per convalida di sfratto : commento teorico-pratico per articoli al R.D. 7-8-1936 n. 1531 by Silvio Micali( Book )

1 edition published in 1937 in Italian and held by 2 WorldCat member libraries worldwide

An optimal probabilistic protocol for synchronous Byzantine agreement by Paul Neil Feldman( Book )

1 edition published in 1992 in English and held by 1 WorldCat member library worldwide

ADVANCED IN COMPUTING RESEARCH: RANDOMNESS AND COMPUTATION - Vol. 5, 1989 by Silvio Micali( Book )

1 edition published in 1989 in Italian and held by 1 WorldCat member library worldwide

CS proofs by Massachusetts Institute of Technology( Book )

1 edition published in 1994 in English and held by 1 WorldCat member library worldwide

Perfect implementation by Sergei Izmalkov( )

1 edition published in 2010 in English and held by 1 WorldCat member library worldwide

Enhanced certificate revocation system by Massachusetts Institute of Technology( Book )

1 edition published in 1995 in English and held by 1 WorldCat member library worldwide

From scratch to Byzantine agreement in constant expected time by Paul Neil Feldman( Book )

1 edition published in 1988 in English and held by 1 WorldCat member library worldwide

A bit by bit secure public-key cryptosystem by S Goldwasser( Book )

1 edition published in 1981 in English and held by 1 WorldCat member library worldwide

Efficient, perfect polynomial random number generators by Silvio Micali( )

1 edition published in 1991 in English and held by 1 WorldCat member library worldwide

Shafi Goldwasser Silvio Micali ACM's A. M. Turing Award recipients( Book )

1 edition published in 2013 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.78 (from 0.68 for From scrat ... to 0.98 for Il procedi ...)

Alternative Names
Silvio Micali Amerikaans wiskundige

Silvio Micali informaticien italo-américain

Silvio Micali informático italo-estadounidense

Silvio Micali matematico italiano

Silvio Micali US-amerikanischer Informatiker

Микали, Сильвио

Сільвіо Мікалі

סילביו מיקאלי

سيلفيو ميكالي

সিলভিও মিকালি Italian-American computer scientist

シルビオ・ミカリ

希爾維奧·米卡利 Italian-American computer scientist

Languages