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

Sandy Zabellمشاهده پروفایل

استاد

• Mathematical Probability
• Bayesian Statistics
• History of Probability and Statistics
• +۳ مورد دیگر

Sandy Zabell is a Professor of Mathematics and Statistics and Data Science at Northwestern University, affiliated with the Department of Philosophy and the Science in Human Culture Program. He holds positions in CIERA (Center for Interdisciplinary Exploration and Research in Astrophysics) and serves as Director of Undergraduate Studies for Statistics. He earned his Ph.D. in 1974 from Harvard University. His research focuses on mathematical probability (e.g., large deviation theory), Bayesian statistics, and their historical/philosophical foundations. He is particularly known for work on exchangeability, DNA identification evidence, and the role of probability in legal contexts. His historical interests include WWII cryptography and the contributions of mathematicians during that era. Zabell’s publications span theoretical and applied domains, including influential works on statistical history and cryptography. His 2005 book Symmetry and its Discontents remains a key text in the philosophy of probability. Recent work includes analyses of Bletchley Park’s statistical methods and German wartime cryptology. Though no specific grants or awards are listed, his interdisciplinary contributions bridge mathematics, law, and history. No lab affiliations or teams are explicitly mentioned in the provided material.

Sunoo Parkمشاهده پروفایل

استادیار

• Security
• Privacy
• Technology Law
• +۶ مورد دیگر

Sunoo Park is an Assistant Professor in Computer Science at NYU Courant Institute of Mathematical Sciences, with a secondary affiliation at NYU School of Law. He directs the DeTaIL Lab , focusing on security, privacy, and transparency in digital technologies. His educational background includes a J.D. from Harvard Law School, a Ph.D. in Computer Science from MIT, and a B.A. from the University of Cambridge. He is a licensed attorney in New York. His research bridges computer science and technology law , with core interests in cryptography, election security, AI ethics, blockchain, and digital policy. Recent work emphasizes legal risks in security research, verifiable voting systems, and adversarial robustness in AI. Park's publications (2017–2025) reveal strong trends in cryptographic applications for societal challenges , including election auditing, deniable encryption, and blockchain vulnerabilities. He consistently addresses tensions between technological capabilities and legal/policy frameworks. Teaching includes graduate courses on Digital Technology Law and AI Ethics , alongside clinical work in NYU's Technology Law & Policy Clinic. Service roles include program committees for IEEE Security & Privacy and NeurIPS (Ethics Committee).

Phong Nguyenمشاهده پروفایل

استاد پژوهشی

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

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)

• Zero-Knowledge Proofs
• Lattice-Based Cryptography
• Error-Correcting Codes
• +۳ مورد دیگر

Jonathan Bootle is a cryptography researcher in the Foundational Cryptography group at IBM Research – Zurich , specializing in efficient zero-knowledge proofs. He holds a PhD from University College London and a Mathematics degree from Clare College, University of Cambridge . Education : PhD (UCL), Mathematics (Part III, Cambridge) His research focuses on zero-knowledge proofs , lattice-based cryptography , and error-correcting codes , with applications in post-quantum security. Recent work includes formal verification of protocols, elastic SNARKs, and generalized key exchange mechanisms. Key publication trends: 2024: Formal verification of sumcheck protocol 2023: Lattice-based credentials and succinct arguments 2022: Gemini SNARKs and DualDory linkable signatures He teaches the 2024 ETH Zurich course on Zero-Knowledge Proofs , covering sigma protocols, Fiat-Shamir transformations, and polynomial commitments. Labs/Teams: Foundational Cryptography group, IBM Security Department Collaborations with UC Berkeley (Alessandro Chiesa) and UCL (Jens Groth)

Julian Lossمشاهده پروفایل

استاد

• Cryptography
• Distributed Computing
• Provable Security
• +۳ مورد دیگر

Dr. Julian Loss is a tenured faculty member at the CISPA Helmholtz Center for Information Security since 2021, focusing on cryptography and its interplay with distributed computing . He previously held postdoctoral positions at the University of Maryland (2019-2021) and Carnegie Mellon University (2021), and worked as a researcher at the blockchain company Spacemesh (2018-2021). Education : PhD in Mathematics from Ruhr University Bochum (2019) His research explores provable security , with emphasis on digital signature schemes , distributed consensus algorithms , and cryptographic protocol design . Recent publications address topics like kryptographic attacks , Byzantine agreement efficiency , and privacy analysis in cryptocurrencies . He has received the ERC Starting Grant (2023) and DFG Grant (2022) . His work is primarily published in top venues including PKC , CCS , EUROCRYPT , and IEEE S&P .

Thijs M.M. Laarhovenمشاهده پروفایل

پژوهشگر

• Cryptography
• Algorithms
• Lattice-based Cryptography
• +۵ مورد دیگر

Thijs M.M. Laarhoven is a researcher in the Coding Theory and Cryptology group within the Mathematics and Computer Science department at the Eindhoven University of Technology (TU/e) . He completed his PhD in 2016 with honors and previously worked at the IBM Research laboratory in Zurich, Switzerland. PhD in Cryptography, TU/e (2016) Master’s in Mathematics, TU/e (2011) Bachelor’s in Mathematics, TU/e (2009) His research focuses on cryptographic algorithms, lattice-based cryptography, quantum computing, and nearest neighbor search techniques. He has made significant contributions to angular locality-sensitive hashing and lattice sieving algorithms . His publications highlight advancements in time-space trade-offs for approximate near neighbors and quantum optimization of lattice-based problems. His awards include the NWO Veni Grant (2018) and multiple Best Paper Awards (2012, 2014, 2015).

Anna-Lena Horlemannمشاهده پروفایل

دانشیار

• Algebraic Coding Theory
• Post-Quantum Cryptography
• Network Coding Theory
• +۳ مورد دیگر

Anna-Lena Horlemann is an Associate Professor for Foundations of Computation at the School of Computer Science, University of St. Gallen. Her research focuses on algebraic coding theory, post-quantum cryptography, and network coding. She leads the Coding Theory and Cryptography research group, actively contributing to NIST's post-quantum standardization efforts. Her work addresses quantum computing threats to current cryptosystems and develops error-correcting codes for reliable data transmission and storage. Education: PhD in Mathematics from the University of Zurich (2013), supervised by Prof. Joachim Rosenthal. Diploma in Mathematics from Ruhr-Universität Bochum. Research interests span coding theory (e.g., rank-metric codes, subspace codes), cryptography (code-based systems, privacy protocols), and neuroinformatics (connectome analysis). Recent publications emphasize Lee metric applications, MDS code classification, and cryptanalysis of Gabidulin-based systems. She mentors doctoral researchers such as Nadja Willenborg and Violetta Weger, focusing on topics like code densities and quantum-resistant algorithms. Her team's work bridges theoretical foundations and practical implementations, with contributions to error-correction resilience and cryptographic security in post-quantum scenarios. No formal awards listed, but actively participates in international conferences (IEEE, CBCrypto) and journal reviews.

• Cryptography
• Elliptic Curve Cryptography
• Public-Key Cryptosystems
• +۵ مورد دیگر

Dr. Chloe Martindale is a Senior Lecturer at the University of Bristol , affiliated with the School of Computer Science . Her research focuses on cryptography, particularly in isogeny-based systems, public-key cryptosystems, and computational mathematics. Her recent work includes parametrizing maximal orders along supersingular isogeny paths and analyzing attacks on the SIDH protocol. She has contributed to homomorphic encryption security using abelian groups. Scientific Awards Best Paper Honorable Mention (2023) Dutch Cyber Security Research Paper Award (2019)

Jonathan A. Kelnerمشاهده پروفایل

استاد

• Algorithms
• Complexity Theory
• Spectral Graph Theory
• +۴ مورد دیگر

Jonathan A. Kelner is a Professor of Applied Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL) . His research bridges pure mathematics and algorithms, focusing on spectral graph theory, combinatorial optimization, and distributed computing.

• 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.

Elmar Teuflمشاهده پروفایل

مدرس ارشد

• Random Walks on Graphs
• Combinatorics
• Probability Theory
• +۳ مورد دیگر

Elmar Teufl is a Senior Lecturer in the Department of Mathematics at Eberhard Karls Universität Tübingen. He holds a Doctorate (2002) and a Habilitation (2015) from Graz University of Technology and Tübingen University, respectively. His research focuses on random walks on graphs and groups, combinatorial problems on self-similar structures, asymptotic methods, and fractal geometry. His work bridges probability theory, combinatorics, and graph theory with applications to fractal networks and recursive systems. Teufl has held academic positions across Europe, including visiting professorships at the University of Stuttgart (2012–2013) and a Marie Curie Fellowship at Bielefeld University (2005–2006). His research has been supported by the Austrian Science Fund (FWF) and the EU. Key achievements include contributions to spanning tree enumeration on Sierpinski graphs and resistance scaling in self-similar lattices. His publications span topics like asymptotic enumeration, determinant identities for Laplacian matrices, and structural properties of nilpotent groups. He received the Austrian Mathematical Society's Studienpreis (2003) for his thesis on self-similar graphs and fractals. Teaching responsibilities include advanced courses in combinatorics and probability, with a full teaching record documented in alma.

Dimitar Jetchevمشاهده پروفایل

استاد

• Number Theory
• Arithmetic Geometry
• Mathematical Cryptology
• +۲ مورد دیگر

Dimitar Jetchev is a Swiss National Science Foundation Professor in number theory, arithmetic algebraic geometry, and mathematical cryptology at the School of Basic Sciences, EPFL. He leads the GR-JET research group and holds positions in the Mathematics Section (TAN) and SMA-GE unit. University of California at Berkeley, Ph.D. in Mathematics (2008) Harvard University, B.A. in Mathematics (2004) Jetchev's research spans number theory and cryptography, focusing on elliptic curves, Selmer groups, Euler systems, Heegner points, and complexity analysis of cryptologic algorithms. His work bridges pure mathematics and cryptographic applications like ECC and symmetric key protocols. His recent publications analyze isogeny graphs of abelian varieties, discrete logarithm problems in genus 2, equidistribution phenomena, and Euler systems. These works explore connections between automorphic representations, unitary groups, and cryptologic algorithms. Swiss National Science Foundation Professor Jetchev has advised PhD students including Boumasmoud Mohamed Réda, Dudeanu Alina, and Vuille Marius Lorenz. His research group GR-JET collaborates with institutions like IHES and EPFL's LACAL lab. He works on unitary Shimura varieties, special cycles, and their applications to Iwasawa theory and the Bloch-Kato conjecture. The GR-JET group investigates isogeny-based cryptosystems and algorithmic improvements in discrete logarithm computations.

• Cybersecurity
• Game Theory
• Quantum Cryptography
• +۵ مورد دیگر

Stefan Rass is a Professor at the Institute of Networks and Security within the Faculty of Engineering & Natural Sciences at Johannes Kepler University Linz (JKU), where he leads the LIT Secure and Correct Systems Lab. As Principal Investigator for FFG-funded projects including reSilienz (digital supply chain resilience, 2023–2025) and ITPUK (AI signature verification, 2022–2024), he bridges theoretical game theory with practical cybersecurity solutions for critical infrastructures and robotics systems. His research spans game-theoretic security models (patrolling games, defense-in-depth strategies), quantum cryptography (QKD network architectures), and cyber deception frameworks like Honeyquest for measuring honeypot effectiveness. Recent work addresses robotics security benchmarking (RobotPerf), cryptographic instruction chaining for control flow protection, and risk assessment methodologies for interdependent infrastructures. His mathematical decision-making approach integrates bounded rationality and stochastic modeling to solve real-world security challenges. Professor Rass actively shapes the field through program committee roles (ARES 2023), peer reviews, and invited talks on security transparency. His current projects focus on cost-benefit-aware monitoring for cyber-physical systems and quantum key distribution standardization, reflecting Austria’s strategic priorities in digital resilience. The LIT Secure and Correct Systems Lab under his direction develops foundational theories while deploying tools for industrial applications, particularly in critical infrastructure protection and secure robotics workflows.

Oscar Esparza Martinمشاهده پروفایل

استاد

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

Oscar Esparza Martin is a Professor at the Department of Telecommunications Engineering within the Barcelona School of Telecommunications Engineering at Universitat Politècnica de Catalunya (UPC). He is an active researcher with over 222 academic activities documented, specializing in network security and information security. His work spans multiple research groups including ISG - Grup de Seguretat de la Informació and ISG-MAK - Information Security Group - Mathematics Applied to Cryptography. Dr. Esparza Martin holds a Telecommunications Engineering degree and a Doctorate from UPC, with postgraduate studies in Networks, Advanced Broadcasting Systems and Services. His expertise centers on network security, with significant contributions to blockchain security, IoT security, satellite communications security, and data exchange protocols. His recent research output shows strong focus on secure blockchain applications, particularly with his work on DA2Wa (a secure pairing protocol between DApps and wallets), and data exchange protocols with free sampling services. His publications span high-impact journals including Computer Communications, IEEE Access, and Electronics. Award or recognition Dr. Esparza Martin actively participates in numerous international conferences as committee member, particularly in areas of IoT, wireless communications, vehicle technology, and security. His collaborations span multiple institutions with key partners including Muñoz Tapia, Soriano Ibáñez, Alins Delgado, and Mata Diaz. His research is supported by various competitive projects including the Cátedra CARISMATICA and Catalonia Digital Innovation Hub (DIH4CAT). His work connects theoretical cryptography with practical security implementations across multiple domains including blockchain, IoT, satellite communications, and data marketplaces, demonstrating both academic rigor and practical relevance to current security challenges.

Maris Ozolsمشاهده پروفایل

استادیار

• Quantum Algorithms
• Quantum Information Theory
• Quantum Cryptography
• +۳ مورد دیگر

Maris Ozols is an Assistant Professor at the University of Amsterdam and a researcher at QuSoft, affiliated with the Algorithms and Complexity department at Centrum Wiskunde & Informatica (CWI). His primary research focuses on quantum algorithms and quantum information theory, with significant contributions to quantum complexity, quantum cryptography, and quantum state discrimination. His research interests span quantum algorithms, quantum information theory, quantum cryptography, quantum complexity, and theoretical computer science. Ozols has developed fundamental techniques in quantum query complexity, quantum state discrimination, and quantum cryptographic security models. His work often bridges theoretical computer science with quantum information physics, demonstrating practical implications for quantum computing architectures. His publication record shows consistent output in top venues including Communications in Mathematical Physics, Leibniz International Proceedings in Informatics, and Quantum journal. Recent work (2022-2025) focuses on quantum state discrimination, quantum circuit optimization, quantum machine learning, and cryptographic applications of quantum algorithms. His research demonstrates strong theoretical foundations with practical implications for quantum computing development. Leverhulme Early Career Fellow (University of Cambridge) Ozols has secured research funding through multiple Netherlands Organisation for Scientific Research (NWO) grants including the Quantum Software Consortium (QSC) and Quantum Computation with Bounded Space projects. His collaborative work spans international institutions including the University of Waterloo (where he earned his PhD), University of Cambridge, IBM Research, and various European quantum computing groups. He maintains active research groups in quantum algorithms at both QuSoft and CWI, with recent focus on quantum machine learning applications and quantum cryptographic protocols.