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

Tal Malkinمشاهده پروفایل

استاد

• Cryptography
• Computer Security
• Complexity Theory
• +۸ مورد دیگر

Tal Malkin is a Professor of Computer Science at Columbia University, directing the Cryptography Lab and serving as inaugural chair of the Cybersecurity Center at Columbia's Data Science Institute. She holds a Ph.D. from MIT (2000), joined Columbia after AT&T Labs research experience, and focuses on cryptography, security, complexity theory with applications in secure computation, zero-knowledge proofs, and privacy-preserving systems . Education: B.S. in Math and Computer Science, Bar-Ilan University M.S. in Computer Science, Weizmann Institute of Science Ph.D. in Computer Science, MIT (2000) Research Interests: Malkin's work spans foundational and applied cryptography, including homomorphic encryption, lattice-based protocols, attribute-based encryption, and tamper-resilient systems . She explores intersections with machine learning and information theory , addressing challenges in multi-party computation , public-key encryption , and side-channel resistance . Scientific Contributions: Her publications include breakthroughs in non-malleable codes , secure computation , and privacy-preserving databases . Notable works involve continual leakage resilience , optimally-fair coin tossing , and garbled circuits for efficient cryptographic protocols. Awards & Grants: Recipient of the NSF CAREER award, IBM and Google faculty research awards, and the IACR Fellow designation. Her research is funded by NSF, NSA, DHS, NYSIA, IARPA, and industry partnerships with Google, IBM, Mitsubishi, and NEC. Professional Leadership: Former conference chairs at CRYPTO 2021 , CCS 2017 , and CT-RSA conferences. Active in program committees for over 20 leading cryptography and security events, including FOCS , Eurocrypt , and Real World Crypto . Advising: Supervised numerous Ph.D. students and postdoctoral researchers, including Marshall Ball , Chengyu Lin , and Negev Shekhel Nosatzki . Her lab has mentored graduates like Ghada Almashaqbeh (2019) and Fernando Krell (2016), focusing on decentralized networks , secure learning , and cryptographic primitives .

Nils Fleischhackerمشاهده پروفایل

استادیار

• Cryptography
• Theoretical Computer Science
• Zero-Knowledge Proofs
• +۵ مورد دیگر

Nils Fleischhacker is an Assistant Professor for Cryptography at Ruhr University Bochum, where he leads the Theoretical Cryptography group within the Faculty of Computer Science. His research focuses on foundational aspects of cryptography with particular emphasis on zero-knowledge proofs, digital signatures, and secure computation. Prior to joining Ruhr University, he held postdoctoral positions at Johns Hopkins University and Carnegie Mellon University. Dr. Fleischhacker received his PhD in Computer Science from Saarland University in February 2017, advised by Dominique Schröder. During his doctoral studies, he was a research intern at Microsoft Research with Chris Brzuska and a research visitor at the University of Maryland, College Park with Jonathan Katz and Dana Dachman-Soled. His research spans theoretical cryptography with significant contributions to zero-knowledge proofs, multi-signature schemes, property-preserving hash functions, and security proofs for cryptographic primitives. Fleischhacker's work often addresses fundamental questions about the limits and possibilities of cryptographic constructions, with particular attention to black-box separations and lower bounds. His recent publications demonstrate a strong focus on lattice-based cryptography and post-quantum secure protocols. Fleischhacker's publications over the past five years reveal a consistent research trajectory focused on improving the efficiency and security of cryptographic primitives, with particular emphasis on signature schemes, zero-knowledge protocols, and secure computation frameworks. His work frequently appears in top-tier cryptography venues including CRYPTO, EUROCRYPT, and CCS. Dr. Fleischhacker actively mentors PhD students, with numerous successful graduations spanning from 2010 to 2024. His former PhD students include Önder Askin (2024), Floyd Zweydinger (2023), and Lars Schlieper (2022), among others. His research is supported through various academic channels and collaborations. He is affiliated with several prominent research organizations including the Horst Görtz Institute (HGI) for Information Security, the DFG Excellence Cluster CASA, the EU Marie Curie Network QSI, and the International Association for Cryptologic Research (IACR). These affiliations provide a strong institutional framework for his theoretical cryptography research.

• Quantum Information Theory
• Quantum Many-Body Systems
• Quantum Dissipative Evolutions
• +۲ مورد دیگر

Angela Capel Cuevas is an Assistant Professor of Quantum Information Theory/Theoretical Quantum Computation at the University of Cambridge's Department of Applied Mathematics and Theoretical Physics (DAMTP). Previously, she held a Junior Professorship at Eberhard Karls Universität Tübingen (2021-2024) and was an MCQST Distinguished PostDoc at TU München (2020-2021). Her research focuses on the intersection of quantum information theory and quantum many-body systems, particularly studying thermalization dynamics via quantum functional inequalities. She is a recipient of the Simons Emmy Noether Fellowship and Forbes 30 Under 30 (Spain 2023). Education: PhD in Mathematics, Universidad Autónoma de Madrid/ICMAT (2015-2019) Master in Computational Engineering and Mathematics, URV/UOC (2016-2018) Bachelor in Mathematics, Universidad de Granada (2009-2014) Research: Angela's work applies analytic and geometric tools to quantum systems, emphasizing decay of correlations in Gibbs states and quantum dissipative evolutions. Key topics include entropy inequalities, modified logarithmic Sobolev inequalities, and thermalization rates in spin chains. Her recent work bridges quantum functional analysis with practical implications for quantum computing and thermalization phenomena. Grants & Roles: PI of CRC TRR 352 'Mathematics of Many-Body Quantum Systems' (7M€) Co-PI of QuantERA project TouQan (1.25M€) Organized workshops at BIRS and Tübingen (2023-2024) Awards: Simons Emmy Noether Fellowship (2023) Forbes 30 Under 30 (2023) Vicent Caselles RSME-FBBVA Award (2022) Labs/Teams: Leads a group studying quantum dissipative systems and thermalization at DAMTP. Collaborates with institutions globally on quantum functional inequalities and Gibbs state properties.

Andrew Childsمشاهده پروفایل

استاد

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +۲ مورد دیگر

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

• Quantum-safe cryptography
• Lattice-Based Cryptography
• Post-Quantum Cryptography
• +۴ مورد دیگر

Ron Steinfeld is an Associate Professor in the Department of Software Systems & Cybersecurity at Monash University, Australia. He holds editorial roles in Designs Codes and Cryptography (since 2017) and has served on technical committees for top-tier conferences like ASIACRYPT, CRYPTO, and EUROCRYPT. His research focuses on quantum-safe cryptography, lattice-based cryptography, and blockchain security, with over 80 refereed publications and AUD$4M+ in research funding. Education: BSc Mathematics and Physics (Monash University, 1998) BE (Hons., First Class) Electrical and Computer Systems (Monash University, 2000) PhD Computer Science (Monash University, 2003) Research Interests: Design and analysis of cryptographic algorithms, quantum-safe protocols, lattice-based security foundations, and blockchain applications. His work underpins NIST standard algorithms like Kyber and Dilithium through structured lattice problem research. Recent Articles Trends: Focus on privacy-preserving blockchain protocols, post-quantum signature schemes, encrypted data search, and cryptographic applications in adversarial AI. Recent work includes fair Bitcoin watchtower schemes and genomic database privacy solutions. Awards: ASIACRYPT 2015 Best Paper Award Advising & Grants: Supervises PhD projects on quantum-safe cryptography and blockchain security. Leads initiatives like the AUD$4M ARC-funded Quantum Information Technology project. Collaborates with industry partners including CSIRO/Data61. Labs/Teams: Key contributor to Monash’s cybersecurity and cryptography research groups, involving interdisciplinary projects on materials discovery ( Æinstein initiative) and post-quantum blockchain security.

Ben Fischمشاهده پروفایل

استادیار

• Cryptography
• Distributed Systems
• Blockchain Technology
• +۵ مورد دیگر

Ben Fisch is an Assistant Professor of Computer Science at Yale University's School of Engineering & Applied Science. He is also the co-founder of Espresso Systems, a company focused on blockchain infrastructure. His research focuses on privacy and verifiability in decentralized systems like Bitcoin and Ethereum, with applications in digital finance and healthcare. Dr. Fisch received his B.A. from the University of Pennsylvania and completed his Ph.D. at Stanford University, where he worked with Dan Boneh in the applied cryptography research group. His educational background provided the foundation for his work at the intersection of cryptography, distributed systems, and economics. His research centers on leveraging cryptographic tools such as succinct non-interactive zero-knowledge proofs (zk-SNARKs), private information retrieval, and homomorphic encryption to address challenges in verifiable computation, verifiable storage, and verifiable fairness. He has made significant contributions to verifiable delay functions (VDFs) and proofs of replication, which have been adopted by major blockchain projects including Ethereum 2.0, Chia, and Filecoin. His work on Filecoin's Proofs of Replication has helped the network reach over 1.5 exabytes of storage capacity. His publication record shows a clear trend toward increasingly sophisticated cryptographic protocols for blockchain applications, with recent work focusing on data availability for Bitcoin rollups, efficient folding schemes for pairing-based arguments, and privacy pools with proof-carrying disclosures. His research bridges theoretical cryptography with practical implementations that have real-world impact in decentralized systems. His notable recognition includes: Best Paper Finalist at ACM CCS 2017 for 'Iron: Functional Encryption using Intel SGX' Dr. Fisch's research has led to significant technology transfer, most notably with his work on Verifiable Delay Functions (VDFs) sparking a multimillion dollar industry initiative through the VDF Alliance. His research on Proofs of Replication forms the basis of Filecoin's incentive layer and consensus protocol. His newer SNARK system Basefold is being used by several commercial products. He maintains active collaborations across academia and industry, with publications spanning top conferences in cryptography and security. As co-founder of Espresso Systems, Dr. Fisch leads a team developing next-generation blockchain infrastructure, particularly focusing on sequencing layers for rollups. His work bridges academic research with practical implementation, ensuring that theoretical advances in cryptography find real-world applications in decentralized systems.

Alexei Kitaevمشاهده پروفایل

استاد

• Quantum Computation
• Topological Quantum Phases
• Anyons
• +۴ مورد دیگر

Alexei Kitaev is the Ronald and Maxine Linde Professor of Theoretical Physics and Mathematics at the California Institute of Technology (Caltech). His research focuses on quantum computation, topological quantum phases, anyons, topological insulators and superconductors, and the black hole information paradox. He has pioneered the concept of topological quantum computation, where quantum information is protected through topological properties of many-body systems. His recent publications explore quantum error correction, scrambling dynamics, and holographic principles in SYK-like models, reflecting his interdisciplinary impact on quantum physics, computer science, and condensed matter. His work on the Sachdev-Ye-Kitaev model has advanced understanding of quantum chaos and gravitational phenomena. Kitaev has received numerous accolades, including the MacArthur Award (2008), Breakthrough Prize in Fundamental Physics (2012), Dirac Medal (2015), and Oliver Buckley Condensed Matter Prize (2017). He has taught advanced courses such as 'Quantum Computation' and 'Advanced Condensed-Matter Physics' at Caltech. Scientific Awards: MacArthur Award (2008) Breakthrough Prize in Fundamental Physics (2012) Dirac Medal (2015) Oliver Buckley Condensed Matter Prize (2017)

Amin Sakzadمشاهده پروفایل

دانشیار

• Lattice-Based Cryptography
• Wireless Communications
• Post-Quantum Cryptography
• +۶ مورد دیگر

Dr. Amin Sakzad is an Associate Professor in the Department of Software Systems & Cybersecurity at Monash University's Faculty of Information Technology. His research focuses on lattice-based cryptography, wireless communications, and post-quantum security protocols. He holds a PhD in Applied Mathematics from Amirkabir University of Technology (2011) and has held academic roles at Carleton University and Monash since 2012. Dr. Sakzad’s expertise spans lattice coding theory, MIMO systems, and privacy-preserving technologies for genomic databases and blockchain applications. He leads multiple ARC-funded projects, including work on secure databases (SRDBMS) and post-quantum cryptographic primitives for FinTech and energy sectors. His research has been recognized through awards such as the FIT Dean’s Award for Teaching Excellence (2021). Key collaborations include projects on blockchain security (CollinStar Lab), genomic data privacy, and energy market cybersecurity. His work addresses UN SDGs through contributions to quality education (SDG 4) and industry innovation (SDG 9). Recent publications highlight advancements in lattice-based cryptography (e.g., CRYSTALS-Kyber variants), privacy-preserving energy trading, and secure blockchain protocols like FPPW watchtower systems. His research bridges theoretical cryptography with practical implementations in embedded systems and 5G telecommunications. Grants: 16 active/completed projects including $1.2M in ARC funding Advising: Supervising PhD projects on lattice applications in post-quantum crypto and blockchain Labs: Core member of Monash’s Software Defined Telecommunications (SDT) Lab and CollinStar Lab

• Information Theory
• Cryptography
• Lattice Theory
• +۵ مورد دیگر

Cong Ling is a Professor of Information Theory and Cryptography at Imperial College London's Department of Electrical and Electronic Engineering, within the Faculty of Engineering. His research focuses on lattice theory and its applications in coding, cryptography, quantum information, and number theory. Key affiliations include the Academic Centre of Excellence in Cyber Security Research and the Engineering Secure Software Systems group. Education details are not explicitly provided in the text, but his professional experience indicates advanced qualifications in electrical engineering and mathematics. Research interests span lattice-based cryptography, post-quantum security, algebraic coding theory, and quantum-resistant algorithms. His work bridges information theory and number theory, with contributions to MIMO systems, secure communication protocols, and cryptographic protocol design. Recent publications emphasize lattice reduction techniques, quantum algorithms for the shortest vector problem, and advancements in polar codes. Notable trends include exploration of non-commutative algebras for cryptography, Gaussian sampling optimizations, and hybrid quantum-classical approaches to hard integer problems. Over 50+ articles published since 2018 reflect his leadership in lattice-based research and quantum-safe technologies. Awards: None explicitly listed in the text. Grants/Advising: No specific grants or student advisees mentioned; focus remains on collaborative research outputs. Labs/Teams: Associated with Imperial's Cyber Security Research groups and quantum engineering initiatives.

Jens Grothمشاهده پروفایل

عضو هیئت علمی

• Cryptography
• Cryptographic Protocols
• Zero-Knowledge Proofs
• +۵ مورد دیگر

Jens Groth is an Honorary Professor at the Department of Computer Science, University College London (UCL), and serves as Chief Scientist at Nexus. His primary research focuses on cryptography, with an emphasis on cryptographic protocols, zero-knowledge proofs, and privacy-preserving technologies. Groth has contributed significantly to advancements in digital signatures, homomorphic encryption, and secure multi-party computation. He holds a leadership role as Program Chair for the 15th IMA International Conference on Cryptography and Coding (2015) and has been a key figure in shaping modern cryptographic standards. His work often bridges theoretical foundations with practical implementations, emphasizing efficiency and security. Groth's research interests include but are not limited to: cryptographic protocol design, lattice-based cryptography, and the application of zero-knowledge proofs in real-world systems such as blockchain and voting systems. His publications span venues like CRYPTO, EUROCRYPT, and ASIACRYPT, reflecting his impact on the field. Notably, he advocates for open access to research and has contributed to strategies ensuring conferences adopt de facto open-access policies. His current focus at Nexus centers on verifiable computation and distributed cryptographic systems.

Aleksander Kubicaمشاهده پروفایل

استادیار

• Quantum Information Science
• Quantum Error Correction
• Fault Tolerance
• +۳ مورد دیگر

Aleksander Kubica is an Assistant Professor of Applied Physics at Yale University, specializing in quantum information science with a focus on quantum error correction and fault tolerance. His research bridges quantum many-body physics and topological codes, particularly exploring applications in superconducting circuits and quantum architectures. He holds a Ph.D. from the California Institute of Technology and a B.S. from the University of Warsaw. Dr. Kubica's work addresses foundational challenges in scalable quantum computing, including optimizing error correction protocols, developing fault-tolerant architectures, and analyzing the intersection of quantum metrology with error mitigation. Recent contributions include advancements in erasure qubits, correlated noise decoding, and topological code adaptations. His research often involves interdisciplinary approaches, combining theoretical physics with algorithm design and hardware-efficient solutions. Key themes in his publications include improving error correction thresholds, designing low-overhead quantum architectures, and exploring novel decoding strategies for topological codes. While no specific awards are listed, his active research trajectory and contributions to quantum computing indicate significant scholarly engagement in the field.

Alex Lombardiمشاهده پروفایل

استادیار

• Cryptography
• Theoretical Computer Science
• Post-Quantum Cryptography
• +۳ مورد دیگر

Alex Lombardi is an Assistant Professor of Computer Science at Princeton University, specializing in cryptography and theoretical computer science. His work explores cryptographic proof systems, post-quantum security, and quantum cryptography. Princeton University (Current) Simons-Berkeley Postdoctoral Fellow (Former) MIT (Graduate Training) Visiting Scientist, Cryptography 10 Years Later Program (2025) Education: PhD in Computer Science from MIT (advised by Vinod Vaikuntanathan) Master's Thesis on Provable Instantiations of Correlation Intractability and the Fiat-Shamir Heuristic Dr. Lombardi's research spans foundational cryptography, with a focus on indistinguishability obfuscation, worst-case assumptions, and quantum cryptographic protocols. His work on SNARGs and PPAD hardness has advanced cryptographic proof systems, while his recent projects address quantum verification and post-quantum security. He encourages prospective cryptography students to apply to Princeton's PhD program. His publications highlight advancements in LWE-based cryptography, quantum protocols, and complexity-theoretic foundations. Key themes include secure computation, hash function design, and cryptographic reductions under quantum assumptions. Scientific Awards: Simons-Berkeley Postdoctoral Fellowship Dr. Lombardi serves on program committees for STOC 2025, EUROCRYPT 2025, and other conferences. He has taught courses like COS 433/533 (Cryptography) and COS 533 (Advanced Cryptography) at Princeton.

Tanja Langeمشاهده پروفایل

استاد

• Cryptography
• Number Theory
• Post-Quantum Cryptography
• +۵ مورد دیگر

Tanja Lange is a Full Professor at the Department of Mathematics and Computer Science at Technische Universiteit Eindhoven. She chairs the Coding Theory and Cryptology group and serves as scientific director of the Eindhoven Institute for the Protection of Systems and Information (Ei/Ψ). Additionally, she holds a visiting professor position at Academia Sinica, Taiwan. Research & Teaching Her research focuses on cryptography and number theory , with leadership in post-quantum cryptography (including code-based, lattice-based, hash-based, and isogeny-based systems). She has taught courses like Introduction to Cryptology and Selected Areas in Cryptology at TU/e, covering quantum algorithms, cryptographic protocols, and mathematical foundations. Key Contributions Co-author of 5 recent publications (2023-2025) on differential addition chains, ROLLO-I analysis, CSIDH fault injection, and KpqC evaluations Recipient of the Best Master Lecturer 2016 award Active in NIST Post-Quantum Cryptography competition (e.g., NTRU Prime) Affiliated with the Center for Quantum Materials and Technology Eindhoven Contact MetaForum 5.062, TU/e Email: tanja@hyperelliptic.org (primary) | t.lange@tue.nl (TU/e)

Shirin Saeedi Bidokhtiمشاهده پروفایل

استادیار

• Information Theory
• Networking
• Data Compression
• +۲ مورد دیگر

Shirin Saeedi Bidokhti is an Assistant Professor at the University of Pennsylvania's School of Engineering and Applied Science with primary appointment in Electrical and Systems Engineering and secondary appointment in Computer and Information Science. She is affiliated with the Warren Center for Network and Data Sciences. She holds M.Sc. and Ph.D. degrees from EPFL and completed postdoctoral work at Stanford and Technical University of Munich. Her research focuses on information theory, networking, data compression, and machine learning. Her recent publications demonstrate strong emphasis on neural compression algorithms, network optimization during the COVID-19 pandemic, and age-of-information theory. Awards include: 2023 IEEE Communications Society & Information Theory Society Joint Paper Award 2021 NSF CAREER Award 2019 NSF-CRII Award Swiss National Science Foundation Fellowships She advises PhD students including Xingran Chen. Current research involves developing data compression algorithms for IoT applications and network strategies for pandemic response.

• Theoretical Computer Science
• Error-Correcting Codes
• Approximation Algorithms
• +۵ مورد دیگر

Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .