See this document in CiteSeerX!

Analysis of Cryptographic Protocols using Logics of Belief: an Overview (2001)  (Make Corrections)  (1 citation)
David Monniaux



  Home/Search   Context   Related

 
View or download:
di.ens.fr/~monniau...onniaux_JTIT02.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  di.ens.fr/~monni...David_Monniaux (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: When designing a cryptographic protocol or explaining it, one often uses arguments such as "since this message was signed by machine B, machine A can be sure it came from B" in informal proofs justifying how the protocol works. Since it is, in such informal proofs, often easy to overlook an essential assumption, such as a trust relation or the belief that a message is not a replay from a previous session, it seems desirable to write such proofs in a formal system. While such logics do not... (Update)

Context of citations to this paper:   More

.... research as bases for defeasible reasoning [Shv90] logics of agents [RG93] and logics of authentication [BAN90, Mat97] Monniaux [Mon01] shows that BAN and GNY logics are decidable, while Massacci [Mas97] gives a tableaux calculus for the (undecidable) logic of access...

Cited by:   More
CardS4: Modal Theorem Proving on Java Smartcards - Goré, Nguyèn   (Correct)

Similar documents (at the sentence level):
7.9%:   Decision Procedures for the Analysis of Cryptographic Protocols.. - Monniaux (1999)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Abstracting Cryptographic Protocols with Tree Automata - Monniaux (1999)   (Correct)
0.3:   Principles for Entity Authentication - Bugliesi, Focardi, Maffei, Tudone (2003)   (Correct)
0.2:   Verifying Secrecy by Abstract Interpretation - Bozga, Lakhnech, Périn (2002)   (Correct)

Similar documents based on text:   More   All
0.2:   Formal Methods for the Analysis of Authentication Protocols - Rubin, Honeyman (1993)   (Correct)
0.1:   On the Automation of GNY Logic - Mathuria, Safavi-Naini, al. (1995)   (Correct)
0.1:   Handling Infeasible Specifications of Cryptographic Protocols - Gong (1991)   (Correct)

Related documents from co-citation:   More   All
2:   The computational complexity of provability in systems of modal propositional lo.. (context) - Ladner - 1977

BibTeX entry:   (Update)

D. Monniaux. Analysis of Cryptographic Protocols using Logics of Belief: an Overview. In this volume, 2001. http://citeseer.ist.psu.edu/monniaux01analysis.html   More

@misc{ monniaux01analysis,
  author = "D. Monniaux",
  title = "Analysis of Cryptographic Protocols using Logics of Belief: an Overview",
  text = "D. Monniaux. Analysis of Cryptographic Protocols using Logics of Belief:
    an Overview. In this volume, 2001.",
  year = "2001",
  url = "citeseer.ist.psu.edu/monniaux01analysis.html" }
Citations (may not include all citations):
1529   A method for obtaining digital signatures and public key cry.. - Shamir - 1982
1065   Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1996
704   Applied Cryptography (context) - Schneier - 1996
317   IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
167   Natural deduction: a proof-theoretical study (context) - Prawitz - 1965
143   Proving properties of security protocols by induction - Paulson - 1997
140   Reasoning about belief in cryptographic protocols - Gong, Needham et al. - 1990
134   The NRL Protocol Analyzer: An Overview - Meadows - 1995
83   ACM Transactions on Computer Systems (context) - Burrows, Abadi et al. - 1990
81   Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978
78   On unifying some cryptographic protocol logics - Syverson, van Oorschot - 1994
71   Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
61   Kerberos authentication and authorization system - Miller, Neuman et al. - 1987
50   An unsolvable problem of elementary number theory (context) - Church - 1936
50   the reachability problem in cryptographic protocols - Amadio, Lugiez - 2000
50   the reachability problem in cryptographic protocols - Amadio, Lugiez - 2000
48   Reasoning about cryptographic protocols in the spi calculus - Abadi, Gordon - 1997
42   Knowledge and Belief: An Introduction to the Logic of Two No.. (context) - Hintikka - 1962
37   Adding time to a logic of authentication - Syverson - 1993
35   Protocol insecurity with finite number of sessions is NP-com.. - Rusinowitch, Turuani - 2001
32   What is elementary geometry (context) - Tarski - 1959
32   A logic of communication in hostile environment (context) - Bieber - 1990
31   Athena: A new efficient automatic checker for security proto.. - Song - 1999
30   A calculus for cryptographic protocols: The spi calculus (context) - Abadi, Gordon - 1998
28   automatic checking of security protocols (context) - Kindred, Wing - 1996
20   Cryptographic Protocols for Distributed Systems (context) - Gong - 1990
15   ACM Operating Systems Review (context) - Nessett, of et al. - 1990
15   A semantics for a logic of authentication (context) - Abadi, Tuttle - 1991
12   Abstract interpretation: a kind of magic (context) - Nilsson - 1995
10   Lazy infinite-state analysis of security protocols - Basin - 1999
8   The logic of authentication protocols - Syverson, Cervesato - 2001
8   Automatic verification of cryptographic protocols with SETHE.. (context) - Schumann - 1997
7   Digital Equipment Corporation (context) - Burrows, Abadi et al. - 1989
6   Decision procedures for the analysis of cryptographic protoc.. - Monniaux - 1999
5   Towards a strand semantics for authentication logics - Syverson - 1999
2   Translated and with appendices by Paul Taylor (context) - Girard, Types et al. - 1990

Documents on the same site (http://www.di.ens.fr/~monniaux/biblio/David_Monniaux.html):   More
An Abstract Monte-Carlo Method for the Analysis of Probabilistic .. - Monniaux (2001)   (Correct)
Decision Procedures for the Analysis of Cryptographic Protocols.. - Monniaux (1999)   (Correct)
Abstracting Cryptographic Protocols with Tree Automata - Monniaux (1999)   (Correct)

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