In 1994, he was one of the first, with Moni Naor, to formally study the problem of practical broadcast encryption.[5] Along with Benny Chor, Moni Naor and Benny Pinkas, he made a contribution to the development of Traitor tracing, a copyright infringement detection system which works by tracing the source of leaked files rather than by direct copy protection.[6]
With Gerhard Woeginger, Fiat organized a series of Dagstuhl workshops on competitive analysis of online algorithms, and together with Woeginger he edited the book Online Algorithms: The State of the Art (Lecture Notes in Computer Science 1442, Springer-Verlag, 1998). His research papers include methods for applying competitive analysis to paging,[7] call control,[8]data management,[9] and the assignment of files to servers in distributed file systems.[10]
Fiat's interest in game theory stretches back to his thesis research, which included analysis of the children's game Battleship.[11] He has taken inspiration from the game Tetris in developing new job shop scheduling algorithms,[12] as well as applying competitive analysis to the design of game-theoretic auctions.[13]
Bibliography
Amos Fiat and Moni Naor,Rigorous Time/Space Tradeoffs for Inverting Functions, SIAM J. Computing 29(3), 1999, pp. 790–803.
Benny Chor, Amos Fiat, Moni Naor and Benny Pinkas, Tracing Traitors, IEEE Transactions on Information Theory, Vol. 46(3), pp. 893–910, 2000.[6]
David Chaum, Amos Fiat and Moni Naor, Untraceable Electronic Cash, 1990.[14]
Amos Fiat and Moni Naor, Broadcast Encryption, 1994.[5]
Amos Fiat and Moni Naor, Implicit O(1) Probe Search, SIAM J. Computing 22: 1–10 (1993).
↑Bartal, Yair; Fiat, Amos; Rabani, Yuval (1995), "Competitive algorithms for distributed data management", Journal of Computer and System Sciences51 (3): 341–358, doi:10.1006/jcss.1995.1073.
↑"Competitive distributed file allocation", Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing (STOC '93), 1993, pp. 164–173, doi:10.1145/167088.167142, ISBN978-0897915915.
↑Fiat, Amos; Shamir, Adi (1989), "How to find a battleship", Networks19 (3): 361–371, doi:10.1002/net.3230190306.
↑Bartal, Yair; Fiat, Amos; Karloff, Howard; Vohra, Rakesh (1992), "New algorithms for an ancient scheduling problem", Proceedings of the Twenty-Fourth ACM Symposium on Theory of Computing (STOC '92), pp. 51–58, doi:10.1145/129712.129718, ISBN978-0897915113.
↑Fiat, Amos (2002), "Competitive generalized auctions", Proceedings of the Thirty-Fourth ACM Symposium on Theory of Computing (STOC '02), pp. 72–81, doi:10.1145/509907.509921, ISBN978-1581134957.
↑Chaum, David; Fiat, Amos; Naor, Moni (1990), Goldwasser, Shafi, ed., "Untraceable Electronic Cash" (in en), Advances in Cryptology – CRYPTO’ 88 (Springer New York) 403: pp. 319–327, doi:10.1007/0-387-34799-2_25, ISBN9780387971964