See this document in CiteSeerX!

FCS'03 Preliminary Version  (Make Corrections)  
Encryption as an abstract data-type: An extended abstract Dale Miller...



  Home/Search   Context   Related

 
View or download:
psu.edu/~dale/papers/fcs03.ps
Cached:  PS.gz  PS   PDF  Image  Update  Help

From:  psu.edu/~dale/pape...recentpapers (more)
(Enter author homepages)

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

Abstract: At the Dolev-Yao level of abstraction, security protocols can be speci ed using multisets rewriting. Such rewriting can be modeled naturally using proof search in linear logic. The linear logic setting also provides a simple mechanism for generating nonces and session and encryption keys via eigenvariables. We illustrate several additional aspects of this direct encoding of protocols into logic. In particular, encrypted data can be seen naturally as an abstract data-type. Entailments between... (Update)

Similar documents (at the sentence level):
36.0%:   Encryption as an abstract data-type: An extended abstract - Miller (2003)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Relating Process Algebras and Multiset Rewriting.. - Bistarelli.. (2002)   (Correct)
0.2:   Specifying and Debugging Security Protocols in the hhf Fragment.. - Delzanno (2000)   (Correct)
0.2:   Higher-Order Quantification and Proof Search - Miller (2002)   (Correct)

Similar documents based on text:   More   All
0.2:   A Proof Theory for Generic Judgments: An Extended - Miller, Tiu (2003)   (Correct)
0.1:   A Proof Search Specification of the π-Calculus - Tiu, Miller   (Correct)
0.1:   Encoding Generic Judgments - Miller, Tiu (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ an-fcs,
  author = "Encryption As An",
  title = "FCS'03 Preliminary Version",
  url = "citeseer.ist.psu.edu/661972.html" }
Citations (may not include all citations):
854   Information and Computation (context) - Milner, Parrow et al. - 1992
419   A formulation of the simple theory of types (context) - Church - 1940
317   IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
257   Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1994
185   The Calculi of Lambda-Conversion (context) - Church - 1941
146   Investigations into logical deductions (context) - Gentzen - 1969
104   A metanotation for protocol analysis - Cervesato, Durgin et al. - 1999
69   calculus as a theory in linear logic: Preliminary results (context) - Miller - 1992
62   Breaking and xing the Needham-Schroeder public-key protocol .. - Lowe - 1996
57   Logic programming with focusing proofs in linear logic (context) - Andreoli - 1992
50   Higher-order Horn clauses - Nadathur, Miller - 1990
42   Relating strands and multiset rewriting for security protoco.. - Cervesato, Durgin et al. - 2000
39   Horn programming in linear logic is NP-complete (context) - Kanovich - 1992
35   Normal process representatives (context) - Gehlot, Gunter - 1990
30   A calculus for cryptographic protocols: The spi calculus (context) - Abadi, Gordon
25   Three uses of the Herbrand-Gentzen theorem in relating model.. (context) - Craig - 1957
25   Protocol speci cation and analysis in Maude (context) - Denker, Meseguer et al. - 1998
21   Logical relations for encryption - Sumii, Pierce - 2001
20   Interpreting strands in linear logic - Cervesato, Durgin et al. - 2000
19   Reasoning with higher-order abstract syntax in a logical fra.. (context) - McDowell, Miller - 2002
19   The complexity of Horn fragments of linear logic (context) - Kanovich - 1994
18   Mathematical Structures in Computer Science (context) - Girard - 2000
17   A proof theory for generic judgments: An extended abstract (context) - Miller, Tiu - 2003
16   Encoding transition systems in sequent calculus - McDowell, Miller et al. - 2003
13   Operating Systems Review (context) - Burrows, Abadi et al. - 1989
8   The logic of authentication protocols - Syverson, Cervesato - 2001
7   Strand spaces: Proving security protocols correct (context) - Fabrega, Herzog et al. - 1999
6   Lexical scoping as universal quanti cation (context) - Miller - 1989
5   Higher-order quanti cation and proof search (context) - Miller - 2002
1   Forum: A multiple-conclusion speci cation language (context) - Miller - 1996

Documents on the same site (http://www.cse.psu.edu/~dale/papers/recentpapers.html):   More
The pi-Calculus as a Theory in Linear Logic: Preliminary Results - Miller (1992)   (Correct)
Higher-Order Quantification and Proof Search - Miller (2002)   (Correct)
Encoding Generic Judgments - Miller, Tiu (2002)   (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