#### Filter Results:

- Full text PDF available (161)

#### Publication Year

1980

2017

- This year (5)
- Last 5 years (49)
- Last 10 years (94)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Shafi Goldwasser, Silvio Micali
- J. Comput. Syst. Sci.
- 1984

A new probabilistic model of data encryption is introduced. For this model, under suitable complexity assumptions, it is proved that extracting any information about the cleartext from the cyphertext is hard on the average for an adversary with polynomially bounded computational resources. The proof holds for any message space with any probability… (More)

- Oded Goldreich, Silvio Micali, Avi Wigderson
- STOC
- 1987

We present a polynomial-time algorithm that, given as a input the description of a game with <italic>incomplete information and any number of players</italic>, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Our algorithm automatically solves all the multi-party protocol problems… (More)

- Shafi Goldwasser, Silvio Micali, Ronald L. Rivest
- SIAM J. Comput.
- 1988

We present a digital signature scheme based on the computational difficulty of integer

- Oded Goldreich, Shafi Goldwasser, Silvio Micali
- J. ACM
- 1986

A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented. This generator is a deterministic polynomial-time algorithm that transforms pairs (<italic>g</italic>, <italic>r</italic>), where <italic>g</italic> is <italic>any</italic> one-way function and… (More)

- Shafi Goldwasser, Silvio Micali, Charles Rackoff
- SIAM J. Comput.
- 1989

Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian. In this paper a computational complexity theory of the… (More)

- Manuel Blum, Silvio Micali
- 23rd Annual Symposium on Foundations of Computer…
- 1982

Much effort has been devoted in the second half of this century to make precise the notion of Randomness. Let us informally recall one of these definitions due to Kolmogorov []. A sequence of bits A =all a2••.•• at is random if the length of the minimal program outputting A is at least k We remark that the above definition is highly non constructive and… (More)

- Christian Cachin, Silvio Micali, Markus Stadler
- EUROCRYPT
- 1999

We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable intractability assumption, which we call the Φ-Hiding Assumption (ΦHA): essentially the difficulty of deciding whether a small prime divides φ(m), where m is a composite integer… (More)

- Manuel Blum, Paul Feldman, Silvio Micali
- STOC
- 1988

We show that interaction in <italic>any</italic> zero-knowledge proof can be replaced by sharing a common, short, random string. We use this result to construct the <italic>first</italic> public-key cryptosystem secure against chosen ciphertext attack.

- Shafi Goldwasser, Silvio Micali
- STOC
- 1982

This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text.
Any implementation of a Public Key Cryptosystem, as proposed by Diffie and Hellman in [8], should possess this property.
Our Encryption Scheme… (More)

- Silvio Micali, Vijay V. Vazirani
- 21st Annual Symposium on Foundations of Computer…
- 1980

In this paper we present an 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs. This algorithm works in 'phases'. In each phase a maximal set of disjoint minimum length augmenting paths is found, and the existing matching is increased along these paths. Our contribution consists in devising a special way of handling blossoms,… (More)