Find Academic Supervisors

• Post-Quantum Cryptography
• Lattice-Based Cryptographic Schemes
• Homomorphic Encryption
• +3 more

Dr. Rachel Player is a Senior Lecturer in the Department of Information Security at Royal Holloway, University of London . Her research focuses on post-quantum cryptography, lattice-based cryptographic schemes, homomorphic encryption, and quantum algorithm applications in cryptanalysis. She holds a PhD in Information Security from Royal Holloway, supervised by Prof. Carlos Cid and Prof. Sean Murphy. Education: PhD in Information Security, Royal Holloway, University of London (supervisors: Prof. Cid & Prof. Murphy) Research Interests: Rachel explores cutting-edge areas in cryptography with a focus on privacy-preserving technologies. Her work bridges theoretical advancements and practical implementations, particularly in homomorphic encryption and post-quantum security protocols. Recent efforts emphasize applying quantum algorithms to cryptanalytic challenges. Professional Activities: Rachel actively contributes to standards development in cryptography, including organizing HomomorphicEncryption.org meetings and participating in ISO/IEC JTC 1/SC 27/WG 2 (cybersecurity standards). She also serves as an editor for the Designs, Codes and Cryptography journal. Labs/Teams: Collaborations include the PolSys team at Sorbonne Université (Paris) and the EU H2020 PROMETHEUS project. Current research is anchored in Royal Holloway's Information Security Department.

• Computer Science
• Machine Learning
• Data Science
• +4 more

Yong Zhang is affiliated with Tsinghua University's Research Institute of Information Technology in Beijing, China. His research focuses on machine learning, optimization algorithms, edge computing, and their applications in areas like time series analysis, federated learning, and sensor networks. He has collaborated on projects involving neural networks, scheduling problems, and privacy-preserving techniques. Education: Yong Zhang earned a PhD in Computer Science and Engineering from Fudan University in 2007. His academic career includes roles at institutions like the Chinese Academy of Sciences and the University of Hong Kong, reflecting a strong interdisciplinary background. Research Contributions: His work spans theoretical computer science, algorithm design, and applied machine learning. Notable areas include developing efficient scheduling algorithms for energy systems, creating robust federated learning frameworks for industrial demand forecasting, and advancing methods for sentiment analysis using multimodal data. He has also contributed to biomedical engineering through smartphone-based health monitoring systems. Collaborations: He frequently collaborates with researchers at institutions like the University of Electronic Science and Technology of China, Nanyang Technological University, and The Hong Kong Polytechnic University. Key projects involve data caching optimization in edge computing, distributed algorithms for dynamic networks, and combinatorial optimization problems. Labs & Future Work: His team explores cutting-edge topics in AI-driven systems, including trust-aware machine learning, distributed resource allocation, and real-time data processing for IoT applications. Current research emphasizes scalable solutions for complex optimization challenges in both academic and industrial settings.

Pascal SasdrichView profile

Researcher

• Hardware Security
• Secure Processor Design
• Computer-Aided Security
• +3 more

Pascal Sasdrich is a Researcher at Ruhr University Bochum, Germany, affiliated with the Faculty of Computer Science and the Security Engineering department. He holds a PhD in IT-Security/Information Technology from the same university (2018), following M.Sc. (2015) and B.Sc. (2012) degrees in the same field. His research focuses on Hardware Security, Secure Processor Design, Computer-Aided Security, and Security by Design. He has extensive experience in cryptographic hardware implementations, including countermeasures against side-channel and fault attacks. Teaching includes courses on Processor Security and Implementation of Cryptographic Schemes. His work bridges theoretical security models with practical hardware implementations, emphasizing automated tools and formal verification for secure embedded systems. Key projects include contributions to Project HEP (open-source hardware security chip design) and development of methodologies like EASIMASK for automated masking in hardware. Publications span cryptographic hardware implementations, fault and side-channel countermeasures, and formal security verification. Notable works include combined threshold implementations, secure processor extensions, and automated generation of masked hardware circuits. Current research emphasizes securing embedded systems through holistic design approaches, including ISA extensions and automated EDA tools.

Georg CarleView profile

Professor

• Internet Technology
• Future Internet Architecture
• Network Security
• +3 more

Prof. Georg Carle is a full Professor in Network Architectures and Network Services at the Technical University of Munich (TUM), affiliated with the TUM School of Computation, Information and Technology. He leads research in Internet technology, focusing on future network architectures, security, and real-time communication. Prior roles include positions at the University of Tübingen and Fraunhofer Institute for Open Communication Systems (FOKUS). Education: Electrical Engineering diploma from University of Stuttgart (1992), Master of Science in Digital Systems (Brunel University, London), and PhD in Telematics from University of Karlsruhe (1996). He held scholarships in complex systems and European Union-funded research at Institut Eurécom. Research Interests: Prof. Carle's work spans network security, sensor networks, autonomous systems, and future Internet protocols. His group develops tools like MoonGen (packet generator) and pos (experiment workflow system). Recent focus includes QUIC protocol analysis, network slicing, and reproducible experimentation frameworks. Key Contributions: Award-winning research includes Applied Networking Research Prizes (2017-2018), Best Paper Awards in IMC/PAM, and innovations in network measurement, security, and programmable data planes. His lab explores cutting-edge topics like post-quantum cryptography, low-latency networking, and 6G automation. Recognition: Honors include ACM SIGCOMM Community Contribution Award, IRTF ANRP, and multiple conference best paper accolades. He advises on network infrastructure for industrial IoT, automotive systems, and secure multiparty computation.

Lisa KohlView profile

Researcher

• Cryptology
• Secure Computation
• Post-Quantum Cryptography
• +3 more

Dr. Lisa Kohl is a tenured Researcher in the Cryptology Group at CWI Amsterdam since October 2020. Her work focuses on secure computation and practical post-quantum secure protocols . Prior to CWI, she was a postdoctoral researcher at Technion with Yuval Ishai and completed her PhD at Karlsruhe Institute of Technology under Dennis Hofheinz in 2019. She also spent eight months at the FACT center, IDC Herzliya during her PhD and wrote her master’s thesis at CWI Cryptology Group as a visiting student in 2015. PhD in Cryptology (2019, Karlsruhe Institute of Technology) Postdoctoral Researcher (Technion, 2019-2020) Research Visit Fellow (FACT Center, 2015-2019) Visiting Student (CWI Cryptology Group, 2015) Her research spans secure multi-party computation , homomorphic secret sharing , post-quantum cryptography , and pseudorandom correlation generation . Articles demonstrate expertise in optimizing oblivious transfer , improving Σ-protocol efficiency , and constructing cryptographic primitives from lattice problems and LPN assumptions . Contact: Lisa.Kohl@cwi.nl

Stephanie BalzerView profile

Assistant Professor

• Programming Languages
• Type Theory
• Program Verification
• +6 more

Stephanie Balzer is an Assistant Professor in the Principles of Programming Group at Carnegie Mellon University's School of Computer Science. She received her PhD from ETH Zurich under Thomas R. Gross and focuses on developing rigorous type systems and verification logics to build failure-free, secure software through compositional and practical methods. Education: PhD (ETH Zurich), Master's (University of Zurich), Semester Thesis (University of Zurich) Her research spans session types , logical relations , and separation logic to ensure correctness and security in concurrent systems. Recent work includes verifying timed message-passing protocols and disentanglement in type systems. Key publication trends include session-typed concurrency , noninterference , and deadlock freedom across programming languages, formal methods, and security domains. She has authored multiple distinguished papers at ECOOP and POPL. Scientific Awards: NSF CAREER Award, ACM SIGPLAN Distinguished Paper, ECOOP Distinguished Paper She advises PhD students including Yue Yao, Yinsen Zhang, and Zak Kent, and has supervised former PhD students like Jules Jacobs (now at Cornell). Her grants include NSF funding for IoT verification , heterogeneous applications , and real-time protocols .

• Cybersecurity
• Privacy-Preserving Protocols
• Secure Multi-Party Computation
• +3 more

Prof. Georg Neugebauer is a Professor at RWTH Aachen University, specializing in cybersecurity, privacy-preserving protocols, and secure multi-party computation. His research focuses on developing frameworks for secure data reconciliation, enhancing information security management systems, and addressing cybersecurity challenges in AI, industrial systems, and smart environments. Research Interests: Secure Multi-Party Computation (MPC) Privacy-Preserving Systems Cybersecurity Education & Training Artificial Intelligence in Security Management Industrial IoT and Operational Technology (OT) Security Digital Forensics and Incident Response Recent work highlights a shift towards cybersecurity education initiatives (e.g., CampusQuest ), AI-driven security solutions, and addressing vulnerabilities in public AI tools. His frameworks like SMC-MuSe have advanced MPC applications for multi-set operations. His publications span conferences such as ARES, ICISSP, and AHFE, addressing topics from smart building protocol security to forensic triage tools. Collaboration with researchers like Schuba, Höner, and Meyer marks his interdisciplinary approach to solving real-world security challenges.

• Secure Multi-party Computation
• Distributed Computing

Divya Ravi is an Assistant Professor in the Theory of Computer Science (TCS) Group at the University of Amsterdam, Netherlands, and a former post-doctoral researcher in the Cryptography and Security Group at Aarhus University, Denmark. Education: PhD in Computer Science from Indian Institute of Science (IISc), Bangalore, India, supervised by Dr. Arpita Patra M.E (Masters) in Computer Science from Computer Science and Automation (CSA), IISc B.E (Bachelors) in Computer Science from BITS Pilani, Hyderabad Campus, India Research Interests: Secure Multi-party Computation Distributed Computing Her work focuses on the feasibility of secure multiparty computation tasks and efficient distributed computing protocol design under varying network and computational models. No scientific awards or advisees are listed in the provided text.

Emanuele D’OsualdoView profile

Professor

• Formal Methods
• Programming Languages
• Verification
• +6 more

Emanuele D’Osualdo is a Tenure-track Professor of Formal Methods for Software Engineering at the University of Konstanz. Previously, he held postdoctoral positions at MPI-SWS Saarbrücken (2020-2024) under Derek Dreyer and at Imperial College London (2015-2020) as a Marie Curie Fellow under Prof. P. Gardner. His research focuses on formal methods for software verification, including static analysis, model checking, and compositional verification techniques for concurrent and probabilistic systems. Research interests span Programming Languages, Verification, Security, Concurrency Theory, and Probabilistic Programming. Notable contributions include the Soter tool for Erlang verification, the James Bound library for π-calculus analysis, and foundational work on hierarchical communication topologies. His 2016 doctoral thesis on concurrency verification earned the CPHC/BCS Distinguished Dissertation Award. Recent work includes Bluebell (POPL 2025), advancing probabilistic reasoning via relational lifting, and compositional approaches to hypersafety (OOPSLA 2022). Active in academic service, he has delivered keynotes at HYPER’25 and participates in major conferences like CAV and POPL. Awards: 2016 CPHC/BCS Distinguished Dissertation Award Tools: Soter (Erlang verifier), James Bound (π-calculus library) Grants/Advising: Supervises graduate students at University of Konstanz (details forthcoming) Led the Formal Methods research group focused on concurrency, security, and probabilistic systems at the University of Konstanz.

Florian BreuerView profile

Professor

• Number Theory
• Arithmetic Geometry
• Elliptic curves
• +6 more

Florian Breuer is a Professor of Mathematics at the University of Newcastle , Australia, affiliated with the School of Information and Physical Sciences . He was on sabbatical at the University of Heidelberg, Germany (July–December 2024) and is a member of CARMA (Priority Research Centre in Computer-Assisted Research Mathematics and its Applications). His research focuses on Number Theory , particularly Arithmetic Geometry , Elliptic curves , Drinfeld modules , and Drinfeld modular forms . He also explores quadratic number fields and Cohen-Lenstra-Martinet heuristics . He serves on the editorial boards of the Journal of Number Theory and Quaestiones Mathematicae . His work often intersects with cryptography, as seen in projects like SeCritMass , a threshold secret petition protocol. His research interests also include Ducci sequences and orders of elements in finite fields . Recent trends in his publications emphasize modular polynomials , heights in algebraic geometry , and Drinfeld modular forms of arbitrary rank . Collaborations with mathematicians like Fabien Pazuki and Dirk Basson highlight his contributions to arithmetic geometry and modular forms. Breuer’s work bridges theoretical number theory with computational methods, evident in his GitHub repository for OEIS sequence A130229 analysis. His research often addresses foundational questions in algebraic structures and their applications in cryptography and computational mathematics.

Reynald AffeldtView profile

Visiting Professor

• Formal Verification
• Coq Proof Assistant
• Monadic Equational Reasoning
• +7 more

Reynald Affeldt is a Chief Senior Research Scientist at AIST (National Institute of Advanced Industrial Science and Technology, Japan) and a Visiting Professor at NAIST (Nara Institute of Science and Technology). His work focuses on formal verification of software using logic and the Coq proof-assistant, with notable contributions to monadic equational reasoning, probabilistic programming, and robotics applications. His research spans multiple domains, including Monadic effects and equational reasoning Probabilistic and nondeterministic programming Information theory and error-correcting codes 3D geometry for robotics Recent publications highlight his efforts in extending monadic reasoning with transformers and formalizing probabilistic semantics in Coq. He has contributed to various conferences, notably as a committee member for CPP and TyDe tracks, and as a program chair for APLAS-related events. His work includes applications to OCaml, imperative language semantics, and algorithm verification (e.g., n-queens, quicksort).

• Cryptography
• Theoretical Computer Science
• Secure Multiparty Computation
• +4 more

Iftach Haitner is a Professor in the Department of Computer Science and Applied Mathematics at the Weizmann Institute of Science, Faculty of Mathematics and Computer Science. His research spans theoretical computer science and cryptography, with a focus on foundational aspects of secure computation and cryptographic primitives. Haitner's primary research interests include Cryptography , Theoretical Computer Science , Secure Multiparty Computation , Coin Flipping Protocols , One-Way Functions , and Differential Privacy . His work often bridges theoretical foundations with practical applications, particularly in the areas of secure computation and cryptographic protocol design. He has made significant contributions to understanding the complexity of fair coin flipping protocols and their relationship to fundamental cryptographic primitives. Analysis of Haitner's recent publications reveals a strong focus on foundational cryptography with particular emphasis on oblivious transfer protocols, verifiable random functions, differential privacy, and secure multiparty computation. His research demonstrates a consistent pattern of advancing theoretical understanding while maintaining practical relevance, often establishing tight bounds and optimal constructions. A notable trend in his recent work involves the interplay between differential privacy and cryptographic primitives, as well as continued exploration of the fundamental limits of secure computation. Haitner has mentored numerous researchers who have become prominent in the field, including Noam Mazor, Jad Silbak, and Eliad Tsfadia. His collaborative work spans multiple institutions and has been supported by significant research funding, though specific grant details are not provided in the available information.

• Secure Multi-Party Computation
• Privacy-Preserving Technologies
• Cryptography
• +5 more

Thomas Schneider is a Professor at Darmstadt University of Technology (TU Darmstadt) in the Department of Computer Science, with strong affiliations to the European Center for Security and Privacy by Design in Germany. His academic journey began with a PhD from Ruhr-Universität Bochum's Horst Görtz Institute for IT-Security in 2012, establishing his foundation in security research. Dr. Schneider's research spans multiple critical areas in computer security and privacy, with particular emphasis on secure multi-party computation, privacy-preserving technologies, cryptography, and federated learning. His work bridges theoretical cryptographic foundations with practical applications in real-world systems. He has made significant contributions to encrypted search, privacy-preserving machine learning, mobile security, and oblivious database systems. Analysis of his recent publications reveals a strong trend toward practical implementations of privacy-enhancing technologies that maintain both security guarantees and computational efficiency. His research consistently addresses the tension between privacy protection and system performance, developing innovative protocols that minimize overhead while maintaining strong security properties. Key themes include secure computation frameworks, leakage-resilient protocols, and privacy-preserving analytics for sensitive domains like healthcare and government data processing. Dr. Schneider actively collaborates with researchers across multiple institutions, contributing to the advancement of cryptographic techniques that have practical relevance in today's data-driven world. His work demonstrates a consistent focus on developing solutions that are not only theoretically sound but also deployable in real systems.

• Cryptography
• Distributed Learning
• Secure Computing
• +3 more

Christoph Hofmeister is a doctoral researcher at the Technical University of Munich (TUM), affiliated with the Associate Professorship of Coding and Cryptography under Prof. Antonia Wachter-Zeh. He holds an M.Sc. in Electrical and Computer Engineering from TUM (2021) and a B.Eng. from Munich University of Applied Sciences (2019), with a dual study program at Infineon Technologies (2015–2019). His research focuses on distributed learning systems, federated learning, secure computing, and coding theory. Key areas include Byzantine-resilient distributed learning, privacy-preserving federated learning, and secure matrix multiplication protocols. Hofmeister’s work addresses challenges such as fault tolerance, communication efficiency, and information-theoretic security in distributed systems. He has contributed to over 15 peer-reviewed publications, including works on DNA-based storage systems, secure aggregation in federated learning, and privacy-preserving algorithms. His teaching includes courses on coding theory, channel coding, and distributed computing at TUM. Current research initiatives include exploring fundamental limits of Byzantine-resilient learning and optimizing compression techniques for federated learning. Hofmeister is also involved in advising doctoral and master’s theses on topics like non-uniform secure aggregation and coordinate-based compression methods.

Thomas SchneiderView profile

Professor

• Cryptography
• Privacy Engineering
• Secure Computation
• +2 more

Thomas Schneider is Professor of Cryptography and Privacy Engineering at TU Darmstadt. His research develops privacy-preserving cryptographic protocols for applications including private set intersection, mobile contact discovery, genomic privacy, and secure computation compilers. He leads the Engineering Cryptographic Protocols Group (ENCRYPTO) and has received both ERC Starting (2019) and Consolidator Grants (2023). Schneider's current projects include: Developing efficient private set intersection protocols for mobile applications Privacy-preserving machine learning frameworks Hardware-assisted cryptographic protocols Secure computation for cloud environments