Ari Juels is an American Cryptographer. He is currently the Weill Family Foundation and Joan and Sanford I. Weill Professor at Cornell Tech and a co-founder and co-director of the Initiative for CryptoCurrencies and Contracts.
He is also the chief scientist at Chainlink Labs. He co-authored the first Chainlink white paper in 2017 with Sergey Nazarov and Steve Ellis. The smallest denomination of the LINK token, the Juel, is named in his honor.
Juels was an employee of RSA Security from 1996 until 2013, with the title Chief Scientist starting in 2007.
Juels's research spans applied cryptography, information security, privacy, and blockchain systems.
Proof of work and denial-of-service defenses
In 1999, Juels and Markus Jakobsson coined and formalized the term "proof of work" in a paper that predated its use in the Bitcoin white paper and is cited among the academic precursors of Bitcoin's design. The same year, with John Brainard, he introduced client puzzles, a proof-of-work-based countermeasure against connection-depletion denial-of-service attacks. Similar proof-of-work challenges are used in modern bot-mitigation and anti-abuse systems, including those of Cloudflare and the Tor Project.
Fuzzy cryptography and authentication
Juels co-developed error-tolerant cryptographic primitives for securing noisy data such as biometric templates: the fuzzy commitment scheme with Martin Wattenberg in 1999, and the fuzzy vault scheme with Madhu Sudan in 2002. This line of work was later applied in RSA products to protect answers to personal security questions used in password recovery. With Ronald Rivest and others, he proposed "fourth-factor authentication" in 2006, a recovery mechanism in which a user who has lost access to a credential is vouched for by pre-designated trusted acquaintances. The paper is credited with first proposing the designated-trustee model of account recovery, which was later adopted in consumer services including Facebook's Trusted Contacts (2013–2022) and Apple's Account Recovery Contact (introduced 2021).
Privacy and electronic voting
In 2001, Juels proposed the first protocols for targeted advertising that preserve user privacy, using private information retrieval and mix networks to let advertisers select ads without learning users' profiles. In 2005, with Dario Catalano and Jakobsson, he introduced the notion of coercion resistance for electronic voting systems, a security property intended to defeat vote buying and voter coercion that has since become standard in the field.
From 2003 to 2009, Juels worked extensively on the security and privacy of RFID and NFC tags. With Rivest and Michael Szydlo he proposed the "blocker tag", a device that selectively prevents RFID readers from scanning consumer items, followed by a lower-cost "soft blocking" variant. His 2006 survey of RFID security and privacy is among his most cited works.
Cloud storage
In 2007, Juels and Burton Kaliski introduced and formalized proofs of retrievability (PoRs), the first cryptographic technique allowing a storage provider to prove to a client that a remotely stored file remains complete and intact without the client downloading it. The concept spawned a substantial line of follow-up work on verifiable cloud storage.
Machine learning security
In 2016, Juels co-authored work introducing model-extraction attacks, in which an adversary reconstructs a proprietary machine learning model by issuing queries to its prediction API; the paper helped establish model stealing as a research area within adversarial machine learning.
Blockchain
Much of Juels's recent research concerns blockchain oracles, which supply external data to smart contracts. His group developed Town Crier (2016), described in later literature as the first oracle to combine Intel SGX with Ethereum smart contracts; it runs inside an SGX trusted execution environment to fetch data from HTTPS websites and deliver it to smart contracts with hardware attestations of its authenticity, and DECO (2020), a cryptographic protocol that lets users prove facts about data retrieved over TLS without revealing the data itself. Both systems were subsequently deployed by Chainlink.
In 2020, Juels co-authored "Flash Boys 2.0", which coined the term "miner extractable value" (MEV), later generalized to maximal extractable value, to describe the profit that block producers can extract by reordering, inserting, or censoring transactions. The paper initiated the systematic study of MEV, which has since become a significant market and research area in blockchain systems.
Writing
Juels has published two thriller novels. Tetraktys (2009) is a cryptography thriller set partly at UC Berkeley. The Oracle (2024) is a thriller about cryptocurrency and blockchain.
↑Jakobsson, Markus; Juels, Ari (September 1999). Proofs of Work and Bread Pudding Protocols. IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security. Boston, MA: Springer. pp.258–272. doi:10.1007/978-0-387-35568-9_18.
↑Juels, Ari; Brainard, John (February 1999). Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks. Proceedings of the 1999 ISOC Network and Distributed System Security Symposium. pp.151–165.
↑Tatoris, Reid; Wolters, Benedikt (April 1, 2022). "The end of the road for Cloudflare CAPTCHAs". Cloudflare Blog. Retrieved 2024-12-06. Challenges are selected based on what characteristics the visitor emits and based on the initial information we have about the visitor. Those challenges include, but are not limited to, proof-of-work, proof-of-space, probing for web APIs, and various challenges for detecting browser-quirks and human behavior.
↑Juels, Ari; Wattenberg, Martin (November 1999). A Fuzzy Commitment Scheme. Proceedings of the 6th ACM Conference on Computer and Communications Security. pp.28–36. doi:10.1145/319709.319714.
↑Juels, Ari; Sudan, Madhu (June 2002). A Fuzzy Vault Scheme. Proceedings of the 2002 IEEE International Symposium on Information Theory (ISIT 2002). Lausanne, Switzerland: IEEE. p.408. doi:10.1109/ISIT.2002.1023680.
↑Juels, Ari; Sudan, Madhu (2006). "A Fuzzy Vault Scheme". Designs, Codes and Cryptography. 38 (2): 237–257. doi:10.1007/s10623-005-6343-z.
↑Brainard, John G.; Juels, Ari; Rivest, Ronald L.; Szydlo, Michael; Yung, Moti (October 2006). Fourth-Factor Authentication: Somebody You Know. Proceedings of the 13th ACM Conference on Computer and Communications Security. pp.168–178. doi:10.1145/1180405.1180427.
↑Lassak, Leona; Markert, Philipp; Golla, Maximilian; Stobert, Elizabeth; Dürmuth, Markus (May 2024). A Comparative Long-Term Study of Fallback Authentication Schemes. Proceedings of the 2024 CHI Conference on Human Factors in Computing Systems. ACM. pp.1–19. doi:10.1145/3613904.3642889.
↑Juels, Ari (2001). Naccache, David (ed.). Targeted Advertising ... and Privacy Too. Topics in Cryptology – CT-RSA 2001. Lecture Notes in Computer Science. Vol.2020. Berlin, Heidelberg: Springer. pp.408–424. doi:10.1007/3-540-45353-9_30.
↑Ullah, Imdad; Boreli, Roksana; Kanhere, Salil S. (2020). "Privacy in targeted advertising: A survey". arXiv:2009.06861 [cs.CR].
↑Juels, Ari; Catalano, Dario; Jakobsson, Markus (November 2005). Coercion-Resistant Electronic Elections. Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society. pp.61–70. doi:10.1145/1102199.1102213.
↑Juels, Ari; Rivest, Ronald L.; Szydlo, Michael (2003). The Blocker Tag: Selective Blocking of RFID Tags for Consumer Privacy. Proceedings of the 10th ACM Conference on Computer and Communications Security. CCS '03. ACM. pp.103–111. doi:10.1145/948109.948126.
↑Juels, Ari; Brainard, John (2004). Soft Blocking: Flexible Blocker Tags on the Cheap. Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society. WPES '04. ACM. pp.1–7. doi:10.1145/1029179.1029181.
↑Juels, Ari (February 2006). "RFID Security and Privacy: A Research Survey". IEEE Journal on Selected Areas in Communications. 24 (2): 381–394. doi:10.1109/JSAC.2005.861395.
↑Juels, Ari; Kaliski, Burton S. (October 2007). PORs: Proofs of Retrievability for Large Files. Proceedings of the 14th ACM Conference on Computer and Communications Security. pp.584–597. doi:10.1145/1315245.1315317.
12Dodis, Yevgeniy; Vadhan, Salil; Wichs, Daniel (2009). Proofs of Retrievability via Hardness Amplification. Theory of Cryptography Conference (TCC 2009). Lecture Notes in Computer Science. Vol.5444. Springer. pp.109–127. doi:10.1007/978-3-642-00457-5_8.
↑Tramèr, Florian; Zhang, Fan; Juels, Ari; Reiter, Michael K.; Ristenpart, Thomas (August 2016). Stealing Machine Learning Models via Prediction APIs. Proceedings of the 25th USENIX Security Symposium. pp.601–618.
↑Oliynyk, Daryna; Mayer, Rudolf; Rauber, Andreas (2023). "I Know What You Trained Last Summer: A Survey on Stealing Machine Learning Models and Defences". ACM Computing Surveys. 55 (14s): 1–41. doi:10.1145/3595292.
↑Zhang, Fan; Cecchetti, Ethan; Croman, Kyle; Juels, Ari; Shi, Elaine (October 2016). Town Crier: An Authenticated Data Feed for Smart Contracts. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. pp.270–282. doi:10.1145/2976749.2978326.
↑Xian, Youquan; Zhou, Lianghaojie; Jiang, Jianyong; Wang, Boyi; Huo, Hao; Liu, Peng (September 2024). "A Distributed Efficient Blockchain Oracle Scheme for Internet of Things". IEICE Transactions on Communications. E107-B (9): 573–582. doi:10.23919/transcom.2023EBP3156.
↑Zhang, Fan; Maram, Deepak; Malvai, Harjasleen; Goldfeder, Steven; Juels, Ari (November 2020). DECO: Liberating Web Data Using Decentralized Oracles for TLS. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. pp.1919–1938.