default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan K. Millen
Person information
- affiliation: MITRE Corporation, Bedford, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j16]George Coker, Joshua D. Guttman, Peter A. Loscocco, Amy L. Herzog, Jonathan K. Millen, Brian O'Hanlon, John D. Ramsdell, Ariel Segall, Justin Sheehy, Brian T. Sniffen:
Principles of remote attestation. Int. J. Inf. Sec. 10(2): 63-81 (2011)- 2010
- [j15]Sushil Jajodia
, Jonathan K. Millen:
Editorial. J. Comput. Secur. 18(2): 187 (2010) - 2005
- [j14]Jonathan K. Millen, Vitaly Shmatikov:
Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation. J. Comput. Secur. 13(3): 515-564 (2005) - [j13]Jonathan K. Millen, Vitaly Shmatikov:
Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation. J. Comput. Secur. 13(4): 695- (2005) - 2003
- [j12]Jonathan K. Millen:
On the freedom of decryption. Inf. Process. Lett. 86(6): 329-333 (2003) - 2001
- [j11]Rebecca N. Wright, Patrick Lincoln, Jonathan K. Millen:
Depender Graphs: A Method of Fault-Tolerant Certificate Distribution. J. Comput. Secur. 9(4): 323-338 (2001) - 1995
- [j10]Jonathan K. Millen:
Unwinding Forward Correctability. J. Comput. Secur. 3(1): 35-54 (1995) - 1994
- [j9]Richard A. Kemmerer, Catherine Meadows, Jonathan K. Millen:
Three System for Cryptographic Protocol Analysis. J. Cryptol. 7(2): 79-130 (1994) - 1993
- [j8]Jonathan K. Millen:
A Resource Allocation Model for Denial of Service Protection. J. Comput. Secur. 2(2-3): 89-106 (1993) - 1989
- [j7]Jonathan K. Millen:
Models of Multilevel Computer Security. Adv. Comput. 29: 1-45 (1989) - 1987
- [j6]Jonathan K. Millen, Sidney C. Clark, Sheryl B. Freedman:
The Interrogator: Protocol Security Analysis. IEEE Trans. Software Eng. 13(2): 274-288 (1987) - 1981
- [j5]Maureen Harris Cheheyl, Morrie Gasser, George A. Huff, Jonathan K. Millen:
Verifying Security. ACM Comput. Surv. 13(3): 279-339 (1981) - [j4]Jonathan K. Millen, David L. Drake:
An experiment with affirm and HDM. J. Syst. Softw. 2(2): 159-175 (1981) - [j3]Jonathan K. Millen:
Recent verification work at MITRE. ACM SIGSOFT Softw. Eng. Notes 6(3): 55 (1981) - 1980
- [j2]Morrie Gasser, Jonathan K. Millen, William F. Wilson:
A note on information flow into arrays. ACM SIGSOFT Softw. Eng. Notes 5(1): 28-29 (1980) - 1976
- [j1]Jonathan K. Millen:
Security Kernel Validation in Practice. Commun. ACM 19(5): 243-250 (1976)
Conference and Workshop Papers
- 2021
- [c34]Sreekanth Malladi, Jonathan K. Millen:
Adapting Constraint Solving to Automatically Analyze UPI Protocols. Protocols, Strands, and Logic 2021: 276-292 - 2019
- [c33]Jonathan K. Millen:
A Long, Slow Conversation. Foundations of Security, Protocols, and Equational Reasoning 2019: 6-7 - 2008
- [c32]Jonathan K. Millen:
Rewriting Techniques in the Constraint Solver. SecReT@LICS/CSF 2008: 77-91 - 2003
- [c31]Jonathan K. Millen, Vitaly Shmatikov:
Symbolic Protocol Analysis with Products and Diffie-Hellman Exponentiation. CSFW 2003: 47-61 - [c30]Jonathan K. Millen, Grit Denker:
MuCAPSL. DISCEX (1) 2003: 238- - 2002
- [c29]Grit Denker, Jonathan K. Millen, Yutaka Miyake:
Cross-Domain Access Control via PKI. POLICY 2002: 202-205 - [c28]Grit Denker, Jonathan K. Millen:
Modeling Group Communication Protocols Using Multiset Term Rewriting. WRLA 2002: 20-39 - 2001
- [c27]Jonathan K. Millen, Vitaly Shmatikov:
Constraint solving for bounded-process cryptographic protocol analysis. CCS 2001: 166-175 - [c26]Véronique Cortier, Jonathan K. Millen, Harald Rueß:
Proving Secrecy is Easy Enough. CSFW 2001: 97-108 - [c25]Peter Y. A. Ryan, John D. McLean, Jonathan K. Millen, Virgil D. Gligor:
Non-Interference: Who Needs It? CSFW 2001: 237-238 - 2000
- [c24]Rebecca N. Wright, Patrick Lincoln, Jonathan K. Millen:
Efficient fault-tolerant certificate revocation. CCS 2000: 19-24 - [c23]Jonathan K. Millen, Rebecca N. Wright:
Reasoning about Trust and Insurance in a Public Key Infrastructure. CSFW 2000: 16-22 - [c22]Grit Denker, Jonathan K. Millen, Antonio Grau, Juliana Küster Filipe:
Optimizing Protocol Rewrite Rules of CIL Specifications. CSFW 2000: 52-62 - [c21]Jonathan K. Millen, Harald Rueß:
Protocol-Independent Secrecy. S&P 2000: 110-119 - [c20]Jonathan K. Millen:
Applications of Term Rewriting to Cryptographic Protocol Analysis overview of the invited talk. WRLA 2000: 229-234 - 1999
- [c19]Jonathan K. Millen:
Local Reconfiguration Policies. S&P 1999: 48-56 - [c18]Jonathan K. Millen:
20 Years of Covert Channel Modeling and Analysis. S&P 1999: 113-114 - 1996
- [c17]Jonathan K. Millen, Hai-Ping Ko:
Narrowing terminates for encryption. CSFW 1996: 39- - [c16]Jonathan K. Millen:
CAPSL: Common Authentication Protocol Specification Language. NSPW 1996: 132 - 1995
- [c15]Jonathan K. Millen:
The Interrogator model. S&P 1995: 251-260 - 1994
- [c14]Jonathan K. Millen:
Unwinding Forward Correctability. CSFW 1994: 2-10 - 1992
- [c13]Jonathan K. Millen:
A resource allocation model for denial of service. S&P 1992: 137-147 - [c12]Jonathan K. Millen, Teresa F. Lunt:
Security for object-oriented database systems. S&P 1992: 260-272 - 1990
- [c11]Jonathan K. Millen:
Hookup Security for Synchronous Machines. CSFW 1990: 84-90 - 1989
- [c10]Jonathan K. Millen:
Finite-State Noiseless Covert Channels. CSFW 1989: 81-86 - 1987
- [c9]Jonathan K. Millen:
Covert Channel Capacity. S&P 1987: 60-66 - 1984
- [c8]Jonathan K. Millen:
The Interrogator: A Tool for Cryptographic Protocol Security. S&P 1984: 134-141 - 1983
- [c7]Bahaa W. Fam, Jonathan K. Millen:
The Channel Assignment Problem. S&P 1983: 107-112 - 1982
- [c6]Jonathan K. Millen:
Kernel Isolation for the PDP-11/70. S&P 1982: 57-65 - 1981
- [c5]Jonathan K. Millen:
Information Flow Analysis of Formal Specifications. S&P 1981: 3-8 - 1978
- [c4]Jonathan K. Millen:
Example of a formal flow violation. COMPSAC 1978: 204-208 - 1974
- [c3]Jonathan K. Millen:
Construction with Parallel Derivatives of the Closure of a Parallel Program Schema. STOC 1974: 242-247 - 1972
- [c2]R. H. Bullen Jr., Jonathan K. Millen:
Microtext: the design of a microprogrammed finite state search machine for full-text retrieval. AFIPS Fall Joint Computing Conference (1) 1972: 479-488 - 1967
- [c1]Jonathan K. Millen:
CHARYBDIS: a LISP program to display mathematical expressions on typewriter-like devices. Symposium on Interactive Systems for Experimental Applied Mathematics 1967: 155-163
Parts in Books or Collections
- 2011
- [p1]Hubert Comon-Lundh, Stéphanie Delaune, Jonathan K. Millen:
Constraint solving techniques and enriching the model with equational theories. Formal Models and Techniques for Analyzing Security Protocols 2011: 35-61
Reference Works
- 2011
- [r2]Jonathan K. Millen:
Biba Model. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 81-82 - [r1]Jonathan K. Millen:
Formal Methods for the Orange Book. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 495-498
Informal and Other Publications
- 2012
- [i1]John D. Ramsdell, Joshua D. Guttman, Jonathan K. Millen, Brian O'Hanlon:
An Analysis of the CAVES Attestation Protocol using CPSA. CoRR abs/1207.0418 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
