Amos Fiat
BornDecember 1, 1956
Haifa, Israel
NationalityIsraeli
Alma materWeizmann Institute of Science
University of California, Berkeley
Tel Aviv University
Scientific career
FieldsComputer Science, Cryptography
InstitutionsTel Aviv University
Doctoral advisorAdi Shamir
Richard Karp
Manuel Blum

Amos Fiat (born December 1, 1956)[1] is an Israeli computer scientist, a professor of computer science at Tel Aviv University. He is known for his work in cryptography, online algorithms, and algorithmic game theory.

Biography

Fiat earned his Ph.D. in 1987 from the Weizmann Institute of Science under the supervision of Adi Shamir.[2] After postdoctoral studies with Richard Karp and Manuel Blum at the University of California, Berkeley, he returned to Israel, taking a faculty position at Tel Aviv University.

Research

Many of Fiat's most highly cited publications concern cryptography, including his work with Adi Shamir on digital signatures (leading to the Fiat–Shamir heuristic for turning interactive identification protocols into signature schemes)[3] and his work with David Chaum and Moni Naor on electronic money, used as the basis for the ecash system.[4] With Shamir and Uriel Feige in 1988, Fiat invented the Feige–Fiat–Shamir identification scheme, a method for using public-key cryptography to provide challenge–response authentication.

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

Honours and awards

References

  1. ↑ Fiat's home page at Tel Aviv University, retrieved 2012-02-19.
  2. ↑ Amos Fiat at the Mathematics Genealogy Project
  3. ↑ Fiat, Amos; Shamir, Adi (1987), "How to prove yourself: practical solutions to identification and signature problems", Advances in Cryptology — CRYPTO' 86, Lecture Notes in Computer Science, vol. 263, London, UK: Springer-Verlag, pp. 186–194, doi:10.1007/3-540-47721-7_12, ISBN 978-3-540-18047-0.
  4. ↑ Chaum, D.; Fiat, A.; Naor, M. (1990), "Untraceable electronic cash", Proceedings on Advances in Cryptology – CRYPTO '88, Lecture Notes in Computer Science, vol. 403, London, UK: Springer-Verlag, pp. 319–327.
  5. 1 2 Amos Fiat; Moni Naor (1994). Broadcast Encryption (Extended abstract). Lecture Notes in Computer Science. Vol. 773. pp. 480–491. doi:10.1007/3-540-48329-2_40. ISBN 978-3-540-57766-9. {{cite book}}: |journal= ignored (help)
  6. 1 2 Naor, Moni; Benny Chor; Amos Fiat; Benny Pinkas (May 2000). "Tracing Traitors". Information Theory. 46 (3): 893–910. doi:10.1109/18.841169. S2CID 11699689.
  7. ↑ Fiat, Amos; Karp, Richard M.; Luby, Michael; McGeoch, Lyle A.; Sleator, Daniel D.; Young, Neal E. (1991), "Competitive paging algorithms", Journal of Algorithms, 12 (4): 685–699, arXiv:cs.DS/0205038, doi:10.1016/0196-6774(91)90041-V, S2CID 3260905.
  8. ↑ Awerbuch, Baruch; Bartal, Yair; Fiat, Amos; Rosén, Adi (1994), "Competitive non-preemptive call control", Proceedings of the Fifth ACM-SIAM Symposium on Discrete Algorithms (SODA '94), pp. 312–320, ISBN 9780898713299.
  9. ↑ Bartal, Yair; Fiat, Amos; Rabani, Yuval (1995), "Competitive algorithms for distributed data management", Journal of Computer and System Sciences, 51 (3): 341–358, doi:10.1006/jcss.1995.1073, MR 1368903.
  10. ↑ Awerbuch, Baruch; Bartal, Yair; Fiat, Amos (1993), "Competitive distributed file allocation", Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing (STOC '93), pp. 164–173, doi:10.1145/167088.167142, ISBN 978-0897915915, S2CID 7421364.
  11. ↑ Fiat, Amos; Shamir, Adi (1989), "How to find a battleship", Networks, 19 (3): 361–371, doi:10.1002/net.3230190306, MR 0996587.
  12. ↑ 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, CiteSeerX 10.1.1.32.3173, doi:10.1145/129712.129718, ISBN 978-0897915113, S2CID 15741871.
  13. ↑ Fiat, Amos; Goldberg, Andrew V.; Hartline, Jason D.; Karlin, Anna R. (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, ISBN 978-1581134957, S2CID 14688502.
  14. ↑ Chaum, David; Fiat, Amos; Naor, Moni (1990), Goldwasser, Shafi (ed.), "Untraceable Electronic Cash", Advances in Cryptology – CRYPTO’ 88, Springer New York, vol. 403, pp. 319–327, doi:10.1007/0-387-34799-2_25, ISBN 9780387971964
  15. ↑ "ACM Paris Kanellakis Award". ACM. Retrieved 6 June 2017.
  16. ↑ "The EATCS Award 2023 - Laudatio for Amos Fiat". EATCS. Retrieved March 31, 2023.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.