Find Academic Supervisors

Abhishek JainView profile

Associate Professor

• Cryptography
• Computer Security
• Privacy
• +5 more

Abhishek Jain is an Associate Professor in the Department of Computer Science at Johns Hopkins University and a Senior Scientist at NTT Research. He is affiliated with the Data Science and AI Institute, the Information Security Institute, and the Algorithms and Complexity group. University: Johns Hopkins University Department: Computer Science Academic Rank: Associate Professor Institutional Roles: Co-director of the Advanced Research in Cryptography group, member of the Theory Group, and co-leader of the Cryptography Group Education: Ph.D. in Computer Science from the University of California Los Angeles (2012), advised by Amit Sahai and Rafail Ostrovsky. Recipient of the Symantec Outstanding Graduate Student Award during his Ph.D. Research Interests Cryptography Secure computation Proof systems Program obfuscation Privacy Blockchain Theoretical computer science Research Trends: His recent publications emphasize cryptographic protocols for homomorphic encryption, zero-knowledge proofs, and secure multi-party computation, alongside applications in blockchain and privacy-preserving systems. Key themes include scalability, verifiable evaluation, and adapting cryptographic techniques to dynamic and distributed environments. Scientific Awards 2020 NSF CAREER Award Best Paper Awards at Eurocrypt and the International Conference on the Theory and Applications of Cryptographic Techniques Advising & Grants: Mentors Ph.D. students and interns/postdocs at NTT Research. Research funded by NSF, DARPA, JP Morgan, Ethereum Foundation, Stellar, Cisco, Samsung, and JHU Catalyst awards. Labs & Teams: Co-leads the Cryptography Group at Johns Hopkins, participates in the DC Area Crypto Day, and organizes the weekly Theory Seminar. Collaborates with institutions including MIT CSAIL, BUSEC, and Microsoft Research New England.

Brent WatersView profile

Professor

• Cryptography
• Computer Security
• Theoretical Computer Science
• +4 more

Brent Waters is a Professor at the Department of Computer Science, University of Texas at Austin , where he has been since 2008. He received his Ph.D. in Computer Science from Princeton University (2004) and held a postdoctoral position at Stanford University (2004-2005). His research focuses on cryptography and computer security, with groundbreaking work in Identity-Based Encryption, Functional Encryption, Attribute-Based Encryption, and code obfuscation. He is a founder of Functional Encryption and Attribute-Based Encryption. Education Ph.D., Computer Science, Princeton University (2004) Research Interests Cryptography, Security Protocols Functional Encryption, Attribute-Based Encryption Indistinguishability Obfuscation, LWE-Based Systems Zero-Knowledge Proofs, Key-Dependent Message Security Selected Publications Trends Recent work (2025) addresses adaptive security in broadcast encryption, SNARGs, and multi-authority ABE systems using LWE and bilinear maps. Key themes include collusion resistance, witness encryption, and optimizing cryptographic assumptions like CRS size reduction. Scientific Awards IEEE Fellow (2025), IACR Fellow (2024), ACM Fellow (2021) Simons Investigator (2019), Grace Murray Hopper Award (2015) Presidential Early Career Award (2011), Packard Fellowship (2011) Advising Current Ph.D. students: Shafik Nassar, George Lu Past Ph.D. students: Rachit Garg (2024), Satya Vusirikala (2021), Rishab Goyal (2019), Venkata Koppula (2018), Yannis Rouselakis (2013), Allison Bishop (2012) Contact Email: bwaters@cs.utexas.edu Phone: (512) 232-7464 | Office: GDC 6.810

Stanislaw JareckiView profile

Associate Professor

• Cryptography
• Cybersecurity
• Distributed Systems
• +3 more

Stanislaw Jarecki is an Associate Professor of Computer Science at the Donald Bren School of Information and Computer Sciences (ICS) at the University of California, Irvine (UCI). He joined UCI in 2003 after earning his Ph.D. in Computer Science from MIT in 2001 under Prof. Shafi Goldwasser. His research focuses on applied and distributed cryptography, with significant contributions to threshold cryptography, secure computation, and password-authenticated key exchange (PAKE) protocols such as OPAQUE, which secures 2 billion WhatsApp users. He also worked at Intertrust’s StarLab and Stanford’s applied cryptography group under Prof. Dan Boneh. Education: Ph.D., Massachusetts Institute of Technology, 2001. Research Interests: Distributed cryptography, secure multi-party computation, privacy-preserving protocols, threshold security, blockchain applications, and efficient cryptographic primitives. His work emphasizes practical solutions for real-world systems, including protocols resilient to server compromises and scalable encryption methods. Awards: 2023 IACR Fellow for contributions to distributed cryptography and efficient secure computation. Advising and Grants: Jarecki’s research has been supported by grants including NSF SaTC programs. He advises students on cryptographic protocol design and security mechanisms. His work on OPAQUE and CHIC protocols exemplifies his focus on bridging theoretical cryptography with practical implementation. Labs/Teams: Leads a research group focused on applied cryptography and security within ICS at UCI, collaborating on projects like secure computation, privacy-preserving data processing, and cryptographic protocol development.

Elette BoyleView profile

Associate Professor

• Cryptography
• Computer Security
• Coding Theory
• +7 more

Elette Boyle is an Associate Professor at Reichman University (IDC Herzliya) and a Senior Scientist at NTT Research . She holds a Ph.D. in Mathematics from MIT (advised by Shafi Goldwasser and Yael Tauman Kalai) and an undergraduate degree from Caltech . Education Ph.D. in Mathematics, MIT B.S. in Mathematics, Caltech Her research focuses on cryptographic solutions for secure data processing , particularly in secure multi-party computation , function/homomorphic secret sharing , and distributed point functions . Recent work explores topology-hiding communication , memory checking complexity , and sublinear-communication MPC . Key trends in her publications include: Advancements in Function Secret Sharing for branching programs and sparse vectors. Efficient Secure Multi-Party Computation protocols with preprocessing. Information-theoretic and computational Topology-Hiding Broadcast schemes. Optimized Oblivious Transfer with constant computational overhead. Scientific Awards European Research Council (ERC) Award Israeli Science Foundation (ISF) Grant United States Air Force Office of Scientific Research (AFOSR) Grant Google Research Scholar Award International Association for Cryptologic Research (IACR) Recognition As Director of the Foundations & Applications of Cryptography (FACT) Research Center , she leads collaborative work with institutions like Technion Israel , Cornell University , and NTT Research . Her students include Pierre Meyer (Ph.D.) , Matan Hamilis (Ph.D.) , and D'or Banon (MSc.) .

Peihan MiaoView profile

Assistant Professor

• Cryptography
• Secure Multi-Party Computation
• Theoretical Computer Science
• +2 more

Peihan Miao is an Assistant Professor in the Department of Computer Science at Brown University, where she is a member of the Theory Group. Her academic journey began with a BS from the ACM Honors Class at Shanghai Jiao Tong University, followed by a PhD from UC Berkeley in 2019 under the supervision of Sanjam Garg. BS: ACM Honors Class at Shanghai Jiao Tong University PhD: University of California, Berkeley (2019) Dr. Miao's research focuses on cryptography and security, with particular emphasis on bridging the gap between theoretical cryptography and practical applications, especially in the realm of secure multi-party computation. Her work spans both foundational theoretical aspects and applied systems, demonstrating a strong commitment to developing cryptographic techniques that can be implemented in real-world scenarios. She has made significant contributions to private set intersection protocols, secure computation frameworks, and cryptographic primitives that enable privacy-preserving data analysis across various domains including genomics and machine learning. Her publication record reveals a consistent focus on advancing secure computation techniques, with recent work exploring structure-aware private set intersection, updatable cryptographic protocols, and applications of cryptography to emerging domains like federated genomics. Her research demonstrates a progression from theoretical foundations toward practical implementations that address real-world privacy challenges. NSF CAREER Award Meta Research Award Google Research Scholar Award Amazon Research Award Dr. Miao actively mentors PhD students including Xinyi Shi, Phuoc Van Long Pham, and Jifeng Wang, as well as postdoc Gayathri Garimella. She serves on program committees for major cryptography conferences including Crypto, TCC, and Asiacrypt. Her teaching portfolio includes courses on applied cryptography, introduction to cryptography and computer security, and special topics in secure computation, demonstrating her commitment to educating the next generation of cryptographers. She also runs a crypto reading group at Brown University for students interested in cryptography research. As part of Brown's Theory Group, Dr. Miao collaborates with colleagues on advancing the theoretical foundations of computer science while maintaining a strong focus on practical applications of cryptographic techniques.

Ying CaiView profile

Associate Professor

• AI
• Machine Learning
• Data Science
• +4 more

Ying Cai is an Associate Professor in the Department of Computer Science at Iowa State University, joining in 2003 after earning his Ph.D. in Computer Science from the University of Central Florida (2002). His research focuses on AI, machine learning, data science, cybersecurity, privacy protection, and database systems. He leads projects funded by the Air Force Research Laboratory, including work on authentication data structures for rank-aware queries, requiring U.S. citizenship and expertise in linear algebra/cryptography. Dr. Cai’s work spans cybersecurity (e.g., adversarial example defense, secure secret sharing), spatio-temporal systems (e.g., traffic risk prediction, check-in time modeling), and healthcare AI (e.g., cervical spine diagnosis with transformers). His publications emphasize practical applications of ML in privacy, security, and distributed systems. Professional roles include Associate Editor for Multimedia Tools and Applications (since 2009), Co-chair for COMPSAC TAIN/NCIW symposium (2014–2017), and TPC Chair for Mobilware 2010. His service includes contributions to INFOCOM, ICDCS, and MDM conferences. Current research opportunities exist for graduate students with strong programming/math skills, particularly in cryptography and linear algebra. He emphasizes interdisciplinary work, such as bridging AI with social sciences via large language models.

Serge FehrView profile

Professor

• Cryptology
• Post-Quantum Cryptography
• Information-Theoretic Cryptography
• +5 more

Serge Fehr is a Senior Researcher in the Cryptology Group at CWI (Centrum Wiskunde & Informatica) in Amsterdam and a part-time Professor at the Mathematical Institute of Leiden University. His research focuses on foundational aspects of cryptology, including post-quantum cryptography, information-theoretic security, zero-knowledge proofs, and secure multiparty computation. He participates in AMSec (Amsterdam Cyber Security Center) and leads work packages in the NWO-funded HAPKIDO consortium. Education: M.Sc. in Mathematics from ETH Zürich (1998) Ph.D. in Cryptography from ETH Zürich and University of Aarhus (2003) Postdoc at Macquarie University (2003-2004) Research Interests: Post-quantum cryptographic primitives (e.g., digital signatures, lattice-based schemes) Quantum-resistant protocols (e.g., non-resignable signatures, Fiat-Shamir transforms) Foundational security proofs in the quantum random oracle model (QROM) Secure multiparty computation and privacy-preserving healthcare systems Key Activities: Editorial Board Member: Journal of Cryptology , IEEE Transactions on Information Theory Program Committee Co-Chair: EUROCRYPT 2025 Steering Committee Member: Beyond IID Information Theory, QCrypt Co-organizer: Symposium Series on Post-Quantum Cryptography Grants/Awards: NWO Cybersecurity consortium grant (HAPKIDO - 2021) NWO Veni Grant (2005) NWO Open & Free Competition Grants (2008, 2013) Students/Advising: Supervised or served on committees for over 15 Ph.D. students, including work on post-quantum signatures, MPC applications, and lattice-based cryptography. Labs/Teams: Active in CWI’s Cryptology Group and Leiden’s Mathematical Institute, collaborating with industry partners (e.g., KPN, Microsoft) in cybersecurity initiatives.

• Cryptography
• Computer Security
• Coding Theory
• +2 more

Elette Boyle is an Associate Professor at the Efi Arazi School of Computer Science, Reichman University (IDC Herzliya), Israel. She serves as the Director of the FACT Research Center and is a Senior Scientist at NTT Research. Additionally, she heads the RRIS International Program. Her academic career spans prestigious institutions including MIT, Technion, and Cornell. Dr. Boyle received her Ph.D. in Mathematics from MIT under the guidance of Shafi Goldwasser and Yael Tauman Kalai. Following her doctorate, she completed postdoctoral research at the Technion Israel Institute of Technology (2013-2015) hosted by Yuval Ishai, and a short-term postdoc at Cornell University (Summer 2013) hosted by Rafael Pass. She completed her undergraduate studies in mathematics at Caltech. Her research focuses on the theoretical foundations of computer security and cryptography, with particular expertise in secure multiparty computation, function secret sharing, distributed point functions, and memory checking protocols. Her work bridges theoretical computer science with practical cryptographic applications, developing protocols that balance security guarantees with computational efficiency. Dr. Boyle's research has significantly advanced the field of cryptography, particularly in understanding the fundamental limits and possibilities of secure computation protocols. Analysis of her recent publications reveals a strong focus on the theoretical foundations of secure computation, with particular emphasis on understanding computational and communication complexity limits. Her work spans multiple dimensions of cryptography including foundational protocols, complexity analysis, and practical implementations. A recurring theme in her research is developing efficient cryptographic primitives that minimize communication overhead while maintaining strong security guarantees. Her contributions to function secret sharing, distributed point functions, and pseudorandom correlation generators have been particularly influential in the field. Dr. Boyle has advised several graduate students including Pierre Meyer (Ph.D., co-advised with Geoffroy Couteau), Matan Hamilis (Ph.D.), and D'or Banon (MSc., co-advised with Ran Cohen). Her research has been supported by various grants enabling her to lead significant projects in cryptography and secure computation. As Director of the FACT Research Center, she leads a team focused on foundational aspects of computer science and cryptography. Her center collaborates with researchers worldwide and serves as a hub for advancing cryptographic research in Israel and internationally.

• Cryptography
• Blockchain Technology
• Cybersecurity
• +4 more

Sri AravindaKrishnan Thyagarajan is a Lecturer at The University of Sydney's School of Computer Science, specializing in cryptography. He focuses on enhancing security and fairness in distributed systems, blockchains, and multi-party computations with applications in post-quantum cryptography. His work spans top-tier conferences like ACM CCS and IEEE SP. Education: B.Tech, Computer Science & Engineering, National Institute of Technology Trichy, India (2011–2015) M.Sc., Computer Science, Saarland University, Germany (2015–2016) Ph.D., Applied Cryptography, Friedrich Alexander Universität Erlangen-Nürnberg, Germany (2016–2021) Research Interests: Cryptography (classical and post-quantum), blockchain security, cryptocurrencies, fairness in multi-party computations, privacy-preserving protocols, and decentralized systems. Recent Articles: Focus on cryptographic protocols for blockchains, threshold cryptography, verifiable randomness, and secure atomic swaps. Recent work includes advancements in post-quantum signatures, distributed randomness generation, and privacy-preserving payment systems. Awards: Nominated for GI Dissertationspreis 2021 Advising & Grants: Advising Ankit Kapoor. Active in program committees for CCS, IEEE SP, and FC. Currently Program Chair for Crypto Valley Conference 2025. Labs/Teams: Part of the Sydney Blockchain Centre and cybersecurity cluster at the University of Sydney. Collaborates globally with institutions like NTT Research, Carnegie Mellon University, and Bocconi University.

Vipul GoyalView profile

Associate Professor

• Cryptography
• Quantum Cryptography
• Security & Privacy
• +1 more

Vipul Goyal is an Associate Professor at the Computer Science Department of Carnegie Mellon University and a Senior Scientist at NTT Research in California. He is on leave from CMU since joining NTT Research in June 2020 after a 7-year tenure at Microsoft Research. His research focuses on Cryptography , Quantum Cryptography , Security & Privacy , and Theoretical Computer Science , supported by grants from NSF, DARPA, Department of Energy NETL, JP Morgan, Cisco, PNC, Ripple, and CyLab initiatives.

Xiaowen ZhangView profile

Professor

• Cryptography
• Information Security
• Cybersecurity
• +5 more

Xiaowen Zhang is a Professor of Computer Science at the College of Staten Island (CSI), City University of New York (CUNY), and a Doctoral Faculty Member at the CUNY Graduate Center. His academic work bridges theoretical and applied research in cybersecurity, information systems, and network technologies. Dr. Zhang holds a Ph.D. in Computer Science from the CUNY Graduate Center (2007) and a Ph.D. in Electrical Engineering from Northern Jiaotong University (1999), along with an M.A. from CUNY Queens College, an M.S. from Northern Jiaotong University, and a B.S. from Shanxi University. His research focuses on Cryptography, Information Security, Cybersecurity, Secure Biometrics, RFID Security & Privacy, Information Retrieval, and Wireless Sensor Networks . He explores both foundational cryptographic methods—such as secret sharing schemes and hash functions—and their practical implementations in secure systems, including RFID authentication protocols and data visualization platforms for sensor networks. The analysis of his recent publications reveals a consistent focus on security mechanisms in distributed and wireless environments . His work frequently combines cryptographic theory with system-level implementations, particularly in RFID and sensor networks. There is a strong trend toward privacy-preserving protocols, efficient data retrieval, and secure information sharing , often leveraging mathematical structures like Latin squares and Bloom filters. Dr. Zhang has been actively involved in mentoring students, as evidenced by numerous co-authored publications with graduate and undergraduate researchers. His contributions span journals such as Security and Communication Networks , Journal of Applied Security Research , and International Journal of Security and Networks , as well as major conferences including IEEE LISAT, ACM CODASPY, and IEEE Sarnoff Symposium.

Aayush JainView profile

Assistant Professor

• Cryptography
• Theoretical Computer Science
• Applied Cryptography
• +3 more

Aayush Jain is an Assistant Professor in the Computer Science Department at Carnegie Mellon University. Previously, he was a Postdoctoral Fellow at NTT Research and a PhD student at UCLA, advised by Professor Amit Sahai. His work bridges theoretical and applied cryptography with core computer science principles. Education PhD in Computer Science, University of California, Los Angeles (UCLA) Postdoctoral Fellowship, NTT Research Research Focus His research explores: foundational cryptography, indistinguishability obfuscation, functional encryption, lattice-based cryptography, secure multi-party computation, and post-quantum security. Work emphasizes rigorous theoretical frameworks with practical implications. Publication Trends Recent articles (2021-2024) demonstrate consistent focus on cryptographic primitives, obfuscation techniques, and security reductions. Dominant venues include CRYPTO, EUROCRYPT, FOCS, and STOC with emerging work in machine learning interfaces. Awards Best Paper Award at STOC 2021 for foundational contributions to indistinguishability obfuscation Advising and Collaboration Current PhD advisees: Alper Cakan, Quang Dao (co-advised), Sagnik Saha, Noah Singer (co-advised). Mentored postdocs: Mitali Bafna (2022-2023) and Rex Fernando (2022-2023). Teaches graduate courses in cryptography and theoretical tools. Leadership Leads the CMU Cryptography research group; organized the CMU Cryptography Workshop. Program committee member for FOCS, TCC, ITCS, and ICALP.

Prabhanjan AnanthView profile

Assistant Professor

• Cryptography
• Theoretical Computer Science
• Post-Quantum Cryptography
• +3 more

Prabhanjan Ananth is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara (UCSB), holding the Glen and Susanne Culler Endowed Chair in Computer Science. He earned his Ph.D. from UCLA in 2017, followed by a postdoctoral fellowship at MIT's CSAIL. His research focuses on cryptography, particularly in classical and post-quantum cryptography, with emphasis on unclonable primitives, pseudorandomness, and cryptographic protocols. Education: Ph.D. in Computer Science from UCLA (2013–2017), postdoctoral research at MIT (2017–2019). Research Interests: His work spans theoretical computer science and cryptography, including post-quantum security, quantum-resistant systems, and unclonable cryptographic primitives. He explores topics like pseudorandomness in quantum models, revocable encryption, and cryptographic protocols for multi-user environments. Recent Publications: His 2025 work advances revocable encryption and pseudorandom unitaries in quantum models. He also contributes to unclonable secret sharing and modular cryptographic design. His research often bridges theoretical foundations with practical applications in quantum-safe systems. Awards: Glen and Susanne Culler Endowed Chair in Computer Science (UCSB). Advising: Current Ph.D. advisees include Aditya Gulati, Yao-Ting Lin, and Divyanshu Bhardwaj. Past students have secured roles at institutions like JPMorgan Chase and EPFL. Teaching: Teaches courses on automata theory (CS 138) and cryptography (CS 178), emphasizing rigorous mathematical proofs and foundational concepts.

Mohammad HajiabadiView profile

Assistant Professor

• Theoretical Cryptography
• Cryptography
• Computer Science
• +3 more

Mohammad Hajiabadi is an Assistant Professor at the University of Waterloo's Department of Computer Science. His research focuses on theoretical cryptography, including cryptographic protocols, functional encryption, and secure communication. He holds a PhD in Computer Science from the University of Victoria (2016), a Master of Science from the same institution (2011), and a Bachelor of Science from Sharif University of Technology (2009). His research explores foundational aspects of cryptography, such as cryptographic assumptions, algorithmic lower bounds, and privacy-preserving techniques. Notable areas include registration-based encryption, secret sharing schemes, and the black-box complexity of cryptographic primitives. His work often intersects with theoretical computer science, addressing challenges in secure computation and efficient protocol design. Dr. Hajiabadi's publications span topics like trapdoor functions, oblivious transfer, and private set intersection, demonstrating a commitment to advancing both the theory and practical applications of cryptography. He has secured collaborative research funding, including a National Science Foundation grant for expanding oblivious transfer tools. His contributions to academic grants and collaborative projects highlight his role in shaping modern cryptographic frameworks.

Geoffroy CouteauView profile

Researcher

• Cryptography
• Secure Multiparty Computation
• Zero-Knowledge Proofs
• +5 more

Geoffroy Couteau is a CNRS research scientist at IRIF (Institut de Recherche en Informatique Fondamentale), Université Paris Cité, where he conducts research in theoretical and applied cryptography. He obtained his PhD from École Normale Supérieure de Paris in 2017 under the supervision of David Pointcheval and Hoeteck Wee, followed by a postdoctoral position at Karlsruhe Institute of Technology (KIT) from 2017 to 2019. His primary research interests include secure multiparty computation, zero-knowledge proofs, and the theoretical foundations of cryptography, with a particular emphasis on pseudorandom correlation generators and efficiency improvements in cryptographic protocols. He has made significant contributions to fine-grained cryptography, non-interactive zero-knowledge proofs, and post-quantum secure computation. The recent publications reflect a strong trend toward foundational advances in secure computation, with increasing focus on efficiency, practicality, and connections to complexity theory and learning theory. His work often bridges theoretical hardness assumptions with practical protocol design. ERC Starting Grant (2023) for project OBELiSC (Overcoming Barriers and Efficiency Limitations in Secure Computation) Geoffroy Couteau has advised numerous PhD and master’s students, including Dung Bui, Clément Ducros, Eliana Carozza, and Ulysse Léchine. He has also hosted many visiting students and postdocs, fostering a vibrant research group. He has served on the program committees of major conferences such as EUROCRYPT, CRYPTO, TCC, and PKC. He is currently leading research in cryptography at IRIF and is involved in postdoctoral hiring for projects in advanced cryptographic primitives. He maintains a research blog and resource collection for students, including LaTeX templates, a probability cheat sheet, and curated answers to common cryptography questions.