Dr. Alley Stoughton is a Research Professor in Computer Science at Boston University and Visiting Fellow at the Hariri Institute. She holds a Ph.D. from the University of Edinburgh and specializes in applying formal methods to security. Her research develops mechanized proofs for cryptographic protocols, security properties, and universally composable security frameworks. Current projects include formal verification of SHA-3 standards and adaptive security proofs in random oracle models. Dr. Stoughton has contributed to NSF-funded projects on composable security and served on technical program committees for security workshops. She maintains collaborations with MIT Lincoln Laboratory and Riverside Research on cryptographic verification.
Sanjay Ramakrishnan is a Senior Lecturer at the UWA Medical School, affiliated with the Centre for Respiratory Health at The University of Western Australia. His primary roles include clinical and academic responsibilities in respiratory medicine, focusing on asthma, chronic obstructive pulmonary disease (COPD), and translational research. He is actively involved in clinical trials evaluating novel therapies and biomarkers for respiratory conditions. Research Interests: Personalized management of asthma and COPD through biomarkers like eosinophils and exhaled nitric oxide (FeNO) Development of predictive risk models for asthma attacks (e.g., the ORACLE scale) Investigation of anti-inflammatory therapies (e.g., dupilumab, benralizumab) in COPD and asthma Evaluation of corticosteroid use in exacerbation management Recent Research Trends: His articles emphasize biomarker-driven approaches to stratify patients, assess treatment efficacy (e.g., in trials like ABRA and STOIC), and explore sustainable clinical practices. Key themes include reducing corticosteroid exposure, understanding type 2 inflammation mechanisms, and optimizing therapeutic outcomes in severe respiratory diseases. Grants and Projects: Leading Phase III trials on tezepelumab and tozorakimab for COPD Investigating budesonide/glycopyrronium/formoterol combinations in COPD Co-leading the FINGERPRINT study on respiratory traits in preterm birth survivors Labs/Teams: Collaborates within multidisciplinary teams at the Centre for Respiratory Health, focusing on translational research and clinical trials.
Boris Levit is a Professor in the Department of Mathematics and Statistics at Queen's University, located in Kingston, Ontario. He holds a Ph.D. from the Institute of Information Transmission in Moscow and a Dr.Sc. from Vilnius University. His research focuses on non-parametric estimation, semi-parametric models, optimal design in non-parametric regression, and optimal interpolation methods. Levit has made significant contributions to statistical theory, particularly in applying differential geometry and partial differential equations to statistical problems. Levit's academic journey includes positions at Moscow State University, the University of Utrecht in the Netherlands, and Queen's University. His work emphasizes modern non-asymptotic approaches to statistical estimation, utilizing Jacobi elliptic functions and addressing challenges in moderate or small sample sizes. He is currently recruiting graduate students. His research has been recognized through awards, including the Dr.Sc. from Vilnius University for integrating differential geometry into statistical research. His publications span over five decades, addressing topics like minimax estimation, spline interpolation, and adaptive filtering. He teaches courses in statistical inference and nonparametric methods.
Shalev Ben-David is an Associate Professor at the University of Waterloo's Department of Computer Science. His research focuses on computational complexity and quantum computing, exploring foundational questions in algorithm design, quantum advantages, and theoretical limits of computation. He holds a PhD from MIT (2017) and a BMath from the University of Waterloo (2011). Education: PhD in Computer Science, MIT, 2017 BMath in Computer Science, University of Waterloo, 2011 His work bridges classical and quantum computational complexity, with contributions to query complexity, oracle separations, and quantum algorithm design. Recent research includes analyzing quantum speedups in symmetric problems and exploring cryptographic applications of quantum tokens. Despite no explicitly listed awards, his prolific publication record reflects sustained academic impact. Advising and grants details are not provided in available texts. His office is located in DC 3128, and further details are accessible via his personal webpage .
Cristian Ene is a Researcher at Grenoble Alpes University and a member of the VERIMAG Laboratory. He holds a PhD in Computer Science (2001) from Grenoble Alpes University. His primary roles include teaching and conducting research in formal verification of cryptographic protocols, computer security, and distributed systems. He is actively involved in developing automated tools for cryptographic protocol analysis, such as contributions to the Tamarin Prover framework. Research Interests : His work focuses on formal methods for verifying cryptographic systems, including model counting, security protocol analysis, and decidability in process calculi. He explores topics such as information flow control, fault-injection countermeasures, and automated theorem proving for asymmetric encryption. Publications : His recent work spans formal verification techniques, optimization in Max#SAT solving (e.g., BaxMC), and cryptographic protocol analysis. Earlier contributions include foundational studies on process decomposition in π-calculus and formal security models in the random oracle framework. Teaching : He teaches courses on cryptographic engineering, formal verification of security protocols, programming languages, and compiler design. Course materials include slides, assignments, and practical exercises using tools like Tamarin Prover. Labs & Teams : He is affiliated with the VERIMAG Laboratory, which specializes in formal methods and embedded systems research. His work integrates theoretical foundations with practical applications in secure system design and automated verification.
Sourav Chakraborty is a Professor in the Advanced Computing and Microelectronics Unit (ACMU) of the Computer and Communication Sciences Division at the Indian Statistical Institute (ISI), Kolkata, India. He joined ISI in July 2018 after serving as faculty at Chennai Mathematical Institute from 2010-2018. Previously, he held postdoctoral positions at Centrum Wiskunde & Informatica (CWI) in Amsterdam and Technion in Israel. Education: Ph.D. in Computer Science, University of Chicago (2008) M.S. in Computer Science, University of Chicago (2005) B.Sc. in Mathematics, Chennai Mathematical Institute (2003) Research Focus: Professor Chakraborty specializes in Theoretical Computer Science with emphasis on classical and quantum complexity of Boolean functions, including sensitivity analysis, property testing, and quantum database search. His work extends to graph algorithms, electronic commerce mechanisms, and coding theory. His research explores fundamental questions in computational complexity through innovative mathematical frameworks. Publication Trends: Recent work demonstrates a strong focus on property testing, sampling algorithms, and complexity theory, with significant contributions to streaming algorithms, Boolean function analysis, and quantum query complexity. His publications frequently appear in top theoretical computer science venues and exhibit consistent innovation in algorithm design and complexity boundaries. Awards & Honors: Praise from Donald E. Knuth for streaming algorithms research Inclusion in Oded Goldreich's 'my choices' list for Conditional Sampling and Huge-Object Model work Chakraborty's function named in his honor for Sensitivity Conjecture contributions Academic Service: Teaches courses in discrete mathematics and theoretical computer science, with detailed course materials available through institutional pages. Organized workshops including the 2020 Workshop on Sensitivity and Query Complexity at ISI.
Denis Firsov is a researcher at the Department of Software Science at Tallinn University of Technology (TUT) and a formal methods engineer at Input Output Global (IOG) . His work bridges formal methods , cryptography , and type theory , with a focus on zero-knowledge proofs , security verification , and language-based security . He has a PhD from the Institute of Cybernetics at TUT (2016), where he studied constructive type theory using Agda and Coq. Postdoctoral research at the University of Iowa (2016-2018) involved impredicative type theory in Cedille. He has held positions at GuardTime (2018-2020) and Matter Labs (2020-2023), working on formal verification of cryptographic protocols and ZK-circuit DSLs . Research Highlights: Developed formalizations for zero-knowledge protocols (Fiat-Shamir, Schnorr, Blum) in EasyCrypt Created Rust DSLs for ZK-circuits with formal correctness proofs Advanced impredicative lambda-encodings with induction in Cedille Contributed to parser certification for context-free and regular languages Patents: US 11,316,698: Delegated signatures for smart devices EU EP4044501B1: Method for data signatures with unbounded keys
Dr. Kevin Sim is a Lecturer at the School of Computing Engineering and the Built Environment, Edinburgh Napier University, with research interests spanning machine learning, biologically inspired computing, hyper-heuristics, and combinatorial optimization. His work focuses on developing advanced algorithm selection techniques and optimization methodologies applicable to real-world domains such as logistics, forestry, and infrastructure engineering. PhD in Hyper-heuristics for Optimization (Edinburgh Napier University, 2014) MSc in Advanced Software Engineering (Edinburgh Napier University, 2010) BSc in Software Technology (Edinburgh Napier University, 2009) His research explores: Feature-free algorithm selection models using recurrent neural networks Evolutionary approaches to instance-space layout optimization Hybrid feature construction methods for environmental risk prediction Ensemble hyper-heuristics for scheduling and packing problems Integration of large language models with evolutionary algorithms Scientific awards include: Bronze Award, International Humies Competition (2018) for wind damage prediction research Recent publications demonstrate expertise in: Neural algorithm selection LLM-evolved heuristics Wind damage modeling Instance-space visualization Feature engineering Real-time optimization Kevin supervises research students in algorithm design and optimization, and has secured funding from the Data Lab (£19,599) and EPSRC (£238,068) for projects related to infrastructure optimization and lifelong learning systems.
Timos Antonopoulos is a Research Scientist and Lecturer in the Department of Computer Science at Yale University. He is a member of the Rigorous Software Engineering (ROSE) group, led by Ruzica Piskac. His office is located in Dunham Laboratory (Room 404) at 10 Hillhouse Avenue, New Haven, CT. Antonopoulos's research focuses on formal methods and their applications in security and reliability. Key areas include: Logic and Verification : Developing tools and algebras for relational verification, termination analysis, and program correctness. Cryptography & Privacy : Designing zero-knowledge protocols (e.g., ZKSMT, ppSAT) and privacy-preserving techniques for automated decision-making and model checking. Automated Reasoning : Creating frameworks for intentional behavior analysis, SMT-based oracles, and invariant inference to handle uncertainty and complexity. His recent publications (2020–2024) reflect a strong emphasis on cryptographic code security, zero-knowledge proofs, and formal accountability tools. Trends include scalable privacy protocols (e.g., parallelization of zero-knowledge systems), legal/ethical AI verification (e.g., soid for automated decisions), and novel graph/algebraic methods for secure computation. Antonopoulos collaborates extensively within the ROSE group, contributing to projects involving oblivious algorithms, timing-attack mitigation, and secure multi-party SAT solving. His work bridges theoretical foundations (e.g., automata theory, relational algebra) with practical systems security challenges.
Dr. Marten van Dijk is a Full Professor in the Computer Security department at Vrije Universiteit Amsterdam (VU) since 2022 and a Group Leader for Computer Security at CWI since 2020. He also holds a Gratis Full Research Professor position at the University of Connecticut's ECE Department since 2020. Previously, he served as Associate and Full Professor at the University of Connecticut and held research roles at MIT CSAIL, RSA Laboratories, and Philips Research. PhD in Mathematics (1997, Eindhoven University of Technology) M.S. in Mathematics (Cum Laude, 1993) M.S. in Computer Science (Cum Laude, 1991) His research focuses on foundational computer security problems using cryptographic principles, including secure processor design, oblivious computation, and privacy-preserving machine learning. Notable contributions span Physical Unclonable Functions (PUFs), Aegis secure processor architecture, and oblivious RAM protocols. 15+ publications in 2023-2025 address topics like PUF cryptanalysis, differential privacy in federated learning, and Byzantine fault tolerance Key journals: IEEE Transactions on Computers, Journal of Cryptology, ACM CCS Conference Award highlights include: IEEE Fellow (2022) for secure processor design and encrypted computation IEEE Technical Achievement Award (2023) Intel Test of Time Award (2022) ACM CCS Best Paper (2013) A. Richard Newton Technical Impact Award (2015) His technical leadership spans hardware security (blu-ray error correction codes), cryptographic protocol design, and machine learning privacy frameworks. Current projects focus on secure processors with hardware-enforced isolation and differential privacy optimization.
Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering, University of Washington. He co-leads the Quantum group and is affiliated with the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program and teaches courses in quantum computation and quantum learning theory. PhD in Computer Science from Caltech (advisor: Thomas Vidick) Postdoctoral researcher at UC Berkeley and the Simons Institute (advisor: Umesh Vazirani) BA in Mathematics from University of Oxford Master in Mathematics from University of Cambridge His research focuses on the intersection of quantum computation and cryptography , particularly quantum pseudorandomness, device certification, and quantum learning theory. His work explores foundational questions about entanglement, non-local games, and quantum cryptographic protocols. Recent publications examine quantum money, zero-knowledge arguments, and separations between finite/infinite-dimensional quantum correlations. Coladangelo's 15 most recent papers address topics like quantum cryptographic foundations , entanglement verification , and pseudorandom state construction . Key venues include Eurocrypt, STOC, CRYPTO, and QIP. His work often bridges theoretical quantum information with practical implementations on cloud-based quantum devices via platforms like qBraid . Google Research Scholar Award (2025) CSE Undergraduate Teaching Award (University of Washington, 2023) Best Student Paper (QIP 2019) He advises PhD student Er-Cheng Tang and has taught courses like CSE 434: Intro to Quantum Computation and CSE 599C: Quantum Learning Theory . Coladangelo also delivered a lecture series at the 22nd Bellairs Crypto Workshop (2024) on "Random and pseudorandom quantum states."
Jan Gunnar Cederquist is an Assistant Professor at the Department of Computer Engineering, Instituto Superior Técnico, Technical University of Lisbon, since 2006. He is also a member of the SQIG (Security and Quantum Information Group) at IT (Instituto de Telecomunicações). His research focuses on mathematical modeling, formal specification, and verification, particularly in security protocols and language-based security. His work spans software verification, type theory, and cryptographic protocol analysis. He has contributed to fields like non-repudiation protocols, RBAC, audit logic, and distributed security. He has taught courses ranging from Software Specification to Language-Based Security at the PhD and MSc levels. His students include MSc candidates Fernando Mário Machado Marques and Carlos Magno Gaspar Vasconcelos. Previously, he held postdoctoral positions at the University of Twente, CWI, INRIA, and Imperial College London. He has chaired tracks at ACM SAC conferences (2010–2011) and served on program committees for security and formal methods events. His industry experience includes roles at Prover Technology and SEMCON.
Holger Dell is a Lecturer in Theoretical Computer Science and Algorithms at the IT University of Copenhagen. His research focuses on computational complexity, graph theory, and algorithmic efficiency. Active in polynomial-time algorithms and oracle-based methods Contributions to edge estimation in hypergraphs and fairness in node embeddings Key collaborations with BARC (Basic Algorithms Research Copenhagen) project Research trends show expertise in causal modeling, finite field polynomial solving, and graph embedding techniques. Recent work emphasizes algorithmic fairness and abstract causal relationships. Participated in a major project funded by the Villum Foundation (2017-2024) as a collaborator.
Furkan Kıraç is an Assistant Professor in the Computer Science Department at Özyeğin University, specializing in Computer Vision and Machine Learning . He previously served as a Part-Time Instructor at the same university (2012-2013) and as a Research Assistant at Boğaziçi University (2009-2013). Education: PhD in Computer Engineering, Boğaziçi University (2013) MS in Systems and Control Engineering, Boğaziçi University (2002) BS in Mechanical Engineering, Boğaziçi University (2000) His research focuses on real-time hand pose estimation , deep learning , and computer vision applications in industrial automation. Recent publications highlight his work on pedestrian tracking, spatio-temporal mapping, and image processing pipelines for test oracle automation. Notable achievements include founding two computer vision companies ( Proksima and Fortibase ) and receiving awards at SIU conferences (2004, 2005, 2012). He has contributed to projects funded by TÜBİTAK and the Scientific and Technical Research Council of Turkey. Scientific Awards: 3rd place in best demo award (SIU 2012) Best application paper award (SIU 2012) 3rd degree in Turkish National Science Competition (1994, 1995) Gold/Silver/Bronze medals in National Computer Science Olympiads
Chethan Kamath is an Assistant Professor in the Department of Computer Science and Engineering at IIT Bombay, where he is a member of the Theory Group and Trust Lab. His primary research focus is on cryptography, particularly its foundations, with broader interests extending to theoretical computer science. His educational journey includes: PhD from IST Austria (2014-2020) under Krzysztof Pietrzak, with thesis titled "On the Average-Case Hardness of Total Search Problems" Master's in CS from IISc Bangalore (2010-2013) under Sanjit Chatterjee, with thesis titled "Constructing Provably Secure Identity-Based Signature Schemes" Bachelor's in CS from University of Kerala (2005-2009) at TKM College of Engineering, Kollam Dr. Kamath's research interests span the theoretical foundations of cryptography, with particular focus on secure computation, complexity theory, and cryptographic hardness assumptions. His work often bridges theoretical computer science with practical cryptographic applications, exploring the boundaries of what can be efficiently computed while maintaining security guarantees. His research frequently addresses fundamental questions about the relationship between cryptographic primitives and complexity classes, especially the PPAD and TFNP complexity classes. His recent publications demonstrate a consistent focus on foundational aspects of cryptography, with particular emphasis on secure computation (garbled circuits, Yao's protocol), proofs systems (proofs of work, proofs of exponentiation), and complexity-theoretic aspects of cryptographic primitives. A notable trend is his exploration of the connections between complexity classes like PPAD and cryptographic assumptions, as well as his work on verifiable delay functions and their underlying number-theoretic assumptions. His research often employs tools from algorithmic graph theory (treewidth, separators) to analyze cryptographic protocols. His notable scientific achievement includes: Azrieli Fellowship during his post-doc at Tel Aviv University Dr. Kamath actively mentors students and researchers, currently advising several PhD and MS students at IIT Bombay, often in collaboration with Sruthi Sekar. His service to the academic community includes extensive program committee memberships for major conferences including Crypto, Eurocrypt, and TCC, demonstrating his standing in the cryptographic research community. He has co-organized educational events like the "Introduction to Cryptography" school as part of the ACM India Summer School 2025 and the "Theoretical Foundations of Cryptography" school as part of the ACM India Summer School 2024. He leads research activities within the Trust Lab at IIT Bombay, which focuses on theoretical and applied aspects of cryptography and security. The lab actively recruits MS/PhD students and post-docs, with ongoing research in foundational cryptography and its applications to secure computation, verifiable delay functions, and complexity-theoretic aspects of cryptographic security.
![](https://www.queensu.ca/mathstat/people/faculty/profiles/"/mathstat/sites/mastwww/files/styles/staggered_tiles_image/public/2021-01/levit-boris.jpg?h=10d202d3&itok=sloydmne")
