Moti Yung

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Moti Yung
Alma materColumbia University
Awards
Scientific career
Fields
Institutions
ThesisMinimum-Knowledge Transfer Protocol (1988)
Doctoral advisorZvi Galil
Doctoral students

Mordechai M. "Moti" Yung is a cryptographer and computer scientist known for his work on cryptovirology and kleptography.

Career[edit]

Yung earned his PhD from Columbia University in 1988 under the supervision of Zvi Galil.[1] In the past, he worked at the IBM Thomas J. Watson Research Center, CertCo, RSA Laboratories, and Google.[citation needed] In 2016, Yung moved from Google to Snap Inc.[2] Yung is currently a research scientist at Google.[3]

Yung was an adjunct senior research faculty member[3] and has co-advised PhD students including Gödel Prize winner Matthew K. Franklin[1] and Jonathan Katz.[1]

Research[edit]

Yung has worked in cryptovirology,[4] kleptography,[5] information-theoretic security,[6][7] secure multi-party computation,[8][9][10] and zero-knowledge proofs,[11][12][13]

Cryptovirology[edit]

In 1996, Adam L. Young and Yung coined the term cryptovirology to denote the use of cryptography as an attack weapon via computer viruses and other malware in contrast to its traditional protective role.[4] In particular, they described the first instances of ransomware using public-key cryptography.[14][15]

Kleptography[edit]

In 1996, Adam L. Young and Yung introduced the notion of kleptography[5] to show how cryptography could be used to attack host cryptosystems where the malicious resulting system with the embedded cryptologic tool in it resists reverse-engineering and cannot be detected by interacting with the host cryptosystem,[16][17][18][19][20] as an argument against cryptographic systems and devices given by an external body as "black boxes" as was the Clipper chip and the Capstone program.[citation needed]

After the 2013 Snowden affair, the NIST was believed to have mounted the first kleptographic attack against the American Federal Information Processing Standard detailing the Dual EC DRBG,[21] essentially exploiting the repeated discrete logarithm based "kleptogram" introduced by Young and Yung.[22]

Awards[edit]

References[edit]

  1. ^ a b c Moti Yung at the Mathematics Genealogy Project
  2. ^ Dave, Paresh (March 29, 2016), "This week in L.A. tech: Three Day Rule lands funding, Snapchat snags encryption expert and Surf Air flies north", Los Angeles Times
  3. ^ a b "Moti Yung". IEEE Computer Society. Retrieved 28 December 2019.
  4. ^ a b Young, A.; M. Yung (1996). Cryptovirology: extortion-based security threats and countermeasures. IEEE Symposium on Security and Privacy. pp. 129–140. doi:10.1109/SECPRI.1996.502676. ISBN 0-8186-7417-2.
  5. ^ a b Infosecurity Magazine: The Dark Side of Cryptography: Kleptography in Black-Box Implementations https://www.infosecurity-magazine.com/magazine-features/the-dark-side-of-cryptography-kleptography-in/
  6. ^ Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung: Perfectly-Secure Key Distribution for Dynamic Conferences. CRYPTO 1992: 471-486 [1]
  7. ^ Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung: Perfectly Secure Message Transmission. J. ACM 40(1): 17-47 (1993)[2]
  8. ^ R. Cramer, Introduction to Secure Computation http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.130.9163&rep=rep1&type=pdf
  9. ^ Zvi Galil, Stuart Haber, Moti Yung: Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model. CRYPTO 1987: 135-155 [3]
  10. ^ Matthew K. Franklin, Moti Yung: Communication Complexity of Secure Computation (Extended Abstract). STOC 1992: 699-710 [4]
  11. ^ Russell Impagliazzo, Moti Yung: Direct Minimum-Knowledge Computations. CRYPTO 1987: 40-51 [5]
  12. ^ Gilles Brassard, Claude Crépeau, Moti Yung: Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. Theor. Comput. Sci. 84(1): 23-52 (1991)[6]
  13. ^ Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao: Concurrent Knowledge Extraction in Public-Key Models. J. Cryptology 29(1): 156-219 (2016)[7]
  14. ^ Skeptical Experts and Smart Attackers. Feb. 2 2013 http://privacy-pc.com/articles/moti-yung-and-adam-young-on-kleptography-and-cryptovirology-5-skeptical-experts-and-smart-attackers.html
  15. ^ Ransomware: The future of extortion By Jibu Elias September 04, 2017 https://www.techradar.com/news/ransomware-the-future-of-extortion
  16. ^ Young, Adam; Yung, Moti (1996), "The Dark Side of "Black-Box" Cryptography or: Should We Trust Capstone?", Adam L. Young, Moti Yung: The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone? CRYPTO 1996: 89-103, Lecture Notes in Computer Science, 1109, p. 89, doi:10.1007/3-540-68697-5_8, ISBN 978-3-540-61512-5
  17. ^ Young, Adam; Yung, Moti (1997), "Kleptography: Using Cryptography Against Cryptography", Adam L. Young, Moti Yung: Kleptography: Using Cryptography Against Cryptography. EUROCRYPT 1997: 62-74, Lecture Notes in Computer Science, 1233, p. 62, doi:10.1007/3-540-69053-0_6, ISBN 978-3-540-62975-7
  18. ^ Young, Adam; Yung, Moti (1997), "The prevalence of kleptographic attacks on discrete-log based cryptosystems", Adam L. Young, Moti Yung: The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. CRYPTO 1997: 264-276, Lecture Notes in Computer Science, 1294, p. 264, doi:10.1007/BFb0052241, ISBN 978-3-540-63384-6
  19. ^ Young, Adam; Yung, Moti (1998), "Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs", Adam L. Young, Moti Yung: Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs. FSE 1998: 122-133, Lecture Notes in Computer Science, 1372, p. 122, doi:10.1007/3-540-69710-1_9, ISBN 978-3-540-64265-7
  20. ^ Young, Adam; Yung, Moti (2001), "Bandwidth-Optimal Kleptographic Attacks", Adam L. Young, Moti Yung: Bandwidth-Optimal Kleptographic Attacks. CHES 2001: 235-250, Lecture Notes in Computer Science, 2162, p. 235, doi:10.1007/3-540-44709-1_20, ISBN 978-3-540-42521-2
  21. ^ Larry Greenemeier (18 September 2013). "NSA Efforts to Evade Encryption Technology Damaged U.S. Cryptography Standard". Scientific American.
  22. ^ Green, Matt, presentation: From Heartbleed to Juniper and Beyond (PDF)
  23. ^ IACR Distinguished Lectures, retrieved 2012-03-11
  24. ^ ACM Names Fellows for Computing Advances that Are Transforming Science and Society Archived 2014-07-22 at the Wayback Machine, Association for Computing Machinery, accessed 2013-12-10
  25. ^ http://homepages.laas.fr/esorics/ Esorics Awards
  26. ^ IACR Moti Yung, IACR Fellow, 2014
  27. ^ http://www.sigsac.org/award/sigsac-awards.html SIGSAC Awards
  28. ^ [8] IEEE fellows 2015
  29. ^ [9] EATCS fellows
  30. ^ Moti Yung Received IEEE Computer Society 2018 W. Wallace McDowell Award

External links[edit]