Stephen R. Tate, Ph.D.
Associate Professor
Department of Computer Science and Engineering
University of North Texas
Navigation
Home
Teaching
Research
Publications
Vita
Links
Contact

Publications

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

    Computer Security and Cryptography

  1. S. R. Tate and K. Xu. "Mobile Agent Security Through Multi-Agent Cryptographic Protocols", Proceedings of the 4th International Conference on Internet Computing (IC 2003), pp. 462-468. [Abstract] [Full Paper (PDF)]

  2. S. R. Tate and K. Xu. "On Garbled Circuits and Constant Round Secure Function Evaluation", CoPS Lab Technical Report 2003-02, 2003. [Abstract] [Full Paper (PDF)]

  3. S. P. Joglekar and S. R. Tate. "ProtoMon: Embedded Monitors for Cryptographic Protocol Intrusion Detection and Prevention," Journal of Universal Computer Science (JUCS), Vol. 11, No. 1, 2005, pp. 83-103. [Abstract] [Full Paper (PDF)]

    (Preliminary version appeared in Proceedings of the 2004 IEEE Conference on Information Technology: Coding and Computing (ITCC), Information Assurance and Security Track, 2004, pp. 81-88.)

  4. V. Gunupudi and S. R. Tate. "Performance Evaluation of Data Integrity Mechanisms for Mobile Agents," Proceedings of the 2004 IEEE Conference on Information Technology: Coding and Computing (ITCC), Information Assurance and Security Track, 2004, pp. 62-69. [Abstract] [Full Paper (PDF)]

  5. K. Xu and S. R. Tate. "Universally Composable Secure Mobile Agent Computation," Proceedings of the 7th International Conference on Information Security (ISC), 2004, pp. 304-317. [Abstract] [Full Paper (PDF)]

  6. V. Gunupudi and S. R. Tate. "SAgent: A Security Framework for JADE," Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2006, pp. 1116-1118. [Abstract] [Full Paper (PDF)]

  7. H. Ge and S. R. Tate. "Efficient Authenticated Key-Exchange for Devices with a Trusted Manager," Proceedings of the 3rd IEEE International Conference on Information Technology (ITNG) - Embedded Cryptographic Systems track, 2006, pp. 198-203. [Abstract] [Full Paper (PDF)]

  8. H. Ge and S. R. Tate. "A Group Signature Scheme with Signature Claiming and Variable Linkability," Proceedings of the 25th IEEE International Performance, Computing, and Communications Conference (IPCCC), 2006, pp. 497-504. [PDF available soon]

  9. H. Ge and S. R. Tate. "Traceable Signature: Better Efficiency and Beyond," Proceedings of Applied Cryptography and Information Security (ACIS), 2006, pp. 327-337. [PDF available soon]

  10. V. Gunupudi, S. R. Tate, and K. Xu. "Experimental Evaluation of Security Protocols in SAgent," Proceedings of the International Workshop on Privacy and Security in Agent-based Collaborative Environments (PSACE), 2006, pp. 60-74. [PDF available soon]

  11. V. Gunupudi and S. R. Tate. "Exploring Data Integrity Protection in SAgent," Proceedings of the International Workshop on Privacy and Security in Agent-based Collaborative Environments (PSACE), 2006, pp. 35-49. [PDF available soon]

  12. V. Gunupudi and S. R. Tate. "Design of the SAgent Security Framework for JADE," Proceedings of the 18th Annual IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), 2006, pp. 90-95. [PDF available soon]

  13. H. Ge and S. R. Tate. "A Direct Anonymous Attestation Scheme for Embedded Devices," Proceedings of the 10th International Conference on Theory and Practice of Public-Key Cryptography (PKC), 2007, to appear. [PDF available soon]

    On-line and Dynamic Algorithms

  14. M. Kao and S. R. Tate. ``Online Matching with Blocked Input'', Information Processing Letters, Vol. 38, May 1991, pp. 113--116. [PostScript] [PDF]

  15. M. Kao, J. H. Reif, and S. R. Tate. ``Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem'', Information and Computation, Vol. 133, No. 1, 1996, pp. 62-80. [PostScript] [PDF]

  16. J. H. Reif and S. R. Tate. ``Dynamic Algebraic Algorithms'', Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 290--301. [ Not available. See the J. of Algorithms paper below for a journal version which supercedes this one. ]

  17. J. H. Reif and S. R. Tate. ``Dynamic Parallel Tree Contraction'', Proceedings of the Symposium on Parallel Algorithms and Architecture, 1994, pp. 114--121. [PostScript] [PDF]

  18. J. H. Reif and S. R. Tate. ``On Dynamic Algorithms for Algebraic Problems'', Journal of Algorithms, Vol. 22, No. 2, 1997, pp. 347-371. [PostScript] [PDF]

  19. M.-Y. Kao and S. R. Tate. ``On-Line Difference Maximization'', SIAM Journal on Discrete Mathematics, Vol. 12, No. 1, 1999, pp. 78--90 (abstract appeared in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 175-182). [PostScript] [PDF]

    Parallel Algorithms and Circuit Complexity

  20. J. H. Reif and S. R. Tate. ``Optimal Size Integer Division Circuits'', SIAM Journal on Computing, Vol. 19, No. 5, October 1990, pp. 912--924. [PostScript] [PDF]

  21. J. H. Reif and S. R. Tate. ``On Threshold Circuits and Polynomial Computation'', SIAM Journal on Computing, Vol. 21, No. 5, October 1992, pp. 896--908. [PostScript] [PDF]

  22. J. H. Reif and S. R. Tate. ``Optimal Size Integer Division Circuits'', Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 264--270.

  23. S. R. Tate. ``Newton Iteration and Integer Division'', Chapter 12 in Synthesis of Parallel Algorithms, edited by John H. Reif, pp. 539--572, 1993. San Mateo, CA: Morgan Kaufmann Publishers. [PostScript] [PDF]

    Robotics

  24. J. H. Reif and S. R. Tate. ``Continuous Alternation'', Algorithmica, Vol. 10, 1993, pp. 151--181. [PostScript]

  25. J. H. Reif and S. R. Tate. ``Approximate Kinodynamic Planning Using L_2-norm Dynamic Bounds'', Computers and Mathematics with Applications, Vol. 27, No. 5, 1994, pp. 29--44. [PostScript]

    Molecular Dynamics, Algebraic Algorithms, and Geometry

  26. 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'', Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992, pp. 703--713.

  27. J. H. Reif and S. R. Tate. ``The Complexity of N-body Simulation'', 20th Annual International Conference on Automata, Languages, and Programming, 1993, pp. 162--176. [PostScript]

  28. S. R. Tate. ``Stable Computation of the Complex Roots of Unity'', IEEE Transactions on Signal Processing, Vol. 43, No. 7, 1995, pp. 1709--1711. [PostScript] \item[] J. H. Reif and S. R. Tate. ``Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input'', {\em Algorithmica}, Vol.~28, 2000, pp.~271--287.

  29. J. H. Reif and S. R. Tate. ``Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input'', Algorithmica, Vol. 28, 2000, pp. 271-287. [PostScript]

  30. J. H. Reif and S. R. Tate. ``N-Body Simulation I: Fast Algorithms for Potential Field Evaluation and Trummer's Problem'', UNT Computer Science Technical Report N-96-002, 1996. [PostScript]

  31. S. R. Tate and K. Xu. ``General-Purpose Spatial Decomposition Algorithms: Experimental Results", 2nd Workshop on Algorithm Engineering and Experimentation (ALENEX), 2000, pp. 197-216. [PostScript] [PDF]

    Data Compression

  32. S. R. Tate. ``Band Ordering in Lossless Compression of Multispectral Images'', IEEE Transactions on Computers, Vol. 46, No. 4, 1997, pp. 477-483 (preliminary version appeared in Proceedings of the Data Compression Conference, 1994, pp. 311--320). [PostScript]

  33. S. R. Tate. ``Lossless Compression of Region Edge Maps'', Duke University Computer Science Technical Report CS-1992-09. [PostScript]

  34. B. Chapin and S. Tate. "Higher Compression from the Burrows-Wheeler Transform by Modified Sorting", abstract to appear in Proceedings of the Data Compression Conference, 1998. [PostScript] [PDF]

    Miscellaneous

  35. M.-Y. Kao, A. Nolte, and S. R. Tate. ``The Risk Profile Problem for Stock Portfolio Optimization,'' Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 228-234. [PostScript] [PDF]

  36. M.-Y. Kao and S.R. Tate. ``Designing Proxies for Stock Market Indices is Computationally Hard'', Quantitative Finance, Vol. 1, No. 3, May 2001, pp. 361-371. (Preliminary version appeared in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1999) [PostScript] [PDF]

  37. S. R. Tate. ``Arithmetic Circuit Complexity and Motion Planning'', Ph. D. Dissertation, Duke University, 1991. [PostScript] [PDF]

  38. S. R. Tate. ``Report on the Workshop on Data and Image Compression Needs and Uses in the Scientific Community'', CESDIS Technical Report TR-93-99.