Halil Ali is a Lecturer in Data Science (Education Focused) at the School of Computing Technologies, RMIT University. His research spans privacy-preserving machine learning, blockchain technologies, and cybersecurity. Key research areas include federated learning , quantum-enhanced AI , secure biometrics , edge unlearning , and privacy in healthcare data . His recent publications focus on resilient AI systems , blockchain applications , and ethical data handling in emerging technologies. His work demonstrates expertise in integrating machine learning with blockchain security across domains like IoT, smart grids, and metaverse healthcare. He contributes to practical frameworks for zero-trust architectures , lightweight consensus protocols , and quantum-classical hybrid models .
Prof. Roger Wattenhofer is a Full Professor at the Department of Information Technology and Electrical Engineering, ETH Zurich, Switzerland, and Deputy head of the Computer Engineering and Networks Lab. He holds a doctorate in Computer Science from ETH Zurich (1998) and has held positions at Brown University and Microsoft Research before returning to ETH. His research focuses on distributed computing, wireless networks, and algorithmic systems design, with contributions to Byzantine agreement protocols, blockchain technologies, and neural network architectures. He teaches courses such as Distributed Systems and Computational Thinking. Education: Ph.D. in Computer Science (ETH Zurich, 1998). Research interests include distributed systems, network algorithms, and the intersection of machine learning with distributed computing. His work spans both theoretical foundations and practical implementations, addressing challenges in fault tolerance, consensus mechanisms, and algorithmic efficiency. Recent publications explore topics like adversarial robustness in voting systems, privacy in reinforcement learning, and generative music models. He actively contributes to open-source frameworks and benchmarks for neural algorithmic reasoning.
Charalampos Papamanthou is an Associate Professor of Computer Science at Yale University, where he also serves as Co-director of the Yale Applied Cryptography Laboratory and a member of the Yale Institute for Foundations of Data Science. He holds affiliations with the Yale Center for Algorithms, Data, and Market Design. Additionally, he is Chief Scientist at Lagrange Labs. His research focuses on computer security and applied cryptography, particularly verifiable and privacy-preserving computations, leakage-abuse attacks on searchable encryption, and scalable blockchains/cryptocurrencies. He has advised numerous students and postdocs, and his work is supported by NSF, Protocol Labs, and JP Morgan. Research Interests: His primary areas include cryptographic protocols, privacy-preserving systems, blockchain infrastructure, secure cloud computing, and distributed consensus mechanisms. He has pioneered advancements in zero-knowledge proofs, private information retrieval, and dynamic searchable encryption. Awards: He has received prestigious awards such as the CCS Test-of-Time Award (2022), JP Morgan Faculty Research Award (2022), and NSF CAREER Award (2017). His contributions span over 140 publications in top venues like CRYPTO, CCS, and SODA. Teaching: He has taught advanced courses in cryptography, algorithms, and computer systems security at Yale and previously at the University of Maryland and Brown University. Recently, he chairs Yale’s PhD admissions in Computer Science. Labs & Teams: Leads the Yale Applied Cryptography Lab, focusing on real-world applications of cryptographic research. Collaborates with industry partners like Lagrange Labs to develop privacy-preserving technologies.
Jelle Hellings is an Assistant Professor in the Department of Computing and Software at McMaster University , Canada. His research focuses on high-performance large-scale data management systems with a strong theoretical and algorithmic component, including resilient systems (blockchains) , graph databases , and external-memory algorithms . He previously worked as a Postdoc Scholar at the University of California, Davis and earned his PhD from Hasselt University in Belgium. Education: Doctor of Sciences in Computer Science (2018), Hasselt University Master of Science in Computer Science and Engineering (2011), Eindhoven University of Technology His research interests include scalable resilient systems with Byzantine fault tolerance, database theory, graph query languages, constraints on graph data, and external-memory algorithms for large graph datasets. He has authored numerous high-impact publications on blockchain-based resilient systems, query optimization in graph databases, and theoretical advancements in relation algebra expressiveness. Hellings actively contributes to academic service through program committee memberships and tutorial organization, and he currently teaches courses on future resilient databases and foundational computer science topics.
Peter Druschel is a Professor and founding Director of the Max Planck Institute for Software Systems (MPI-SWS) in Saarbrücken, Germany. He holds adjunct professorships at Saarland University and the University of Maryland. His research focuses on distributed systems, operating systems, and privacy-preserving technologies. He earned his Ph.D. from the University of Arizona in 1994 and has held roles at Rice University since 1994, including Professor of Computer Science (2002–2005). Education: Ph.D. in Computer Science, University of Arizona (1994) Research Interests: Distributed systems, operating systems, network security, accountable computing, and privacy technologies. Current projects include privacy compliance in data systems (Thoth), secure communication (EbN), and privacy-aware image capture (I-Pic). Awards: SIGOPS Mark Weiser Award (2008) NSF CAREER Award (1995) Member of Academia Europaea and German Academy of Sciences Leopoldina Grants & Leadership: Leads the ERC Synergy Project imPACT, chairs the Max Planck Society’s Chemistry, Physics, and Technology Section, and collaborates with institutions like Cornell and Google. Advises on policy issues related to technology and privacy. Labs/Teams: Distributed Systems Group at MPI-SWS, collaborations with Microsoft Research and MIT. Current team includes students and postdocs working on privacy, security, and distributed systems.
Michael J. Freedman is the Robert E. Kahn Professor of Computer Science at Princeton University and co-founder/CTO of Timescale. He received his Ph.D. from NYU’s Courant Institute and degrees from MIT. Current roles: Professor, Co-founder & CTO Affiliations: Princeton University, SNS Group, CITP Associate Education: Ph.D. (NYU), S.B./M.Eng. (MIT) His research spans distributed systems, networking, and security, with innovations like CoralCDN, DONAR, and Ethane. His work impacts decentralized content delivery, software-defined networking, and privacy-enhancing technologies. His recent publications address scalable fusion algorithms, GPU acceleration for data systems, and distributed GPU resource management. These works intersect with cloud infrastructure, network optimization, and security. Scientific honors include: Presidential Early Career Award for Scientists and Engineers (PECASE) Sloan Fellowship NSF CAREER Award Office of Naval Research Young Investigator Award Test of Time Award (Theory of Crypto Conference) ACM SIGOPS Mark Weiser Award He advises graduate students like Sam Ginzburg and Ashwini Raina, who joined Meta AI and Timescale post-PhD. His projects have secured substantial grants, including $110M Series C funding for Timescale. Key labs/teams: Princeton SNS Group Co-founder, Timescale (enterprise data platform) Co-founder, iobeam (IoT analytics, acquired by Timescale) Collaboration with FCC on Consumer Broadband Test Contributions to OpenFlow/SDN standardization
Juan Garay is a Professor in the Department of Computer Science & Engineering at Texas A&M University, affiliated with the College of Engineering. His research focuses on cryptography, information security, and distributed systems, with notable contributions to cryptographic protocols, blockchain technologies, and consensus mechanisms. He holds a leadership role in advancing theoretical and applied aspects of secure computation and network security. Research Interests: Cryptography and Information Security Secure Multiparty Computation Cryptocurrencies and Blockchain Protocols Consensus Algorithms Distributed Computing Game Theory in Cryptography Publications highlight his work on the Bitcoin Backbone Protocol, secure multiparty computation, and post-quantum cryptographic systems. He actively contributes to conferences and workshops in cryptography and distributed systems. He advises graduate students in computer science and engineering, though specific advisee names are not listed. His work is supported by grants from the National Science Foundation (NSF) and other institutions, focusing on secure protocols and distributed systems. Office: Peterson Building (PETR 429) Contact: garay@cse.tamu.edu
Björn Brandenburg is a researcher at the Max Planck Institute for Software Systems (MPI-SWS) in Kaiserslautern, Germany. His work focuses on real-time systems, scheduling algorithms, and operating system design, with a particular emphasis on predictable resource allocation and performance guarantees in multiprocessor and cyber-physical environments. His research interests include real-time response-time analysis (e.g., PROSA ), locking protocols for multiprocessor systems, side-channel mitigation in cloud environments, and the verification of real-time scheduling policies. He has contributed to foundational studies on deadline failure probabilities, self-suspending tasks, and predictable real-time Linux implementations. Scientific awards include recognition for outstanding papers on TimerShield (2017) Offline Equivalence (2017) . His work intersects with practical systems like LITMUSRT and ROS 2, aiming to bridge theoretical guarantees with real-world applications in safety-critical and distributed real-time systems.
Quanquan Liu is an Assistant Professor of Computer Science at Yale University. His research focuses on algorithms for large data, dynamic and distributed graph algorithms, parallel computing, differential privacy, and Byzantine-resilient systems. He holds a PhD in Computer Science from MIT's Theory Group and has held postdoctoral positions at Northwestern University and MIT. Education: PhD in Computer Science, MIT (Advisors: Erik Demaine and Julian Shun) MEng in Computer Science, MIT B.S. in Computer Science and Math, MIT (Advisor: David Karger) Research Interests: Theory and practice of algorithms for large-scale data, dynamic/distributed graph algorithms, parallel and high-performance computing, differential privacy, and Byzantine-resilient algorithms. Recent Highlights: His work includes practical differentially private graph algorithms, efficient parallel algorithms for graph problems, and fair course allocation mechanisms. Notably, he received the Best Paper Award at SPAA 2022 for parallel dynamic graph algorithms. Service: PC member for PPoPP, ESA, SPAA, and ALENEX Coach for USA Computing Olympiad (USACO) and Northwestern's ICPC team Current Group: Advising PhD students Felix Zhou and Pranay Mundra, and Master's student Jinghua Sun.
Henry F. (Hank) Korth is a Professor of Computer Science and Engineering at Lehigh University, with a courtesy appointment in the Department of Decision and Technology Analytics in the College of Business. He serves as Director of the Blockchain Lab in the Center for Financial Services and Co-Director of the Computer Science and Business Program. Korth is a Fellow of the ACM and IEEE, and a recipient of the VLDB 10-Year Award and Bell Labs President's Silver Award for contributions to database technologies. PhD in Computer Science from Princeton University MA, MSE in Computer Science from Princeton University BA in Mathematics from Williams College Korth's research spans database systems, blockchain systems, distributed systems, and real-time systems. He has pioneered transaction management in parallel and distributed systems, query processing, and the impact of modern computing architectures on database performance. His recent work focuses on blockchain applications in enterprise databases, including acceleration of zero-knowledge proofs, benchmarking frameworks, central-bank digital currencies, and private-yet-provable accounting systems. His contributions are rooted in both theoretical advancements and practical implementations, such as the QTM™ aggregation engine and the DataBlitz™ main-memory storage manager. Scientific awards include: ACM Fellow IEEE Fellow 10-Year Award at the VLDB Conference Bell Labs President's Silver Award Korth actively supervises research within the Blockchain Lab and is affiliated with the Scalable Software Systems Research Group at Lehigh. His scholarly output reflects a deep engagement with blockchain benchmarking, concurrency control, verifiable databases, and the evolution of database systems in response to technological shifts.
Fan Zhang is an Assistant Professor in the Department of Computer Science at Yale University. He holds a Ph.D. from Cornell University, advised by Ari Juels, and a B.S. from Tsinghua University. His research focuses on computer security, applied cryptography, decentralized systems, blockchains, and trusted execution environments (TEEs). He leads the Decentralized Systems Group at Yale and is affiliated with the IC3, CDCC, and CADMY centers. He teaches courses on blockchain and real-world cryptography. Key research interests include blockchain decentralization, privacy-preserving protocols, and secure distributed systems. Notable contributions include the Town Crier oracle system (acquired by Chainlink), the DECO TLS protocol, and foundational work on transaction order fairness and MEV mitigation. Awards include the Ethereum Foundation Academic Grant (2022) and the IBM PhD Fellowship (2018-2020). His work has been published in top venues like CCS, S&P, CRYPTO, and USENIX Security.
Natacha Crooks Dr. Natacha Crooks is an Assistant Professor in the Department of Electrical Engineering and Computer Science (EECS) at UC Berkeley. Her research focuses on distributed systems, databases, and security, with a particular emphasis on consistency models, BFT protocols, and cloud computing. She is a founding member of the SkyLab and a core contributor to the Data Systems and Foundations Group at Berkeley. She holds a Ph.D. in Distributed Systems from the University of Texas at Austin (2019) and a BA in Computer Science and Law from the University of Cambridge (2012). Affiliations & Roles: Assistant Professor, UC Berkeley EECS Visiting Researcher at Azure Research, Security & Privacy Founding Member of SkyLab Member of Berkeley Center for Decentralized Intelligence Former Scientific Advisor at Improbable and Astronomer Research Interests: Her work bridges distributed systems and database research, addressing challenges in transactional consistency, fault-tolerant protocols, and cloud resource optimization. Key themes include: Designing scalable BFT consensus algorithms Secure multi-cloud storage solutions Optimizing distributed transaction processing Privacy-preserving distributed systems Awards & Recognition: Sloan Research Fellow (2025) NSF CAREER Award ACM SIGOPS Dennis M. Ritchie Doctoral Dissertation Award (2020) IEEE CS TCDE Early Career Award (2024) Teaching: Fall 2025: CS 294-282 (Research Culture and Community Norms), Wheeler 130. Industrial Collaboration: Prior roles include visiting researcher at Cornell University, Microsoft Research (DMX group), and Imperial College London. Industrial partnerships include work with Materialize, Astronomer, and Improbable.
Alexander Russell is a Professor of Computer Science and Mathematics at the University of Connecticut, serving as Director of Graduate Affairs in the School of Computing and Director of the UConn Voting Technology Research Lab. He holds a Ph.D. in Mathematics and an S.M. in Computer Science from MIT, alongside dual B.A. degrees in Mathematics and Computer Science from Cornell University. His research focuses on cryptographic protocols, blockchain security, quantum computing, algorithms, and election auditing. Key areas include consensus algorithms, complexity-theoretic cryptography, and applied cryptography in voting systems. Recent work emphasizes low-variance risk-limiting audits and adaptive security mechanisms for blockchains. Notable contributions span provably secure blockchain protocols (e.g., Ouroboros), election integrity methods, and smartphone-based depression prediction models. His articles address topics like settlement bounds in longest-chain consensus, Byzantine-resilient gossip protocols, and energy-efficient neighbor discovery in mobile networks. Russell advises on interdisciplinary projects at the Voting Technology Research Center and collaborates on grants involving quantum-resistant cryptography and healthcare analytics. His work bridges theoretical computer science with practical applications in secure systems and public infrastructure.
Sergey Gorbunov is an Associate Professor in the Department of Computer Science at the University of Waterloo . He holds a Ph.D. from MIT (2015), an M.Sc. and H.B.Sc. from the University of Toronto (2012 and 2011, respectively). His research focuses on Cryptography, Network Security, Blockchain Technology, Secure Protocols, and Privacy-Preserving Systems . He explores advanced cryptographic techniques for decentralized systems, privacy-enhancing technologies, and secure communication protocols. His work includes pioneering contributions to blockchain security (e.g., mitigating front-running attacks, enhancing transaction privacy) and foundational cryptographic tools like homomorphic encryption and multi-signature schemes. Recent publications emphasize resilient consensus mechanisms, anonymous payment channels, and efficient cryptographic primitives for distributed systems. Notable projects include Astrape (anonymous payment channels), Algorand Agreement (fast Byzantine consensus), and StealthDB (encrypted SQL databases). His research bridges theoretical cryptography with practical applications in secure computing and decentralized technologies.
Maximilian Egger is a Doctoral Researcher at the Institute for Communications Engineering under Prof. Antonia Wachter-Zeh at the Technical University of Munich (TUM). His research focuses on distributed machine learning, privacy-preserving computing, and information theory. He holds an M.Sc. in Electrical Engineering and Information Technology (2022, TUM) and a B.Eng. in Electrical Engineering (2020). He has conducted research stays at École Polytechnique Fédérale de Lausanne (2024) and Imperial College London (2023). Egger has received several awards, including the DAAD Scholarship (2023) and the VDE Award Bavaria (2020). His work emphasizes secure federated learning, Byzantine-resilient systems, and efficient distributed algorithms. He is affiliated with the Chair of Coding and Cryptography and actively contributes to advancements in decentralized learning systems. Recent publications highlight breakthroughs in privacy preservation, channel capacity estimation, and scalable federated edge learning.
