#### Filter Results:

- Full text PDF available (137)

#### Publication Year

1982

2017

- This year (5)
- Last 5 years (42)
- Last 10 years (74)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

- Michael Ben-Or, Shafi Goldwasser, Avi Wigderson
- STOC
- 1988

Every function of <italic>n</italic> inputs can be efficiently computed by a complete network of <italic>n</italic> processors in such a way that:<list><item>If no faults occur, no set of size <italic>t</italic> < <italic>n</italic>/2 of players gets any additional information (other than the function value),
</item><item>Even if Byzantine faults are… (More)

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

Shafi Goldwasser∗∗ Silvio Micali∗∗ Ronald L. Rivest ∗∗ Abstract We present a digital signature scheme based on the computational difficulty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice (where each message may be… (More)

- 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)

- Oded Goldreich, Shafi Goldwasser, Dana Ron
- FOCS
- 1996

In this paper, we consider the question of determining whether a function <italic>f</italic> has property P or is ε-far from any function with property P. A <italic>property testing</italic> algorithm is given a sample of the value of <italic>f</italic> on instances drawn according to some distribution. In some cases, it is also allowed to query… (More)

Recent developments have transformed cryptography from a semi-scientific discipline to a respectable field in theoretical Computer Science. In particular, concepts such as polynomialindistinghuishability, pseudorandomness and zero-knowledge interactive proofs were introduced and classical notions as secure encryption and unforgeable signatures were placed… (More)

- Oded Goldreich, Shafi Goldwasser, Shai Halevi
- IACR Cryptology ePrint Archive
- 1996

We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the conjectured computational difficulty of lattice-reduction problems, providing a possible alternative to existing public-key encryption algorithms and digital signatures such as RSA… (More)

This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the “memory attack”, was proposed recently. In this attack, a significant fraction of the bits of a secret key of a cryptographic algorithm can be measured by an adversary if the secret… (More)

- Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum
- J. ACM
- 2008

In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial time or, in other words, a “muggle”.1 The verifier should be super-efficient and run in nearly linear time. These proof systems can be used for delegating computation: a server can run a computation for a client and… (More)