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

Abhishek Jainمشاهده پروفایل

دانشیار

• Cryptography
• Computer Security
• Privacy
• +۵ مورد دیگر

Abhishek Jain is an Associate Professor in the Department of Computer Science at Johns Hopkins University and a Senior Scientist at NTT Research. He is affiliated with the Data Science and AI Institute, the Information Security Institute, and the Algorithms and Complexity group. University: Johns Hopkins University Department: Computer Science Academic Rank: Associate Professor Institutional Roles: Co-director of the Advanced Research in Cryptography group, member of the Theory Group, and co-leader of the Cryptography Group Education: Ph.D. in Computer Science from the University of California Los Angeles (2012), advised by Amit Sahai and Rafail Ostrovsky. Recipient of the Symantec Outstanding Graduate Student Award during his Ph.D. Research Interests Cryptography Secure computation Proof systems Program obfuscation Privacy Blockchain Theoretical computer science Research Trends: His recent publications emphasize cryptographic protocols for homomorphic encryption, zero-knowledge proofs, and secure multi-party computation, alongside applications in blockchain and privacy-preserving systems. Key themes include scalability, verifiable evaluation, and adapting cryptographic techniques to dynamic and distributed environments. Scientific Awards 2020 NSF CAREER Award Best Paper Awards at Eurocrypt and the International Conference on the Theory and Applications of Cryptographic Techniques Advising & Grants: Mentors Ph.D. students and interns/postdocs at NTT Research. Research funded by NSF, DARPA, JP Morgan, Ethereum Foundation, Stellar, Cisco, Samsung, and JHU Catalyst awards. Labs & Teams: Co-leads the Cryptography Group at Johns Hopkins, participates in the DC Area Crypto Day, and organizes the weekly Theory Seminar. Collaborates with institutions including MIT CSAIL, BUSEC, and Microsoft Research New England.

• Distributed Systems
• Cryptocurrencies
• Computer Security
• +۷ مورد دیگر

David Mazières is a Professor at Stanford University , affiliated with the School of Engineering and the Department of Computer Science . He serves as a software engineer at the Stellar Development Foundation . His work bridges academic research and industry applications in distributed systems and security. University: Stanford University Academic Rank: Professor Email: dm@scs.stanford.edu Research Interests: David Mazières' research focuses on distributed systems , cryptocurrencies , and computer security . Key areas include consensus protocols (e.g., Stellar ), low-latency scheduling ( Syrup , Shinjuku ), and cryptographic techniques for privacy and security ( SafetyPin , CCFI ). Key Achievements: His notable works include: TCP-ENO (RFC 8547) for secure transport protocols Stellar Consensus Protocol for decentralized finance SOSP 1999 Best Paper for 'Separating key management from file system security' Teaching Contributions: He has taught core and advanced courses at Stanford since 2005, including CS212 (Operating Systems) , CS240h (Functional Systems in Haskell) , and CS251 (Cryptocurrencies and Blockchain Technologies) . Previously taught courses at NYU (2001-2005).

Henrik Sandbergمشاهده پروفایل

استاد

• Cyber-Physical Systems Security
• Power Systems
• Model Reduction
• +۶ مورد دیگر

Henrik Sandberg is a Professor at the Division of Decision and Control Systems , KTH Royal Institute of Technology , Stockholm, Sweden. He holds the title of Deputy Head of Division and is affiliated with the School of Electrical Engineering and Computer Science . Education: MSc in Engineering Physics (1999) PhD in Automatic Control (2004) from Lund University Postdoctoral position at Caltech (pre-2007) Research Interests: Focus on cyber-physical systems security , power systems , model reduction , and fundamental limitations of control systems . Key sub-areas include attack detection , networked control , privacy-preserving estimation , and resilient control architectures . Publications: Over 150 papers across IEEE Transactions and Automatica , covering topics like stealthy attacks , distributed control , LQG optimization , and thermodynamic costs in filtering . Recent work includes LWE-based encrypted control and Bayesian deception mechanisms . Scientific Awards: Best Student Paper Award Finalist at IEEE CASE 2014; Best Student-Paper Award at IEEE CDC 2004. Grants & Projects: Leads the DYNACON project (WASP Cybersec cluster) and collaborates on CERCES (critical infrastructure resilience). Serves as examiner for multiple advanced courses in cybersecurity and control systems. Contact: Email: hsan@kth.se Phone: +46 (0)8 790 7294 Room: A:607, Malvinas Väg 10, Stockholm

Ian Goldbergمشاهده پروفایل

استاد

• Security
• Privacy
• Privacy-Enhancing Technologies (PETs)
• +۵ مورد دیگر

Ian Goldberg is a Professor at the Cheriton School of Computer Science , University of Waterloo, Canada. He holds the Canada Research Chair in Privacy Enhancing Technologies and leads the Cryptography, Security, and Privacy (CrySP) group . He is affiliated with the Cybersecurity and Privacy Institute and the Institute for Quantum Computing . Research Focus: Security, privacy, and privacy-enhancing technologies (PETs) for the Internet, including Off-the-Record (OTR) Messaging , censorship resistance , private information retrieval , and zero-knowledge proofs . Recent Publications: His work addresses metadata protection , deniable authentication , and secure multi-party computation , with applications to anonymous communication and censorship resistance. Scientific Awards: Canada Research Chair in Privacy Enhancing Technologies Students: He advises current and former PhD/Master’s students in projects like Lox , PRSONA , Walkie-Talkie , and SkypeMorph . Notable advisees include Sajin Sasy (Privacy-Preserving Communications), Justin Tracey (PETs Development), and Tao Wang (Website Fingerprinting Defenses). Labs & Teams: Goldberg is a core member of the CrySP group and contributes to the Tor Project and Off-the-Record Messaging open-source initiatives. His research bridges theoretical and applied cryptography, with deployments in real-world systems like Tor and PIR protocols.

Jelani Nelsonمشاهده پروفایل

استاد

• Theoretical Computer Science
• Algorithms
• Data Streams
• +۸ مورد دیگر

Jelani Nelson is a Professor and Department Chair in the UC Berkeley EECS Department (College of Engineering). His work focuses on theoretical computer science , particularly algorithms , data streams , dimensionality reduction , and privacy-preserving computation . Advising : Current students include Ishaq Aden-Ali, Xin Lyu, Mihir Singhal, and Hongxun Wu (co-advised with leading researchers). Education : PhD from MIT (George M. Sprowls Award), M.Eng from MIT. Research Highlights : Developed foundational results in Johnson-Lindenstrauss dimensionality reduction (optimality, sparse embeddings). Advancements in differential privacy (lower bounds, private mean estimation, threshold learning). Pioneering work on streaming algorithms for heavy hitters, norm estimation, and graph problems. Innovations in compressed sensing and oblivious subspace embeddings . Scientific Awards : PODS Best Paper Award (2011, 2022) IBM Pat Goldberg Memorial Best Paper Award (2011) George M. Sprowls Award for MIT doctoral thesis (2009) NeurIPS 2020 Spotlight Presentation

Stefano Tessaroمشاهده پروفایل

استاد

• Cryptography
• Computer Security
• Theoretical Computer Science
• +۳ مورد دیگر

Stefano Tessaro is a Professor in the Paul G. Allen School of Computer Science & Engineering at the University of Washington. He holds the Paul G. Allen Career Development Professorship. His research focuses on cryptography, theoretical computer science, and computer security, emphasizing practical applications of cryptographic techniques. He co-leads the cryptography group at UW with Andrea Coladangelo and Huijia Lin, and is part of the theory group. Education: PhD in Computer Science from ETH Zurich (2010) Postdoctoral researcher at MIT CSAIL (2010-2014) and UC San Diego (2014-2019) Joined UW in 2019 as faculty Research Interests: His work spans theoretical cryptography, privacy-preserving systems, cryptographic protocols, and security foundations. He explores practical applications of cryptography, including secure protocols, post-quantum cryptography, and efficient cryptographic constructions. Articles Trends: Recent publications emphasize threshold signatures, memory-tight security proofs, lattice-based cryptography, and privacy-preserving systems. Key themes include adaptive security, formal verification, and efficiency improvements in cryptographic protocols. Awards: NSF CAREER Award Sloan Research Fellowship Hellman Fellowship Research awards from Cisco, JP Morgan, and Microsoft Grants & Advising: His research has been supported by NSF grants and industry partnerships. He advises students in cryptographic theory and applications, though no specific student names are listed in the provided text. Labs & Teams: Co-leads the UW cryptography group, collaborating on projects like LERNA (secure aggregation) and Twinkle (threshold signatures). Engages with interdisciplinary teams in theoretical computer science and security.

Sanjam Gargمشاهده پروفایل

دانشیار

• Cryptography
• Security
• Privacy
• +۳ مورد دیگر

Prof. Sanjam Garg is an Associate Professor at the University of California, Berkeley in the Computer Science Division under the College of Engineering. His work focuses on cryptography and its applications to security and privacy , with affiliations to the Berkeley Center for Responsible, Decentralized Intelligence (RDI) and the Simons Institute for the Theory of Computing (SITC). Education: Ph.D., Computer Science, University of California, Los Angeles (2013) B.Tech, Computer Science and Engineering, Indian Institute of Technology, Delhi (2008) His research spans cryptography , secure computation , and zero-knowledge proofs , with recent publications on threshold encryption , zkSNARKs , and private set intersection . Trends in his work emphasize blockchain security , obfuscation , and secure multiparty computation . Scientific Honors: ACM Doctoral Dissertation Award (2013) Sloan Research Fellowship (2020) Okawa Research Grant (2016) IACR EUROCRYPT Best Paper Award (2013) FOCS Test of Time Award (2023) Bakar Fellows Spark Award (2023) Prof. Garg has advised researchers like James Bartusek (2024), Akshayaram Srinivasan (2020), and Peihan Miao (2019), who are now at institutions such as Microsoft Research and University of Toronto. He teaches CS 170 on algorithms at Berkeley.

Daniel M. Kaneمشاهده پروفایل

استاد

• Number Theory
• Combinatorics
• Complexity Theory
• +۳ مورد دیگر

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

Kristofer S.J. Pisterمشاهده پروفایل

استاد

• Micro/Nano Electro Mechanical Systems (MEMS)
• Control Systems
• Robotics
• +۶ مورد دیگر

Kristofer Pister is a Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He co-directs the Berkeley Sensor and Actuator Center (BSAC) and the Ubiquitous Swarm Lab. His career spans groundbreaking innovations in Micro/Nano Electro Mechanical Systems (MEMS), Control Systems, and Low-Power Circuits, with a focus on Smart Dust and synthetic insects. Education: Ph.D. and M.S. in EECS from UC Berkeley (1992, 1989); B.A. in Applied Physics from UC San Diego (1986). His research areas include MEMS , Control Systems , Robotics , and Integrated Circuits , with recent work on self-powered micro-sensors, crystal-free radios, and interplanetary swarm networks. Key awards include the ISA Albert F. Sperry Founder Award (2009) , Alexander Schwarzkopf Prize (2006) , and the NSF CAREER Award (1996) . He has authored numerous influential publications in wireless sensor networks and microrobotics. His lab, Ubiquitous Swarm Lab , explores distributed robotics and swarm intelligence. Pister emphasizes open collaboration in research, ethical conduct in academia, and efficient resource utilization for graduate students.

Benedikt Bünzمشاهده پروفایل

استادیار

• Applied Cryptography
• Blockchain Technology
• Consensus Algorithms
• +۴ مورد دیگر

Benedikt Bünz is an Assistant Professor of Computer Science at New York University's Courant Institute of Mathematical Sciences. He is also a co-founder and chief scientist of Espresso Systems, where he applies his research expertise to real-world blockchain solutions. His academic work bridges theoretical cryptography with practical blockchain implementations, focusing on enhancing privacy, security, and usability of decentralized systems. Dr. Bünz's research centers around applied cryptography, consensus mechanisms, and game theory as they relate to cryptocurrencies. His work spans zero-knowledge proofs, verifiable delay functions, secure multi-party computation, and privacy-preserving protocols. He has made significant contributions to Bulletproofs, a zero-knowledge proof system deployed on blockchains like Monero, and pioneered research in verifiable delay functions which are now part of Ethereum 2.0's design. His recent work focuses on recursive proof systems, accumulation schemes, and efficient verification techniques for blockchain scalability. His publication record shows a consistent progression from foundational cryptographic primitives to practical blockchain implementations. Recent work demonstrates increasing sophistication in recursive proof systems (ProtoStar, HyperPlonk), novel accumulation techniques (ARC, DewTwo), and foundational work on randomness generation (VDFs). His research consistently bridges theoretical cryptography with real-world blockchain applications, resulting in protocols that are both theoretically sound and practically implementable across multiple blockchain platforms. Dr. Bünz actively contributes to the academic community through teaching and mentorship. He teaches courses on cryptography of blockchains and computer security at NYU, providing students with hands-on experience in blockchain security and cryptographic protocols. His industry engagement through Espresso Systems demonstrates his commitment to translating academic research into practical solutions for the blockchain ecosystem.

Daniel Gottesmanمشاهده پروفایل

استاد

• Quantum Computing
• Algorithms and Theory
• Quantum Error Correction
• +۳ مورد دیگر

Daniel Gottesman is the Brin Family Endowed Professor in Theoretical Computer Science at the University of Maryland, affiliated with the Department of Computer Science, Institute for Advanced Computer Studies (UMIACS), and the Joint Center for Quantum Information and Computer Science (QuICS). He holds a Ph.D. in Physics from Caltech (1997) and has held positions at institutions like the Perimeter Institute and Quantum Benchmark. His research focuses on quantum computing, quantum error correction, and fault-tolerant systems, with contributions to stabilizer codes and quantum teleportation-based gates. Education: Bachelor's in Physics, Harvard University (1992) Ph.D. in Physics, California Institute of Technology (1997) Research Interests: Quantum error correction and fault-tolerant architectures Quantum cryptography and secure communication protocols Quantum complexity theory and algorithm design Applications of stabilizer codes and topological quantum computing Scientific Awards: Fellow of the American Physical Society CIFAR Senior Fellow in Quantum Information Science Three U.S. Patents (e.g., quantum key distribution systems) Advising & Grants: Supervised over 30 students/postdocs and served on numerous thesis committees. Active in securing funding for quantum research through endowed professorships and industry partnerships (e.g., Quantum Benchmark). Labs/Teams: Member of QuICS and UMIACS, collaborating on quantum hardware-software integration and error correction challenges.

• Secure Decentralized Systems
• Blockchain Technology
• Systems Security
• +۳ مورد دیگر

Prof. Bryan Ford leads the Decentralized/Distributed Systems (DEDIS) lab at EPFL. He focuses on secure decentralized systems, including blockchain technology, privacy, and systems security. He earned his Ph.D. from MIT and held faculty positions at Yale University and EPFL. His work spans distributed consensus protocols, peer-to-peer networking, and privacy-preserving systems. Key projects include QuePaxa (timeout-free consensus), UIA (global connectivity for mobile devices), and MedCo (secure healthcare data sharing). He advises numerous PhD students and contributes to open-source projects like Bitcoin collective signing and privacy networks like Riffle. Education: Ph.D., MIT; Postdoctoral work at Yale Research interests include blockchain scalability, consensus algorithms, and cryptographic privacy. His lab develops systems like TRIP for coercion-resistant voting and F3B to mitigate blockchain front-running. His work on NAT traversal and peer-to-peer protocols (e.g., STUN/ICE) remains foundational in network architecture. He emphasizes practical, auditable security solutions such as CertiKOS and atomic cross-chain transactions (Atom). Notable contributions: CoSi (collective signing), OmniLedger (sharded blockchain), and privacy-preserving protocols like PURBs (Protected Unsealable Recursive Boxes). His lab collaborates with Swiss Post to audit e-voting systems and designs democratic cryptocurrencies like PoPCoin.

• Computer Security
• Privacy
• Applied Cryptography
• +۶ مورد دیگر

Aggelos Kiayias FRSE is Chair in Cyber Security and Privacy and Director of the Blockchain Technology Laboratory at the University of Edinburgh. He is also Chief Scientist at blockchain technology company Input Output. His academic work spans over two decades with more than 200 publications in cryptography, blockchain, and security. Dr. Kiayias received his Ph.D. from the City University of New York and was an undergraduate at the University of Athens Mathematics department. His research focuses on computer security, privacy, applied cryptography, and foundations of cryptography with particular emphasis on blockchain technologies, distributed systems, e-voting, secure multiparty protocols, and identity management. His recent work demonstrates continued innovation across multiple dimensions of blockchain technology, with publications spanning theoretical foundations, practical implementations, economic modeling, and privacy-preserving techniques. The research output shows strong emphasis on security analysis, consensus protocols, transaction processing, and economic incentives within decentralized systems. His work bridges theoretical cryptography with real-world blockchain applications. Among his notable recognitions are an ERC Starting Grant, Marie Curie fellowship, NSF Career Award, Fulbright Fellowship, election as Fellow of the Royal Society of Edinburgh in 2021, and the BCS Lovelace Medal in 2024. He has served as program chair for major conferences including the Cryptographers' Track of RSA (2011), Financial Cryptography (2017), Real World Crypto Symposium (2020), and Public-Key Cryptography Conference (2020), and as general chair of Eurocrypt 2013. Professor Kiayias has supervised over 20 PhD students, many of whom have gone on to academic positions at institutions including Imperial College, Stanford University, Royal Holloway University London, University of Glasgow, University of Sydney, and Virginia Commonwealth University. His current advisees include Yu Shen, Amirreza Sarencheh, and Christina Ovezik with expected graduations between 2025-2026. He leads the Blockchain Technology Laboratory at the University of Edinburgh and is involved in several major blockchain research projects including Panoramix and Fentec. His research has received significant funding from the European Union (Horizon 2020, ERC), UK research councils (EPSRC), US agencies (NSF, DHS, NIST), and Greek research bodies.

Qiang Tangمشاهده پروفایل

دانشیار

• Cryptography
• Blockchain Technology
• Computer Security
• +۳ مورد دیگر

Qiang Tang is currently an Associate Professor (Level D) at the School of Computer Science of The University of Sydney. Previously, he was a Senior Lecturer (2021.1-2024.12) at USYD and an Assistant Professor at the Computer Science Department of New Jersey Institute of Technology (2016.8-2021.1), where he co-directed the JACOBI Blockchain Lab with Prof. Jian Pei and Prof. Zhenfeng Zhang. He completed his PhD at the University of Connecticut under Prof. Aggelos Kiayias and Prof. Alexander Russell, following postdoctoral research at Cornell University with Prof. Elaine Shi. His research spans applied and theoretical cryptography, blockchain technology, privacy, and computer security. His work is supported by ARC, Google, Ethereum Foundation, Stellar Foundation, Protocol Labs, Algorand Foundation, Oracle, and USYD. Previous funding includes NSF, JD.com, AFRL, DoE, and Particl Foundation. His research has led to significant contributions in consensus protocols, distributed randomness generation, secure multi-party computation, and privacy-preserving technologies. Tang's publications reveal a strong focus on practical cryptographic solutions for blockchain and distributed systems. His recent work demonstrates expertise in asynchronous consensus, optimal protocol design, and secure implementations for real-world applications. His research shows consistent innovation in improving efficiency, security, and scalability of distributed systems. Scientific Awards: 2025 DSN Best Paper Award 2024 ICDCS Distinguished Paper Award 2023 SOAR Prize, USYD 2023 Oracle for Research Award 2022 Stellar Foundation Research Awards 2022 Ethereum Academic Award 2019 MIT Technical Review, 35 Chinese Innovators Under 35 Tang actively mentors PhD and Master's students, with several alumni now holding faculty positions or research roles at institutions like City University Hong Kong, Chinese Academy of Sciences, and A*STAR Singapore. He has received significant research funding including a multi-year Google project on End-to-End Secure Cloud and an ARC DP grant on Order Fairness in Decentralized Systems. He leads the research in his lab focusing on blockchain protocols and cryptographic applications, with strong industry connections through collaborations with Google, Ethereum Foundation, Stellar Foundation, and Protocol Labs. His team regularly publishes in top security and cryptography venues including CRYPTO, CCS, USENIX Security, and S&P.

Joachim Rosenthalمشاهده پروفایل

استاد

• Coding Theory
• Cryptography
• Algebraic Geometry
• +۲ مورد دیگر

Joachim Rosenthal is a Professor of Applied Mathematics at the University of Zurich's Department of Mathematics, leading the Applied Algebra Group. His research integrates coding theory, cryptography, and algebraic geometry with applications in communications and security systems. His primary research explores algebraic coding theory including convolutional codes, subspace codes, and post-quantum cryptography. He develops algorithms for error correction, code optimization, and cryptographic protocol analysis, with emphasis on mathematical structures in finite fields and rings. Professor Rosenthal serves as President of the Swiss Mathematical Society (2024-2025) and sits on IEEE Information Theory Society's Board of Governors. He has organized multiple international conferences on coding theory and cryptography, including the Zurich COST Meeting and Workshop on Convolutional Codes. His editorial contributions include roles at Archiv der Mathematik and SIAM Journal on Applied Algebra and Geometry. Recent publications focus on code construction methods, complexity analysis in group-based cryptography, and algebraic approaches to error-correcting codes.