Joshua D. Guttman. Key compromise and the authentication tests. Electronic Notes in Theoretical Computer Science, 47, 2001. Editor, M. Mislove. URL http://www.elsevier.nl/ locate/entcs/volume47.html, 21 pages. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Searching for Shapes in Cryptographic Protocols - Doghmi, Guttman, Thayer Self-citation (Guttman) (Correct)
No context found.
Joshua D. Guttman. Key compromise and the authentication tests. Electronic Notes in Theoretical Computer Science, 47, 2001. Editor, M. Mislove. URL http://www.elsevier.nl/ locate/entcs/volume47.html, 21 pages.
Exercise on Implementing the Authentication Tests - Guttman (2003) Self-citation (Guttman) (Correct)
No context found.
Joshua D. Guttman. Key compromise and the authentication tests. Electronic Notes in Theoretical Computer Science, 47, 2001. Editor, M. Mislove. URL http: //www.elsevier.nl/locate/entcs/volume47.html, 21 pages.
Security Protocol Design via Authentication Tests - Guttman (2002) (2 citations) Self-citation (Guttman) (Correct)
....encryption to achieve authentication and freshness. ATSPECT offers functionality and security guarantees akin to the purchase request, payment authorization, and payment capture phases of SET, the secure electronic transaction standard created by the major credit card firms. In previous work [10, 12, 8], we have developed a method called the authentication test method that can be used by hand to verify cryptographic protocols. We also pointed out that the same ideas can be used to guide the protocol development process, quickly leading to new protocols; proofs of correctness for these ....
....the transforming edge occurs. We will design ATSPECT so that incoming tests are sufficient to achieve all the authentication properties. A second, alternative justification of the goal Authentication, I uses an outgoing test. An unsolicited test achieves the nonrepudiation goal. 2. 3 Recency In [8] we study recency as a means for ensuring that protocols cannot be undermined by key compromise. In the current paper, we use the same notion of recency for a different purpose, namely to ensure that a transaction is not caused by a dishonest party replaying a stale message. Regular strands ....
J. D. Guttman. Key compromise and the authentication tests. Electronic Notes in Theoretical Computer Science, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC