Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
How to Prove Yourself: Practical Solutions to Identification and Signature Problems
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 are described.
Several schemes are presented that allow a center to broadcast a secret to any subset of privileged users out of a universe of size n so that coalitions of k users not in the privileged set cannot learn the secret.
Untraceable Electronic Cash
An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 and receiving from the second party a note including a digital signature.
Zero-knowledge proofs of identity
This paper defines the definition of unrestricted input zero- knowledge proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsoever (not even the one bit revealed in zero-knowledge proofs of assertions).
Correlation clustering in general weighted graphs
- E. Demaine, Dotan Emanuel, A. Fiat, Nicole Immorlica
- Computer Science, MathematicsTheor. Comput. Sci.
- 1 September 2006
An O(log n)-approximation algorithm is given for the general case based on a linear-programming rounding and the "region-growing" technique for Kr, r-minor-free graphs and it is proved that this linear program has a gap of Ω( log n), and therefore the approximation is tight under this approach.
This work gives cryptographic schemes that help trace the source of leaks when sensitive or proprietary data is made available to a large set of parties, in the context of pay television, where only paying customers should be able to view certain programs.
Optimal Search and One-Way Trading Online Algorithms
It is shown that a simple threat-based strategy is optimal and its competitive ratio is determined which yields, for realistic values of the problem parameters, surprisingly low competitive ratios.
Highway dimension, shortest paths, and provably efficient algorithms
- Ittai Abraham, A. Fiat, A. Goldberg, Renato F. Werneck
- Computer Science, MathematicsSODA '10
- 17 January 2010
The notion of highway dimension is introduced and it is shown how low highway dimension gives a unified explanation for several seemingly different algorithms.
On-line routing of virtual circuits with applications to load balancing and machine scheduling
An algorithm is described that achieves on-line allocation of routes to virtual circuits (both point-to-point and multicast) with a constant competitive ratio with respect to maximum congestin, where n is the number of nodes in the network.
Competitive Paging Algorithms
- A. Fiat, R. Karp, M. Luby, L. A. McGeoch, D. Sleator, N. Young
- Computer ScienceJ. Algorithms
- 1 December 1991
The marking algorithm is developed, a randomized on-line algorithm for the paging problem, which it is proved that its expected cost on any sequence of requests is within a factor of 2Hk of optimum.