Jelani Nelson is a Professor and Department Chair in the UC Berkeley EECS Department (College of Engineering). His work focuses on theoretical computer science , particularly algorithms , data streams , dimensionality reduction , and privacy-preserving computation . Advising : Current students include Ishaq Aden-Ali, Xin Lyu, Mihir Singhal, and Hongxun Wu (co-advised with leading researchers). Education : PhD from MIT (George M. Sprowls Award), M.Eng from MIT. Research Highlights : Developed foundational results in Johnson-Lindenstrauss dimensionality reduction (optimality, sparse embeddings). Advancements in differential privacy (lower bounds, private mean estimation, threshold learning). Pioneering work on streaming algorithms for heavy hitters, norm estimation, and graph problems. Innovations in compressed sensing and oblivious subspace embeddings . Scientific Awards : PODS Best Paper Award (2011, 2022) IBM Pat Goldberg Memorial Best Paper Award (2011) George M. Sprowls Award for MIT doctoral thesis (2009) NeurIPS 2020 Spotlight Presentation
Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.
Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.
Ben Fisch is an Assistant Professor of Computer Science at Yale University's School of Engineering & Applied Science. He is also the co-founder of Espresso Systems, a company focused on blockchain infrastructure. His research focuses on privacy and verifiability in decentralized systems like Bitcoin and Ethereum, with applications in digital finance and healthcare. Dr. Fisch received his B.A. from the University of Pennsylvania and completed his Ph.D. at Stanford University, where he worked with Dan Boneh in the applied cryptography research group. His educational background provided the foundation for his work at the intersection of cryptography, distributed systems, and economics. His research centers on leveraging cryptographic tools such as succinct non-interactive zero-knowledge proofs (zk-SNARKs), private information retrieval, and homomorphic encryption to address challenges in verifiable computation, verifiable storage, and verifiable fairness. He has made significant contributions to verifiable delay functions (VDFs) and proofs of replication, which have been adopted by major blockchain projects including Ethereum 2.0, Chia, and Filecoin. His work on Filecoin's Proofs of Replication has helped the network reach over 1.5 exabytes of storage capacity. His publication record shows a clear trend toward increasingly sophisticated cryptographic protocols for blockchain applications, with recent work focusing on data availability for Bitcoin rollups, efficient folding schemes for pairing-based arguments, and privacy pools with proof-carrying disclosures. His research bridges theoretical cryptography with practical implementations that have real-world impact in decentralized systems. His notable recognition includes: Best Paper Finalist at ACM CCS 2017 for 'Iron: Functional Encryption using Intel SGX' Dr. Fisch's research has led to significant technology transfer, most notably with his work on Verifiable Delay Functions (VDFs) sparking a multimillion dollar industry initiative through the VDF Alliance. His research on Proofs of Replication forms the basis of Filecoin's incentive layer and consensus protocol. His newer SNARK system Basefold is being used by several commercial products. He maintains active collaborations across academia and industry, with publications spanning top conferences in cryptography and security. As co-founder of Espresso Systems, Dr. Fisch leads a team developing next-generation blockchain infrastructure, particularly focusing on sequencing layers for rollups. His work bridges academic research with practical implementation, ensuring that theoretical advances in cryptography find real-world applications in decentralized systems.
Jaclyn Lang is the Selma Lee Bloch Brown Assistant Professor of Mathematics at Temple University. Her research centers on algebraic number theory, focusing on modular forms, Galois representations, elliptic curves, motives, and p-adic methods. Education: Ph.D. in Mathematics, UCLA (2016), advised by Haruzo Hida Part III of the Mathematical Tripos, University of Cambridge (2010), supervised by Tom Fisher MA in Mathematics, Bryn Mawr College (2009), supervised by Helen Grundman Research Interests: She works on advanced problems in number theory, including the Eisenstein ideal, pseudorepresentations, and arithmetic geometry of elliptic curves. Her work often bridges algebraic geometry and automorphic forms using p-adic techniques. Scientific Awards: Churchill Scholarship (2009–2010) Clare Booth Luce Scholarship (2007–2009) NSF Graduate Research Fellowship (2010–2015) Charles E. and Sue K. Young Graduate Student Award (2015) NSF Mathematical Sciences Postdoctoral Research Fellowship (2016–2020) AWM Travel Grant (2023) Fulbright U.S. Student Program Grant (2016) Simons Travel Support for Mathematicians (2023–2028) Grants: She has received NSF Standard Grant DMS-331117 (2023–2026) and participated in programs like the Park City Math Institute and Women in Numbers Europe (WINE3).
Assoc Prof Ng Teng Yong is an Associate Professor at the School of Mechanical & Aerospace Engineering (NTU), specializing in numerical modeling and simulation. With a background as Research Manager at A*STAR Institute of High Performance Computing, his work spans materials science, nanotechnology, and aerospace engineering. Current focus on graphene-based desalination membranes Expertise in molecular dynamics simulations Investigates nanoscale fluid mechanics and structural dynamics Recent publications highlight advancements in energy-efficient electrodialysis, smart robotics, and nonlinear vibration analysis. His interdisciplinary approach integrates computational methods with experimental validation in additive manufacturing and soft material mechanics.
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.
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.
David Jao is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His research focuses on post-quantum cryptography, particularly leveraging isogenies of supersingular elliptic curves for secure cryptographic protocols. He is renowned for co-developing the Supersingular Isogeny Key Encapsulation (SIKE) protocol, a leading candidate for post-quantum cryptography standards. His work spans theoretical foundations and practical implementations, including optimizing isogeny-based systems for embedded devices and ARM processors. Research interests include isogeny-based cryptosystems, elliptic curve cryptography, zero-knowledge proofs, and cryptographic security against quantum attacks. He explores applications of expander graphs and Ramanujan graphs in cryptography, alongside algorithmic improvements for cryptographic protocols such as SIDH (Supersingular Isogeny Diffie-Hellman). Key contributions include advancements in key compression techniques for SIKE, side-channel attack mitigation, and formalizing security models for post-quantum key exchange. His publications analyze cryptographic hardness assumptions, such as the discrete logarithm problem in finite groups and the semidirect product structure in isogeny-based systems. Jao’s work bridges theoretical mathematics and applied cryptography, with a focus on ensuring practical security in next-generation cryptographic systems. His research addresses challenges in quantum-resistant authentication, key establishment, and digital signatures, often emphasizing efficiency and resistance to both classical and quantum attacks.
Valter Moretti is a Full Professor in the Department of Mathematics at the University of Trento. His academic career spans roles from Research Fellow to Full Professor, focusing on Mathematical Physics and Quantum Field Theory (QFT) in curved spacetime. He earned an MSc in Physics from Genova University and a PhD in Theoretical Physics from Trento University. Research Interests : Algebraic QFT, General Relativity, Quantum Mechanics, Operator Algebras, and Spectral Theory. His work bridges mathematical rigor with physical applications, particularly in quantum localization, entanglement, and curved spacetime phenomena. Publications : Authored 15+ recent papers on topics like quantum particle localization, entanglement certification, and QFT on curved backgrounds. Collaborated on a 2022 patent for generating entangled photon states. Awards : Holds a patent for a quantum-certified random number generator (2022). Supervision : Advised 8 PhD students, including N. Pinamonti, L. Franceschini, and C. van de Ven. Coordinated national and international research projects (e.g., H2020-MSCA-COFUND-2015). Labs & Collaborations : Affiliated with INFN, TIFPA-INFN, and Q@TN (Quantum@Trento). Organized conferences like Quantum Physics and Geometry (2014) and Quantum Machine Learning (2023). Teaching : Lectures on Analytical Mechanics, Quantum Relativistic Theories, and Special Relativity. Authored textbooks on Spectral Theory and Quantum Mechanics.
Lawrence C. Washington is a Professor of Mathematics at the University of Maryland, College Park . His office is located in Mathematics Building 1105, and he can be reached at lcw@math.umd.edu . Teaching & Courses: In Spring 2023 he is teaching Cryptography 456 (TuTh 11:00–12:15) and co-organising the Algebra Seminar (MW 2–3). Office hours are held Tuesdays 1:30–2:30 and Thursdays 10:00–10:50. Research Interests: His work centres on number theory , with particular emphasis on cyclotomic fields , elliptic curves , cryptology , and Iwasawa theory . He has made extensive contributions to the study of p-adic L-functions , class groups , heuristics for class numbers , and the arithmetic of elliptic curves, often bridging deep theoretical questions with computational investigations. Textbooks & Scholarly Output: Washington is the author of several widely-used textbooks: Introduction to Cryptography with Coding Theory (3rd ed.) Introduction to Cyclotomic Fields Elliptic Curves: Number Theory and Cryptography An Introduction to Number Theory with Cryptography (2nd ed.) Elementary Number Theory Recent Publication Trends: Over the past five years his papers have focused on heuristics for Iwasawa invariants , anti-cyclotomic extensions , class groups of real cyclotomic fields , and analytic estimates for sums of prime powers . The work is characterised by a synthesis of algebraic, analytic, and computational techniques, frequently yielding explicit examples and numerical data that inform broader conjectures in algebraic number theory. Extracurricular Interests: Outside mathematics, Washington enjoys running and playing the bassoon , and he maintains a light-hearted page devoted to his favourite intersection in Chevy Chase, MD. Advising & Grants: While the provided text does not enumerate individual students or specific grants, his extensive publication record and long-standing professorship indicate ongoing supervision of graduate research and participation in funded projects in number theory and cryptography.
Giorgis Petridis is an Associate Professor at the University of Georgia, specializing in arithmetic combinatorics, a field rooted in combinatorial number theory with modern extensions into discrete analysis and finite field geometry. Born in Athens, Greece, he earned his PhD from the University of Cambridge under Tim Gowers and held a Visiting Assistant Professor position at the University of Rochester. He serves as an editor for Combinatorial Theory and is affiliated with the Number Theory and Arithmetic Geometry group, particularly its additive combinatorics and discrete analysis subgroup. Doctor of Philosophy (2011), University of Cambridge Certificate of Advanced Studies in Mathematics (2002), St John’s College, Cambridge BA (Hons) in Mathematics (2001), St John’s College, Cambridge His research focuses on additive combinatorics, exploring sumset estimates, polynomial configurations in prime lattices, and geometric incidence problems over finite fields. He investigates combinatorial geometry, including pinned distance problems and bisector arrangements, while also contributing to exponential sum bounds and expander graph theory. His work bridges theoretical mathematics with applications in pseudorandomness and discrete geometry. Recent publications highlight trends in finite field analysis, with 6 of 15 articles addressing arithmetic structures in prime-order fields. Key keywords include Combinatorics , Number Theory , and Finite Fields , with sub-fields spanning polynomial configurations, energy bounds, and geometric combinatorics. Scientific awards include the Creative Research Medal (2024) from the University of Georgia for mid-career research impact. Grants from the Simons Foundation (MPS-TSM-00007816) and multiple NSF DMS Awards (2054214, 1723016, 1500984, 1804049) support his work on discrete analysis and conferences. He co-advises five PhD students and has supervised multiple Master’s theses on topics like point-plane incidences and additive energy. Outreach includes leading high school math teams, organizing discrete analysis sessions, and contributing to public science communication guides.
Joachim Rosenthal is a Professor of Applied Mathematics at the University of Zurich's Department of Mathematics, leading the Applied Algebra Group. His research integrates coding theory, cryptography, and algebraic geometry with applications in communications and security systems. His primary research explores algebraic coding theory including convolutional codes, subspace codes, and post-quantum cryptography. He develops algorithms for error correction, code optimization, and cryptographic protocol analysis, with emphasis on mathematical structures in finite fields and rings. Professor Rosenthal serves as President of the Swiss Mathematical Society (2024-2025) and sits on IEEE Information Theory Society's Board of Governors. He has organized multiple international conferences on coding theory and cryptography, including the Zurich COST Meeting and Workshop on Convolutional Codes. His editorial contributions include roles at Archiv der Mathematik and SIAM Journal on Applied Algebra and Geometry. Recent publications focus on code construction methods, complexity analysis in group-based cryptography, and algebraic approaches to error-correcting codes.
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.) .
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.
