• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Timed Models for Protocol Security (1992)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.cs.berkeley.edu]
  • [www.cs.cmu.edu]
  • [reports.adm.cs.cmu.edu]
  • [www.cs.berkeley.edu]
  • [www.eecs.berkeley.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Nevin Heintze , J. D. Tygar
Citations:2 - 1 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Heintze92timedmodels,
    author = {Nevin Heintze and J. D. Tygar},
    title = {Timed Models for Protocol Security},
    institution = {},
    year = {1992}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

The notion of time is prerequisite for describing and verifying the security properties of key management protocols. Without it, properties relating to the expiration of keys and the freshness of messages and nonces cannot be formulated. Recently Burrows, Abadi and Needham proposed a formal system for protocol verification which includes an ability to reason about time. In essence their "Logic of Authentication " is a proof theory for reasoning about key management protocols. One difficulty with such a logic lies in justifying the inferences that can be made. We approach this problem by developing an accompanying model theory for protocol security. Model theoretic techniques have been used before in the protocol verification literature, but our approach is different in two respects. First we consider a model theory which includes a notion of time. Second, the purpose of much of the previous model theoretic work was aimed at developing protocol verification tools and so assumptions abou...

Citations

2115 Clocks and the Ordering of Events in a Distributed System - Lamport - 1978
1040 R.: A logic for authentication - Burrows, Abadi, et al. - 1989
872 A.C.-C.: On the security of public key protocols - Dolev, Yao - 1983
407 Differential Cryptanalysis of DES-like Cryptosystems - Biham, Shamir - 1990
289 Zero Knowledge Proofs of Identity - Feige, Fiat, et al. - 1987
112 E cient and Timely Mutual Authentication - Otway, Rees - 1987
109 Limitations of the Kerberos authentication system - Bellovin, Merritt - 1991
105 Model Checking vs. Theorem Proving: A Manifesto", Systems - Halpern, Vardi - 1991
80 Applying Formal Methods to the Analysis of a Key Management Protocol - Meadows - 1990
76 Differential Cryptanalysis of the Full 16-Round DES - Biham, Shamir - 1993
47 The Power of Temporal Proofs - Abadi - 1987
34 A Decision Procedure for a Class of Herbrand Set Constraints - Heintze, ar - 1990
33 Using Encryption for Authentication in Large Networks - Needham, Schroeder - 1978
29 A Formal Model of Knowledge, Action and Communication in Distributed Systems - Halpern, Fagin - 1985
13 Inferring a Sequence Generated by a Linear Congruence", Proceeding 23 rd - Plumstead - 1982
10 Strongbox: A System for Self-Securing Programs - Tygar, Yee - 1991
5 A Key Management Scheme for End-to-End Encryption and a Formal Veri cation of Its Security - Kasami, Yamamura, et al. - 1982
3 Basic Tense Logic", Handbook of Philosophical Logic, Volume II - Burgess - 1986
2 Logic and Computation", Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency - Benthem, \Time - 1988
1 Differential Cryptanalysis of the Ful l 16-round - Biham, Shamir - 1991
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University