I’m an Associate Teaching Professor in the Department of Computer Science at Johns Hopkins University. Recently, I was awarded the 2016 Robert B. Pond, Sr. Excellence in Teaching Award. Prior to joining JHU in July 2014, I was an Associate Professor in the Mathematics and Computer Science Department at McDaniel College. I earned my Ph.D. in Computer Science at the University of California, San Diego (UCSD).

**Fall 2017 Office Hours in Malone Hall 221:
**Mondays, 10:30-11:30am

Wednesdays: 3:15-4:15pm

Thursdays: 10:30-11:30am

Fridays: 10:30-11:30am

I will also be around most Tuesdays, though don’t have a fixed office hour that day. If you need to see me at another time during the week, please email me to set up an appointment.

**Fall 2017 Courses:**

601.220 Intermediate Programming

601.231 Automata and Computation Theory

**All Courses Taught at JHU:**

601.107 (was 60**0**.107) Introductory Programming in Java

601.108 (was 60**0**.108) Introduction to Programming Lab

601.220 (was 60**0**.**1**20) Intermediate Programming

601.226 (was 60**0**.226) Data Structures

601.231 (was 60**0**.2**7**1) Automata and Computation Theory

**Publications:
**A Forward-Secure Digital Signature Scheme.

M. Bellare and S. Miner. CRYPTO ’99.

Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications.

A. Desai and S. Miner. Asiacrypt 2000.

Forward-Secure Threshold Signature Schemes.

M. Abdalla, S. Miner and C. Namprempre. RSA Conference 2001, Cryptographers’ Track.

Graph-Based Authentication of Digital Streams.

S. Miner and J. Staddon. IEEE Symposium on Security and Privacy 2001.

Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time Periods.

T. Malkin, D. Micciancio and S. Miner. Eurocrypt 2002.

Self-Healing Key Distribution with Revocation.

J. Staddon, S. Miner, M. Franklin, D. Balfanz, M. Malkin and D. Dean. IEEE Symposium on Security and Privacy 2002.

Anonymous Credentials with Biometrically-Enforced Non-Transferability.

R. Impagliazzo and S. Miner More. 2003 ACM Workshop on Privacy in the Electronic Society.

Sliding-Window Self-Healing Key Distribution.

S. Miner More, M. Malkin, J. Staddon and D. Balfanz. 2003 ACM Workshop on Survivable and Self-Regenerative Systems.

Building an XQuery Interpreter in a Compiler Construction Course.

S. Miner More, T. Pevzner, A. Deutsch, S. Baden and P. Kube. SIGCSE 2005 Technical Symposium on Computer Science Education, February 2005.

On Interdependence of Secrets in Collaboration Networks.

S. Miner More and P. Naumov. Theoretical Aspects of Rationality and Knowledge XII (TARK 2009), July 2009.

An Independence Relation for Sets of Secrets.

S. Miner More and P. Naumov. *Studia Logica* volume 94, issue 1, pages 73-85 (February 2010). An initial version appeared in 16th Workshop on Logic, Language, Information and Computation (WoLLIC 2009), June 2009.

Independence and Functional Dependence Relations on Secrets.

R. Kelvey, S. Miner More, P. Naumov and B. Sapp. Twelfth International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010), May 2010.

Hypergraphs of Multiparty Secrets.

S. Miner More and P. Naumov. *Annals of Mathematics and Artificial Intelligence,* 62 (1-2), pp 79-101, June 2011. An initial version appeared in the 11th International Workshop on Computational Logic in Multi- Agent Systems (CLIMA XI), August 2010.

Information Flow on Directed Acyclic Graphs.

M. Donders, S. Miner More and P. Naumov. 18th Workshop on Logic, Language, Information and Computation (WoLLIC 2011), May 2011.

Functional Dependence on Hypergraphs of Multiparty Secrets.

S. Miner More and P. Naumov. 12th International Workshop on Computational Logic in Multi- Agent Systems (CLIMA XII), LCNS Volume 6814, pp 29-40, July 2011.

A Ternary Knowledge Relation on Secrets.

S. Miner More, P. Naumov, B. Nicholls and A. Yang. 13th Conference on Theoretical Aspects of Rationality and Knowledge XIII (TARK 2011), pp. 46-54, July 2011.

Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence.

S. Miner More, P. Naumov and B. Sapp. Proceedings of 20th Conference on Computer Science Logic (CSL 2011), pp. 443-457, August 2011.

Logic of Secrets in Collaboration Networks.

S. Miner More and P. Naumov. *Annals of Pure and Applied Logic, *162 (12), pp. 959–969, December 2011.

Calculus of Cooperation and Game-Based Reasoning about Protocol Privacy.

S. Miner More and P. Naumov. *ACM Transactions on Computational Logic (ToCL) *13(3), Article 22, August 2012.