Research

I've been doing research in computer science for almost 40 years, and I have done work in a wide range of areas, including complexity theory, algorithms, data compression, computer security, and cryptography. My most recent work focuses on ways to make security and cryptographic software more reliable, robust, and secure. I am particularly interested in how to find vulnerabilities in large codebases, and have recently done work to enable large-scale static analysis of complex, inter-dependent software packages. This work, as well as my earlier work in other areas, can be found below in my publications.

As I am phasing in to retirement now, I am no longer taking new students or actively creating new projects. I still find this work fascinating and fun, and enjoy working toward solutions to algorithmic and security problems. Feel free to contact me if you have questions about my work, or are interested in finding a research collaborator in these areas.

Publications

This list is a work-in-progress as I redesign my website. You can find abstracts and PDFs of various versions, as well as links to official journal/conferce pages, by clicking on a title.

  1. S.R. Tate and B. Yuan. On the Efficiency of Building Large Collections of Software: Modeling, Algorithms, and Experimental Results, in Springer Communications in Computer and Information Science, vol 1859, pp. 145-168, July 2023. Security&CryptographyJournal
  2. S.R. Tate and B. Yuan. Minimum Size Build Environment Sets and Graph Coloring, in Proceedings of the 17th International Conference on Software Technologies (ICSOFT), 2022, pp. 57-67. Security&CryptographyConference
  3. L. J. Crotts and S. R. Tate. Promoting a Common Testbed for Natural Deduction Tutoring Systems, in Proceedings of the 6th International Conference on Education and E-Learning (ICEEL), 2022, pp. 43-49. EducationConference
  4. L. J. Crotts and S. R. Tate. Comparison of Natural Deduction Theorem Provers used in Electronic Tutoring Systems, in Proceedings of the 6th International Conference on Education and E-Learning (ICEEL), 2022, pp. 1-6. EducationConference
  5. S. R. Tate, M. Bollinadi, and J. Moore. Characterizing Vulnerabilities in a Major Linux Distribution, in Proceedings of the 32nd International Conference on Software Engineering & Knowledge Engineering (SEKE), 2020, pp. 538-543. Security&CryptographyConference
  6. S. R. Tate and R. Vishwanathan. Expiration and Revocation of Keys for Attribute-Based Signatures, in 29th Annual IFIP WG 11.3 Working Conference on Data and Application Security, 2015, pp. 153-169. Security&CryptographyConference
  7. B. L. Kurtz, J. B. Fenwick, R. Tashakkori, A. Esmaili, and S. R. Tate. Active Learning During Lecture Using Tablets, in Proceedings of the SIGCSE Technical Symposium, 2014, pp. 121-126. EducationConference
  8. S. R. Tate, R. Vishwanathan, and S. Weeks. Encrypted Secret Sharing and Analysis by Plaintext Randomization, in 16th Information Security Conference, 2013, pp. 49-65. Security&CryptographyConference
  9. S. R. Tate, R. Vishwanathan, and L. Everhart. Multi-user dynamic proofs of data possession using trusted hardware, in 3rd ACM Conference on Data and Application Security and Privacy (CODASPY 13), 2013, pp. 353-364. Security&CryptographyConference
  10. L. S. Iyer, X. Zhao, A. Chow, and S. R. Tate. Computer Science and Information Technology (CSIT) Identity: An Integrative Theory to Explain Gender Gap in IT, in Proceedings of the International Conference on Information Systems (ICIS), 2011. EducationConference
  11. S. R. Tate and R. Vishwanathan. General Secure Function Evaluation Using Standard Trusted Computing Hardware, in 9th Annual Conference on Privacy, Security, and Trust (PST), 2011, pp. 221-228. Security&CryptographyConference
  12. P. Sroufe, S. Tate, R. Dantu, E. Celikel. Experiences during a Collegiate Cyber Defense Competition, in Journal of Applied Security Research, Vol. 16, No. 3, July 2010. EducationJournal
  13. Y. Kong, J. Deng, and S. R. Tate. A Distributed Public Key Caching Scheme in Large Wireless Networks, in IEEE Global Telecommunications Conference -- Communication & Information System Security (GLOBECOM 10), 2010. Security&CryptographyConference
  14. V. Gunupudi and S. R. Tate. Timing-Accurate TPM Simulation for What-If Explorations in Trusted Computing, in Proceedings of the 2010 International Symposium on Performance Evaluation of Computer and Telecommunication Systems, 2010, pp. 171-178. Security&CryptographyConference
  15. S. R. Tate and R. Vishwanathan. Performance Evaluation of TPM-based Digital Wallets, in Proceedings of the 2010 International Symposium on Performance Evaluation of Computer and Telecommunication Systems, 2010, pp. 179-186. Security&CryptographyConference
  16. S. R. Tate and R. R. Panko. Digital Signatures and Electronic Signatures, in The Handbook of Technology Management, Hossein Bidgoli, ed., John Wiley & Sons, 2009. Security&CryptographyBook Chapter
  17. S. R. Tate and R. Vishwanathan. Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols using Trusted Computing Technology, in Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Application Security, 2009, pp. 252-267. Security&CryptographyConference
  18. P. Yu and S. R. Tate. Online/Offline Signature Schemes for Devices with Limited Computing Capabilities, in Proceedings of the RSA Conference 2008, Cryptographers Track (CT-RSA), 2008, pp. 301-317. Security&CryptographyConference
  19. V. Gunupudi and S. R. Tate. Generalized Non-interactive Oblivious Transfer using Count-Limited Objects with Applications to Secure Mobile Agents, in Proceedings of the 12th International Conference on Financial Cryptography and Data Security, 2008, pp. 98-112. Security&CryptographyConference
  20. P. Yu and S. R. Tate. An Online/Offline Signature Scheme Based on the Strong RSA Assumption, in Proceedings of the 3rd IEEE International Symposium on Security in Networks and Distributed Systems (SSNDS) - part of the 21st International Conference on Advanced Information Networking and Applications Workshops, 2007, pp. 601-606. Security&CryptographyConference
  21. V. Gunupudi and S. R. Tate. Random Oracle Instantiation in Distributed Protocols Using Trusted Platform Modules, in Proceedings of the 3rd IEEE International Symposium on Security in Networks and Distributed Systems (SSNDS) - part of the 21st International Conference on Advanced Information Networking and Applications Workshops, 2007, pp. 463-469. Security&CryptographyConference
  22. H. Ge and S. R. Tate. A Direct Anonymous Attestation Scheme for Embedded Devices, in Proceedings of the 10th International Conference on Theory and Practice of Public-Key Cryptography (PKC), pp. 16-30, 2007. Security&CryptographyConference
  23. V. Gunupudi and S. R. Tate. Design of the SAgent Security Framework for JADE, in Proceedings of the 18th Annual IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), 2006, pp. 90-95. Security&CryptographyConference
  24. V. Gunupudi and S. R. Tate. Exploring Data Integrity Protection in SAgent, in Proceedings of the International Workshop on Privacy and Security in Agent-based Collaborative Environments (PSACE), 2006, pp. 35-49. Security&CryptographyConference
  25. V. Gunupudi, S. R. Tate, and K. Xu. Experimental Evaluation of Security Protocols in SAgent, in Proceedings of the International Workshop on Privacy and Security in Agent-based Collaborative Environments (PSACE), 2006, pp. 60-74. Security&CryptographyConference
  26. H. Ge and S. R. Tate. Traceable Signature: Better Efficiency and Beyond, in Proceedings of Applied Cryptography and Information Security (ACIS), 2006, pp. 327-337. Security&CryptographyConference
  27. H. Ge and S. R. Tate. A Group Signature Scheme with Signature Claiming and Variable Linkability, in Proceedings of the 25th IEEE International Performance, Computing, and Communications Conference (IPCCC), 2006, pp. 497-504. Security&CryptographyConference
  28. H. Ge and S. R. Tate. Efficient Authenticated Key-Exchange for Devices with a Trusted Manager, in Proceedings of the 3rd IEEE International Conference on Information Technology (ITNG) - Embedded Cryptographic Systems track, 2006, pp. 198-203. Security&CryptographyConference
  29. V. Gunupudi and S. R. Tate. SAgent: A Security Framework for JADE, in Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2006, pp. 1116-1118. Security&CryptographyConference
  30. S. P. Joglekar and S. R. Tate. ProtoMon: Embedded Monitors for Cryptographic Protocol Intrusion Detection and Prevention, in Journal of Universal Computer Science (JUCS), Vol. 11, No. 1, 2005, pp. 83-103. Security&CryptographyJournal
  31. K. Xu and S. R. Tate. Universally Composable Secure Mobile Agent Computation, in Proceedings of the 7th International Conference on Information Security (ISC), 2004, pp. 304-317. Security&CryptographyConference
  32. V. Gunupudi and S. R. Tate. Performance Evaluation of Data Integrity Mechanisms for Mobile Agents, in Proceedings of the 2004 IEEE Conference on Information Technology: Coding and Computing (ITCC), Information Assurance and Security Track, 2004, pp. 62-69. Security&CryptographyConference
  33. S. P. Joglekar and S. R. Tate. ProtoMon: Embedded Monitors for Cryptographic Protocol Intrusion Detection and Prevention, in Proceedings of the 2004 IEEE Conference on Information Technology: Coding and Computing (ITCC), Information Assurance and Security Track, 2004, pp. 81-88. Security&CryptographyConference
  34. S. R. Tate and K. Xu. On Garbled Circuits and Constant Round Secure Function Evaluation, in CoPS Lab Technical Report 2003-02, 2003. Security&CryptographyReport
  35. S. R. Tate and K. Xu. Mobile Agent Security Through Multi-Agent Cryptographic Protocols, in Proceedings of the 4th International Conference on Internet Computing (IC 2003), pp. 462-468. Security&CryptographyConference
  36. M.-Y. Kao, A. Nolte, and S. R. Tate. The Risk Profile Problem for Stock Portfolio Optimization, in Computational Methods in Decision-Making, Economics, and Finance, ed E. J. Kontoghiorghes, B. Rustem, and S. Siokos, 2002, pp. 213-230. MiscellaneousChapter
  37. M.-Y. Kao and S.R. Tate. Designing Proxies for Stock Market Indices is Computationally Hard, in Quantitative Finance, Vol. 1, No. 3, May 2001, pp. 361-371. MiscellaneousJournal
  38. M.-Y. Kao, A. Nolte, and S. R. Tate. The Risk Profile Problem for Stock Portfolio Optimization, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 228-234. MiscellaneousConference
  39. J. H. Reif and S. R. Tate. Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input, in Algorithmica, Vol. 28, 2000, pp. 271-287. GeometryJournal
  40. S. R. Tate and K. Xu. General-Purpose Spatial Decomposition Algorithms: Experimental Results, in Proceedings of the 2nd Workshop on Algorithm Engineering and Experimentation (ALENEX), 2000, pp. 197-216. GeometryConference
  41. M.-Y. Kao and S. R. Tate. On-Line Difference Maximization, in SIAM Journal on Discrete Mathematics, Vol. 12, No. 1, 1999, pp. 78--90. Online AlgorithmsJournal
  42. M.-Y. Kao and S.R. Tate. Designing Proxies for Stock Market Indices is Computationally Hard, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999. MiscellaneousConference
  43. B. Chapin and S. Tate. Higher Compression from the Burrows-Wheeler Transform by Modified Sorting, in Proceedings of the Data Compression Conference (DCC), 1998. Data CompressionConference
  44. S. R. Tate. Band Ordering in Lossless Compression of Multispectral Images, in IEEE Transactions on Computers, Vol. 46, No. 4, 1997, pp. 477-483. Data CompressionJournal
  45. J. H. Reif and S. R. Tate. On Dynamic Algorithms for Algebraic Problems, in Journal of Algorithms, Vol. 22, No. 2, 1997, pp. 347-371. Online AlgorithmsJournal
  46. M.-Y. Kao and S. R. Tate. On-Line Difference Maximization, in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 175-182. Online AlgorithmsConference
  47. M. Kao, J. H. Reif, and S. R. Tate. Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, in Information and Computation, Vol. 133, No. 1, 1996, pp. 62-80. Online AlgorithmsJournal
  48. J. H. Reif and S. R. Tate. N-Body Simulation I: Fast Algorithms for Potential Field Evaluation and Trummer's Problem, in UNT Computer Science Technical Report N-96-002, 1996. GeometryReport
  49. S. R. Tate. Stable Computation of the Complex Roots of Unity, in IEEE Transactions on Signal Processing, Vol. 43, No. 7, 1995, pp. 1709--1711. GeometryJournal
  50. J. H. Reif and S. R. Tate. Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds, in Computers and Mathematics with Applications, Vol. 27, No. 5, 1994, pp. 29--44. RoboticsComplexityJournal
  51. S. R. Tate. Band Ordering in Lossless Compression of Multispectral Images, in Proceedings of the Data Compression Conference (DCC), 1994, pp. 311-320. Data CompressionConference
  52. J. H. Reif and S. R. Tate. Dynamic Algebraic Algorithms, in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994, pp. 290--301. Online AlgorithmsConference
  53. J. H. Reif and S. R. Tate. Dynamic Parallel Tree Contraction, in Proceedings of the Symposium on Parallel Algorithms and Architecture (SPAA), 1994, pp. 114--121. Online AlgorithmsConference
  54. J. H. Reif and S. R. Tate. Continuous Alternation: The Complexity of Pursuit in Continuous Domains, in Algorithmica, Vol. 10, 1993, pp. 151--181. RoboticsComplexityJournal
  55. J. H. Reif and S. R. Tate. The Complexity of N-body Simulation, in Proceedings of the 20th Annual International Conference on Automata, Languages, and Programming (ICALP), 1993, pp. 162--176. GeometryConference
  56. S. R. Tate. Report on the Workshop on Data and Image Compression Needs and Uses in the Scientific Community, in CESDIS Technical Report, TR-93-99, 1993. MiscellaneousReport
  57. M. Kao, J. H. Reif, and S. R. Tate. Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1993, pp. 441-447. Online AlgorithmsConference
  58. S. R. Tate. Newton Iteration and Integer Division, in Synthesis of Parallel Algorithms, edited by John H. Reif, Chapter 12, pp. 539--572, 1993. San Mateo, CA: Morgan Kaufmann Publishers. ComplexityJournal
  59. S. R. Tate. Lossless Compression of Region Edge Maps, in Duke University Computer Science Technical Report, CS-1992-09, 1992. Data CompressionReport
  60. V. Pan, J. H. Reif, and S. R. Tate. The Power of Combining the Techniques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms, in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), 1992, pp. 703--713. GeometryConference
  61. J. H. Reif and S. R. Tate. On Threshold Circuits and Polynomial Computation, in SIAM Journal on Computing, Vol. 21, No. 5, October 1992, pp. 896--908. ComplexityJournal
  62. S. R. Tate. Arithmetic Circuit Complexity and Motion Planning, in Ph.D. Dissertation, Duke University, 1991. MiscellaneousReport
  63. M. Kao and S. R. Tate. Online Matching with Blocked Input, in Information Processing Letters, Vol. 38, May 1991, pp. 113--116. Online AlgorithmsJournal
  64. J. H. Reif and S. R. Tate. Optimal Size Integer Division Circuits, in SIAM Journal on Computing, Vol. 19, No. 5, October 1990, pp. 912--924. ComplexityJournal
  65. J. H. Reif and S. R. Tate. Optimal Size Integer Division Circuits, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), 1989, pp. 264--270. ComplexityConference