#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1962

2014

- This year (0)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

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

- Shimon Even, Oded Goldreich, Abraham Lempel
- CRYPTO
- 1982

Randomized protocols for signing contracts, certified mail, and flipping a coin are presented. The protocols use a 1-out-of-2 oblivious transfer subprotocol which is axiomatically defined.
The 1-out-of-2 oblivious transfer allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart. The first (second) secret is… (More)

- Reuven Bar-Yehuda, Shimon Even
- J. Algorithms
- 1981

- Shimon Even, Robert E. Tarjan
- SIAM J. Comput.
- 1975

- Shimon Even, Yishay Mansour
- Journal of Cryptology
- 1991

We suggest a scheme for a block cipher which uses only one randomly chosen permutation,F. The key, consisting of two blocks,K 1 andK 2, is used in the following way. The message block is XORed withK 1 before applyingF, and the outcome is XORed withK 2, to produce the cryptogram block. We show that the resulting cipher is secure (when the permutation is… (More)

- Shimon Even, Oded Goldreich, Silvio Micali
- Journal of Cryptology
- 1996

A new type of signature scheme is proposed. It consists of two phases. The first phase is performed off-line, before the message to be signed is even known. The second phase is performed on-line, once the message to be signed is known, and is supposed to be very fast. A method for constructing such on-line/off-line signature schemes is presented. The method… (More)

- Shimon Even, Yossi Shiloach
- J. ACM
- 1981

There is given an undirected graph G -(V, E) from which edges are deleted one at a time and about which questions of the type, "Are the vertices u and v in the same connected component?" have to be answered "on-line." There is presented an algorithm which maintains a data structure in which each question is answered in constant time and for which the total… (More)

- F. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli
- J. Comput. Syst. Sci.
- 1971

Diverse graph structure models for concurrent processing systems have been suggested and used. The structures differ in generality and scope according to the properties one wishes to model and analyze. In this paper we solve a problem of maximal storage requirements for a simple flowchart model called the Marked Graph Model. Marked Graphs can be derived as… (More)

- Shimon Even, Robert E. Tarjan
- Theor. Comput. Sci.
- 1976

- Shimon Even, Alan L. Selman, Yacov Yacobi
- Information and Control
- 1984