Find Academic Supervisors

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.

• Cryptography
• Computer Security
• Privacy
• +5 more

Amr Youssef is a Professor at the Concordia Institute for Information Systems Engineering, Concordia University. His research focuses on applied cryptography, network security, cyber-physical systems security, blockchain, and privacy. He has contributed extensively to securing smart grids, IoT devices, and web applications through cryptographic protocols and machine learning-driven solutions. His work addresses critical challenges in cybersecurity, including e-voting systems, fault-tolerant differential protection, and privacy-preserving communication protocols. He explores vulnerabilities in modern systems such as SSO permissions, JavaScript exploits, and stalkerware tools, while developing frameworks like MEGR-APT for APT detection and TEE-Receipt for non-repudiation. Youssef’s research integrates interdisciplinary approaches, combining cryptography with AI (e.g., vision transformers for power quality analysis) and leveraging trusted execution environments (TEE) for secure computing. His projects often involve collaboration with industrial standards (e.g., IEC 61850), emphasizing practical implementations in real-world systems.

• Applied Cryptography
• Network Security
• Cyber-Physical Systems Security
• +4 more

Noman Mohammed is an Associate Professor of Computer Science at the University of Manitoba’s Faculty of Science, leading the Data Security & Privacy (DSP) laboratory. He specializes in privacy-preserving techniques for data sharing, addressing challenges in healthcare, genomic, and financial data. In 2020, he received the Terry G. Falconer Memorial Rh Institute Foundation Emerging Researcher Award for his contributions to bridging privacy and data utility gaps. His research focuses on balancing data accessibility and individual privacy through technical solutions like federated learning, differential privacy, and secure genomic data processing. He emphasizes integrating policy guidelines with advanced technologies to mitigate privacy risks from interconnected data sources. Notable achievements include developing toolkits for data anonymization and federated learning frameworks, as well as advancing methods to secure cloud-based data storage and analysis. His work aligns with societal needs for robust privacy mechanisms in an era of expanding personal data collection. Future objectives involve addressing privacy challenges in emerging technologies, such as heterogeneous data integration and scalable systems for personal data management. Despite his research focus, he notably avoids social media platforms.

• Data Security
• Privacy-Preserving Techniques
• Healthcare Data Privacy
• +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.) .

• Cryptography
• Computer Security
• Coding Theory
• +7 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
• Computer Security
• Coding Theory
• +2 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.

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

Brett Hemenway Falk is a Researcher in the Department of Computer and Information Science at the University of Pennsylvania. He serves as director of the Crypto and Society Lab, focusing on privacy and security in digital environments and facilitating transparency and trust. His work combines rigorous mathematical approaches with practical implementations in cryptography and blockchain technology. Education: Sc.B. in Mathematics from Brown University Ph.D. in Mathematics from UCLA Research Interests include: Cryptography and secure multi-party computation protocols Blockchain technology (cross-chain interoperability, financial network stability, on-chain governance) Privacy-preserving algorithms and data security Coding theory applications in secure systems Scientific Contributions include: Developing practical secure computation protocols Advancing ORAM (Oblivious RAM) architectures Analyzing decentralized governance mechanisms Exploring DeFi network stability and token economics His teaching activities feature the popular MCIT 582 Blockchain course at Penn. Research funding comes from NSF, DARPA, IARPA, ONR, ARL, NIH , and the Laura and John Arnold Foundation.

• Cryptography
• Blockchain
• Computer Security
• +5 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.

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

Sharad Mehrotra is a Distinguished Professor at the University of California, Irvine (UCI), leading the Center for Emergency Response Technologies (CERT) and directing the NSF-funded RESCUE project. He previously served at the University of Illinois, Urbana-Champaign, and holds a Ph.D. from the University of Texas at Austin (1993). His research focuses on data management, IoT systems, privacy-preserving technologies, and smart spaces, with contributions to frameworks like TIPPERS and MARS. Education: Ph.D., Computer Science, University of Texas at Austin, 1993 Research Interests: His work bridges database systems, security, and IoT, emphasizing privacy in smart environments. Notable projects include sentient space technologies for disaster response, cryptographic methods for encrypted data queries, and semantic IoT integration. Recent efforts address privacy in multi-owner data systems and resilient community water infrastructure. Awards & Recognition: ACM Fellow (2024) SIGMOD Best Paper (2001), DASFAA Best Paper (2004) NAVWAR Innovation Award (2021) Outstanding Graduate Mentor (2005) Grants & Leadership: As RESCUE PI, he managed $12.5M NSF funding, developing crisis-response software deployed by emergency agencies. Collaborations include the Cal-IT2 institute (UCSD/UCI) and the US Navy’s TIPPERS platform. He co-leads initiatives like the NSF Civic Innovation Challenge for disaster resilience in aging communities. Labs & Teams: Directs UCI’s Information Systems Group and CERT, fostering interdisciplinary research with 60+ members. His teams produce open-source tools (e.g., SEMIoTIC, PrivacySphere) and engage in global partnerships via Fulbright Visiting Scholar programs.

• Data Management
• Distributed Systems
• Database as a Service
• +7 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.

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

Rafail Ostrovsky is the Norman E. Friedman Chair in Knowledge Sciences at UCLA Samueli School of Engineering, where he serves as a Distinguished Professor of Computer Science and Mathematics. He also directs the Center for Information and Computation Security at UCLA. His academic leadership extends to his role as a foreign member of Academia Europaea and his fellowship in multiple prestigious organizations including the National Academy of Inventors, AAAS, ACM, IEEE, and IACR. Professor Ostrovsky's research spans multiple domains in theoretical computer science, with primary focus on cryptography, secure computation, and algorithms. His work on garbled circuits, zero-knowledge proofs, and private information retrieval has had significant theoretical and practical impact. He has pioneered research in secure multi-party computation, oblivious RAM, and cryptographic protocols that maintain privacy while enabling complex computations on sensitive data. His research bridges theoretical foundations with practical applications in secure systems, ranging from database security to hardware-based cryptographic primitives. Ostrovsky's publication record shows a consistent trajectory of innovation in cryptographic theory and its applications. His recent work focuses on optimizing secure computation protocols for efficiency while maintaining strong security guarantees, with particular attention to communication complexity, round complexity, and practical implementations. He has made significant contributions to homomorphic encryption, non-malleable commitments, and zero-knowledge proofs, often developing techniques that transform theoretical constructs into practically viable solutions. 1993 Henry Taub Prize 2017 IEEE Computer Society Edward J. McCluskey Technical Achievement Award 2018 RSA Award for Excellence in Mathematics (RSA Prize) 2022 W. Wallace McDowell Award (highest award from IEEE Computer Society) Fellow of National Academy of Inventors, AAAS, ACM, IEEE, and IACR Foreign member of Academia Europaea With over 350 peer-reviewed publications and 16 issued USPTO patents, Professor Ostrovsky has significantly shaped the field of cryptography and secure computation. His mentorship has cultivated numerous students and postdocs who have gone on to make their own contributions to the field. His editorial roles on prestigious journals including Journal of ACM and Algorithmica reflect his standing in the theoretical computer science community. His leadership extends to chairing major conferences including FOCS 2011 and serving on over 40 international conference program committees. As Director of the Center for Information and Computation Security at UCLA, Professor Ostrovsky leads a team focused on advancing the theoretical foundations and practical applications of secure computation. His center serves as a hub for interdisciplinary research connecting cryptography with systems security, network protocols, and hardware security. The center's work spans from foundational cryptographic primitives to real-world applications requiring privacy-preserving computation.

• Cryptography
• Secure Computation
• Garbled Circuits
• +7 more

Dr. Dima Alhadidi is an Associate Professor in the School of Computer Science at the University of Windsor. His research focuses on Cybersecurity, Data Privacy, Machine Learning, and their applications in Health Informatics, Cloud Computing, and Smart Grids. He holds a PhD in Computer Science and Software Engineering from Concordia University (2010). His research interests include secure federated learning frameworks, privacy-preserving techniques for genomic and health data, and adversarial machine learning defenses. Notable contributions include Trustformer (2025), secure aggregation methods in federated learning, and hybrid malware classification using deep learning. Recent work emphasizes mitigating membership inference attacks and developing privacy-preserving analytics for distributed systems. Dr. Alhadidi actively advises graduate students on topics like social network clustering (NICASN 2022) and federated learning security. No scientific awards are explicitly listed. His research spans theoretical frameworks (e.g., λ_AOP calculus) to applied systems in smart grids and healthcare informatics.

• Cybersecurity
• Data Privacy
• Machine Learning
• +3 more

Petr Kuznetsov is a Professor at Telecom Paris (Institut Polytechnique de Paris), affiliated with the Department of Computer Science and Networks (INFRES). He leads the Autonomous Critical Embedded Systems (ACES) research team at the Information Processing and Communication Laboratory (LTCI). His work bridges theoretical foundations and practical applications in distributed systems. Research Focus: Kuznetsov specializes in distributed algorithms, synchronization protocols, failure detection mechanisms, and the application of algebraic topology to distributed computing. His recent work explores Byzantine fault tolerance, blockchain consensus, and concurrency in networking infrastructures. Recent Publication Trends (2015-2025): His articles predominantly focus on scalability and resilience in distributed systems, with emerging themes in blockchain technologies, Byzantine fault tolerance, and concurrency optimization. Theoretical contributions include computability theorems and complexity bounds, while applied work targets payment systems and distributed ledgers. Awards & Honors: Best Paper Award at DISC 2019 for Scalable Byzantine Reliable Broadcast Best Student Paper Award at PODC 2018 for An Asynchronous Computability Theorem for Fair Adversaries Projects & Advising: He directs the TrustShare Innovation Chair (large-scale data synchronization) and DISCMAT (mathematical foundations of distributed computing). Actively seeks PhD candidates for projects on distributed algorithms and concurrency. Laboratory & Teams: Heads the ACES team at LTCI, focusing on critical embedded systems and fault-tolerant distributed architectures. Collaborates internationally through workshops like SPTDC.

• Distributed Systems
• Algorithms
• Synchronization
• +3 more

Aarushi Goel is an Assistant Professor of Computer Science at Purdue University's Department of Computer Science, part of the College of Science. She joined the department in Fall 2024 and is affiliated with Purdue's main campus in West Lafayette, Indiana. Her research focuses on cryptographic protocols, with a strong emphasis on secure multiparty computation (MPC), zero-knowledge proofs, and distributed systems security. Her work addresses challenges in privacy-preserving computation, Byzantine fault tolerance, and efficient cryptographic systems. Notable research directions include optimizing MPC protocols for dynamic environments, minimizing communication overhead in distributed systems, and developing practical zero-knowledge proof frameworks. Recent publications explore topics like homomorphic secret sharing, sublinear prover protocols, and Byzantine agreement with polylogarithmic communication complexity. Dr. Goel's contributions often bridge theoretical cryptography with real-world applications, such as secure machine learning training and verifiable computation. Her work has implications for decentralized systems, blockchain technology, and privacy-enhancing technologies. No awards or grants are explicitly listed in the provided materials, but her prolific publication record indicates active engagement in cutting-edge research. She holds no listed advisees or students in the current data. Lab and team affiliations are not specified in the provided text, though her research likely involves collaborations within Purdue's computer science department and external institutions. Her office is located in LWSN 2142D on the Purdue campus.

• Cryptography
• Secure Multiparty Computation (MPC)
• Zero-Knowledge Proofs
• +3 more

Andrej Bogdanov is a Professor at the University of Ottawa in the School of Electrical Engineering and Computer Science . He earned his B.S. and M.Eng. from MIT and Ph.D. from UC Berkeley . Before joining Ottawa, he held positions at the Chinese University of Hong Kong , ITCS (Tsinghua) , DIMACS (Rutgers) , and the Institute for Advanced Study . He has served as a Visiting Professor at the Tokyo Institute of Technology (2013) and the Simons Institute (2017, 2021). Research Interests : Computational complexity, cryptography foundations, pseudorandomness, one-way functions, property testing, quantum algorithms, and sublinear-time algorithms. Teaching : Courses on Discrete Mathematics, Great Algorithms, Computational Complexity, and Cryptography at University of Ottawa, Chinese University of Hong Kong, and Rutgers University. Publications : 15+ recent works in TCC , CRYPTO , ICALP , RANDOM , and journals like Journal of Cryptology and Theory of Computing . Service : Program co-chair for SAC 2026 , and committee member for major conferences including CRYPTO , TCC , Eurocrypt , and FOCS . Advising : 12 current and former Ph.D./M.Phil. students, with postdoctoral advisees at institutions like IIT Palakkad and Academia Sinica . His work bridges theoretical computer science with applications in cryptography, quantum computing, and network security.

• Cryptography
• Computational Complexity
• Pseudorandomness
• +6 more