• 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
  • 3,106
  • 149
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 toExpand
  • 520
  • 76
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 inExpand
  • 964
  • 71
Untraceable Electronic Cash
  • 805
  • 56
Tracing traitors
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 payExpand
  • 487
  • 31
Optimal Search and One-Way Trading Online Algorithms
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 sequenceExpand
  • 137
  • 30
Correlation clustering in general weighted graphs
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
  • 225
  • 27
Highway dimension, shortest paths, and provably efficient algorithms
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 veryExpand
  • 212
  • 27
On-line routing of virtual circuits with applications to load balancing and machine scheduling
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 requestsExpand
  • 293
  • 26
Competitive Paging Algorithms
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 forExpand
  • 374
  • 25