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.
Roman Langrehr is a Researcher affiliated with the Institute for Theoretical Computer Science at ETH Zürich, Switzerland. He is part of the Professorship for Computer Science and contributes to the Numerical Analysis of Dynamical Systems research group, involved in projects such as the DFG Priority Research Program DANSE focusing on connecting orbits in high-dimensional dynamical systems. His work bridges theoretical computer science with applied mathematics, particularly in economic modeling and dynamical systems analysis. Research interests include numerical methods for dynamical systems, computational economics, and optimization strategies for economic models. He has contributed to studies on Skiba sets in optimal control problems and numerical techniques for boundary value problems. His cryptographic research spans functional encryption, lattice-based cryptography, and secure key exchange protocols. Publications highlight advancements in non-interactive key exchange (NIKE), malleable SNARKs, and deniable authentication protocols. He collaborates on projects involving dynamic optimization and has explored the intersection of economic theory with computational methods. His work is characterized by a focus on rigorous numerical analysis and applied cryptography.
Hessam Mahdavifar is an Associate Professor in the Department of Electrical and Computer Engineering at Northeastern University's College of Engineering. His research focuses on coding theory, wireless communications, data privacy, and privacy-preserving computing. He holds a PhD from the University of California San Diego (2012), an MS from UCSD (2009), and a BS from Sharif University of Technology (2007). Key research areas include analog subspace coding for non-coherent networks, polar coding for low-capacity channels, and privacy-preserving protocols for distributed learning. His work bridges information theory with practical applications in secure communication and federated learning systems. Notable contributions include analog secret sharing frameworks and coded computing techniques for resilient distributed algorithms. Awards: NSF CAREER Award (2020), Qualcomm Innovation Fellowship (2020), IEEE RFID Best Paper (2015), and International Mathematical Olympiad Silver Medal (2002/2003) Grants: NSF CAREER grant for coding subspace research, collaborative projects on polar coding and coded computing Labs/Teams: Active in Northeastern's Information Theory and Communications group, leading research on secure machine learning and wireless security His recent work emphasizes federated learning security (e.g., LightVeriFL protocols), privacy-preserving distributed algorithms, and code design for emerging communication paradigms like millimeter-wave covert systems.
Suthee Ruangwises is a Lecturer at the Department of Computer Engineering, Chulalongkorn University. He holds a PhD and Master's from Tokyo Institute of Technology (2020 and 2017) under Prof. Toshiya Itoh and Prof. Osamu Watanabe, and a Bachelor's from MIT (2015). His research focuses on card-based cryptography, puzzle complexity analysis, and matching under preferences, with notable work on physical zero-knowledge proofs and NP-completeness proofs for puzzles. Postdoctoral positions at Tokyo Institute of Technology (2020–2024) and University of Electro-Communications (UEC). Recipient of the Best Paper Award at APKC 2025 for work on Sumplete puzzles. Active in international conferences such as UCNC, CiE, and WALCOM. Research interests span secure multiparty computation, graph algorithms, and cryptographic protocol design. He maintains databases of card-based cryptography papers and NP-completeness proofs for pencil puzzles. His Erdős number is 3 via collaboration with Toshiya Itoh. Teaching includes Computational Theory at Chula. Recent publications emphasize innovations in physical cryptographic protocols and puzzle-based computational problems, reflecting his interdisciplinary approach at the intersection of cryptography, algorithms, and combinatorics.
Thomas Wies is a Professor of Computer Science at the Courant Institute, New York University, and Chair of the Computer Science Department. His research focuses on program analysis and verification, automated deduction, and concurrency. University : New York University School : Courant Institute Department : Computer Science Academic Rank : Professor His research explores foundational techniques for verifying concurrent systems, including separation logic, shape analysis, and SMT-based methods. Key trends in his recent work include advancements in symbolic verification for concurrent data structures, multiparty protocol analysis, and linearizability proof tools. Scientific awards he has received include: Best Paper Award, ISSRE 2019 Best Paper Award, ACM SIGPLAN OOPSLA 2014 He has advised numerous PhD students and co-advised alumni, including Devora Chait-Roth, Mark Goldstein, Ekanshdeep Gupta, and others. His teaching portfolio includes graduate and undergraduate courses on programming languages, concurrency, and program verification. Professional roles include organizing conferences like VerifyThis 2025 and chairing program committees for VMCAI and ESOP.
Abhishek Jain is an Associate Professor in Computer Science at Johns Hopkins University and a Senior Scientist at NTT Research . His research focuses on Cryptography , Theoretical Computer Science , and Computer Security , with significant contributions to obfuscation, zero-knowledge proofs, and secure computation. Current affiliations: Johns Hopkins University (since 2015), NTT Research (since 2023) Research groups: Cryptography Group , Theory Group , Information Security Institute His work is supported by grants from NSF Career , DARPA , JP Morgan , Ethereum Foundation , Stellar , Cisco , Samsung , and JHU Catalyst . He has received the Best Paper Award at EUROCRYPT 2021 and journal invitations for FOCS 2022 and CRYPTO 2023 papers. Advising highlights include PhD students Aditya Hegde , Harry Eldridge , and Pratyush Ranjan Tiwari , and postdocs Pedro Branco and Nils Fleishhacker . He actively recruits interns and postdocs for NTT Research in Sunnyvale, CA.
German Saez Moreno is a Professor in the Department of Mathematics at the Universitat Politècnica de Catalunya (UPC), affiliated with the Barcelona School of Telecommunications Engineering. He is a core member of the ISG-MAK (Information Security Group - Mathematics Applied to Cryptography) and the MAK research group. His work focuses on cryptography, information security, and their applications in cybersecurity and distributed systems. Research Interests: Cryptography and cryptanalysis of advanced cryptographic protocols Secret sharing schemes and access structure design Secure communication protocols and post-quantum cryptography Distributed key management and self-healing systems Cybersecurity education and curriculum development Recent Publications Trends: His 2025 work on (k,n)-consecutive access structures advances secret sharing theory. Recent projects (2023-2022) emphasize cybersecurity education and post-quantum cryptographic solutions. Earlier contributions (2010-2005) include foundational work on threshold schemes, proxy signatures, and self-healing key distribution mechanisms. Grants & Projects: Lead researcher in multiple competitive R&D projects including 'Criptografía para retos digitales emergentes' (2022), 'Hacia una sociedad digital segura' (2014), and EU-funded 'European Network of Excellence for Cryptology II' (2010). Active in curriculum innovation through the SPACE project (2023). Lab/Team: Co-leads the ISG-MAK group focusing on applied cryptography and information security solutions.
Engelbert Hubbers is a Lecturer at Radboud University, affiliated with the Digital Security Group within the Institute for Computing and Information Sciences (iCIS). His primary role involves teaching responsibilities across multiple courses such as Mathematical Structures, Formal Reasoning, and Logic and Applications. His research interests focus on formal methods, electronic voting systems, and discrete mathematics, with a particular emphasis on cybersecurity applications like Java Card security and e-passport systems. Engelbert has contributed to significant projects such as the RIES internet voting system and the KOA remote voting system, emphasizing formal verification and secure protocol design. He has held roles in academic governance, including membership in the Exam Committee and Program Committee of iCIS. His work bridges theoretical computer science with practical applications in secure voting technologies and embedded systems. Publications span topics from formal logic in education to cryptographic protocols, reflecting his transition from foundational research (e.g., polynomial automorphisms) to applied security. His teaching includes coordinating courses on formal reasoning, discrete mathematics, and semantics, demonstrating a commitment to both education and cybersecurity innovation.
Tal Malkin is a Professor of Computer Science at Columbia University's Fu Foundation School of Engineering and Applied Science, where she directs the Cryptography Lab and previously served as the inaugural chair of the Cybersecurity Center at the Data Science Institute. Her academic journey includes a BS in Math and Computer Science from Bar-Ilan University, an MS in Computer Science from the Weizmann Institute of Science, and a PhD in Computer Science from MIT. Prior to joining Columbia, she worked as a research scientist at AT&T Labs Research. Dr. Malkin's research spans foundational and practical aspects of cryptography, with significant contributions to secure computation, private search, non-malleable codes, leakage and tamper resilient cryptography, and strong public key encryption. Her work increasingly explores connections between cryptography and other fields including complexity theory, information theory, and machine learning. As evidenced by her numerous publications in top-tier venues like Crypto, Eurocrypt, and TCC, her research combines theoretical rigor with practical applications, particularly in privacy-preserving technologies and secure distributed systems. Her publication record reveals a strong focus on cryptographic foundations and security protocols, with recent work addressing challenges in tamper resilience, leakage resistance, and secure multiparty computation. The trend shows increasing integration of cryptographic techniques with machine learning applications, reflecting the growing importance of secure AI systems. Her research has consistently addressed both theoretical limits and practical implementations of cryptographic primitives. IACR fellow NSF CAREER Award Faculty awards from JP Morgan, IBM, and Google Avanessians Diversity Award from the Fu Foundation School of Engineering and Applied Science Presidential Teaching Award at Columbia University Professor Malkin has successfully mentored numerous PhD and MS students, with her current advisees including Marshall Ball, Chengyu Lin, and Negev Shekhel Nosatzki. Her extensive service to the cryptographic community includes chairing major conferences (CRYPTO 2021, CCS 2017, TCC 2016A, ACNS 2015, CT-RSA 2008) and serving on program committees for virtually all major cryptography and security conferences. She chairs the Theory of Cryptography Conference steering committee and has organized numerous workshops including the New York Area Theory Day and New York City Crypto Day. She leads the Columbia Cryptography Lab, which serves as a hub for both theoretical and applied cryptographic research. The lab maintains strong connections with industry partners and regularly publishes in top venues, demonstrating a balanced approach to fundamental research and practical security applications.
Cihan Eryonucu is a Ph.D. student and researcher at the KTH Royal Institute of Technology , affiliated with the Networked Systems Security (NSS) Group and the WASP - Autonomous Systems and Software track . He is supervised by Professor Panos Papadimitratos . Research Focus: Security and privacy in participatory sensing systems, Sybil attack detection, and privacy-preserving protocols for location-based services. Teaching: Assistant roles in courses like Advanced Networked Systems Security (EP2510) and Building Networked Systems Security (EP2520) , and a teacher in Communication System Design (IK2200) . Expertise: His work addresses vulnerabilities in crowdsourced systems (e.g., Google Maps manipulation) and develops cryptographic methods for secure data aggregation. Publications: Recent works explore Sybil attack mitigation via presence verification, privacy-enhancing frameworks for urban sensing, and applications of homomorphic encryption to genomic and location data. Contact: Email eryonucu@kth.se | Room 4444, Kistagången 16, KTH Royal Institute of Technology.
Iftach Haitner is a Professor at Tel Aviv University's School of Computer Science, currently on leave while serving as Principal Researcher at the Stellar Development Foundation. His primary academic affiliation remains with Tel Aviv University where he maintains an active research group and supervises multiple PhD students. His educational background includes a PhD (2008) and Master's degree from the Weizmann Institute of Science under Omer Reingold and Oded Goldreich respectively, and undergraduate studies in Mathematics and Computer Science at Tel Aviv University. His research focuses on Cryptography and Computational Complexity , with significant contributions to coin-flipping protocols, one-way functions, differential privacy, and secure computation. Analysis of his 15 most recent publications reveals consistent focus on foundational cryptographic problems. His work demonstrates strong emphasis on computational entropy concepts (inaccessible entropy, next-block pseudoentropy), protocol security against adaptive adversaries, and tight complexity bounds for cryptographic primitives. The publications span top venues including STOC, FOCS, Crypto, and Eurocrypt, showing sustained high-impact research output. The Kadar Family Award for Outstanding Research (2018) Tel Aviv University Rector's Awards for Excellence in Teaching (2017, 2018) SIAM Outstanding Paper Prize (2011) Intel Israel award for outstanding PhD students (2008) Multiple best paper awards (CRYPTO 2006, ICALP 2006) Haitner has advised numerous PhD students including Noam Mazor, Jad Silbak, and Eliad Tsfadia. His research has been supported by multiple Israel Science Foundation grants (2011-2023), an ERC Starting Grant (2015-2020), and Blavatnik ICRC grants. He also maintains industry connections through roles at Coinbase (2022-2024) and previous consulting positions at Unbound Security and Team8. His professional service includes editorial work for SIAM Journal on Computing and program committee memberships for major cryptography conferences including Crypto, Eurocrypt, and TCC. He co-organizes the Greater Tel Aviv Area Cryptography Seminar and other specialized workshops.
Aarushi Goel is an Assistant Professor in the Computer Science department at Purdue University , specializing in cryptography. She previously held a postdoctoral position at NTT Research's CIS Lab under Sanjam Garg and earned her PhD from Johns Hopkins University in 2022, advised by Abhishek Jain. Research Focus: Designing efficient techniques for secure multiparty computation (MPC) and zero-knowledge proofs (ZKPs), with applications in privacy-preserving systems, blockchain, and cloud security. Teaching: Courses include Advanced Cryptography (CS65500) and Special Topics in Cryptography (CS59200-STC), emphasizing state-of-the-art ZKP methods and MPC protocols. Scientific Awards: Simons-Berkeley Research Fellow (2025), participating in the program "Cryptography 10 Years Later".
Nicholas Hopper is a Professor and Associate Department Head of Instruction in the Computer Science & Engineering Department at the University of Minnesota's College of Science and Engineering. He has been a faculty member at the University of Minnesota since completing his PhD at Carnegie Mellon University in 2004, and has established himself as a leading researcher in online communications security and privacy. Dr. Hopper received his B.A. from the University of Minnesota, Morris in 1999 and his Ph.D. in Computer Science from Carnegie Mellon University in 2004. Nicholas Hopper's primary research interest is in online communications security and privacy. Within this field, his main focus is on anonymous communication, censorship resistance, and applied cryptography. His work has significantly advanced the understanding of website fingerprinting attacks and defenses, particularly in the Tor network. Hopper has also made important contributions to secure messaging protocols, privacy-preserving technologies, and network security. His research often combines theoretical cryptography with practical implementations to address real-world privacy challenges. Over his career, his work has been cited more than 5,000 times, demonstrating substantial impact in the security and privacy community. Hopper's recent publications demonstrate a strong focus on website fingerprinting in Tor, with multiple papers on defenses like RegulaTor and analyses of information leakage. His work increasingly incorporates machine learning techniques for both attacks (like DeepCoFFEA) and defenses. There's also a consistent thread of research on secure messaging protocols and group communication. The breadth of his work spans theoretical cryptography, practical security implementations, and privacy metrics, with a particular emphasis on real-world applicability and evaluation. Dr. Hopper has received numerous prestigious awards for his work: NSF CAREER award (2006) Institute of Technology Student Board "Professor of the Year" award (2007) McKnight Land-Grant Professor award (2008) Best Student Paper Award at ACM CCS (2012) Andreas Pfitzmann Best Student Paper Award (2013) Honorable Mention for the 2013 PET Award for Outstanding Research Dr. Hopper has advised numerous graduate students, including over 10 PhD graduates who have gone on to academic positions at institutions like Ewha Womens University, University of Colorado Colorado Springs, and University of Tennessee. His current PhD students continue to work on cutting-edge privacy and security problems. He has served in significant leadership roles in the security research community, including as Program Chair for PETS 2010 and 2011, and as an Associate Editor for ACM TISSEC. His extensive service on program committees for major security venues (IEEE S&P, NDSS, CCS, CRYPTO, TCC, PETS, WPES, Financial Crypto, and WWW) demonstrates his standing in the field. While specific lab information isn't prominently featured in the provided materials, Dr. Hopper's research group appears to focus on privacy-enhancing technologies, particularly related to the Tor network. His students' work on website fingerprinting, secure messaging, and censorship resistance suggests an active research group working at the intersection of theory and practice in security and privacy. His research has practical implications for users seeking anonymity online and has influenced the design of privacy-preserving systems.
Alan T. Sherman is a Professor of Computer Science in the Department of Computer Science and Electrical Engineering at the University of Maryland, Baltimore County (UMBC). He holds a Ph.D. from MIT (1987), an S.M. from MIT (1982), and a Sc.B. from Brown University (1978). His research focuses on high-integrity voting systems, cybersecurity education, cryptology, discrete algorithms, and formal methods for analyzing cryptographic protocols. Sherman is a key contributor to the Scantegrity voting system, which ensures voter verifiability and privacy in optical scan elections. He has also developed educational tools like CyberGuardian and MeetingMayhem to teach cybersecurity concepts through game-based learning. He advises students and collaborates on grants related to election security, privacy-preserving technologies, and cybersecurity education. Sherman is affiliated with UMBC's Center for Information Security and Assurance (CISA) and has organized events such as the Pan-American Chess Championships and consulting initiatives in voting system design. His work bridges theoretical cryptography with practical applications, emphasizing trustworthy computing and secure voting infrastructure.
Ghada Almashaqbeh is an Assistant Professor of Computer Science at the University of Connecticut's School of Computing, affiliated with the Connecticut Advanced Computing Center (CACC) and the Engineering for Human Rights Initiative. Previously, she cofounded CacheCash (based on her PhD work) and worked as a Cryptographer at NuCypher. She is currently a scientific advisor at Sunscreen and The Melon, and holds 2023 fellowships from the Foresight Institute and Uniswap Foundation's TLDR program. She earned her PhD in Computer Science from Columbia University (2019), advised by Allison Bishop and Tal Malkin, and is supported by NSF, Protocol Labs, and UConn grants. Her research focuses on cryptography, systems security, and privacy, particularly in blockchain and distributed systems. Key areas include secure blockchain scalability (chainBoost, ammBoost), privacy-preserving smart contracts (smartFHE), unclonable cryptography using biochemical materials, and revocable proxy signatures. Her work bridges theory and practice, emphasizing real-world applications and rigorous validation. She has received awards including the 2023 Foresight Institute Fellowship and Uniswap Foundation's TLDR Fellowship. Her lab recruits postdocs and PhD students to tackle challenges in cryptography, privacy, and systems security. She emphasizes interdisciplinary approaches, combining cryptography with biochemistry and distributed systems for practical solutions.
