( en | de | ru )

 

Disambiguation of "Millen, Jonathan K."

Author of the publication

copydeleteadd this publication to your clipboard
Proving Secrecy is Easy Enough.

, , and . CSFW, page 97-108. IEEE Computer Society, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sabine Millen

Roland Millen

Jonathan Roth

Jonathan Cavanagh

Jonathan Burmeister

 

Other publications of authors with the same name

CAPSL: Common Authentication Protocol Specification Language.. NSPW, page 132. ACM, (1996)Construction with Parallel Derivatives of the Closure of a Parallel Program Schema. STOC, page 242-247. ACM, (1974)Finite-State Noiseless Covert Channels.. CSFW, page 81-86. IEEE Computer Society, (1989)Unwinding Forward Correctability.. CSFW, page 2-10. IEEE Computer Society, (1994)Constraint solving for bounded-process cryptographic protocol analysis., and . ACM Conference on Computer and Communications Security, page 166-175. ACM, (2001)The Interrogator model.. S&P, page 251-260. IEEE Computer Society, (1995)MuCAPSL., and . DISCEX (1), page 238-. IEEE Computer Society, (2003)CHARYBDIS: a LISP program to display mathematical expressions on typewriter-like devices.. Symposium on Interactive Systems for Experimental Applied Mathematics, page 155-163. ACM, (1967)Unwinding Forward Correctability.. J. Comput. Secur., 3 (1): 35-54 (1995)A Long, Slow Conversation.. Foundations of Security, Protocols, and Equational Reasoning, volume 11565 of Lecture Notes in Computer Science, page 6-7. Springer, (2019)