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.

Farzad MashayekView profile

Professor

• Turbulent Reacting Flow
• Plasma Flow
• Electrostatic Atomization
• +9 more

Farzad Mashayek is a Professor and Department Head of Aerospace and Mechanical Engineering at the University of Arizona, College of Engineering. He is a member of the Graduate Faculty and leads the Computational Multiphase Transport Laboratory. His research integrates high-fidelity simulations, machine learning, and experimental validation across diverse domains in fluid dynamics and energy systems. Educational Background: PhD in Mechanical Engineering, State University of New York at Buffalo, Buffalo, NY MS in Mechanical Engineering, Sharif University of Technology, Tehran, Iran BS in Mechanical Engineering, Sharif University of Technology, Tehran, Iran His research interests include turbulent reacting flows, plasma dynamics, electrostatic atomization, solid-ion and lithium batteries, computational fluid dynamics, and machine learning applications in engineering. He employs high-order spectral element methods, phase-field modeling, and deep neural networks to study complex multiphysics phenomena such as drop impact, battery degradation, and turbulence modeling. The recent publications reflect a strong trend toward integrating machine learning with multiphysics simulations, particularly in battery safety (thermal runaway prediction), materials characterization (STEM image analysis), and fluid dynamics (modal analysis of turbulence). His work often involves collaboration with experimental groups to validate models, especially in dental aerosol suppression and electrohydrodynamics. Scientific Awards: Sustained Service Award, American Institute of Aeronautics and Astronautics (AIAA), Spring 2022 Best Presentation Award, The 20th International Conference on Computational Mathematics, Parallel and Distributed Computing, Summer I 2018 Dr. Mashayek has secured funding from NSF (GOALI program) for controlled coating via charged droplet deposition. He advises graduate students and postdoctoral researchers in computational mechanics and energy systems, fostering interdisciplinary research. He has contributed to engineering education, particularly during the pandemic, with active learning strategies in online instruction. He leads a dynamic research team focused on advancing simulation tools and applying them to real-world challenges in energy, manufacturing, and public health.

Nils FleischhackerView profile

Assistant Professor

• Cryptography
• Theoretical Computer Science
• Zero-Knowledge Proofs
• +5 more

Nils Fleischhacker is an Assistant Professor for Cryptography at Ruhr University Bochum, where he leads the Theoretical Cryptography group within the Faculty of Computer Science. His research focuses on foundational aspects of cryptography with particular emphasis on zero-knowledge proofs, digital signatures, and secure computation. Prior to joining Ruhr University, he held postdoctoral positions at Johns Hopkins University and Carnegie Mellon University. Dr. Fleischhacker received his PhD in Computer Science from Saarland University in February 2017, advised by Dominique Schröder. During his doctoral studies, he was a research intern at Microsoft Research with Chris Brzuska and a research visitor at the University of Maryland, College Park with Jonathan Katz and Dana Dachman-Soled. His research spans theoretical cryptography with significant contributions to zero-knowledge proofs, multi-signature schemes, property-preserving hash functions, and security proofs for cryptographic primitives. Fleischhacker's work often addresses fundamental questions about the limits and possibilities of cryptographic constructions, with particular attention to black-box separations and lower bounds. His recent publications demonstrate a strong focus on lattice-based cryptography and post-quantum secure protocols. Fleischhacker's publications over the past five years reveal a consistent research trajectory focused on improving the efficiency and security of cryptographic primitives, with particular emphasis on signature schemes, zero-knowledge protocols, and secure computation frameworks. His work frequently appears in top-tier cryptography venues including CRYPTO, EUROCRYPT, and CCS. Dr. Fleischhacker actively mentors PhD students, with numerous successful graduations spanning from 2010 to 2024. His former PhD students include Önder Askin (2024), Floyd Zweydinger (2023), and Lars Schlieper (2022), among others. His research is supported through various academic channels and collaborations. He is affiliated with several prominent research organizations including the Horst Görtz Institute (HGI) for Information Security, the DFG Excellence Cluster CASA, the EU Marie Curie Network QSI, and the International Association for Cryptologic Research (IACR). These affiliations provide a strong institutional framework for his theoretical cryptography research.

Stefano TessaroView profile

Professor

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

Stefano Tessaro is a Professor in the Paul G. Allen School of Computer Science & Engineering at the University of Washington. He holds the Paul G. Allen Career Development Professorship. His research focuses on cryptography, theoretical computer science, and computer security, emphasizing practical applications of cryptographic techniques. He co-leads the cryptography group at UW with Andrea Coladangelo and Huijia Lin, and is part of the theory group. Education: PhD in Computer Science from ETH Zurich (2010) Postdoctoral researcher at MIT CSAIL (2010-2014) and UC San Diego (2014-2019) Joined UW in 2019 as faculty Research Interests: His work spans theoretical cryptography, privacy-preserving systems, cryptographic protocols, and security foundations. He explores practical applications of cryptography, including secure protocols, post-quantum cryptography, and efficient cryptographic constructions. Articles Trends: Recent publications emphasize threshold signatures, memory-tight security proofs, lattice-based cryptography, and privacy-preserving systems. Key themes include adaptive security, formal verification, and efficiency improvements in cryptographic protocols. Awards: NSF CAREER Award Sloan Research Fellowship Hellman Fellowship Research awards from Cisco, JP Morgan, and Microsoft Grants & Advising: His research has been supported by NSF grants and industry partnerships. He advises students in cryptographic theory and applications, though no specific student names are listed in the provided text. Labs & Teams: Co-leads the UW cryptography group, collaborating on projects like LERNA (secure aggregation) and Twinkle (threshold signatures). Engages with interdisciplinary teams in theoretical computer science and security.

Brian ConradView profile

Professor

• Number Theory
• Arithmetic Geometry
• Algebraic Geometry
• +3 more

Brian Conrad is a Professor of Mathematics at Stanford University, specializing in number theory and arithmetic geometry. He holds a position in the Department of Mathematics and has contributed extensively to algebraic geometry, algebraic number theory, and representation theory. His research encompasses foundational work on reductive groups, pseudo-reductive groups, and their applications in arithmetic contexts. Dr. Conrad is an editor for the Journal of the AMS, Algebra and Number Theory, and IMRN. He has organized numerous learning seminars, including those on étale cohomology and the BSD conjecture, and has taught advanced courses on algebraic geometry, class field theory, and modular forms. His work bridges classical algebraic geometry with modern arithmetic applications, emphasizing foundational proofs and geometric intuition. His editorial roles and seminar leadership reflect his commitment to advancing mathematical exposition and education. Education details are not explicitly provided in the texts, but his academic trajectory includes significant contributions to the field through publications and mentorship. Dr. Conrad's research has led to advancements in areas such as the classification of algebraic groups, étale cohomology, and the arithmetic of elliptic curves. His collaborative work with mathematicians like Chai, Oort, and Prasad has produced influential monographs, including Pseudo-reductive Groups and Complex Multiplication and Lifting Problems .

Benedikt BünzView profile

Assistant Professor

• Applied Cryptography
• Blockchain Technology
• Consensus Algorithms
• +4 more

Benedikt Bünz is an Assistant Professor of Computer Science at New York University's Courant Institute of Mathematical Sciences. He is also a co-founder and chief scientist of Espresso Systems, where he applies his research expertise to real-world blockchain solutions. His academic work bridges theoretical cryptography with practical blockchain implementations, focusing on enhancing privacy, security, and usability of decentralized systems. Dr. Bünz's research centers around applied cryptography, consensus mechanisms, and game theory as they relate to cryptocurrencies. His work spans zero-knowledge proofs, verifiable delay functions, secure multi-party computation, and privacy-preserving protocols. He has made significant contributions to Bulletproofs, a zero-knowledge proof system deployed on blockchains like Monero, and pioneered research in verifiable delay functions which are now part of Ethereum 2.0's design. His recent work focuses on recursive proof systems, accumulation schemes, and efficient verification techniques for blockchain scalability. His publication record shows a consistent progression from foundational cryptographic primitives to practical blockchain implementations. Recent work demonstrates increasing sophistication in recursive proof systems (ProtoStar, HyperPlonk), novel accumulation techniques (ARC, DewTwo), and foundational work on randomness generation (VDFs). His research consistently bridges theoretical cryptography with real-world blockchain applications, resulting in protocols that are both theoretically sound and practically implementable across multiple blockchain platforms. Dr. Bünz actively contributes to the academic community through teaching and mentorship. He teaches courses on cryptography of blockchains and computer security at NYU, providing students with hands-on experience in blockchain security and cryptographic protocols. His industry engagement through Espresso Systems demonstrates his commitment to translating academic research into practical solutions for the blockchain ecosystem.

Clark OlsonView profile

Professor

• Computer Vision
• Clustering Algorithms
• Robot Navigation
• +3 more

Clark Olson is a Professor in the Division of Computing & Software Systems at the University of Washington Bothell, part of the School of Science, Technology, Engineering & Mathematics. He earned his Ph.D. in Computer Science from UC Berkeley (1994), M.S. in Electrical Engineering (1990), and B.S. in Computer Engineering (1989) from the University of Washington, Seattle. Education: Ph.D. in Computer Science (2017) from University of California, Berkeley M.S. in Electrical Engineering (1990) from University of Washington, Seattle B.S. in Computer Engineering (1989) from University of Washington, Seattle His research focuses on computer vision, robot navigation, and clustering algorithms. He has developed techniques for Mars rover terrain mapping, subspace clustering, and geometric feature matching. His work bridges theory and application in autonomous systems and image analysis. Analysis of his publications reveals expertise in computer vision (8 papers), clustering algorithms (4 papers), and robotics (5 papers). Key subtopics include Mars exploration (3 papers), Hough transforms (3 papers), and probabilistic methods (3 papers). Professor Olson teaches courses ranging from introductory programming (CSS 161-162) to advanced topics in computer vision (CSS 487-587) and algorithm design (CSS 549). He also advises on the CSSE Capstone (CSS 497) projects requiring rigorous prerequisites and structured evaluation criteria.

David CashView profile

Professor

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

David Cash is a Professor in the Department of Computer Science at the University of Chicago. His research focuses on applied and theoretical cryptography, computer security, and theoretical computer science. He joined UChicago in 2018 and has held roles such as teaching courses in cryptography, computer security, and discrete mathematics. Cash has advised numerous PhD and master’s students, including Sam Everett, Alexander Hoover, and Jesse Stern. His work includes constructing quantum-secure cryptography systems, analyzing encrypted data navigation, and foundational theoretical results. He has received notable awards like the 2025 Quantrell Award for Teaching and multiple Best Paper awards at Eurocrypt. Cash's research also explores secure computation, oblivious RAM, and cryptographic agility. His affiliations include the Systems Group at UChicago, focusing on interdisciplinary systems research. Education details are not explicitly provided in the text. However, his career trajectory suggests advanced degrees in computer science or related fields. His teaching spans undergraduate and graduate courses, emphasizing both theoretical foundations (e.g., discrete mathematics) and applied topics like cryptocurrencies and secure systems. Cash actively engages in academic service, including organizing conferences and reviewing research. His work bridges theoretical insights with practical applications, addressing modern computational security challenges. His research contributions span cryptographic protocols, secure data structures, and privacy-preserving technologies. Notable projects include work on searchable encryption, leakage-abuse attacks, and cryptographic systems resilient to quantum computing. Cash collaborates with institutions like Rutgers University and has mentored postdoctoral researchers such as Alexander Hoover. His grants include NSF CAREER awards and Simons Institute fellowships, supporting research in secure outsourcing and cryptographic data protection.

John MacLaren WalshView profile

Professor

• Information Theory
• Network Coding
• Distributed Computing
• +4 more

John MacLaren Walsh is a Professor in the Department of Electrical and Computer Engineering at Drexel University, where he leads the Adaptive Signal Processing and Information Theory Research Group. He holds BS, MS, and PhD degrees from Cornell University, all completed under Dr. C. Richard Johnson, Jr. His research spans information theory, network coding, distributed computing, and machine learning applications in patent analysis. His work focuses on: Bounding entropic vectors and their impact on communication networks Rate region computation for network coding and distributed storage Information theory for distributed function computation Machine learning-enhanced patent processing systems Publications emphasize entropy geometry, network coding complexity, distributed algorithms, and patent analysis, with consistent themes of optimization and combinatorial methods. Recent work (2016-2019) shows increased focus on probabilistic supports and computational efficiency in network coding. Awards: 2011 NSF CAREER Award for 'Entropy Geometry in Variational Inference Signal Processing' He has advised PhD students on topics like entropy region mapping, network coding, and distributed control. Key grants include NSF CAREER and AFOSR funding for wireless network overhead control. He directs the Adaptive Signal Processing and Information Theory Research Group, which develops algorithms for network coding, distributed storage, and patent analysis systems.

• Information Theory
• Cryptography
• Lattice Theory
• +5 more

Cong Ling is a Professor of Information Theory and Cryptography at Imperial College London's Department of Electrical and Electronic Engineering, within the Faculty of Engineering. His research focuses on lattice theory and its applications in coding, cryptography, quantum information, and number theory. Key affiliations include the Academic Centre of Excellence in Cyber Security Research and the Engineering Secure Software Systems group. Education details are not explicitly provided in the text, but his professional experience indicates advanced qualifications in electrical engineering and mathematics. Research interests span lattice-based cryptography, post-quantum security, algebraic coding theory, and quantum-resistant algorithms. His work bridges information theory and number theory, with contributions to MIMO systems, secure communication protocols, and cryptographic protocol design. Recent publications emphasize lattice reduction techniques, quantum algorithms for the shortest vector problem, and advancements in polar codes. Notable trends include exploration of non-commutative algebras for cryptography, Gaussian sampling optimizations, and hybrid quantum-classical approaches to hard integer problems. Over 50+ articles published since 2018 reflect his leadership in lattice-based research and quantum-safe technologies. Awards: None explicitly listed in the text. Grants/Advising: No specific grants or student advisees mentioned; focus remains on collaborative research outputs. Labs/Teams: Associated with Imperial's Cyber Security Research groups and quantum engineering initiatives.

Jens GrothView profile

Academic

• Cryptography
• Cryptographic Protocols
• Zero-Knowledge Proofs
• +5 more

Jens Groth is an Honorary Professor at the Department of Computer Science, University College London (UCL), and serves as Chief Scientist at Nexus. His primary research focuses on cryptography, with an emphasis on cryptographic protocols, zero-knowledge proofs, and privacy-preserving technologies. Groth has contributed significantly to advancements in digital signatures, homomorphic encryption, and secure multi-party computation. He holds a leadership role as Program Chair for the 15th IMA International Conference on Cryptography and Coding (2015) and has been a key figure in shaping modern cryptographic standards. His work often bridges theoretical foundations with practical implementations, emphasizing efficiency and security. Groth's research interests include but are not limited to: cryptographic protocol design, lattice-based cryptography, and the application of zero-knowledge proofs in real-world systems such as blockchain and voting systems. His publications span venues like CRYPTO, EUROCRYPT, and ASIACRYPT, reflecting his impact on the field. Notably, he advocates for open access to research and has contributed to strategies ensuring conferences adopt de facto open-access policies. His current focus at Nexus centers on verifiable computation and distributed cryptographic systems.

Pratyush MishraView profile

Assistant Professor

• Cryptography
• Computer Security
• Zero-Knowledge Proofs
• +2 more

Pratyush Mishra is an Assistant Professor at the University of Pennsylvania in the Department of Computer and Information Science, where he is affiliated with the Security and Privacy Laboratory. His research focuses on the intersection of cryptographic proof systems and computer security , particularly on efficient implementations of zero-knowledge proofs and secure computation protocols. Pratyush completed his PhD in Computer Science at UC Berkeley , advised by Alessandro Chiesa and Raluca Ada Popa , and holds a BSc in EECS from UC Berkeley, where he worked with David Wagner . His current research group includes PhD students Anubhav Baweja , Tushar Mopuri , Bharath Namboothiry , and Alireza Shirzad , along with Matan Shtepel , a former research assistant who moved to CMU for his PhD. His work spans advanced cryptographic techniques like zkSNARKs , accumulation schemes , and private delegation of provers , with applications in decentralized systems and secure inference. His recent publications focus on optimizing polynomial commitments , read-write streaming for SNARKs, and horizontally scalable proofs . Key awards include: ACM SIGSAC Doctoral Dissertation Award Runner-Up (2022) CSAW Applied Research Award (2016) for Hidden Voice Commands He teaches courses like CIS 5560: Cryptography and 7000-2: Theory and Practice of Succinct Zero Knowledge Proofs , covering topics such as symmetric cryptography, public-key encryption, digital signatures, zero-knowledge proofs, and secure multiparty computation. His lab contributes to the arkworks ecosystem for zero-knowledge proof libraries and co-founded the startup Aleo based on his research.

• Computational Mathematics
• Numerical Analysis
• Tsunami Modelling
• +5 more

Stephen Roberts is a Professor at the Australian National University (ANU) in the College of Science, Department of Mathematics. He is the lead developer of the ANUGA open-source hydrodynamic modeling software, which simulates dam breaks, floods, and tsunamis for governments and engineers. Roberts has made significant contributions to computational mathematics, particularly in numerical methods for partial differential equations, sparse grid data fitting, and finite element approximations scaling to millions of data points. MSc, Flinders University (1980) PhD, University of California, Berkeley (1985) His research interests include: Computational methods for shallow water wave equations Development of Python-based scientific computing frameworks Global sensitivity analysis and uncertainty quantification Adaptive mesh algorithms for fluid dynamics Recent publications focus on energy-stable numerical schemes, multiscale flood simulation, and convergence analysis in sensitivity methods. Roberts actively collaborates with environmental agencies and has led major computational science education programs at ANU. Stephen serves as Treasurer of the Computational Mathematics Group (ANZIAM) and leads projects in: Parallelization of hydrodynamic models CO2 leak detection via atmospheric measurements Optimization of sparse grid combinations His work combines theoretical advancements with real-world applications in disaster risk reduction and climate policy.

Jennifer K. RyanView profile

Professor

• Numerical Analysis
• High-Order Numerical Methods
• Discontinuous Galerkin Methods
• +4 more

Jennifer K. Ryan is a Professor and Division Head for Numerical Analysis, Optimization & Systems Theory at the Department of Mathematics, KTH Royal Institute of Technology, Stockholm. She is affiliated with the Digital Futures Faculty, a cross-disciplinary research center jointly established by KTH, Stockholm University, and RISE Research Institutes of Sweden. Her research focuses on developing numerical schemes for extracting enhanced accuracy from simulations, with applications in imaging, data analysis, and fluid dynamics. Ryan’s work emphasizes improving computational efficiency through theoretical insights and practical algorithms. Her academic roles include teaching courses like Numerical Methods for Differential Equations II and supervising student projects in numerical analysis. She has contributed to the SIAC MAGIC toolbox, a software package for accuracy-enhancing filtering techniques. Ryan’s research group actively explores discontinuous Galerkin methods, SIAC filtering, and multi-resolution analysis, addressing challenges in computational physics and engineering. Her publications span high-order numerical methods, mesh adaptivity, and applications in plasma physics and wave equations. Projects include error estimation for boundary integral methods and developing filters for noisy data. Ryan collaborates internationally, contributing to both theoretical advancements and practical implementations in computational science.

Markus LandView profile

Academic

• Algebraic Topology
• Homotopy Theory
• K-Theory
• +3 more

Markus Land is a Tenure Track Professor at the Department for Mathematics, Ludwig Maximilian University of Munich, affiliated with the Algebraic Geometry Working Group. His research bridges algebraic topology, homotopy theory, and K-theory, focusing on their interplay with L-theory and manifold topology. He has held postdoctoral positions at the University of Copenhagen (supported by an EU Marie Curie Fellowship and DFG Grant) and the University of Regensburg, and earned his PhD at the University of Bonn under Wolfgang Lück. Education : PhD in Mathematics (University of Bonn, 2016) Positions : Postdoctoral (University of Copenhagen, 2019–2022; University of Regensburg, 2016–2019) Research Interests : Markus Land explores algebraic topology and homotopy theory , particularly algebraic K-theory , hermitian K-theory , and their connections to L-theory and manifold topology . His work often applies infinity-categories to foundational problems in operator K-theory and geometric topology. Recent Publications : His research includes groundbreaking studies on chromatic localization in K-theory, Grothendieck-Witt groups in ring theory, and additivity in cobordism categories . Collaborations with leading mathematicians like Georg Tamme and Ulrich Bunke highlight interdisciplinary approaches to algebraic and geometric problems. Awards & Grants : EU Marie Curie Individual Fellowship (2020–2022) DFG Individual Research Grant (2019–2020) Teaching & Academic Leadership : He has designed advanced courses including Topology I–V , Algebraic K-Theory , and Condensed Mathematics , emphasizing homotopy theory and infinity-categories . Future initiatives include student seminars on arithmetic and algebraic geometry to foster academic collaboration. Working Group : As part of the Algebraic Geometry Working Group at LMU Munich, he contributes to seminars and research projects on arithmetic geometry , manifold classification , and spectral algebra .