Selected Publications SELECTED PUBLICATIONS

Complexity

S. Mocas, ``A Note on the Relationship of BPP and RP to Exponential Time Classes'', Portland State University Technical Report TR02-1, 2002 .

S. Mocas, ``Using Bounded Query Classes to Separate Classes in the Exponential Time Hierarchy from Classes in PH'', Theoretical Computer Science 158,1996, pp. 221-231.

S. Homer and S. Mocas, ``Nonuniform Lower Bounds for Exponential Time Classes'', Proceedings from the 20th International Symposium on Mathematical Foundations of Computer Science August, 1995. Lecture Notes in Computer Science #969, Springer-Verlag.

S. E. Mocas ``Separating Exponential Time Classes from Polynomial Time Classes'', PhD. Thesis, 1993.

L. Longpre and S. Mocas, ``Symmetry of Information and One-way Functions'', IPL (Information Processing Letters) 46, May 1993, pp. 95-100.

Security and Forensics

S. Mocas, ``Building Theoretical Underpinnings for Digital Forensics Research'', (.pdf), Dgital Investigation, 1 (2004) pp. 61-68

S. Mocas, ``Building Theoretical Underpinnings for Digital Forensics Research'', (.pdf), Proceedings of the Digital Forensic Research Workshop (DFRWS) , August, 2003.

G. Heuston, W. Harrison, S. Mocas, M. Morrissey and J. Richardson, ``High Tech Forensics: Serving as a Police Reserve Specialist'', (.pdf), submitted to Communications of the ACM , to appear June 2003.

W. Harrison, D. Aucsmith, G. Heuston, S. Mocas, M. Morrissey and S. Russelle, ``A Lessons Learned Repository for Computer Forensics'', (.pdf), International Journal of Digital Evidence (IJDE) , Volume 1, Issue 3, Fall, 2002.

S. Mocas and T. Schubert, ``Formal Analysis of IP Layer Security'', Proceedings of the DIMACS Special Year on Networks, DIMACS Workshop on Design and Formal Verification of Security Protocols, September, 1997. Available on CD.

S. Mocas and T. Schubert, ``A Mechanized Logic for Secure Key Escrow Protocol Verification '', 1995 International Workshop on Higher Order Logic Theorem Proving and its Applications, September, 1995, Lecture Notes in Computer Science #971, Springer-Verlag, pp 308-323.



Last modified 10/8/02