Florian Kerschbaum is a Professor and NSERC/RBC Industrial Research Chair in Data Security at the Cheriton School of Computer Science, University of Waterloo. His research focuses on data security and privacy, applied cryptography, and confidentiality in data science. Research interests span data collection/preparation management, secure multi-party computation, homomorphic encryption, differential privacy, and machine learning robustness/privacy. His work develops cryptographic solutions for practical data management challenges in distributed systems.
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.
Nadia Polikarpova is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego . She earned her PhD from ETH Zurich in 2014 under Bertrand Meyer , followed by postdoctoral research at MIT CSAIL with Armando Solar-Lezama . Her academic contributions have been recognized with prestigious awards including the 2020 Sloan Fellowship , 2020 Intel Rising Stars Award , and 2020 NSF CAREER Award . Polikarpova's research focuses on program synthesis , program verification , and type systems . She leads the Programming Systems group at UCSD and contributes to the IFIP Working Group 2.8 on Functional Programming since 2022. Her work spans foundational research and practical tools, including projects like Synquid , SuSLik , and Laurel that combine formal methods with machine learning for code generation. Her recent publications in venues like OOPSLA , NeurIPS , and ICFP reveal trends in AI-assisted programming , live programming environments , and formal verification . She has advised numerous PhD and Master’s students including Shraddha Barke , Zheng Guo , and Tristan Knoth , many of whom have moved to prominent academic and industry positions. Notable artifacts from her lab include tools like ColDeco for spreadsheet inspection and Superfusion for eliminating intermediate data structures. 2020 : Sloan Fellow 2020 : Intel Rising Stars Award 2020 : NSF CAREER Award 2021 : Distinguished Paper at POPL 2023 : Distinguished Artifact at PLDI 2023 : Distinguished Paper at OOPSLA Polikarpova actively contributes to academic service, serving on program committees for PLDI , POPL , and OOPSLA , and co-chairing the OOPSLA Review Committee in 2023. She has delivered keynotes at APLAS'20 and PLDI'24 , emphasizing the integration of large language models with formal methods.
James C. Hoe is Professor of Electrical and Computer Engineering at Carnegie Mellon University (College of Engineering). He is on sabbatical at MangoBoost and directs research in computer architecture, reconfigurable computing, and high-level hardware design. Education Ph.D., Electrical Engineering and Computer Science, MIT (2000) M.S., Electrical Engineering and Computer Science, MIT (1994) B.S., Electrical Engineering and Computer Science, UC Berkeley (1992) Research Interests Professor Hoe’s work spans computer architecture , reconfigurable computing , FPGA architectures , and high-level hardware synthesis . His group created the CoRAM abstraction for virtualized FPGA computing and leads efforts in power-efficient accelerators, in-network computing, and security-oriented FPGA systems. Scientific Awards IEEE Fellow (2013) Intel Outstanding Researcher Award (2021) Research Funding & Projects Intel / VMware Crossroads 3D-FPGA Academic Research Center – co-leading exploration of FPGA roles in future datacenters. DARPA BRASS program ($2.7 M, 4 years) – ensuring long-lived software systems remain robust to resource changes. Pigasus open-source IDS – world’s fastest FPGA-accelerated intrusion-detection system (100 Gb/s on one server). Labs & Teams He heads activities within the Computer Architecture Lab at Carnegie Mellon (CALCM) , supervising graduate researchers on CoRAM++, SPIRAL autotuning, and FPGA overlays for stream processing.
Alexandra Boldyreva is a Professor at the Georgia Institute of Technology, holding joint appointments in the School of Cybersecurity and Privacy and the School of Computer Science. She serves as Associate Chair for Graduate Studies in the School of Cybersecurity and Privacy and coordinates the Information Security Master’s program in the College of Computing. Her affiliations include the Institute for Information Security & Privacy (IISP), the Algorithms, Combinatorics and Optimization (ACO) program, and the Algorithms and Randomness Center (ARC). She earned her Ph.D. in Computer Science from the University of California, San Diego, and holds bachelor’s and master’s degrees in applied mathematics from St. Petersburg State Technical University, Russia. Her research focuses on cryptography and information security, with notable contributions to encryption methods, authentication protocols, and privacy-preserving systems. Boldyreva’s work emphasizes provable security analysis of protocols like FIDO2 and TLS 1.3, as well as searchable encryption and data privacy techniques. Her recent studies include secure communication channel establishment, leakage quantification in encryption systems, and applications of fuzzy search in encrypted databases. She has received Test of Time Awards for foundational contributions to cryptography. Boldyreva leads initiatives in cybersecurity education and has secured grants for research in secure communication protocols and human-computing approaches to key exchange. Her interdisciplinary collaborations span computer science, mathematics, and privacy engineering.
Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.
Prof. Sanjam Garg is an Associate Professor at the University of California, Berkeley in the Computer Science Division under the College of Engineering. His work focuses on cryptography and its applications to security and privacy , with affiliations to the Berkeley Center for Responsible, Decentralized Intelligence (RDI) and the Simons Institute for the Theory of Computing (SITC). Education: Ph.D., Computer Science, University of California, Los Angeles (2013) B.Tech, Computer Science and Engineering, Indian Institute of Technology, Delhi (2008) His research spans cryptography , secure computation , and zero-knowledge proofs , with recent publications on threshold encryption , zkSNARKs , and private set intersection . Trends in his work emphasize blockchain security , obfuscation , and secure multiparty computation . Scientific Honors: ACM Doctoral Dissertation Award (2013) Sloan Research Fellowship (2020) Okawa Research Grant (2016) IACR EUROCRYPT Best Paper Award (2013) FOCS Test of Time Award (2023) Bakar Fellows Spark Award (2023) Prof. Garg has advised researchers like James Bartusek (2024), Akshayaram Srinivasan (2020), and Peihan Miao (2019), who are now at institutions such as Microsoft Research and University of Toronto. He teaches CS 170 on algorithms at Berkeley.
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.
Assia Mahboubi is a tenured researcher ( directrice de recherche ) at INRIA in the Gallinette team, Nantes, France, and an endowed professor in the Algebra and Number Theory section of the Vrije Universiteit Amsterdam, Netherlands. Her work bridges theoretical computer science and formal mathematics, with significant contributions to proof assistants and formal verification. Her research focuses on the foundations and formalization of mathematics in type theory, particularly on the automated verification of mathematical proofs. She explores the interplay between computer algebra and formal proofs, and is a key contributor to the Rocq prover (formerly Coq) and the Mathematical Components libraries. Her work often examines how familiar mathematical objects can be optimally represented for computer-aided proof checking. Recent publications show a strong trend toward categorical reasoning, diagram chasing, and continuity properties in constructive type theory, with increasing focus on practical applications of formal methods in computational mathematics. Her work demonstrates the maturation of formal verification techniques from theoretical foundations to practical tools for mathematical research. ERC Consolidator grant for the FRESCO (Fast and Reliable Symbolic Computation) project Mahboubi actively supervises doctoral students including Vojtěch Štěpančík, Tomás Vallejos Parada, and Alain Chavarri Villarello. She has received significant research funding through her ERC Consolidator grant for the FRESCO project, which aims to develop fast and reliable symbolic computation techniques. She is deeply involved in the international research community, serving on program committees for major conferences including POPL, CPP, and ICFP. She leads research in the Gallinette team at INRIA, which focuses on the intersection of proof assistants, programming languages, and formal mathematics. Her work has helped establish formal verification as a practical tool for mathematical research, moving beyond theoretical foundations to real applications in computational mathematics.
Kristofer Pister is a Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He co-directs the Berkeley Sensor and Actuator Center (BSAC) and the Ubiquitous Swarm Lab. His career spans groundbreaking innovations in Micro/Nano Electro Mechanical Systems (MEMS), Control Systems, and Low-Power Circuits, with a focus on Smart Dust and synthetic insects. Education: Ph.D. and M.S. in EECS from UC Berkeley (1992, 1989); B.A. in Applied Physics from UC San Diego (1986). His research areas include MEMS , Control Systems , Robotics , and Integrated Circuits , with recent work on self-powered micro-sensors, crystal-free radios, and interplanetary swarm networks. Key awards include the ISA Albert F. Sperry Founder Award (2009) , Alexander Schwarzkopf Prize (2006) , and the NSF CAREER Award (1996) . He has authored numerous influential publications in wireless sensor networks and microrobotics. His lab, Ubiquitous Swarm Lab , explores distributed robotics and swarm intelligence. Pister emphasizes open collaboration in research, ethical conduct in academia, and efficient resource utilization for graduate students.
Andrew Miller is an Associate Professor in the Electrical and Computer Engineering department at the University of Illinois, specializing in Programming Languages, Formal Methods, Software Engineering, Security and Privacy, and Systems and Networking. His research focuses on blockchain technologies, cryptography, and secure systems. Professor Miller's research spans multiple critical areas in modern computer security. His work primarily focuses on blockchain technologies , where he has made significant contributions to understanding and improving the security, privacy, and performance of systems like Bitcoin and Ethereum. He has conducted empirical analyses of privacy in the Lightning Network and developed protocols for confidential smart contracts. His work in cryptography includes research on multiparty computation, zero-knowledge proofs, and formal methods for cryptographic protocol design. Miller also investigates security vulnerabilities in proof-of-stake systems and resource exhaustion attacks, contributing to the robustness of decentralized systems. His applied security research extends to privacy-preserving health applications, as evidenced by his work on the Safer Illinois platform for COVID-19 contact tracing. Miller's publication record demonstrates consistent contributions to top security and systems venues including IEEE Security & Privacy, ACM CCS, Financial Cryptography, and USENIX Security. His research shows a clear trajectory from foundational work in blockchain security to more applied systems addressing real-world privacy and security challenges. Recent work focuses on making multiparty computation services publicly auditable and developing decentralized identity solutions that maintain compatibility with existing systems. Distinguished Reviewer Award, IEEE Security & Privacy 2018 Professor Miller has advised students including Vivek Nair, who joined the prestigious Hertz Fellows program in 2022. He has taught various courses including Introduction to Algorithms & Models of Computation, Advanced Computer Security, Cryptography, Applied Cryptography, and Ideal Functionality in Cryptography. His research has received support through grants including the SaTC: CORE: Medium project on "Automated Support for Writing High-Assurance Smart Contracts" in 2018. Miller is actively involved in research groups focusing on blockchain security, cryptographic protocols, and privacy-preserving systems. His lab appears to collaborate extensively with researchers across multiple institutions, as evidenced by the diverse author lists on his publications. Current work seems to be focused on making decentralized systems more secure, privacy-preserving, and accessible for real-world applications.
Prof. Bryan Ford leads the Decentralized/Distributed Systems (DEDIS) lab at EPFL. He focuses on secure decentralized systems, including blockchain technology, privacy, and systems security. He earned his Ph.D. from MIT and held faculty positions at Yale University and EPFL. His work spans distributed consensus protocols, peer-to-peer networking, and privacy-preserving systems. Key projects include QuePaxa (timeout-free consensus), UIA (global connectivity for mobile devices), and MedCo (secure healthcare data sharing). He advises numerous PhD students and contributes to open-source projects like Bitcoin collective signing and privacy networks like Riffle. Education: Ph.D., MIT; Postdoctoral work at Yale Research interests include blockchain scalability, consensus algorithms, and cryptographic privacy. His lab develops systems like TRIP for coercion-resistant voting and F3B to mitigate blockchain front-running. His work on NAT traversal and peer-to-peer protocols (e.g., STUN/ICE) remains foundational in network architecture. He emphasizes practical, auditable security solutions such as CertiKOS and atomic cross-chain transactions (Atom). Notable contributions: CoSi (collective signing), OmniLedger (sharded blockchain), and privacy-preserving protocols like PURBs (Protected Unsealable Recursive Boxes). His lab collaborates with Swiss Post to audit e-voting systems and designs democratic cryptocurrencies like PoPCoin.
Prof. Dr. Sebastian Steinhorst is an Associate Professor (W3-level with tenure) at the Technical University of Munich (TUM) within the Embedded Systems and Internet of Things group at the TUM School of Computation, Information and Technology . His research focuses on advancing the security, predictability, reliability, and interoperability of smart connected and autonomous systems, particularly for applications in Internet of Things (IoT) , Industry 4.0 , and automotive systems . PhD in Computer Science (2011) from Goethe University Frankfurt Postdoctoral roles at TUMCREATE Singapore (2011-2016) and Aarhus University (2016) Joined TUM in 2016 as Rudolf Moessbauer Tenure Track Professor His research areas include decentralized embedded systems, hardware/software co-design, modeling and verification of cyber-physical systems, security protocols for automotive networks, and time-sensitive networking (TSN) for industrial applications. Recent work explores blockchain-based data sovereignty, zero-knowledge proofs for vehicle authentication, and resilient architectures for autonomous systems. Key scientific contributions include the 2019 ACM TODAES Best Paper Award and pioneering work on CyberSecDome , LeapChain , and Simutack frameworks. He serves on editorial boards and conference committees, including co-organizing the Autonomous Systems Design initiative at DATE. His teaching portfolio spans lectures on System Design for IoT , Software Architecture for Distributed Systems , and IoT Security across multiple semesters. He also leads advanced seminars on embedded systems and IoT.
Sean Welleck is an Assistant Professor at Carnegie Mellon University's School of Computer Science, Language Technologies Institute, leading the L3 Lab. His research focuses on bridging informal and formal reasoning with AI, spanning machine learning for mathematics and code, inference algorithms, and AI agents. PhD in Computer Science from New York University (advised by Kyunghyun Cho) Postdoctoral work at University of Washington (advised by Yejin Choi) His work explores AI-driven formal methods for mathematics and code generation, test-time compute scaling, and algorithms enabling AI improvement over time. Recent publications analyze reasoning evaluation, premise selection, and automated proof optimization in systems like Lean. Key article trends include neural theorem proving, code generation, and inference-time compute optimization. Awards: NVIDIA AI Labs Pioneering Research Awards (2017, 2018), NAACL 2025 Best Paper. Current advisees include PhD students Pranjal Aggarwal, Weihua Du (co-advised with Yiming Yang), Andre He (co-advised with Daniel Fried), and Seungone Kim (co-advised with Graham Neubig). He co-organizes workshops like Autoformalization for the Working Mathematician (ICERM 2025) and VerifAI: AI Verification in the Wild (ICLR 2025), and teaches Advanced NLP at CMU.
Sushmita Ruj is an Associate Professor in the School of Computer Science and Engineering at the University of New South Wales (UNSW), Sydney. She serves as the Faculty of Engineering Lead for the UNSW Institute for Cybersecurity (IfCyber) and as the Taste of Research (ToR) Coordinator within the School of Computer Science and Engineering. Her academic journey includes previous positions as a Senior Research Scientist at CSIRO's Data61 (2019-2022), Associate Professor at the Indian Statistical Institute, Kolkata, and Assistant Professor at the Indian Institute of Technology (IIT), Indore. Dr. Ruj's primary research interests focus on applied cryptography, post-quantum cryptography, cybersecurity, blockchains, and data privacy. She designs practical, efficient, and provably secure protocols for real-life applications, with particular emphasis on critical infrastructure including smart grids, cloud computing, ad hoc networks, and data sharing frameworks. As quantum technology advances, her work increasingly focuses on developing quantum-safe algorithms to ensure a more secure Internet infrastructure. Her research spans multiple domains including cryptographic key management, proofs of storage, verifiable computation, vector commitments, and privacy-enhancing technologies for cloud and IoT environments. Her recent publications demonstrate a strong trend toward post-quantum cryptography solutions, with particular emphasis on blockchain applications, DNS security, and privacy-preserving protocols for industrial IoT. The research shows increasing focus on practical implementations of theoretical cryptographic concepts, with applications across multiple sectors including finance, healthcare, and critical infrastructure. Her work bridges the gap between theoretical cryptography and real-world security challenges, with growing emphasis on the transition from classical to quantum-resistant systems. Best Paper Award at ACISP 2024 JNCA Best Survey Award (2023) NSW Innovation Award (iAward) Merit Winner (2022) Women in Science Award from CSIRO (2020) ACM Senior Member (2016) IEEE Senior Member (2015) Samsung GRO award (2014) Dr. Ruj has successfully mentored numerous PhD and Master's students, with many of her former students now holding academic positions at institutions like IIT Indore, TU Wien, and CISPA Helmholtz Center. She has secured significant competitive funding including multiple Australian Research Council (ARC) grants, Samsung GRO Award, NetApp Faculty Fellowship, Cisco Academic Grant, and IBM Research grant. Her current research portfolio includes projects on blockchain-based quantum-safe digital medical passports, embedding trust in digital IDs, and resilience of supply chain unstructured data. As Faculty of Engineering Lead for IfCyber, Dr. Ruj plays a key role in UNSW's cybersecurity research initiatives. She has served on editorial boards for prestigious journals including IEEE Transactions on Information Forensics and Security and has held leadership positions in major conferences such as ACISP 2021 and Indocrypt 2020. She was also a member of the working group on "Blockchain For Cybersecurity" for the National Blockchain Roadmap of Australia and the first Blockchain Working group set up by the Reserve Bank of India.
