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

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

• Quantum Computation
• Quantum Cryptography
• Entanglement and Quantum Correlations
• +۳ مورد دیگر

André Vasconcelos is an Associate Professor at the Department of Computer Science and Engineering, Instituto Superior Técnico, University of Lisbon, and a senior researcher at IDSS Lab (INESC-ID). His work spans Enterprise Architecture , Blockchain Technology , and Interoperability in public and private sectors. PhD in Computer Science (2007, Instituto Superior Técnico) Master's in Computer Science (2001, Instituto Superior Técnico) Lisbon MBA (2015, Católica | Nova) Research focuses on Enterprise Architecture for governance, blockchain Interoperability mechanisms (e.g., cross-chain transactions, bridge security), and Digital Transformation in government. Key projects include Hermes (fault-tolerant middleware), Harmonia (zero-knowledge proofs for security), and XChainWatcher (attack monitoring in bridges). His scientific contributions systematically address cross-chain vulnerabilities, GDPR compliance, and real-world applications in healthcare (e.g., MedClick), automotive (car registration), and public administration (cloud assessment tools). He has no explicitly listed awards but drives national policy through contributions to Portuguese laws on ICT Governance , Open Standards , and Digital Identity (e.g., id.gov.pt mobile app). Advisory work includes PhD and Master’s students , though specific names are not provided. Professional activities emphasize consulting for information systems architecture and shaping EU Digital Identity frameworks (e.g., eIDAS Regulation 2024/1183). Labs/teams include IDSS Lab (INESC-ID) and collaborations with global researchers.

• Enterprise Architecture
• Information Systems
• Blockchain Technology
• +۳ مورد دیگر

Bas Spitters is an Associate Professor in the Department of Computer Science at Aarhus University, Denmark, specializing in the rigorous intersection of programming languages, formal methods, and cryptography. His work prioritizes mathematical precision in software verification, particularly for security-critical systems like cryptographic protocols and blockchain applications. His research focuses on Programming Languages , Formal Verification , and Cryptology , with deep expertise in Type Theory , Homotopy Type Theory , and Blockchain . Key themes include verified compiler backends (e.g., WebAssembly), formal security analysis of Rust implementations, and foundational verification of cryptographic primitives. His fingerprint reveals dominant associations with Smart Contracts (100%), Type Theory (99%), and Blockchain (47%), reflecting his commitment to eliminating vulnerabilities through formal proofs. Analysis of his 15 most recent publications (2022-2025) shows a consistent trajectory toward end-to-end verification of high-assurance systems. He bridges theoretical foundations (e.g., homotopy type theory) with practical implementations in Rust, targeting real-world problems in blockchain consensus, zero-knowledge proofs, and side-channel-resistant cryptography. His work increasingly integrates multiple verification tools (e.g., Coq, hax) to address complex security properties. Scientific awards: None documented in available sources. Dr. Spitters has supervised 2 PhD students and led the project Verifiable Cryptographic Software (2019-2023), developing foundational tools for verifying cryptographic implementations. His research group collaborates globally on formalizing decentralized exchanges, optimizing verified cryptographic libraries, and advancing proof automation for security protocols. Current efforts focus on Rust-based verified pipelines and formal specifications for zero-knowledge protocols like halo2, with implications for blockchain scalability and security.

• Programming Languages
• Formal Methods
• Cryptology
• +۵ مورد دیگر

Daniele Micciancio is a Professor in the Computer Science & Engineering Department at the University of California, San Diego, where he has been faculty since 1999. He is a member of both the Cryptography and Security group and the Theory of Computation group within the Jacobs School of Engineering. His academic journey began with a PhD in computer science from the Massachusetts Institute of Technology in 1998. PhD in Computer Science, Massachusetts Institute of Technology (1998) Micciancio's research focuses on the intersection of theoretical computer science and cryptography, with particular emphasis on lattice-based cryptographic systems. His work spans lattice algorithms, complexity of lattice problems, symbolic analysis of cryptographic protocols, and various cryptographic primitives including zero-knowledge proofs. His research has significantly advanced the field of post-quantum cryptography, particularly in developing cryptographic systems based on the hardness of lattice problems that could withstand attacks from quantum computers. His recent publications demonstrate a continued focus on homomorphic encryption, lattice-based cryptography, and secure computation protocols. The trend shows increasing practical applications of his theoretical work, with publications addressing real-world implementation challenges in privacy-preserving computation, medical data analysis, and genomic research. Matchey Award (FOCS 1998) Sprowls Award (MIT EECS, 1999) CAREER Award (NSF, 2001) Hellman Fellowship (2001) Sloan Fellowship (2003) 20-years Test of Time Awards (FOCS 2022, FOCS 2024) Fellow of the IACR (1999) Professor Micciancio has advised numerous graduate students who have gone on to successful careers in academia and industry, including prominent researchers in lattice-based cryptography. His professional activities include serving on editorial boards for prestigious journals including SIAM Journal on Computing, Journal of Cryptology, and Information and Computation. He has also been heavily involved in conference organization, serving as program chair for TCC 2010, CRYPTO 2019, and CRYPTO 2020, and as general chair for TCC 2014. As a member of both the Cryptography and Security group and the Theory of Computation group at UCSD, Micciancio contributes to a vibrant research environment focused on foundational aspects of computer security and theoretical computer science. His work continues to influence both theoretical developments and practical implementations of cryptographic systems, particularly as the field prepares for the post-quantum era.

• Cryptography
• Theoretical Computer Science
• Lattice-Based Cryptography
• +۵ مورد دیگر

Rafail Ostrovsky is a Distinguished Professor of Computer Science and Mathematics at UCLA, holding the Norman E. Friedman Chair in Knowledge Sciences at the Henry Samueli School of Engineering and Applied Science. As Director of the Center for Information and Computation Security, he leads research in cryptography, theoretical computer science, and secure computation with over 350 refereed publications and 15 issued USPTO patents. His primary research focuses on cryptography and theoretical computer science, with significant contributions to private information retrieval, zero-knowledge proofs, secure multi-party computation, and privacy-preserving technologies. His work bridges theoretical foundations with practical applications in network security, data analysis, and cryptographic protocols. Dr. Ostrovsky's research has evolved from fundamental cryptographic primitives to complex systems addressing modern security challenges in distributed environments, with recent work emphasizing efficient secure computation, robust protocols, and privacy-preserving techniques for high-dimensional data. His publication record demonstrates consistent leadership in cryptography, with recent articles focusing on zero-knowledge systems, secure computation protocols, and cryptographic primitives with enhanced security properties. The research trends show increasing emphasis on efficiency, robustness against malicious adversaries, and practical implementations of theoretical cryptographic concepts. 1993 Henry Taub Prize 2017 IEEE Computer Society Edward J. McCluskey Technical Achievement Award 2018 RSA Award for Excellence in Mathematics 2022 W. Wallace McDowell Award (highest award from IEEE Computer Society) Fellow of AAAS, ACM, IEEE, and IACR Foreign member of Academia Europaea Fellow of the National Academy of Inventors Dr. Ostrovsky has held significant leadership roles including chair of the IEEE Technical Committee on Mathematical Foundations of Computing (2015-2018) and chair of the IEEE FOCS 2011 Program Committee. He has served on over 40 international conference program committees and currently serves on editorial boards for Journal of ACM, Algorithmica Journal, and Journal of Cryptology. At UCLA, he teaches foundational courses including Introduction to Cryptography (CS183), Foundations of Cryptography (CS282A/M209A), and Cryptographic Protocols (CS282B/M209B). As Director of the Center for Information and Computation Security, Dr. Ostrovsky leads a multidisciplinary team advancing research in cryptography, network security, and privacy technologies. His group collaborates across computer science, mathematics, and engineering disciplines to develop innovative solutions for contemporary security challenges, with upcoming work focusing on obfuscation, proof systems, and secure computation as evidenced by his scheduled visiting scientist position for Summer 2025.

• Cryptography
• Theoretical Computer Science
• Algorithms
• +۴ مورد دیگر

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.

• Cryptography
• Theoretical Computer Science
• Foundations of Cryptography
• +۵ مورد دیگر

Manoj M. Prabhakaran is the Vijay and Sita Vashee Chair Professor at the Indian Institute of Technology Bombay in the Department of Computer Science and Engineering , and an Adjunct Professor at the University of Illinois, Urbana-Champaign . His research spans Cryptography, Theoretical Computer Science, Algorithms, and Complexity Theory , with a focus on Secure Multi-Party Computation (MPC) and Zero-Knowledge Proofs . As Principal Investigator of the IITB Trust Lab , he has organized major events like the 2017 MPC School and Workshop . Education: Ph.D. in Computer Science His work explores foundational questions in Cryptography , including Randomness Complexity , Non-malleable Codes , and Homomorphic Encryption . Recent publications address Leakage-Resilient Cryptography and Interactive Proofs . He advises Ph.D. students like Debasish Ray Chawdhuri and Kaartik Bhushan , and his email is publicly listed.

• Cryptography
• Secure Multi-Party Computation
• Theoretical Computer Science
• +۹ مورد دیگر

Douglas Wikström is a Lecturer in Theoretical Computer Science at the Royal Institute of Technology (KTH), specifically within the School of Electrical Engineering and Computer Science. He is based at Lindstedtsvägen 5, Floor 5, Stockholm, with contact information including phone +46 8 790 81 38 and email dog@kth.se. Dr. Wikström specializes in cryptography and theoretical computer science, with a strong focus on electronic voting systems, security protocols, and mix-net technologies. His research spans zero-knowledge proofs, verifiable computation, and cryptographic protocol design. His work demonstrates significant contributions to the theoretical foundations of secure voting systems and privacy-preserving technologies. His recent publications reveal a continued emphasis on cryptographic verification techniques, security analysis of voting protocols, and efficient implementations of cryptographic primitives. The research trajectory shows consistent contributions to both theoretical aspects of cryptography and practical implementations of secure systems. As an educator, Dr. Wikström teaches several advanced courses including Algorithms, Data Structures and Complexity (DD2350), Advanced Algorithms (DD2440), Fundamentals of Cryptography (DD2448), and Applied Cryptography (DD2520), where he serves as course coordinator, teacher, and examiner. His teaching portfolio demonstrates a strong commitment to both theoretical foundations and practical applications of computer science.

• Cryptography
• Theoretical Computer Science
• Algorithms
• +۴ مورد دیگر

Xavier BULTEL is a Lecturer at INSA Centre Val de Loire, affiliated with the Computer Science Department. His research focuses on cryptography, data privacy, and secure communication protocols. Email: xavier.bultel@insa-cvl.fr Research Interests: Xavier specializes in cryptographic protocols for anonymity, zero-knowledge proofs, and secure multi-party computation. His work addresses privacy-preserving mechanisms in mobile networks, trick-taking games, and physical ring signatures. Recent Contributions: His publications from 2021-2024 highlight advancements in sanitizable signatures, plaintext equality proofs, and cryptographic games. Key keywords include Cryptography, Cybersecurity, and Secure Communication.

• Cryptography
• Cybersecurity
• Data Privacy
• +۳ مورد دیگر

Assoc. Prof. Dejan Lavbič is an Associate Professor at the University of Ljubljana, Faculty of Computer and Information Science with 15+ years of academic experience. His research focuses on intelligent agents, multi-agent systems, ontologies, and blockchain-based smart contracts , particularly in semantic web technologies, AI services ecosystems, and information quality assessment . Doctor of Philosophy in Computer Science, University of Ljubljana (2010) Bachelor of Science in Computer Systems and Informatics, University of Ljubljana (2004) His scientific contributions span semantic web frameworks, blockchain applications, and machine learning systems, with 20+ peer-reviewed publications. Recent works include: Smart contract classification with AI Cardano blockchain identity systems Information quality metrics with gamification Awards include Cambridge CAE certification and multiple industry certifications. He mentors students in decentralized applications, AI development, and smart city ecosystems , having guided 6+ diploma/master theses on topics like automated essay grading and air quality data collection.

• Intelligent agents
• Multi-agent systems
• Ontologies
• +۷ مورد دیگر

Professor Zhengfeng Ji is an Adjunct Professor at the Centre for Quantum Software and Information within the Faculty of Engineering and Information Technology at the University of Technology Sydney. His research focuses on quantum computation, quantum information theory, and quantum communication. Quantum complexity theory Quantum algorithms Quantum network optimization Entanglement characterization Recent publications highlight advancements in quantum network routing frameworks and quantum proof systems. He has secured multiple grants including the Sydney Quantum Academy Postdoctoral Fellowship and ARC Discovery Projects. Quantum Exponential Time Hypothesis Quantum PCP Conjecture Post-quantum Cryptographic Protocols Scientific awards include: SQA Scholarship Sydney Quantum Academy Postdoctoral Fellowship SUSTech Scholarship

• Quantum computation
• Quantum information, computation and communication

Thomas Dreibholz is a Chief Research Engineer at Simula Metropolitan's Center for Resilient Networks and Applications. He specializes in cyber sovereignty, network security, and internet testbeds, with extensive work on distributed systems, cloud computing, and 5G networks. Affiliation: Simula Metropolitan, Oslo, Norway Research Focus: Multi-path transport protocols, network resilience, and privacy-preserving frameworks His research explores the intersection of network security, cloud/fog computing, and next-generation communication protocols. Recent work includes HiPerConTracer for network analysis, privacy-aware fog platforms , and multi-layered federated learning security . He contributes to testbed development, including the NorNet infrastructure for real-world multi-path transport research. Publications reflect expertise in multi-path TCP , 5G network optimization , and cloud/fog security . He has delivered invited talks at institutions like Hainan University and Princeton University, emphasizing open-source testbed deployment and educational outreach.

• Cyber Sovereignty and Network Security
• Internet Testbeds
• Distributed Systems
• +۸ مورد دیگر

Morten Øygarden is a Postdoctoral Fellow in the Department of Cryptography at Simula UiB, a joint research initiative between Simula Research Laboratory and the University of Bergen. His work bridges theoretical cryptography and practical security analysis within Norway's premier cryptographic research environment. His educational background culminates in a 2021 PhD from the University of Bergen with the thesis "Algebraic Cryptanalysis of Cryptographic Schemes with Extension Field Structure", establishing his expertise in algebraic methods for cryptanalysis. Øygarden's research focuses on Algebraic Cryptanalysis , Post-Quantum Cryptography , and Symmetric Cryptography , specializing in vulnerabilities of multivariate systems, code-based schemes, and ring-based primitives. He develops novel Gröbner basis techniques to break cryptographic assumptions underlying quantum-resistant candidates, with direct implications for NIST standardization processes. Analysis of his 2020-2024 publications reveals consistent innovation in algebraic attack methodologies, particularly against arithmetization-oriented primitives for zero-knowledge proofs and MPC-friendly ciphers. His work demonstrates exceptional depth in exploiting mathematical structures of symmetric primitives while advancing post-quantum security evaluations of multivariate and code-based systems. His publication record in top venues including CRYPTO, EUROCRYPT, and the Journal of Cryptology reflects significant contributions to cryptographic science, though specific awards or grant details are not documented in available sources.

• Algebraic Cryptanalysis
• Post-Quantum Cryptography
• Symmetric Cryptography

Håvard Raddum serves as Chief Research Scientist in the Department of Cryptography at Simula UiB, a joint research entity of Simula Research Laboratory and the University of Bergen. His primary focus involves advancing cryptographic security through algorithm analysis, Fully Homomorphic Encryption applications, and hardware-level attack mitigation. Raddum's research spans cryptography with specialization in security analysis of cryptographic algorithms, practical deployment of Fully Homomorphic Encryption, and physical attacks on hardware implementations. His work addresses vulnerabilities in symmetric ciphers, multivariate schemes, and lattice-based systems through algebraic cryptanalysis, side-channel techniques, and theoretical security proofs. Analysis of his 2019-2025 publications reveals concentrated expertise in cryptanalysis across diverse primitives. Key trends include algebraic attacks on arithmetization-oriented cryptography, side-channel analysis of lightweight ciphers, error detection in lattice computations, and security evaluations of Fully Homomorphic Encryption. His research consistently bridges theoretical frameworks with practical implementation vulnerabilities.

• Cryptography
• Security analysis of cryptographic algorithms
• Fully Homomorphic Encryption
• +۱ مورد دیگر

Dipti Kapoor Sarmah is a Lecturer specializing in cybersecurity, steganography, and cryptography. Her work bridges theoretical and applied aspects of secure data transmission, digital forensics, and cyber threat mitigation. Current role: Lecturer in Semantics, Cybersecurity & Services Key research areas: Cryptography, Steganography, Phishing analysis, IoT security Her research explores hybrid cryptographic-steganographic systems, gamified cybersecurity education, and innovative approaches to combat MageCart e-skimming attacks using reverse proxy architectures. She has systematically analyzed zero-knowledge protocols (zk-SNARK, zk-STARK, Bulletproofs) for privacy-preserving authentication. Recent publications address pandemic-era phishing trends, consumer IoT security standards, and data mining applications in insurance fraud detection. Her work frequently intersects with artificial intelligence and machine learning techniques for secure image processing. Notable recognition includes the EMMSAD 2025 Best Paper Award for collaborative research on phishing attack ontologies. Her activity spans diverse formats including peer-reviewed journal articles, conference contributions, and systematic literature reviews. With a Scopus h-index of 5 and over 128 citations, her research output spans 2008-2025, showing consistent contributions to cybersecurity, particularly in steganography optimization algorithms and digital forensics.

• Cryptography
• Steganography
• Cybersecurity
• +۴ مورد دیگر