جستجوی استاد راهنمای دانشگاهی

Bryan Parno is a Professor at Carnegie Mellon University in the Departments of Electrical & Computer Engineering and Computer Science . He is the recipient of the Kavčić-Moura Chair and leads the Secure Foundations Lab , focusing on end-to-end secure systems through formal verification. Research spans secure systems , applied cryptography , distributed systems , and zero-knowledge proofs Developed Verus (verified Rust systems) and Project Everest (verified HTTPS stack) Key contributions include Ironclad , Flicker , and Pinocchio , with impacts on Intel CPUs and Windows/iOS security models His work emphasizes open-source tools and reproducibility , often published in top venues like POPL, PLDI, and IEEE S&P. Recent projects address WebAssembly security and formal verification of complex distributed systems . Major Awards Jay Lepreau Best Paper Award (OSDI 2025) IEEE Cybersecurity Award for Practice (2024) Sloan Research Fellowship (2018) Test-of-Time Awards (IEEE S&P 2023, IEEE S&P 2020) Best Paper Awards at USENIX Security, OOPSLA, and PLDI

• Secure Systems
• Formal Software Verification
• Verifiable Computation
• +۷ مورد دیگر

Duong Hieu Phan is a Professor at Telecom Paris, part of the Institut Polytechnique de Paris, and Head of the Cybersecurity-Cryptography team. He holds a Ph.D. in Computer Science from Ecole Normale Supérieure and has extensive postdoctoral experience at University College London and research roles at France Telecom R&D. His academic career includes roles as an assistant/associate professor at LAGA, University of Paris 8 (2007–2015), and later as a professor and director of the Master 2 Maths CRYPTIS program at XLIM, University of Limoges (2015–2020). His research focuses on cryptography, with emphasis on provable security, functional encryption, privacy-preserving systems, and anamorphic cryptography. Key areas include secure communication mechanisms against oppressive surveillance, decentralized systems, and post-quantum security. He has contributed to foundational work on CCA security for FHE, quantum-resistant protocols, and verifiable functional encryption. Prof. Phan is actively involved in professional committees, including IACR ASIACRYPT and PKC steering committees, and editorial boards such as the IACR CIC Journal. He promotes Franco-Vietnamese scientific collaboration through roles in the CNRS IRL partnership. His teaching spans cryptography, algorithms, and mathematics at undergraduate and master’s levels, including program coordination and research supervision.

• Cryptography
• Provable Security
• Functional Encryption
• +۷ مورد دیگر

David Pointcheval is a CNRS Researcher at the Computer Science Department of École Normale Supérieure (ENS) in Paris, France. Since 2005, he has led the Cryptography Team, which has been associated with Inria since 2008. He became the Chair of the Computer Science Department at ENS in 2017. Education: PhD in Computer Science (1996) from University of Caen. His research focuses on the provable security of cryptographic primitives and protocols. He has contributed to privacy-preserving aggregation techniques for data from multiple sources, including work on homomorphic encryption and functional encryption. He has served as program chair for major cryptography conferences (PKC 2010, Eurocrypt 2012) and held leadership roles in the International Association for Cryptologic Research (IACR) as one of nine elected directors for nine years. He holds over 150 international publications and a dozen patents. Scientific Awards: ERC Advanced Grant (Privacy for the Cloud)

• Cryptography
• Provable Security
• Cryptographic Protocols
• +۳ مورد دیگر

Phong Nguyen is a Research Professor at Inria (Directeur de recherche) and a part-time professor at the Computer Science Department (DI ENS) of École Normale Supérieure (ENS), PSL University in Paris. He leads the ENS Crypto Team (Inria Equipe Projet Cascade) and serves as the principal investigator for the ERC Advanced Grant PARQ (2020) focused on lattices in parallel and quantum computing. He holds a PhD (1999) and Habilitation (2007) from ENS-Lyon, with an agrégation de mathématiques (1997). His research integrates cryptography, algorithmic number theory, and lattice-based computations, emphasizing: Cryptanalysis : Deconstructing cryptographic protocols, especially lattice-based systems Post-quantum cryptography : Developing quantum-resistant solutions Lattice algorithms : Optimization of reduction, enumeration, and sieving techniques Real-world applications : Bridging theoretical constructs with practical security implementations His publications (spanning Eurocrypt, Asiacrypt, and Journal of Cryptology) demonstrate deep expertise in lattice cryptography, with recurring themes in algorithm efficiency, cryptanalysis of NTRU/GGH systems, and theoretical advancements in lattice reduction. Recent work (2024) continues this trajectory with improved BKZ analysis and hypercubic lattice optimizations. Awards include : ERC Advanced Grant (2020) for PARQ project Best Paper Award at EUROCRYPT 2006 Cor Baayen Award (2001) He advises PhD students (e.g., Henry Bambury, Leo Ducas) and interns from institutions like École Polytechnique and ENS. He directs the ENS Crypto Team and previously held leadership roles as: French Director of the Japanese-French Laboratory for Informatics (2015-2019) European Director of LIAMA (Sino-European Computer Science Lab, 2013-2015) Coordinator of ECRYPT II virtual labs (2008-2012)

• Cryptography
• Cryptanalysis
• Post-quantum Cryptography
• +۵ مورد دیگر

Yassine Lakhnech is a Professor at the University Joseph Fourier (Grenoble 1), leading the 'Distributed and Complex Systems' research team within the VERIMAG laboratory. His work focuses on computer security, cryptography, formal verification, and programming language semantics. He has been actively involved in coordinating major interdisciplinary research initiatives like the PERSYVAL-lab, which addresses cyber-physical systems (CPS) challenges. His research bridges computational and formal approaches, with contributions to cryptographic protocol analysis, information flow control, and automated theorem proving. Key projects include the development of tools like HERMES for cryptographic protocol verification and involvement in ANR-funded projects such as Verso, PROSE, and AVOTE. He has also organized international conferences and workshops, including the Canada-France MITACS Workshop on Foundations & Practice of Security and the Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign. His publications span over 147 papers, with an h-index of 25 and g-index of 42, reflecting significant contributions to formal methods, security protocols, and hybrid systems. Despite his role as Vice President of Research, he maintains active scientific productivity, emphasizing the integration of theoretical and practical advancements in CPS and security.

• Computer Security
• Cryptography
• Formal Verification
• +۵ مورد دیگر

Amin Timany is an Associate Professor in the Department of Computer Science at Aarhus University, Denmark, where he conducts research in programming languages, type theory, and formal verification. He is a member of the Logic and Semantics Group and actively contributes to the development of logical relations, separation logic, and proof assistants such as Coq and Iris. He holds a PhD in Computer Science from KU Leuven (2018) and was previously a postdoctoral fellow with FWO at KU Leuven. His research focuses on mechanized semantics, program equivalence, concurrency, and distributed systems verification. He is particularly known for solving the long-standing problem of proving encapsulation in the ST monad using logical relations. His recent publications span top-tier venues including POPL, ICFP, PLDI, and CPP, with key contributions in guarded interaction trees, higher-order separation logic (e.g., Trillium), and modular verification of CRDTs and virtual machines. His work emphasizes formalization and mechanization in Coq, often within the Iris framework. He has served on numerous program committees and has chaired conferences such as CPP and sessions at CoqPL. Notably, his paper 'Modular Denotational Semantics for Effects with Guarded Interaction Trees' received a Distinguished Paper Award at POPL 2024. PhD, KU Leuven, 2018 MSc, TU Dresden, 2013 He teaches courses such as Compilation, Program Logics, and Advanced Topics in Programming Language Theory. He collaborates extensively with researchers like Lars Birkedal, Robbert Krebbers, and Derek Dreyer, and mentors students in formal methods and PL theory.

• Programming Languages
• Type Theory
• Logical Relations
• +۹ مورد دیگر

Thomas Stoll is a tenured Professor at the Faculty of Science and Technology , University of Lorraine, Nancy, France. He leads research in Analytic and Combinatorial Number Theory , focusing on Diophantine equations , digital expansions , and sum-of-digits functions . He is affiliated with the IECL (Institut Élie Cartan de Lorraine) and has coordinated ANR-FWF research projects like MuDeRa and ArithRand .

• Analytic Number Theory
• Combinatorial Number Theory
• Diophantine Equations
• +۸ مورد دیگر

Thomas Debris-Alazard is a research scientist at Inria within the Grace project-team and a part-time assistant professor at École Polytechnique. His work focuses on code-based and lattice-based cryptography, with significant contributions to post-quantum cryptographic design and analysis. PhD in Code-Based Cryptography, Sorbonne University (2019) His research interests include code-based and lattice-based cryptography, post-quantum security, quantum algorithms, and information theory. He has made foundational contributions to the understanding of decoding problems, learning with errors, and the design of secure cryptographic primitives resistant to quantum attacks. The recent publications highlight a strong focus on the theoretical underpinnings of code-based cryptography, including hardness reductions, decoding algorithms, and the security of post-quantum signature schemes. His work bridges classical and quantum computational models, with an emphasis on provable security and cryptanalysis. Best Paper Award at Asiacrypt 2019 He has advised PhD students Maxime Bombar and Pierre Loisel. He is the principal investigator of the ANR JCJC COLA project and coordinator of the Wave signature scheme for NIST standardization. His teaching at École Polytechnique includes courses on code-based cryptography, information theory, and quantum computing.

• Code-based Cryptography
• Lattice-based Cryptography
• Post-Quantum Cryptography
• +۵ مورد دیگر

Dr. Damien Vergnaud is a Full Professor at Sorbonne University since September 2017, affiliated with the ALMASTY research team within LIP6 (Laboratoire d'Informatique de Paris 6), the Computer Science department of the Faculty of Science. His office is located at 4 place Jussieu, Paris, France, in Couloir 24-25, Étage 4, Bureau 412. Dr. Vergnaud holds a doctorate degree in mathematics from Université de Caen Basse-Normandie and an habilitation thesis in computer science from École normale supérieure. His research focuses on the design of efficient and secure cryptographic protocols, theoretical aspects of provable security, number theory, and randomness in cryptography. His work spans multiple domains including post-quantum cryptography, zero-knowledge proofs, secure implementation techniques against side-channel attacks, and cryptographic protocol analysis. He actively investigates how quantum computing impacts traditional cryptographic assumptions and protocols, as evidenced by his supervision of PhD students working on quantum-related cryptographic topics. Dr. Vergnaud's recent publications demonstrate a strong focus on post-quantum cryptographic techniques, zero-knowledge argument systems, and secure implementation methodologies. His research output shows consistent collaboration with both academic researchers and industry partners, particularly in practical cryptographic implementations. His work bridges theoretical foundations with practical security considerations, addressing challenges in modern cryptographic systems including resistance to quantum computing threats and side-channel analysis. Dr. Vergnaud actively supervises PhD students, currently mentoring three doctoral candidates and having successfully guided four students to completion in recent years. His supervision spans diverse topics within cryptography, including post-quantum cryptographic techniques, zero-knowledge arguments, secure implementations against physical attacks, and mathematical studies of pseudorandom number generators. He has served on numerous PhD defense committees, indicating his active role in the academic community. Dr. Vergnaud is a member of the ALMASTY research team at LIP6, which specializes in cryptographic algorithms and protocols. The team works on both theoretical foundations and practical implementations of cryptographic systems, with particular emphasis on security against various attack vectors including quantum computing threats and side-channel analysis.

• Cryptography
• Post-quantum cryptography
• Zero-knowledge proofs
• +۴ مورد دیگر

Jacques Stern is a renowned Professor of Computer Science at the École normale supérieure (ENS) in Paris, France, where he has held a position since 1992. He has also served as Director of the Computer Science Laboratory at ENS from 1996 to 2007 and as Chairman of the Board for Ingenico SA and the Agence Nationale de la Recherche (ANR). His work has significantly advanced cryptology, particularly in areas like public-key encryption, cryptanalysis, and cryptographic protocols. École polytechnique (1968) École normale supérieure (1968–1972) Agrégation de Mathématiques (1971) PhD in Sciences (1975) Jacques Stern's research spans foundational and applied aspects of cryptography. Key interests include complexity theory , public-key encryption , block ciphers , cryptographic protocols , and cryptanalysis . His work on coding theory and smart card applications bridges theoretical and practical security challenges. His publications emphasize cryptanalysis of public-key systems, signature schemes , and security proofs . Notable trends include lattice-based cryptography , algebraic attacks , and provable security frameworks. CNRS Gold Medal 2006 RSA Award for Excellence in Mathematics 2007 CNRS Silver Medal 2005 Prix Lazare Carnot 2003 Prix Science et Défense 2008 Fellow of IACR 2005 Jacques Stern has advised numerous researchers through collaborations with scholars like David Pointcheval, Antoine Joux, and Guillaume Poupard. His leadership roles at ENS, ANR, and ARCEP reflect his influence on national research and cybersecurity policy. He has contributed to cryptographic standards, including evaluations of AES candidates. As Director of the ENS Computer Science Laboratory (1996–2007), he fostered interdisciplinary research. His later advisory roles (e.g., ARCEP, 2012–) continue to shape electronic communications regulation.

• Cryptography
• Cryptanalysis
• Public Key Encryption
• +۵ مورد دیگر

Jonathan Protzenko is a Principal Researcher at Microsoft Azure Research , focusing on advancing the theory and practice of software verification through formal methods and type systems. His work bridges critical security gaps in modern programming languages, with verified code integrated into major software like BoringSSL, Linux kernel, Python, and Firefox. PhD in Computer Science from INRIA Paris (2014) Formerly at Microsoft Research (9 years) and INRIA's Gallium team (2010–2014) His research spans verified cryptography (EverCrypt, HACL*), Rust verification (Aeneas, Eurydice), and computational law (Catala). Recent projects include: Rust verification (2022–present): Aeneas and Eurydice toolchains for bidirectional Rust-C compilation Verified protocol stacks (2019–present): Noise*, MLS*, and Signal* implementations Formal computational law (2020–2022): Catala for formalizing legal texts Open-source impact (2009–present): Maintaining Thunderbird add-ons His 15 most recent publications (2025–2021) highlight trends in Rust verification , secure messaging protocols , and formal methods for legal frameworks . Scientific accolades include the Internet Defense Prize and SIGPLAN Research Highlight . Notable advisees include Théophile Wallez and Denis Merigoux , who won the Gilles Kahn PhD Award . His work involves collaborations with startups like Cryspen and formal verification toolchains like KreMLin .

• Type Systems
• Programming Languages
• Software Verification
• +۱۰ مورد دیگر

Jay Bosamiya is a Senior Researcher at Microsoft Research (mapped to Researcher academic rank) and a PhD graduate from Carnegie Mellon University (advised by Bryan Parno). His research explores the intersection of Security , Systems , and Programming Languages , focusing on provably-safe software sandboxing and memory-safe execution of unsafe code. Education : PhD in Computer Science (CMU), BTech in Computer Science and Engineering (IIT Roorkee) Key Contributions : Lucet (high-concurrency sandboxing runtime), MSWasm (memory safety enforcement), and WebAssembly security frameworks His recent publications (2020-2023) emphasize compiler design , formal verification , and secure execution environments . Notable awards include four consecutive DEFCON CTF championships (2022-2025) as a member of MushMush (MMM) and Plaid Parliament of Pwning (PPP). Beyond research, he actively participates in open-source development, CTF competitions, and occasionally shares insights on JavaScript quirks, game development, and formal methods via social media.

• Security
• Systems
• Programming Languages
• +۳ مورد دیگر

Pierre Senellart is a Professor in the Computer Science Department at École normale supérieure (ENS, Université PSL) and deputy director of the DI ENS laboratory, a joint CNRS/Inria/ENS unit. He leads the Valda team at Inria Paris and holds a chair in the PRAIRIE Paris School of AI. University: École normale supérieure (Université PSL) School: Department of Computer Science (DI ENS) Academic Rank: Professor Research Interests: His work bridges theoretical and practical aspects of web data management, including web crawling, archiving, information extraction, uncertainty management, and intensional data systems. He contributes to probabilistic XML data models, provenance tracking, and knowledge base construction. Recent Article Trends: His Google Scholar publications (2025–2023) focus on provability in probabilistic databases, theorem extraction from PDFs, and AI applications in uncertain data analysis. Topics span game theory, knowledge compilation, and multi-modal learning for scientific documents. Scientific Awards: Junior member of Institut Universitaire de France (2020–2025) Distinguished SIGMOD 2017 Program Committee Member ACM HyperText 2014 Douglas Engelbart Best Paper Award Adviser of Clément Genzmer (SIGMOD Programming Contest 2009 winner) Grants & Projects: He secures major funding (e.g., PRAIRIE Paris School of AI: €575k, DesCartes CNRS@CREATE: SGD50M), with roles in research projects like Dissemin (open science platforms) and ARCOMEM (social web archiving).

• Web Data Management
• Probabilistic Databases
• Provenance in Databases
• +۴ مورد دیگر

Ron Steinfeld is an Associate Professor at Monash University's Faculty of Information Technology, where he leads research in cryptography and cybersecurity. His work focuses on lattice-based cryptography, post-quantum algorithms, and secure multiparty computation. Dr. Steinfeld has made significant contributions to NIST's post-quantum cryptography standardization process through his Titanium proposal. Recent research includes efficient discrete Gaussian samplers (FACCT, COSAC), zero-knowledge proof optimizations, and blockchain security protocols. He received the Best Paper Award at ASIACRYPT 2015 for improved security proof techniques using Renyi divergence. Dr. Steinfeld serves on program committees for major cryptography conferences including CRYPTO and ASIACRYPT. His laboratory develops practical cryptographic solutions for quantum-resistant systems, with applications in secure communications and privacy-preserving protocols. Professional activities include coordinating Monash's Cybersecurity Reading Group and collaborating with international research teams.

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

Cédric Fournet serves as Senior Principal Research Manager at Microsoft Research in Cambridge, UK, where he leads the Constructive Security research team. He also directs the Secure Distributed Computations project at the MSR-INRIA Joint Center in collaboration with INRIA Paris's Prosecco team. With over two decades of experience since joining Microsoft Research in 1998, Fournet maintains active collaborations across academic and industrial research communities. His educational background includes graduation from École Polytechnique in 1992, followed by a year working on deductive databases at BULL. He obtained a second engineering degree from École Nationale des Ponts et Chaussées in 1995 and completed his PhD in computer science at INRIA Rocquencourt, where he applied concurrency theory to distributed programming through a variant of the pi calculus. Fournet's research spans multiple interconnected domains in computer security and programming languages. His primary focus involves building, verifying, and deploying secure components for critical infrastructure, most notably through the Everest project which aims to create verified replacements for HTTPS components like miTLS. His work integrates formal methods with practical security concerns, addressing challenges in cryptographically-verifiable computing, TLS security, secure cloud outsourcing using trusted hardware (SGX, TPM), side-channel resistance, and information-flow security. A unifying thread throughout his career is the application of dependent types, particularly through the F* programming language, to create provably secure systems. Analysis of his recent publications reveals a consistent trajectory toward verified security implementations across diverse platforms and protocols. His work has evolved from theoretical foundations in cryptographic protocol verification to practical, production-ready systems like EverCrypt and EverParse. The research demonstrates increasing sophistication in handling real-world constraints while maintaining formal guarantees, with recent work addressing microarchitectural security, confidential computing in AI accelerators, and media provenance for combating synthetic media. CCS Distinguished Paper Award (2024) for Principled Microarchitectural Isolation on Cloud CPUs Best Paper Award Nominee (2023) for Confidential Consortium Framework Distinguished Paper Award (2015) for A Messy State of the Union: Taming the Composite State Machines of TLS As leader of the Constructive Security team at Microsoft Research, Fournet oversees multiple significant research initiatives with substantial funding from both internal Microsoft resources and external collaborations. His team's work on Everest has received sustained support for developing verified cryptographic implementations, while the MSR-INRIA Joint Center provides a framework for international collaboration on secure distributed systems. The team maintains strong industry partnerships that facilitate the transition of research prototypes into deployed systems. The Constructive Security research team operates at the intersection of theory and practice, maintaining close connections with both the INRIA Prosecco team in Paris and various Microsoft product groups. Their work environment emphasizes formal verification techniques applied to real-world security challenges, with particular focus on creating tools and frameworks (like F*) that enable building systems with strong security guarantees. The team's approach combines deep theoretical insights with practical engineering considerations to produce solutions that are both formally verified and deployable in production environments.

• Security
• Privacy
• Cryptography
• +۷ مورد دیگر