Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

How to Prove Yourself: Practical Solutions to Identification and Signature Problems

In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys.… Expand

Broadcast Encryption

We introduce new theoretical measures for the qualitative and quantitative assessment of encryption schemes designed for broadcast transmissions. The goal is to allow a central broadcast site to… Expand

Zero-knowledge proofs of identity

In this paper we extend the notion of interactive proofs of assertions to interactive proofs of knowledge. This leads to the definition of unrestricted input zero-knowledge proofs of knowledge in… Expand

Tracing traitors

- B. Chor, A. Fiat, M. Naor, Benny Pinkas
- Computer Science
- IEEE Trans. Inf. Theory
- 21 August 1994

We give cryptographic schemes that help trace the source of leaks when sensitive or proprietary data is made available to a large set of parties. A very relevant application is in the context of pay… Expand

Optimal Search and One-Way Trading Online Algorithms

- Ran El-Yaniv, A. Fiat, R. Karp, G. Turpin
- Computer Science, Mathematics
- Algorithmica
- 1 May 2001

Abstract. This paper is concerned with the time series search and one-way trading problems. In the (time series) search problem a player is searching for the maximum (or minimum) price in a sequence… Expand

Correlation clustering in general weighted graphs

- E. Demaine, D. Emanuel, A. Fiat, N. Immorlica
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 1 September 2006

We consider the following general correlation-clustering problem [N. Bansal, A. Blum, S. Chawla, Correlation clustering, in: Proc. 43rd Annu. IEEE Symp. on Foundations of Computer Science, Vancouver,… Expand

Highway dimension, shortest paths, and provably efficient algorithms

- I. Abraham, A. Fiat, A. Goldberg, Renato F. Werneck
- Computer Science
- SODA '10
- 17 January 2010

Computing driving directions has motivated many shortest path heuristics that answer queries on continental scale networks, with tens of millions of intersections, literally instantly, and with very… Expand

On-line routing of virtual circuits with applications to load balancing and machine scheduling

- J. Aspnes, Y. Azar, A. Fiat, Serge A. Plotkin, Orli Waarts
- Computer Science
- JACM
- 1 May 1997

In this paper we study the problem of on-line allocation of routes to virtual circuits (both <italic>point-to-point</italic> and <italic>multicast</italic>) where the goal is to route all requests… Expand

Competitive Paging Algorithms

- A. Fiat, R. Karp, M. Luby, L. A. McGeoch, D. Sleator, N. Young
- Computer Science
- J. Algorithms
- 1 December 1991

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for… Expand