Daniel S. Roche

Daniel S. Roche is a Professor in the Department of Computer Science at the United States Naval Academy. He focuses on developing efficient algorithms for mathematical problems, particularly leveraging randomization to enhance performance in terms of time, space, or communication. His research areas include polynomial computation, sparse polynomial interpolation, and applied cryptography, with a special interest in secure cloud computing and privacy-preserving technologies.

Roche has contributed to advancements in oblivious RAM and sparse polynomial operations, authoring numerous publications in top-tier conferences such as CCS, NDSS, and ISSAC. His work is supported by the U.S. National Science Foundation (Award #1618269). Roche actively collaborates with researchers like Mark Giesbrecht, Adam J. Aviv, and Seung Geol Choi.

Research Trends: Recent publications highlight Roche's work on unbalanced private set union protocols, randomized prime generation in arithmetic progressions, and enhanced verification techniques for polynomial matrices. His articles from 2019–2025 emphasize sub-linear communication protocols, memory-efficient algorithms, and applied cryptographic systems.

Contact: roche@usna.edu | Office: 438 Hopper Hall, USNA | Phone: (410) 293-6814