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

Julia Cagé is a Full Professor of Economics at Sciences Po Paris since 2024, having joined the Department of Economics in 2014 and receiving tenure in 2021. She is affiliated with the Laboratory for Interdisciplinary Evaluation of Public Policies (LIEPP), the Centre for Economic Policy Research (CEPR) where she leads the CEPR Research and Policy Network on 'Media Plurality,' and the CESifo Research Network. Her research spans political economy, media economics, and economic history with a focus on democracy, information economics, and political participation. Cagé's research interests center on the intersection of media, politics, and economics, particularly examining how media structures influence democratic processes, political participation, and information provision. Her work combines historical analysis with contemporary economic methods to understand the relationship between media markets, campaign finance, and political representation. She has pioneered research on media ownership models, the economics of digital journalism, and the long-term effects of historical institutions on contemporary political behavior. Her publications reveal a consistent focus on the economics of information and democracy, with particular attention to media markets, campaign finance, and electoral systems. Her work spans both theoretical and empirical approaches, often using historical data to inform contemporary policy questions. The research demonstrates increasing interdisciplinary integration, connecting economics with political science, history, and media studies to address fundamental questions about democratic representation and information markets. European Research Council Starting Grant (2021) for the PARTICIPATE project Best Young French Economist Award (ex aequo) by Le Cercle des économistes and Le Monde (2023) Yrjö Jahnsson Award (2025) Special Jury Prize for Best Book on Media (2016) Prix Pétrarque de l'essai by Le Monde and France Culture (2019) Cagé has supervised numerous PhD students and early-career researchers through her ERC grant and other research projects. She has secured substantial funding including the European Research Council Starting Grant and McCourt Institute grants in 2022 and 2023. Her research group at LIEPP has produced influential policy recommendations on media pluralism and democratic representation. She has also been involved in practical applications of her research through her board membership at Agence France Presse (2015-2022) and her policy engagement with French and European institutions. Cagé leads the PARTICIPATE research project funded by the ERC, which studies campaign finance, information, and political influence using individual-level data and computer science tools. Her work connects with broader research initiatives at Sciences Po focused on democratic innovation and the political economy of information. She frequently collaborates with interdisciplinary teams including economists, political scientists, historians, and computer scientists to address complex questions about democracy in the digital age.

• Political Economy
• Media Economics
• Information Economics
• +۷ مورد دیگر

Geoffroy Couteau is a CNRS research scientist at IRIF (Institut de Recherche en Informatique Fondamentale), Université Paris Cité, where he conducts research in theoretical and applied cryptography. He obtained his PhD from École Normale Supérieure de Paris in 2017 under the supervision of David Pointcheval and Hoeteck Wee, followed by a postdoctoral position at Karlsruhe Institute of Technology (KIT) from 2017 to 2019. His primary research interests include secure multiparty computation, zero-knowledge proofs, and the theoretical foundations of cryptography, with a particular emphasis on pseudorandom correlation generators and efficiency improvements in cryptographic protocols. He has made significant contributions to fine-grained cryptography, non-interactive zero-knowledge proofs, and post-quantum secure computation. The recent publications reflect a strong trend toward foundational advances in secure computation, with increasing focus on efficiency, practicality, and connections to complexity theory and learning theory. His work often bridges theoretical hardness assumptions with practical protocol design. ERC Starting Grant (2023) for project OBELiSC (Overcoming Barriers and Efficiency Limitations in Secure Computation) Geoffroy Couteau has advised numerous PhD and master’s students, including Dung Bui, Clément Ducros, Eliana Carozza, and Ulysse Léchine. He has also hosted many visiting students and postdocs, fostering a vibrant research group. He has served on the program committees of major conferences such as EUROCRYPT, CRYPTO, TCC, and PKC. He is currently leading research in cryptography at IRIF and is involved in postdoctoral hiring for projects in advanced cryptographic primitives. He maintains a research blog and resource collection for students, including LaTeX templates, a probability cheat sheet, and curated answers to common cryptography questions.

• Cryptography
• Secure Multiparty Computation
• Zero-Knowledge Proofs
• +۵ مورد دیگر

Mohamed-Lamine Messai is a Professor at Université Lyon 2, France, specializing in cybersecurity, IoT security, and networking. He teaches courses such as Computer Security, Hacking Labs, and Cryptography, and is actively involved in research projects like ROMANCE (knowledge graph modeling for organizational vulnerabilities) and GLADIS (graph-based intrusion detection). His work focuses on key management systems, resource-constrained networks, and AI-driven cybersecurity solutions. He has supervised numerous PhD and master's students, including Abel Oroke, Floribert Katembo, and Sami Bettayeb. His research spans IoT security, blockchain applications, and graph neural networks for threat detection. He frequently presents at international conferences and workshops, including GRASEC, ARES, and IWCMC. Current projects include Federated Learning with Hybrid Encryption for APT detection and autonomous bio-inspired 5G deployment strategies. Key Projects: ROMANCE, GLADIS, CyberSecGraph, DATACAP Teaching: M1/M2 courses in Computer Security, IoT, Networking, and Distributed Computing Lab Affiliations: Involved in L3i lab activities and Open Days at the University of La Rochelle

• Key Management in IoT Networks
• Cybersecurity
• Networking Security
• +۳ مورد دیگر

Dr. Stephanie Balzer is an Assistant Professor in the Principles of Programming Group at Carnegie Mellon University's School of Computer Science. Her research focuses on enabling failure-free software through formal methods like type systems and verification logics. She emphasizes compositional proofs for scalability and practical validation via software artifacts. Programming Languages Type Theory Program Verification Concurrency & Security Her recent work explores timed protocols, disentanglement logic, and multiparty session types. Articles demonstrate semantic logical relations for termination (2025), deadlock freedom in Rust embeddings (2022), and information flow control (2024). Key collaborative papers address cyclic process networks and separation logic frameworks. Scientific recognition includes: NSF CAREER Award (2025) ACM SIGPLAN Distinguished Paper (2022) ECOOP Distinguished Paper (2022) She supervises PhD candidates Yue Yao, Yinsen Zhang, and Zak Kent (with Guy Blelloch), plus Master's student Sonya Simkin. Former advisee Jules Jacobs received Cum Laude distinction at Radboud University. Active in academic service, Balzer chairs PLMW@POPL workshops and co-organizes Oregon Programming Language Summer School. She serves on program committees for LICS, POPL, and ICFP.

• Programming Languages
• Program Verification
• Type Theory
• +۷ مورد دیگر

Ugo Dal Lago is a Professor of Computer Science at the University of Bologna since November 2015 and maintains a dual affiliation with INRIA Sophia Antipolis. His academic career demonstrates extensive involvement with top-tier conferences including POPL, ICFP, ESOP, and ETAPS where he has served both as author and committee member. His research focuses on theoretical computer science with particular emphasis on programming language theory and quantitative aspects of computation. Dal Lago's work explores computational models beyond classical paradigms, including randomized, Bayesian, and quantum computing approaches. His contributions span from foundational complexity analysis techniques for functional programs to cutting-edge research in quantum programming languages. Analysis of his publication record (2022-2025) reveals three dominant research trajectories: quantum computing (with focus on circuit analysis and resource estimation), probabilistic computation (particularly on program equivalence and termination properties), and advanced type systems (intersection types, effect systems, and coeffect systems). His work consistently bridges theoretical foundations with practical applications, especially in emerging computational paradigms. Quantum Computing: Multiple publications on quantum circuit analysis, resource estimation, and multiparty protocols Probabilistic Programming: Research on almost-sure termination, expected cost analysis, and program equivalence Type Theory: Development of intersection types and effect systems for program verification Formal Methods: Application of Floyd-Hoare logic to quantum program verification Cryptography: Work on computational indistinguishability and logical relations for security proofs Dal Lago serves on steering committees for major conferences including DICE-FOPARA and ETAPS, and has been a program committee member for POPL, ICFP, and ESOP. His research demonstrates increasing focus on quantum information processing, with quantum-related publications comprising over 40% of his output in the most recent two years.

• Programming Language Theory
• Probabilistic Computation
• Quantum Computation
• +۵ مورد دیگر

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
• +۷ مورد دیگر

Reynald Affeldt is Chief Senior Research Scientist at the National Institute of Advanced Industrial Science and Technology (AIST) , Japan, and concurrently serves as Visiting Professor at the Nara Institute of Science and Technology (NAIST) . His research is anchored in formal verification of software using logic, with a strong emphasis on the Coq proof assistant. His research interests span: Formal verification of software Probabilistic programming and semantics Information theory and error-correcting codes 3D geometry for robotics Coq-based formalization Affeldt leads the Infotheo project, a Coq library for reasoning about discrete probabilities, information theory, and linear error-correcting codes. His recent publications focus on equational reasoning for probabilistic programs and the formalization of monadic constructs in dependent type theory. Scientific Contributions: Program committee member for POPL, CPP, APLAS, ICFP, CoqPL, TyDe Author of multiple peer-reviewed papers in formal methods Lead developer of Infotheo Coq library Contact & Affiliations: Email: reynald.affeldt@aist.go.jp Primary affiliation: AIST, Digital Architecture Research Center Visiting position: NAIST

• Formal verification of software
• Probabilistic programming
• Information theory
• +۳ مورد دیگر