Israeli computer scientist
Amos Fiat (born December 1, 1956)[ 1] computer scientist , a professor of computer science atTel Aviv University . He is known for his work incryptography ,online algorithms , andalgorithmic game theory .
Fiat earned his Ph.D. in 1987 from theWeizmann Institute of Science under the supervision ofAdi Shamir .[ 2] Richard Karp andManuel Blum at theUniversity of California, Berkeley , he returned to Israel, taking a faculty position atTel Aviv University .
Many of Fiat's most highly cited publications concerncryptography , including his work withAdi Shamir ondigital signatures (leading to theFiat–Shamir heuristic for turning interactive identification protocols into signature schemes)[ 3] David Chaum andMoni Naor onelectronic money , used as the basis for theecash system.[ 4] Uriel Feige in 1988, Fiat invented theFeige–Fiat–Shamir identification scheme , a method for usingpublic-key cryptography to providechallenge–response authentication .
In 1994, he was one of the first, withMoni Naor , to formally study the problem of practicalbroadcast encryption .[ 5] Benny Chor , Moni Naor and Benny Pinkas, he made a contribution to the development ofTraitor tracing , acopyright infringement detection system which works by tracing the source of leaked files rather than by directcopy protection .[ 6]
WithGerhard Woeginger , Fiat organized a series ofDagstuhl workshops oncompetitive analysis ofonline algorithms , and together with Woeginger he edited the bookOnline Algorithms: The State of the Art (Lecture Notes in Computer Science 1442, Springer-Verlag, 1998). His research papers include methods for applying competitive analysis topaging ,[ 7] call control ,[ 8] data management ,[ 9] distributed file systems .[ 10]
Fiat's interest ingame theory stretches back to his thesis research, which included analysis of the children's gameBattleship .[ 11] Tetris in developing newjob shop scheduling algorithms,[ 12] [ 13]
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). ^ Fiat's home page at Tel Aviv University, retrieved 2012-02-19.^ Amos Fiat at theMathematics Genealogy Project ^ 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 ^ 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 ^a b Amos Fiat; Moni Naor (1994)."Broadcast Encryption" .Advances in Cryptology – CRYPTO '93 (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 ^a b 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 . ^ 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 ^ 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) 312– 320,ISBN 9780898713299 ^ 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 ^ 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 ^ Fiat, Amos; Shamir, Adi (1989), "How to find a battleship",Networks ,19 (3):361– 371,doi :10.1002/net.3230190306 ,MR 0996587 ^ 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 ^ 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 ^ Chaum, David; Fiat, Amos; Naor, Moni (1990), Goldwasser, Shafi (ed.), "Untraceable Electronic Cash",Advances in Cryptology – CRYPTO’ 88 , vol. 403, Springer New York, pp. 319– 327,doi :10.1007/0-387-34799-2_25 ISBN 9780387971964 ^ "ACM Paris Kanellakis Award" . ACM. Retrieved6 June 2017 .^ "The EATCS Award 2023 - Laudatio for Amos Fiat" . EATCS. RetrievedMarch 31, 2023 .
Adleman ,Diffie ,Hellman ,Merkle ,Rivest ,Shamir (1996)Lempel ,Ziv (1997)Bryant ,Clarke ,Emerson ,McMillan (1998)Sleator ,Tarjan (1999)Karmarkar (2000)Myers (2001)Franaszek (2002)Miller ,Rabin ,Solovay ,Strassen (2003)Freund ,Schapire (2004)Holzmann ,Kurshan ,Vardi ,Wolper (2005)Brayton (2006)Buchberger (2007)Cortes ,Vapnik (2008)Bellare ,Rogaway (2009)Mehlhorn (2010)Samet (2011)Broder ,Charikar ,Indyk (2012)Blumofe ,Leiserson (2013)Demmel (2014)Luby (2015)Fiat ,Naor (2016)Shenker (2017)Pevzner (2018)Alon ,Gibbons ,Matias ,Szegedy (2019)Azar ,Broder ,Karlin ,Mitzenmacher ,Upfal (2020)Blum ,Dinur ,Dwork ,McSherry ,Nissim ,Smith (2021)Burrows ,Ferragina ,Manzini (2022)
International National Academics People
