جست‌وجوی استاد و پژوهشگر

Artur Konrad EKERTمشاهده پروفایل

استاد پژوهشی

• Quantum Information Processing
• Quantum Cryptography
• Quantum Computing
• +۳ مورد دیگر

Artur Konrad EKERT is a Research Professor at the National University of Singapore , a Lee Kong Chian Centennial Professor , and a Fellow of the Royal Society (FRS) . His work bridges theoretical and experimental quantum physics, computer science, and information theory, with a focus on quantum cryptography and quantum computing. Education: DPhil from the University of Oxford (1991). His research explores the foundational principles of quantum information processing, emphasizing secure communication protocols and algorithmic efficiency. Key contributions include advancing entanglement-based cryptography and analyzing quantum privacy limits. His publications span quantum key distribution, relativistic quantum effects, and computational complexity, reflecting interdisciplinary collaborations. Scientific awards include: Fellow of the Royal Society (FRS) Lee Kong Chian Centennial Professorship He has mentored researchers in quantum cryptography and contributed to experimental implementations of quantum communication technologies.

Aayush Jainمشاهده پروفایل

استادیار

• Cryptography
• Theoretical Computer Science
• Applied Cryptography
• +۳ مورد دیگر

Aayush Jain is an Assistant Professor in the Computer Science Department at Carnegie Mellon University. Previously, he was a Postdoctoral Fellow at NTT Research and a PhD student at UCLA, advised by Professor Amit Sahai. His work bridges theoretical and applied cryptography with core computer science principles. Education PhD in Computer Science, University of California, Los Angeles (UCLA) Postdoctoral Fellowship, NTT Research Research Focus His research explores: foundational cryptography, indistinguishability obfuscation, functional encryption, lattice-based cryptography, secure multi-party computation, and post-quantum security. Work emphasizes rigorous theoretical frameworks with practical implications. Publication Trends Recent articles (2021-2024) demonstrate consistent focus on cryptographic primitives, obfuscation techniques, and security reductions. Dominant venues include CRYPTO, EUROCRYPT, FOCS, and STOC with emerging work in machine learning interfaces. Awards Best Paper Award at STOC 2021 for foundational contributions to indistinguishability obfuscation Advising and Collaboration Current PhD advisees: Alper Cakan, Quang Dao (co-advised), Sagnik Saha, Noah Singer (co-advised). Mentored postdocs: Mitali Bafna (2022-2023) and Rex Fernando (2022-2023). Teaches graduate courses in cryptography and theoretical tools. Leadership Leads the CMU Cryptography research group; organized the CMU Cryptography Workshop. Program committee member for FOCS, TCC, ITCS, and ICALP.

Riham AlTawyمشاهده پروفایل

دانشیار

• IoT Security
• Lightweight Cryptography
• Blockchain Consensus Mechanisms
• +۳ مورد دیگر

Riham AlTawy is an Associate Professor and MTIS Program Director at the Department of Electrical and Computer Engineering, University of Victoria. She previously held positions as an NSERC Postdoctoral Fellow at the University of Waterloo and an NSERC Canada Graduate Scholar at Concordia University. Her research focuses on IoT security, blockchain consensus mechanisms, lightweight cryptographic primitives, and privacy-preserving protocols. She leads the IoTSec group, which develops application-specific cryptographic solutions for IoT authentication and privacy challenges. Education includes postdoctoral training at the Communication Security (ComSec) group (University of Waterloo) and doctoral studies at Concordia University. Her work has led to publications in top venues such as IEEE Transactions and CANS conferences. She actively seeks PhD research assistants and postdoctoral fellows in cryptographic research. Key research areas include authentication protocols for edge computing, privacy in cross-domain systems, and lightweight algorithms for constrained devices. Her group emphasizes practical solutions for real-world IoT security challenges.

Vinod Vaikuntanathanمشاهده پروفایل

استاد

• Cryptography
• Fully Homomorphic Encryption
• Lattice-Based Cryptography
• +۴ مورد دیگر

Vinod Vaikuntanathan is the Ford Foundation Professor of Engineering in the MIT EECS department and a principal investigator at MIT CSAIL. He holds a BTech from IIT Madras (2003), and SM/PhD degrees from MIT (2005/2009). His research focuses on cryptography, particularly fully homomorphic encryption (FHE), lattice-based cryptography, and quantum-resistant systems. He co-founded Duality Technologies as Chief Cryptographer. **Education:** BTech in Computer Science (2003), Indian Institute of Technology Madras SM in Electrical Engineering & Computer Science (2005), MIT PhD in Computer Science (2009), MIT **Research Interests:** His work spans FHE (enabling computations on encrypted data), lattice-based cryptography (post-quantum security), and intersections with quantum computing, machine learning, and privacy. He explores applications in secure computation, algorithm design, and cryptographic protocols. **Awards:** Recipient of the Gödel Prize (2022), Simons Investigator (2023), and MacVicar Faculty Fellow (2024). His work on FHE and lattice algorithms has earned widespread acclaim in cryptography and theoretical computer science. **Teaching & Mentorship:** Advanced cryptography courses at MIT (e.g., 6.5630, 6.876J) Advised PhD students (e.g., Sergey Gorbunov, Tianren Liu) and postdocs (e.g., Nir Bitansky, Mark Zhandry) now leading positions in academia and industry **Collaborations:** Organizer of the Charles River Crypto Day and MIT Cryptography Seminar Principal investigator on grants from NSF, DARPA, and Microsoft

• Cryptography
• Post-Quantum Cryptography
• Network Security
• +۳ مورد دیگر

Douglas Stebila is an Associate Professor in the Department of Combinatorics and Optimization at the University of Waterloo, Faculty of Mathematics. His research focuses on cryptographic protocols, with an emphasis on post-quantum cryptography, TLS protocol security, and key exchange mechanisms. He has contributed to the design and analysis of cryptographic systems resilient to quantum computing threats, including work on hybrid key exchange methods and post-quantum TLS implementations. Stebila is involved in standards projects such as the Open Quantum Safe initiative, aiming to transition existing infrastructure to quantum-resistant algorithms. His recent work addresses security models for cryptographic protocols, including formal verification of key establishment schemes and analysis of real-world protocols like Signal and TLS. His research spans theoretical cryptography, applied protocol analysis, and implementation security. Key contributions include studies on obfuscated key exchange, verifiable decapsulation of post-quantum KEMs, and optimization of TLS handshake efficiency (e.g., TurboTLS). He also explores challenges in cryptographic protocol design, such as preventing double authentication and ensuring resistance against side-channel attacks. His work frequently bridges academic research with practical applications, emphasizing the transition of cryptographic innovations into real-world systems. Stebila collaborates with industry and academic partners on projects like the Open Quantum Safe initiative, which develops libraries for post-quantum cryptography integration. His publications often address security analyses of emerging protocols and their vulnerability to both classical and quantum adversaries. He has co-authored conference proceedings for major venues like CRYPTO and SAC, and contributed to standards documentation for protocols such as TLS and SSH.

Chris Peikertمشاهده پروفایل

استاد

• Cryptography
• Lattice-based Cryptography
• Coding Theory
• +۲ مورد دیگر

Chris Peikert is a Professor in the Department of Computer Science and Engineering at the University of Michigan's College of Engineering. He received his Ph.D. from MIT's Computer Science and Artificial Intelligence Laboratory in 2006 under the supervision of Silvio Micali. Peikert is a leading researcher in cryptography, particularly known for his foundational work in lattice-based cryptography. His research interests span cryptography, lattices, coding theory, algorithms, and computational complexity, with a particular focus on cryptographic schemes whose security can be based on the apparent intractability of lattice problems. Peikert has made significant contributions to the development and analysis of lattice-based cryptographic primitives, including ring-LWE, fully homomorphic encryption, and zero-knowledge proofs. Peikert's recent work demonstrates continued leadership in post-quantum cryptography, with publications in top venues like CRYPTO, EUROCRYPT, and STOC. His research spans theoretical foundations of lattice problems to practical implementations of lattice-based cryptographic systems, including hardware acceleration for fully homomorphic encryption. IACR Fellow (2024) Test-of-Time Award from Crypto 2008 (2023) TCC Test-of-Time Award (2017) Patrick C. Fischer Development Professor of Theoretical Computer Science (2017) Best Paper Award at Eurocrypt 2010 Best Paper Award at STOC 2009 Alfred P. Sloan Foundation Fellowship Google Research Award Peikert has been actively involved in the cryptographic research community, serving on program committees for major conferences including CRYPTO, EUROCRYPT, FOCS, and TCC (where he was program co-chair in 2021). He has also developed educational resources, including extensive lecture materials on lattice-based cryptography and teaching courses on cryptography and theoretical computer science at both the undergraduate and graduate levels.

• Cryptography
• Theoretical Computer Science
• Machine Learning
• +۳ مورد دیگر

Mohammad Mahmoody is an associate professor in the Computer Science Department at the University of Virginia. His research focuses on theoretical aspects of cryptography, computational complexity, and machine learning, particularly on understanding barriers such as lower bounds and impossibility results. He has taught courses including Algorithms, Cryptography, and Theory of Computation. His work explores foundational questions in cryptography, adversarial robustness in machine learning, and computational assumptions underlying cryptographic primitives. Education: Ph.D. in Computer Science from Princeton University (2010) Affiliations: University of Virginia, Department of Computer Science Research Interests: His interests span cryptography (e.g., encryption schemes, coin-tossing, and registration-based systems), theoretical computer science (computational complexity, algorithms), and machine learning (adversarial robustness, data poisoning). He emphasizes formal proofs and rigorous analysis in security and learning frameworks. Publications: Recent work includes studies on quantum-resistant cryptography, adversarial machine learning, and cryptographic protocol design. Key themes involve impossibility results, lower bounds for cryptographic assumptions, and the interplay between computational constraints and learning theory. Service & Grants: - Served on program committees for ICML, NeurIPS, CRYPTO, and TCC - Organized workshops on cryptography and lower bounds - Research funded by grants exploring adversarial robustness and cryptographic foundations Labs/Teams: - Collaborations with researchers in cryptography, machine learning, and theoretical computer science - Advises a team of graduate students and postdocs in security and learning theory.

Chris Monicoمشاهده پروفایل

دانشیار

• Cryptology
• Computational Algebra
• Number Theory
• +۶ مورد دیگر

Chris Monico is an Associate Professor in the Department of Mathematics & Statistics at Texas Tech University . He has been a faculty member there since 2003, following post-doctoral research at the University of Notre Dame. Education B.S. in Mathematics – Monmouth University M.S. in Mathematics – University of Notre Dame Ph.D. in Mathematics – University of Notre Dame Research Focus Monico’s scholarship centers on the intersection of cryptology , computational algebra , and number theory . A significant recent thrust has been the application of machine-learning techniques to mathematical finance , evidenced by work on random-forest models for option pricing and high-frequency trading risk metrics. Parallel lines of inquiry include post-quantum cryptographic schemes built on tropical algebra and semigroup actions, as well as classical problems in Ramsey theory and combinatorial semigroups . Publication Trends Between 2015 and 2025 Monico has published prolifically, with a clear shift around 2020 toward mathematical finance and machine-learning applications , alongside continued output in algebraic cryptanalysis and combinatorics . His 2024–2025 articles emphasize data-driven models in trading, whereas 2020–2021 works concentrate on cryptanalyses of tropical and group-based key-exchange systems. Earlier contributions focus on computational number theory and semigroup-based cryptography. Contact Information Email: c.monico@ttu.edu Phone: 806-834-4144 Office: Department of Mathematics & Statistics, Texas Tech University, 1108 Memorial Circle, Lubbock, TX 79409-1042 Advising & Grants No specific doctoral or master’s students, funded grants, or named awards are detailed in the provided text. Laboratory or Research Group The text does not mention any dedicated laboratory or research group.

Benne de Wegerمشاهده پروفایل

دانشیار

• Cryptology
• Information Security
• Cryptography Analysis
• +۵ مورد دیگر

Benne de Weger is an Associate Professor in the Department of Coding Theory and Cryptology at Eindhoven University of Technology (TU/e). His research focuses on cryptology, information security, computational number theory, and lattice-based cryptography. He holds MSc and PhD degrees in Mathematics from Leiden University. Prior to his academic position at TU/e, he worked in industry roles as a cryptographic software engineer and information security consultant. Research interests include RSA cryptanalysis, hash collision applications, Diophantine equations, and the abc-conjecture. His work bridges theoretical mathematics with applied cryptography, particularly in lattice-based systems and security protocol analysis. He has contributed to over 98 research outputs, including peer-reviewed articles and conference proceedings. Notable recent work involves lattice vector analysis and hybrid algorithms for cryptographic problem-solving. Benne has supervised 45 academic works but no specific student names are listed in the provided text. No scientific awards are explicitly mentioned. His research collaborations span global institutions, focusing on cryptographic systems and number theory applications.

• Quantum Computing Theory
• Computational Complexity
• Quantum Information Science
• +۳ مورد دیگر

Adam Bouland is an Assistant Professor of Computer Science at Stanford University, affiliated with the CS Theory Group. He holds a Ph.D. from MIT (advised by Scott Aaronson), followed by postdoctoral research at UC Berkeley and the Simons Institute for the Theory of Computing (advised by Umesh Vazirani). His research focuses on quantum computing theory, computational complexity, and their connections to physics. He teaches courses such as Quantum Complexity Theory (CS 359D) and Quantum Computing (CS 259Q), and has advised numerous doctoral, master’s, and postdoctoral researchers. His research group includes Tamara Kohler (postdoc), Shaun Datta, Jack Zhou, Jordan Docter, and Chenyi Zhang (doctoral students), among others. Bouland’s work bridges quantum algorithms, entanglement theory, and complexity theory, with contributions to quantum supremacy, pseudorandomness, and holographic principles. Recent highlights include studies on BosonSampling hardness, AdS/CFT duality constraints, and efficient quantum compilation. He has served on program committees for FOCS 2019, QIP 2020, STOC 2023, and ITCS 2025. His research is supported by grants including the NSF CAREER Award for exploring quantum pseudorandomness and complexity frontiers.

John Wrightمشاهده پروفایل

استادیار

• Quantum Computing
• Theoretical Computer Science
• Quantum Complexity Theory
• +۳ مورد دیگر

John Wright is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. His research centers on theoretical computer science with a focus on quantum computing, specifically quantum state learning, quantum complexity theory, property testing, and approximation algorithms. He is affiliated with the Simons Institute for the Theory of Computing. Education includes a Ph.D. in Computer Science from Carnegie Mellon University (2016), advised by Ryan O'Donnell, and a B.Sc. in Computer Science from the University of Texas at Austin. Research interests span quantum complexity, interactive proofs (e.g., MIP* = RE), quantum algorithms, and foundational aspects of quantum computation. His work bridges computer science, physics, and mathematics, with emphasis on understanding computational limits through quantum paradigms. Publications primarily explore quantum complexity, algorithms, and verification, with recent trends including quantum cryptography, tomography, and hardness proofs. Articles frequently involve collaborations with researchers like Thomas Vidick, Henry Yuen, and Ryan O'Donnell. Awards include the IEEE CS TCPAMI Young Researcher Award (2015). Teaching covers graduate and undergraduate courses such as CS 170 (Efficient Algorithms and Intractable Problems) and CS 294 (Quantum Complexity Theory). He advises students in quantum computing research and collaborates extensively across institutions. Labs/teams include the Quantum Computing group at UC Berkeley, with ties to the Simons Institute. Research support is managed by Amy Frithsen.

George O'Mahonyمشاهده پروفایل

مدرس

• Cybersecurity
• Cyber Resilience
• Network Security
• +۸ مورد دیگر

Dr. George O'Mahony serves as Head of Department of Computer Science at Munster Technological University (MTU) and is a CONNECT Associate Investigator with Research Ireland. He leads Ireland's Cyber Range infrastructure development and acts as WorldSkills Ireland Expert for Cybersecurity Skill 54, driving national cybersecurity initiatives through academia-industry collaboration. Education: B.E. in Electrical and Electronic Engineering, University College Cork (UCC) Ph.D. in Electrical and Electronic Engineering, University College Cork (UCC), 2021 His research pioneers cyber resilience frameworks for OT/IoT systems, zero-trust architectures, and machine learning applications in anomaly detection. He develops low-complexity security solutions for resource-constrained edge devices, with emphasis on wireless sensor networks, GPS applications, and penetration testing methodologies. His work bridges theoretical innovation with practical infrastructure implementation. Recent publications reveal accelerating focus on quantum-resistant cryptography, MQTT-ZT secure brokers, and unified cyber resilience models. His scholarly output consistently addresses interference detection in wireless networks while expanding into satellite communications security and AI-driven network customization, reflecting strategic adaptation to emerging cyber threats. Research Leadership: CONNECT: Associate Investigator advancing cyber security research NCF Cyber Shock: Co-Principal Investigator Cyber Explore: Principal Investigator at MTU Cyber Range: National infrastructure lead (mobile/cloud) Horizon Telemetry: Core research team member As STEM advocate and Cyber Futures Academy contributor, O'Mahony shapes cybersecurity education through WorldSkills Ireland engagement and industry-focused cyber range deployments that serve academic, governmental, and commercial sectors.

• Post-Quantum Cryptography
• Lattice-Based Cryptographic Schemes
• Homomorphic Encryption
• +۳ مورد دیگر

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.

John Clarkمشاهده پروفایل

استاد

• Cybersecurity
• Software Engineering
• Artificial Intelligence
• +۵ مورد دیگر

John Clark is a Professor of Computer and Information Security at the University of Sheffield since 2017 and Director of the Siemens Digital MINE. Previously, he held roles as Professor of Critical Systems at the University of York (1992–2017) and worked at Logica in security R&D. He studied Mathematics and Applied Statistics at the University of Oxford. His research focuses on cybersecurity, software engineering, and AI applications, particularly in threat modeling, intrusion detection, quantum cryptanalysis, and secure autonomous systems. Clark leads the Security of Advanced Systems research group and has secured grants totaling over £36 million. Notable projects include the EPSRC-funded DAASE (2012–2019) and the Active Building Centre (2018–2022). His work on phishing detection (e.g., analyzing user behavior) and malware analysis has been widely recognized. He has been awarded the Royal Society Wolfson Merit Award (2013), GEECO medals (2005, 2013), and multiple best-paper prizes. Clark’s research spans theoretical and applied domains, including evolutionary computation for cryptanalysis, robotic system security, and smart grid protection. His labs explore areas like digital twin authentication and privacy-aware energy theft detection. He has supervised numerous grants and maintains active collaborations with industry and academia.

Berk Sunarمشاهده پروفایل

استاد

• Applied Cryptography
• Cybersecurity
• Microarchitectural Security
• +۵ مورد دیگر

Berk Sunar is a Professor of Electrical & Computer Engineering and the founder of the Vernam Applied Cryptography and Cybersecurity Laboratory at Worcester Polytechnic Institute (WPI). He joined WPI in 2000 after holding postdoctoral and research roles at Oregon State University (OSU) and Trust Inc. His work focuses on applied cryptography, microarchitectural security, AI security, post-quantum cryptography, and homomorphic encryption. Sunar received his BSc from Middle East Technical University (1995) and PhD from Oregon State University (1998). Research interests include vulnerabilities in hardware (e.g., Rowhammer, TPM-FAIL), side-channel attacks, and cryptographic implementations. Notable contributions include discovering flaws in Intel CPUs and TPM chips affecting billions of devices, as well as developing defenses like cuHE (GPU-accelerated homomorphic encryption). Publications highlight breakthroughs in transient execution attacks (e.g., LVI, RIDL), post-quantum signature schemes (Dilithium), and cloud security (Firecracker VMM vulnerabilities). Awards include NSF CAREER (2002) and IBM Pat Goldberg Best Paper (2007). Advised over 30 graduate students, many of whom hold senior roles in academia and industry. Current research addresses AI security, quantum-resistant algorithms, and automated attack detection via machine learning. The Vernam Lab remains a hub for cybersecurity innovation.