See this document in CiteSeerX!

Fast Automatic Synthesis of Security Protocols Using  (Make Corrections)  
Backward Search Hongbin Zhou University College, Cork Simon N. ...



  Home/Search   Context   Related

 
View or download:
bcri.ucc.ie/BCRI_22.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  bcri.ucc.ie/nonPeerReviewed (more)
(Enter author homepages)

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

Abstract: An automatic security protocol generator is proposed that uses logic-based synthesis rules to guide it in a backward search for suitable protocols from protocol goals. The approach taken is unlike existing automatic protocol generators which typically carry out a forward search for candidate protocols from the protocol assumptions. A prototype generator has been built that performs well in the automatic generation of authentication and key exchange protocols. (Update)

Active bibliography (related documents):   More   All
0.5:   Security Protocol Design via Authentication Tests - Guttman (2002)   (Correct)
0.4:   Compositional Analysis of Authentication Protocols - Bugliesi, Focardi, Maffei   (Correct)
0.3:   Modelling and Security Analysis of Authenticated Group Key.. - Pereira (2003)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ hongbin-fast,
  author = "Backward Search Hongbin",
  title = "Fast Automatic Synthesis of Security Protocols Using",
  url = "citeseer.ist.psu.edu/748959.html" }
Citations (may not include all citations):
404   A calculus for cryptographic protocols: The spi calculus - Abadi, Gordon - 1997
317   IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
263   The inductive approach to verifying cryptographic protocols - Paulson - 1998
171   Prudent engineering practice for cryptographic protocols - Abadi, Needham - 1994
164   ACM Transactions on Computer Systems (context) - Burrows, Abadi et al. - 1990
140   Reasoning about belief in cryptographic protocols - Gong, Needham et al. - 1990
90   Strand spaces: why is a security protocol correct (context) - Thayer, Herzog et al. - 1998
67   A hierarchy of authentication specifications - Lowe - 1997
41   A taxonomy of replay attacks - Syverson - 1994
21   Relations between secrets: Two formal analyses of the yahalo.. - Paulson - 1998
13   Optimal privacy and authentication on a portable communicati.. (context) - Carlsen - 1994
8   Authentication tests - Guttman, Thayer - 2000
7   Theory generation for security protocols - Kindred, Wing - 1999
6   Looking for diamonds in the desert: extending automatic prot.. - Perrig, Song - 2000
6   Strategies against replay attacks - Aura - 1997
5   A simple logic for authentication protocol design - Buttyan, Staamann et al. - 1998
3   Security protocol design via authentication tests - Guttman - 2002
3   Using intensional specifications of security protocols (context) - Roscoe - 1996
1   Requirement Specification Note that we express the public ch.. (context) - Woo, Lam et al. - 1994
1   Theory generation for the simple logic (context) - O'Crualaoich, Foley - 2002
1   cient automated checker for security protocol analysis (context) - Song, new - 1999
1   A weakest precondition calculus for analysis of cryptographi.. (context) - Alves-Foss, Soule - 1997

Documents on the same site (http://www.bcri.ucc.ie/nonPeerReviewed.html):   More
General Error Locator Polynomials for Binary Cyclic Codes.. - Mora, Orsini, al. (2005)   (Correct)
A Groebner Bases Technique To Compute Distance And Weight.. - Sala (2003)   (Correct)
On the Gröbner basis of a family of quasi-cyclic LDPC codes - Giorgetti, Rossi, Sala (2005)   (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