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

Deian Stefanمشاهده پروفایل

دانشیار

• security
• programming languages
• systems
• +۷ مورد دیگر

Deian Stefan is an Associate Professor at the University of California San Diego (UCSD) in the Department of Computer Science and Engineering . His research spans security , programming languages , and systems , with a focus on building principled and practical secure systems. He has served as a co-founder and Chief Scientist at Intrinsic (acquired by VMWare) and contributed to standards bodies like the W3C WebAppSec and Node.js Security Working Groups . His research interests include: Secure Systems : Web frameworks, browser designs, sandboxing, runtime systems Language-Based Security : Constant-time programming, memory safety, information flow control Verification : Security verification, static/symbolic analysis tools WebAssembly and JavaScript JITs security Deian Stefan has received multiple scientific awards , including several Distinguished Paper Awards at venues like POPL, ICFP, and USENIX Security, as well as the IEEE Cybersecurity Award for Practice (2022) and CSAW 2020 First Place for Applied Research. He has taught courses on Computer Security (CSE 127, CSE 227) and advanced topics in Building Secure Systems (CSE 291) using Rust, WebAssembly, and blockchain security. His work has been supported by collaborations with industry and academia, including projects like RLBox and COWL .

• Cryptography
• Computational Number Theory
• Computer Algebra
• +۳ مورد دیگر

Damien Stehlé is a Professor at the École Normale Supérieure de Lyon (ENS Lyon), affiliated with the Laboratoire LIP (CNRS, ENSL, INRIA, UCBL, U. Lyon) and a member of the AriC team. He is also a member of the Institut Universitaire de France. His research focuses on cryptography, computational number theory, and computer algebra, particularly lattice-based cryptography and its applications in post-quantum security. He has held editorial roles at the Journal of Cryptology and Designs, Codes and Cryptography, and served on committees for major conferences like ASIACRYPT and CRYPTO. His work has led to advancements in lattice reduction algorithms, cryptographic protocols (e.g., signatures, encryption schemes), and security proofs in the quantum random oracle model. Stehlé has supervised numerous PhD students, including Alice Pellet-Mary and Miruna Rosca, and has contributed to open-source lattice reduction software like fplll. His awards include Best Paper Awards at ASIACRYPT 2021 and 2015. He teaches advanced courses on post-quantum cryptography and cryptanalysis at the Master’s level.

Bryan Parnoمشاهده پروفایل

استاد

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

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

Karim ZKIKمشاهده پروفایل

دانشیار

• Cybersecurity
• Blockchain Technologies
• Artificial Intelligence
• +۳ مورد دیگر

Karim ZKIK is an Associate Professor of Cyber Security and Information Systems at ESAIP Graduate School of Engineering, Angers, France. Previously, he served as an Assistant Professor at the International University of Rabat (UIR), Morocco. His roles include Educational Manager of the Cyber Security track, Head of the Cybersecurity Innovation Hub, and committee member for ABET certification and curriculum design. He actively contributes to academic service, organizing conferences such as the International Conference on Cryptology, Coding Theory, and Cyber Security (I4CS 2022), and serves as a Guest Editor for Computers and Industrial Engineering . His research focuses on cybersecurity for connected systems, blockchain technologies, AI-driven security solutions, and cyber resilience in industrial control systems. Recent work explores integrating blockchain and machine learning for threat detection, secure IoT networks, and supply chain resilience. Key contributions include frameworks for cyber resilience in retail and airlines, blockchain-based crowdfunding security, and SDN-based attack mitigation. ZKIK holds a Habilitation (2024) and PhD in Cyber Security from Université d’Angers and Mohamed V University, Rabat. He holds over 20 certifications from EC-Council, IBM, and Cisco. His work bridges theoretical research and industry applications, addressing challenges in smart environments, industrial systems, and sustainable supply chains.

Théo Winterhalterمشاهده پروفایل

پژوهشگر

• Type Theory
• Proof Assistants
• Formal Verification
• +۳ مورد دیگر

Théo Winterhalter is a researcher at INRIA Saclay and a member of the Laboratory of Mathematics and Computer Science (LMF) at ENS Paris-Saclay . He previously held a postdoctoral position at the Max Planck Institute for Security and Privacy (MPI-SP) and completed his PhD at the Gallinette research team in Nantes, supervised by Nicolas Tabareau and Matthieu Sozeau. Education PhD in Computer Science, 2017–2020, University of Nantes (Gallinette/Inria) MSc in Computer Science, École Normale Supérieure de Rennes Research interests include type theory , proof assistants , formal verification , and dependent types . He actively works on improving the safety and usability of proof assistants like Rocq (formerly Coq), focusing on rewrite rules, erasure, and cryptographic verification. His work often involves formalizing results within proof assistants and developing tools for verified programming. Contributions span conferences like POPL, ICFP, CPP, and TYPES. Recent projects include foundational verification of high-speed cryptography ( The Last Yard ), type-preserving rewrite rules ( The Rewster ), and modular cryptographic proofs ( SSProve ). His publications emphasize formal methods and computational assumptions in type theory. Teaching includes the Proof Assistants course at MPRI , a joint master’s program. He co-supervises PhD students like Yann Leray and has mentored interns on topics such as erased data implementation and Autosubst tooling. Labs and Teams : Deducteam (INRIA Saclay) – Developing deduction tools and formal verification LMF (ENS Paris-Saclay) – Laboratory for Mathematics and Computer Science Gallinette (former) – Team at INRIA Nantes MetaCoq Project – Collaborative effort on Coq verification

Vincent Rocaمشاهده پروفایل

پژوهشگر

• Privacy
• Robust Content Distribution
• Transport Protocols
• +۶ مورد دیگر

Vincent Roca is a permanent researcher at Inria , a French national research institute for digital science and technology. Since 2019, he leads the Privatics research team focusing on privacy, previously part of the Planete team (2000-2012) for Internet protocols and applications. His work spans Privacy in smartphones, IoT, and web browsers Design of the ROBERT and CLEA protocols for the French TousAntiCovid app Standardization in IETF working groups, notably on FEC and network coding Co-author of Inria's cybersecurity white book (2019) Instructor of the popular Privacy in the digital world MOOC (14,006 participants) Research Interests include privacy risks in digital technologies, robust content distribution via FLUTE/ALC transport protocols and LDPC-Staircase FEC codes, and network coding for scalable services. His articles focus on privacy in LoRaWAN, contact tracing protocols, GDPR compliance, and FEC optimization. Scientific Awards include the Third Applied Research Price from FIEEC (2014) Knight Medal of the French Order of Merit (2020) Students supervised include PhD candidates in privacy-preserving IoT, secure authentication, and alumni like Samuel Pelissier (LoRaWAN privacy) and Michael Toth (GDPR compliance). Software Contributions include openfec.org (AL-FEC codes) and FLUTE/ALC implementations .

Duong Hieu Phanمشاهده پروفایل

استاد

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

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.

Sihem Mesnagerمشاهده پروفایل

استاد

• Symmetric Cryptography
• Coding Theory
• Finite Fields
• +۱۰ مورد دیگر

Sihem Mesnager is a University Professor of Mathematics at the University of Paris VIII, affiliated with the Laboratory of Analysis, Geometry and Applications (LAGA) at Paris XIII (CNRS) and the AGC3 research group (Algebra, Geometry, Combinatorics) . She holds an adjunct professorship at Télécom Paris within the MIC2 Mathematics team of the Computer Science and Networks department (INFRES). Her work bridges pure mathematics and applied cryptography, focusing on Boolean functions, bent functions, and coding theory for secure communication and data protection. PhD in Mathematics, University of Pierre and Marie Curie (Paris VI), Sorbonne University (2002) Habilitation (HDR) in Mathematics, University of Paris VIII (2012) Research Interests Dr. Mesnager specializes in symmetric cryptography and coding theory , particularly their applications to secure digital communication, error correction, and post-quantum cryptographic protocols. Her algebraic approach employs finite fields, exponential sums, algebraic geometry, and finite geometry to analyze and construct cryptographic primitives like S-boxes, APN functions, and optimal linear codes. She also investigates algorithmic aspects of computer algebra in these domains. Scientific Awards George Boole International Prize (2020) PEDR Excellence Scientific Award (2019-2022) PEDR Excellence Scientific Award (2014-2017) Publications & Projects Her recent work includes constructing weightwise perfectly balanced Boolean functions for the FLIP cipher, optimizing Inner Product Masking schemes via coding theory, and developing post-quantum secure functional encryption using multivariate cryptography. She has contributed to Reed-Muller codes, BCH codes, and Gaussian sum-based linear codes with one-dimensional hulls, emphasizing their applications in side-channel attack resistance and quantum error correction.

• Programming Languages
• Formal Verification
• Compilers
• +۵ مورد دیگر

Clément Pit-Claudel is an Assistant Professor at École Polytechnique Fédérale de Lausanne (EPFL), leading the SYSTEMF lab focused on programming languages, formal methods, and systems engineering. His work bridges mathematical formalisms with practical system development to achieve full assurance in critical software and hardware. PhD in Computer Science from MIT (2016) William A. Martin Memorial Thesis Award recipient Former Senior Applied Scientist at Amazon AWS Teaching accolades including the Frederick C. Hennie III Teaching Award Research spans three axes: extensible proof-producing compilers for performance-critical systems, verified hardware compilation with cycle-accurate semantics, and interactive theorem prover tooling for democratizing verification technology. Key projects include Kôika for hardware verification, Alectryon for Coq proof visualization, and Fiat for correct-by-construction program synthesis. Recent publications address JavaScript regex verification (ICFP 2024), cryptographic server integration (PLDI 2024), and hardware simulation optimization (ASPLOS 2021). Articles demonstrate expertise in functional-to-imperative translation, domain-specific compiler extensions, and hardware-software co-verification. Scientific contributions recognized through: Distinguished artifact award (SLE 2020) MIT William A. Martin Thesis Award Frederick C. Hennie III Teaching Award Teaching philosophy emphasizes hands-on lab instruction , oral assessment , and automated tooling . Courses taught include Software Construction (undergraduate) and Interactive Theorem Proving (graduate) at EPFL. Research service includes program committee roles at Dafny, POPL, and SPLASH conferences.

Simone Aonzoمشاهده پروفایل

مدرس

• Cybersecurity
• Malware Analysis
• Android Security
• +۵ مورد دیگر

Simone Aonzo is a Class 2 Lecturer in the Digital Security department at EURECOM, a leading research and education institution in France focused on digital sciences. He is actively engaged in cybersecurity research with a strong emphasis on malware analysis, Android security, and machine learning applications in threat detection. His research interests span several critical areas in modern cybersecurity, including: Android and Windows malware analysis Evasive techniques used by malware Machine learning vulnerabilities in security systems Binary analysis and cryptographic function detection Phishing and social engineering attacks Security hardening using AI The trends in his recent publications (2024–2025) reflect a deep focus on adversarial machine learning, evasive malware behaviors, and the application of AI in both offensive and defensive security contexts. His work frequently appears in top security venues such as RAID, NDSS workshops, and IEEE-affiliated conferences, demonstrating his active contribution to the research community. He has no listed scientific awards in the provided text. Simone Aonzo is involved in mentoring and training through academic collaborations and educational events such as the PEPR Cybersecurity Winter School. While specific advisees are not listed, his collaborative publications suggest an active role in guiding junior researchers. There is no mention of grants, but his publication output implies ongoing research funding. He also contributes to community knowledge through talks and workshops. He is associated with the Digital Security research group at EURECOM, which focuses on cutting-edge cybersecurity challenges, including malware analysis, privacy, and system security. The team employs advanced techniques in machine learning, reverse engineering, and automated analysis to study modern threats.

Oum El Kheir Aktoufمشاهده پروفایل

استاد

• Dependability
• Safety
• Security
• +۵ مورد دیگر

Oum El Kheir Aktouf is a Professor in Computer Science at Grenoble Institute of Technology (Esisar Engineering School) and a member of the LCIS laboratory, France. She previously served as a Visiting Professor at San José State University, USA, during a sabbatical leave. Education : Master and PhD in Computer Science from Grenoble Institute of Technology Her research focuses on dependability, safety, and security of embedded and interconnected systems, including sensor-based applications and multi-agent architectures. She employs runtime testing, diagnosis, and monitoring approaches. Her work spans mobile application testing, fault diagnosis in RFID and wireless sensor networks, and security frameworks for autonomous systems. Recent publications highlight trends in Android security benchmarking , decentralized cryptography , and multi-agent resilience . She has participated in 12 funded national and international research projects and supervised courses in operating systems, real-time systems, distributed computing, and system dependability.

Stephen Chongمشاهده پروفایل

استاد

• Programming Languages
• Information Security
• Language-based Security
• +۳ مورد دیگر

Stephen Chong is a Gordon McKay Professor in the Harvard John A. Paulson School of Engineering and Applied Sciences , where he co-directs the Undergraduate Studies in Computer Science program. His research intersects programming languages and information security , focusing on language-based security frameworks. Education : PhD in Computer Science from Cornell University (2008), B.Sc.(Hons) and B.A. from Victoria University of Wellington (New Zealand). Research : Develops tools like Formulog (Datalog + SMT for static analysis) and Accrue (Java interprocedural analysis), emphasizing security guarantees proportional to programmer effort. Grants : Funded by NSF , DARPA , AFOSR , and Google Faculty Research Award . Recent publications focus on neurosymbolic approaches (e.g., Guess & Sketch ), Datalog synthesis (e.g., Making Formulog Fast ), and quantitative robustness in cyber-physical systems. His group has pioneered formal methods for secure assembly transpilation and sensor attack modeling. Awards : NSF CAREER Award AFOSR Young Investigator Award Sloan Research Fellowship Advising : Supervised numerous PhD and senior thesis students, including Aaron Bembenek , Anitha Gollamudi , and Lucas Waye . Mentored projects like AbcDatalog (multi-threaded Datalog engine) and Shill (secure shell scripting). Labs/Teams : Leads the Programming Languages at Harvard group, collaborating with institutions globally. Organized workshops (e.g., NSF Workshop on Formal Methods for Security ) and chaired committees at conferences like CSF , POPL , and PLDI .

• Cryptography
• Lattice-based cryptography
• Post-quantum cryptography
• +۳ مورد دیگر

Professor Damien Stehlé is a faculty member at École Normale Supérieure de Lyon (ENS Lyon), where he is part of the AriC team within the Laboratoire de l'Informatique du Parallélisme (LIP). He is also a distinguished member of the Institut Universitaire de France. His research and teaching activities focus on cryptography, computational number theory, and computer algebra, with particular emphasis on lattice-based cryptographic systems. Stehlé's research primarily centers on the computational aspects of Euclidean lattices and their applications in cryptography. He has made significant contributions to lattice-based cryptography, particularly in the context of post-quantum cryptography. His work addresses fundamental questions about the hardness of lattice problems, algorithmic improvements for lattice reduction, and the development of practical cryptographic schemes based on lattice assumptions. He has been actively involved in the NIST post-quantum cryptography standardization process, contributing to the analysis of lattice-based candidates like Kyber and Saber. His publications span theoretical foundations to practical implementations, demonstrating a rare ability to bridge abstract mathematics with real-world cryptographic applications. Throughout his career, Stehlé has published extensively in top-tier cryptography and theoretical computer science venues. His research has been recognized with multiple best paper awards for groundbreaking contributions to the field. Best paper award at ASIACRYPT 2021 for 'On the hardness of the NTRU problem' Best paper award at ASIACRYPT 2015 for 'Improved security proofs in lattice-based cryptography' Best paper award at EUROCRYPT 2015 for 'Cryptanalysis of the Multilinear Map over the Integers' Professor Stehlé has supervised numerous PhD students over the years, often collaborating with other leading researchers in the field. He serves on program committees of major cryptography conferences and is a member of editorial boards for prestigious journals including the Journal of Cryptology and Designs, Codes and Cryptography. His research group at LIP's AriC team is recognized as a leading center for lattice-based cryptography research in Europe.

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

Dario Fiore is a Research Professor at the IMDEA Software Institute in Madrid, Spain. He holds a Ph.D. in Computer Science from the University of Catania (Italy), supervised by Dario Catalano, with postdoctoral positions at Max Planck Institute for Software Systems (Germany), New York University (USA), and École Normale Supérieure (France). His research focuses on theoretical and practical aspects of Cryptography, emphasizing secure computation, privacy-preserving technologies, and cryptographic protocols. Fiore has authored over 69 conference papers and 19 journal articles, with notable contributions to zero-knowledge proofs, homomorphic encryption, and verifiable computation. He leads a research group involving postdocs and students, and has secured grants such as the ERC Consolidator Grant PICOCRYPT and funding from NEC Laboratories Europe. Education: Ph.D. in Computer Science, University of Catania, 2010 Visiting Student: New York University (2009-2010), IBM Research (2008-2009) Research Interests: Cryptography, Security, Privacy, Zero-Knowledge Proofs, Secure Computation, Homomorphic Encryption His work bridges foundational cryptography with real-world applications, including privacy-preserving systems and blockchain technologies. Recent research highlights include verification-efficient homomorphic signatures, non-malleable zkSNARKs, and efficient zero-knowledge proofs for data streams. Grants & Awards: ERC Consolidator Grant PICOCRYPT (2021-2026, PI) Top Reviewer Award at ACM CCS 2022 Best Short Paper at JNIC 2015 Fiore actively participates in program committees (e.g., Eurocrypt 2025) and has delivered keynotes on cryptographic topics. His team's work is implemented in libraries like 'hsnp' for homomorphic signatures.

• Computational Statistics
• Machine Learning
• Monte Carlo Methods
• +۵ مورد دیگر

Alain Durmus is a Professor at École Polytechnique, affiliated with the CMAP (Applied Mathematics Department). His research focuses on computational statistics, machine learning, and stochastic methods for Bayesian inference and generative models. Key areas include Monte Carlo methods, stochastic optimization, and Riemannian geometry in optimization. He has contributed to theoretical advancements in Markov processes and their applications in sampling algorithms. Affiliations: École Polytechnique (CMAP), ENS Paris-Saclay (teaching roles), and other academic collaborations. Teaching: Courses on mathematical statistics, stochastic methods, probability theory, and optimization at ENS Paris-Saclay and École Polytechnique. Research Interests: Development of Monte Carlo algorithms, stochastic approximation schemes, and theoretical analysis of Markov chain convergence. Specializes in Bayesian statistics, generative models, and high-dimensional inference. His work bridges theory and application, with notable contributions to Langevin dynamics, nonreversible MCMC methods, and federated learning. He has received a Best student paper award at ICASSP 2020 for collaborative research on Bayesian computation using Sliced-Wasserstein distances. Alain’s publications span prestigious journals like the Annals of Applied Probability and SIAM, with a focus on algorithmic innovation and rigorous mathematical foundations.