Sara Miner More, Ph.D.
Associate Professor of
2 College Hill
Westminster, Maryland 21157
Courses Taught At McDaniel
CSC 1106: The Art of Programming (CS1)
CSC 1109: Discrete Mathematics
CSC 2222: Database Design
CSC 3314: Theory of Computation
CSC 3365: Special Topics: Compiler Construction
CSC 4406: Principles of Programming Languages
CSC 4413: Modern Cryptography
FYS 1128: Privacy and Security in a Networked Society (First Year Seminar)
FYS 1175: Virtual Worlds (First Year Seminar)
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.
On Interdependence of Secrets in Collaboration Networks.
S. Miner More and P. Naumov. Theoretical Aspects of Rationality and Knowledge XII (TARK 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).
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).
Hypergraphs of Multiparty Secrets.
S. Miner More and P. Naumov. Annals of Mathematics and Artificial Intelligence, to appear.
An initial version appeared in the 11th International Workshop on Computational Logic in Multi- Agent Systems (CLIMA XI), 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).
Logic of Secrets in Collaboration Networks.
S. Miner More and P. Naumov. To appear, Annals of Pure and Applied Logic.
Functional Dependence on Hypergraphs of Multiparty Secrets.
S. Miner More and P. Naumov. To appear at the 12th International Workshop on Computational Logic in Multi- Agent Systems (CLIMA XII), 2011.
A Ternary Knowledge Relation on Secrets.
S. Miner More, P. Naumov, B. Nicholls and A. Yang. To appear at Theoretical Aspects of Rationality and Knowledge XIII (TARK 2011).
Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence.
S. Miner More, P. Naumov and B. Sapp. To appear in 20th Conference on Computer Science Logic (CSL 2011).
Calculus of Cooperation and Game-Based Reasoning about Protocol Privacy.
S. Miner More and P. Naumov. To appear, ACM Transactions on Computational Logic (ToCL).