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

Ryan Henryمشاهده پروفایل

استادیار

• Applied Cryptography
• Secure Systems
• Privacy-Preserving Technologies
• +۳ مورد دیگر

Ryan Henry is an Assistant Professor in the Department of Computer Science at the University of Calgary. His research focuses on applied cryptography, emphasizing the development of secure systems that prioritize user privacy. His work spans designing privacy-enhancing technologies, implementing cryptographic protocols, and analyzing number-theoretic attacks on cryptographic assumptions. He also explores theoretical aspects of cryptographic efficiency and practical deployment challenges. While specific educational background details are not provided in the text, his research contributions highlight expertise in cryptography, secure systems, and privacy-preserving technologies. His work has addressed topics such as Private Information Retrieval (PIR), secure messaging, and blockchain privacy. Key research interests include: Secure Multiparty Computation Privacy-Preserving Data Access Efficient Cryptographic Protocols Zero-Knowledge Proofs IoT Security Cryptocurrency and CBDC Design His recent publications emphasize advancements in distributed systems security, privacy in recommendation systems, and cryptographic efficiency. Notable contributions include the Grotto and Duoram frameworks for secure computation, and proposals for Canadian CBDC frameworks. Despite extensive research output, no scientific awards or grants are explicitly mentioned in the provided text. Collaborations and lab affiliations are not detailed, though his work suggests involvement in interdisciplinary projects on privacy and security technologies.

Rafail Ostrovskyمشاهده پروفایل

استاد

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

Rafail Ostrovsky is a Professor of Computer Science and Mathematics at UCLA , affiliated with the Center for Information and Computation Security at the Henry Samueli School of Engineering and Applied Science. He earned his Ph.D. in Computer Science from MIT in 1992 under Silvio Micali. Research Focus: His work spans cryptography, algorithms, and theoretical computer science, emphasizing secure multi-party computation, zero-knowledge proofs, oblivious RAM, and high-dimensional data analysis. Applications include privacy-preserving data mining, systems security, and quantum cryptography. Article Trends: Recent publications address concurrent security protocols, robust secret sharing via expander graphs, and efficient multi-party computation. Topics intersect computational complexity, cryptographic reductions, and practical security implementations. Awards: Recipient of the 2018 RSA Conference Excellence in Mathematics Award , 2017 IEEE Fellow , and multiple IEEE/ACM honors. Holds 14 U.S. patents and over 290 refereed papers. Advising: Supervised 27 Ph.D. students, many now professors at top institutions. Served on 40+ program committees, including FOCS 2011 Chair. Labs: Leads the CICS research center, fostering interdisciplinary work in information security and cryptographic systems.

• Database Systems
• Privacy-Preserving Computation
• Indexing Techniques
• +۳ مورد دیگر

Dong Xie is an Assistant Professor in the field of Computer Science and Engineering , with a focus on database systems and privacy-preserving computation. His work spans indexing techniques, oblivious RAM, and high-throughput data processing. Key Research Areas: Encrypted databases, access pattern privacy, dynamic data structures, spatial analytics. Collaborations: Active in database optimization and security, with external partnerships reflected in recent publications. Over the past decade, Dong Xie has contributed to advancements in oblivious query processing , index dynamization , and spatial data management . His research addresses challenges in secure data access , concurrent updates , and storage efficiency , particularly for cloud and distributed environments. Recent publications highlight his work on low-latency transaction scheduling (2025), dynamic sampling indexes (2023), and SSD-based storage optimization (2022). His articles explore intersections of privacy , performance , and scalability .

• Cryptography
• Secure Multiparty Computation (MPC)
• Zero-Knowledge Proofs
• +۳ مورد دیگر

Aarushi Goel is an Assistant Professor of Computer Science at Purdue University's Department of Computer Science, part of the College of Science. She joined the department in Fall 2024 and is affiliated with Purdue's main campus in West Lafayette, Indiana. Her research focuses on cryptographic protocols, with a strong emphasis on secure multiparty computation (MPC), zero-knowledge proofs, and distributed systems security. Her work addresses challenges in privacy-preserving computation, Byzantine fault tolerance, and efficient cryptographic systems. Notable research directions include optimizing MPC protocols for dynamic environments, minimizing communication overhead in distributed systems, and developing practical zero-knowledge proof frameworks. Recent publications explore topics like homomorphic secret sharing, sublinear prover protocols, and Byzantine agreement with polylogarithmic communication complexity. Dr. Goel's contributions often bridge theoretical cryptography with real-world applications, such as secure machine learning training and verifiable computation. Her work has implications for decentralized systems, blockchain technology, and privacy-enhancing technologies. No awards or grants are explicitly listed in the provided materials, but her prolific publication record indicates active engagement in cutting-edge research. She holds no listed advisees or students in the current data. Lab and team affiliations are not specified in the provided text, though her research likely involves collaborations within Purdue's computer science department and external institutions. Her office is located in LWSN 2142D on the Purdue campus.

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

Rafail Ostrovsky is a Distinguished Professor of Computer Science and Mathematics (by courtesy) at UCLA's Henry Samueli School of Engineering and Applied Science. He holds the Norman E. Friedman Chair in Knowledge Sciences and serves as Director of the Center for Information and Computation Security. With over 350 refereed publications and 15 issued USPTO patents, he is one of the most influential researchers in theoretical computer science and cryptography. Professor Ostrovsky's research spans cryptography, network algorithms, and search and classification of large-scale, high-dimensional data. His work focuses on foundational aspects of secure computation including zero-knowledge proofs, secure multi-party computation, private information retrieval, and privacy-preserving data analysis. His contributions to streaming algorithms, metric embedding, and clustering for high-dimensional data have established important theoretical frameworks with practical applications. He has pioneered techniques for secure computation that maintain privacy while enabling collaborative data analysis. His recent publications demonstrate continued leadership in advancing secure computation protocols, with emphasis on efficiency improvements, practical implementations, and novel applications in blockchain technology and distributed systems. His work consistently addresses fundamental theoretical challenges while maintaining relevance to real-world security problems, bridging the gap between theoretical cryptography and practical security solutions. Selected Honors: 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 (the highest award given by the IEEE Computer Society) Professor Ostrovsky has served in 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 the editorial boards of the Journal of ACM and Algorithmica Journal. As a Fellow of the National Academy of Inventors, AAAS, ACM, IEEE, and IACR, and as a foreign member of Academia Europaea, his contributions have been widely recognized across multiple disciplines. He actively teaches advanced courses including Introduction to Cryptography (CS183), Foundations of Cryptography (CS282A/M209A), and Cryptographic Protocols (CS282B/M209B), mentoring the next generation of security researchers while continuing to push the boundaries of secure computation through his research.

Wei-Kai Linمشاهده پروفایل

استادیار

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

Wei-Kai Lin is an Assistant Professor in the Department of Computer Science at the University of Virginia. He holds a Ph.D. from Cornell University and previously worked as a postdoctoral researcher at Northeastern University and CMU, advised by Professors Daniel Wichs and Elaine Shi. His research focuses on cryptography and theoretical computer science, particularly private accesses on big data, oblivious RAM (ORAM), and private information retrieval (PIR). Lin's work has been recognized with the Best Paper Award at STOC 2023 for his breakthrough in doubly efficient PIR and FHE for RAM programs. Lin's education includes a B.S. and M.S. from National Taiwan University, followed by roles as a software engineer and a research assistant at Academia Sinica. He teaches courses such as Introduction to Cryptography (CS 6222) and Cryptography (CS 4501) at UVA. He actively organizes the UVA Theory Seminar, fostering discussions on topics like expander codes, multiplicative weights algorithms, and privacy-preserving techniques. His research interests include cryptographic protocols that minimize computational overhead while ensuring privacy, such as OptORAMa (the first optimal ORAM scheme) and NanoGRAM (garbled RAM with logarithmic overhead). Lin collaborates with industry and academia, addressing challenges in secure computation and privacy in distributed systems.

• Cryptographic Protocols
• Cloud Security and Privacy
• Homomorphic Encryption
• +۳ مورد دیگر

Travis Mayberry is an Assistant Professor in the Cyber Security department at the United States Naval Academy. His research focuses on cryptographic protocols, cloud security, privacy-preserving technologies, homomorphic encryption, and secure voting systems. He holds a PhD in Computer Science from Northeastern University, with a dissertation on practical Oblivious RAM (ORAM) protocols for private data outsourcing. He also contributed to the Scantegrity project at the University of Maryland, Baltimore County, developing end-to-end verifiable voting systems. Key areas of research include privacy in mobile devices, secure communication protocols, and cryptographic mechanisms for data protection. His work has been published in top venues like Privacy Enhancing Technologies Symposium (PETS), Network and Distributed Systems Security Symposium (NDSS), and ACM Computer and Communications Security (CCS). He received a Distinguished Paper Award in 2014 for his research on combining ORAM and PIR for efficient private file retrieval. Mayberry’s publications analyze vulnerabilities in Bluetooth Low Energy protocols, TLS client authentication tracking, and MAC address randomization in mobile devices. He has collaborated extensively on secure voting systems (e.g., Scantegrity) and practical ORAM implementations like ObliviSync and rORAM. His contributions bridge theoretical cryptography with real-world applications in privacy and security.

Anrin Chakrabortiمشاهده پروفایل

استادیار

• Cryptography
• Systems Security
• Cloud Computing Security
• +۷ مورد دیگر

Anrin Chakraborti is an Assistant Professor in the Department of Computer Science at the University of Illinois at Chicago, affiliated with the College of Engineering. His work bridges cryptography, systems, and theory to build privacy-preserving technologies for real-world challenges. Ph.D. in Computer Science from Stony Brook University (2020) Postdoctoral Researcher at Duke University B.Tech in Computer Science from Jadavpur University, India Chakraborti’s research focuses on three core areas: Secure Cloud Computing: Developing cryptographic mechanisms to protect data confidentiality and integrity in cloud environments against side-channels and malicious providers. Privacy in Collaborative Systems: Designing tools for private information sharing in cyber-physical systems and collaborative learning pipelines, including autonomous vehicle communication. Deniable Communication & Storage: Creating storage and messaging systems resistant to coercion, backdoors, and key compromise through plausibly deniable encryption. His publications demonstrate a consistent focus on privacy-enhancing technologies, oblivious protocols, and secure storage solutions. Notable contributions include Wink (deniable secure messaging), INVISILINE (plausibly-deniable storage), and ORAM-based protocols for cloud data privacy. He teaches graduate courses like CS 588 (Security & Privacy in Networked Systems) and CS 594 (Applied Cryptography), emphasizing hands-on implementation of secure systems.

Jack Doernerمشاهده پروفایل

استادیار

• Theoretical and Applied Cryptography
• Multiparty Computation
• Threshold Signatures
• +۷ مورد دیگر

Jack Doerner is an Assistant Professor in the Department of Computer Science at the University of Virginia, within the School of Engineering and Applied Science. He earned his Ph.D. in Computer Science from Northeastern University in 2022 and holds B.S. and B.A. degrees in Computer Science and Studio Art from the University of Virginia (2015). His research focuses on the theoretical and applied aspects of cryptography, with core interests in secure multiparty computation (MPC), threshold signatures, zero-knowledge proofs, and oblivious RAM. His work aims to design efficient, secure, and practical cryptographic protocols, particularly for applications in cryptocurrency and secure computation. His most influential work is a series of highly efficient threshold ECDSA protocols, developed with collaborators like abhi shelat and Yashvanth Kondi. These protocols are secure under standard cryptographic assumptions and have achieved remarkable performance, being implemented by major companies like Coinbase, Visa, and Web3Auth. His research also includes significant contributions to MPC with identifiable abort, coin tossing extension, and the foundational theory of ideal signature functionalities. Best Paper Award, ACM CCS 2017 He has advised research and collaborated extensively, leading to numerous publications in top venues like IEEE S&P, ACM CCS, Eurocrypt, and Crypto. His work often bridges theory and practice, resulting in open-source implementations and widespread adoption. He has no known lab or team name mentioned, but his research is conducted within the broader context of the University of Virginia's computer science research community.

• Computer Science
• Information Security
• Cloud Computing
• +۶ مورد دیگر

Radu Sion is a Professor at the Department of Computer Science, Stony Brook University, specializing in Computer Science , Information Security , Cloud Computing , Data Privacy , and Cryptography . His research focuses on secure data outsourcing, trusted hardware applications, and privacy-preserving systems. Recent work includes Wink: Deniable Secure Messaging (2023) and A Study of China's Censorship Evasion (2023), both exploring plausibly deniable communication. Earlier contributions like PEARL (2021) and ConcurDB (2014) address secure storage and database integrity. His 2024 paper INVISILINE introduces invisible plausibly deniable storage solutions. His research spans Oblivious RAM , History-Independent Data Structures , Trusted Execution Environments , and Flash Memory Security . Key collaboration networks include Bogdan Carbunar, Anrin Chakraborti, and Chen Chen.

Jack Doernerمشاهده پروفایل

استادیار

• Cryptography
• Secure Multiparty Computation
• Oblivious RAM (ORAM)
• +۴ مورد دیگر

Jack Doerner is an Assistant Professor of Computer Science at the University of Virginia. His research focuses on cryptography, particularly secure multi-party computation, threshold cryptography, and oblivious RAM (ORAM). Previously, he held postdoctoral positions at Brown University (hosted by Anna Lysyanskaya) and jointly at the Technion and Reichman University (hosted by Yuval Ishai and Elette Boyle). He completed his PhD at Northeastern University, advised by Abhi Shelat. His work spans foundational advancements in cryptographic protocols, including threshold ECDSA, modular analysis of broadcast protocols, and scalable ORAM solutions. Notable contributions include the first constant-round coin tossing extension with guaranteed output and efficient secure stable matching at scale. His research emphasizes practical efficiency and security in distributed systems. Doerner also engages in artistic endeavors, creating films, photography, and sculptures that explore perception and space. His art has been exhibited in galleries such as the Second Street Gallery in Charlottesville. Publications highlight contributions to secure computation frameworks, threshold signatures, and cryptographic protocols. His work addresses challenges in distributed systems, privacy-preserving algorithms, and foundational cryptographic assumptions.

Alexander R. Blockمشاهده پروفایل

استادیار

• Cryptography
• Coding Theory
• SNARKs
• +۷ مورد دیگر

Dr. Alexander R. Block is an Assistant Professor at the University of Illinois at Chicago (UIC) , specializing in Cryptography and Coding Theory . He focuses on the concrete security and space-efficiency of SNARKs, error-correcting codes , and locally decodable codes . Before UIC, he was a postdoctoral researcher at Georgetown University and University of Maryland , advised by Justin Thaler and Jonathan Katz. His PhD from Purdue University (2022) was supervised by Jeremiah Blocki. His research bridges theoretical and applied aspects, including field-agnostic SNARKs (CRYPTO 2024) with expand-accumulate codes, Fiat-Shamir security analysis of FRI protocols (ASIACRYPT 2023), and memory-hard puzzles in the standard model (SCN 2022). He has contributed to insertion-deletion error codes (CCC 2023) and secure computation with leaky correlations (TCC 2018, CRYPTO 2017). Dr. Block has received multiple scientific awards , including the Emil Stefanov Fellowship (2021) and Purdue Three Minute Thesis Competition Finalist (2022). His teaching includes courses like UIC's CS 505 - Computability and Complexity Theory (Spring 2025), where he emphasizes interactive proofs and zero-knowledge systems . He actively serves on program committees for CRYPTO , EUROCRYPT , and ZKProof Workshop , and has reviewed for leading journals and conferences.

David Heathمشاهده پروفایل

استادیار

• Cryptography
• Secure Multiparty Computation (MPC)
• Zero Knowledge Proofs
• +۳ مورد دیگر

David Heath is an Assistant Professor at the University of Illinois Urbana-Champaign, affiliated with the Siebel School of Computing and Data Science and the Department of Computer Science. His research focuses on Cryptography, specifically Secure Multiparty Computation (MPC) and Zero Knowledge proofs. He earned his doctoral degree from Georgia Institute of Technology, recognized by the 2023 Outstanding Doctoral Dissertation Award. His work emphasizes reducing computational costs in MPC and ZK protocols, with notable contributions in garbled circuits and ORAM optimizations. He has received prestigious awards including the 2023 Distinguished Paper Award at ACM CCS and the Best Paper Award at Eurocrypt 2022. His teaching excellence is reflected in multiple 'Teacher Ranked as Excellent' recognitions from UIUC students. Research interests span algorithmic advancements in secure computation, cryptographic protocols, and privacy-preserving technologies. Recent work includes oblivious computation models, garbled RAM systems, and efficient zero-knowledge processors.

Aarushi Goelمشاهده پروفایل

استادیار

• Cryptography
• Secure Multiparty Computation
• Zero-Knowledge Proofs
• +۵ مورد دیگر

Aarushi Goel is an Assistant Professor in the Computer Science department at Purdue University , specializing in cryptography. She previously held a postdoctoral position at NTT Research's CIS Lab under Sanjam Garg and earned her PhD from Johns Hopkins University in 2022, advised by Abhishek Jain. Research Focus: Designing efficient techniques for secure multiparty computation (MPC) and zero-knowledge proofs (ZKPs), with applications in privacy-preserving systems, blockchain, and cloud security. Teaching: Courses include Advanced Cryptography (CS65500) and Special Topics in Cryptography (CS59200-STC), emphasizing state-of-the-art ZKP methods and MPC protocols. Scientific Awards: Simons-Berkeley Research Fellow (2025), participating in the program "Cryptography 10 Years Later".

Adithya Vadapalliمشاهده پروفایل

استادیار

• Cryptography
• Secure Multi-Party Computation
• Oblivious RAM
• +۳ مورد دیگر

Adithya Vadapalli is an Assistant Professor at the Department of Computer Science and Engineering (IIT Kanpur, India). His research focuses on constructing systems that prevent data leaks through cryptographic methods, with broader applications in secure computation and privacy preservation. Education: Ph.D. in Computer Science from Indiana University Bloomington. Prior Role: Postdoctoral Fellow at the University of Waterloo (CrySP group). His research interests include: Secure Multi-Party Computation (SMPC) Oblivious RAM (ORAM) design Metadata protection techniques Privacy-preserving machine learning Recent publications highlight advancements in cryptographic primitives like distributed point functions, bandwidth-efficient distributed ORAM, and round-efficient 3-party MPC for dynamic data structures. These works span theoretical foundations and practical implementations. Currently, no scientific awards or student records are explicitly listed in the provided materials.