Talk:Burrows–Abadi–Needham logic

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Cryptography / Computer science  (Rated C-class, High-importance)
WikiProject icon This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
C-Class article C  This article has been rated as C-Class on the quality scale.
 High  This article has been rated as High-importance on the importance scale.
Taskforce icon
This article is supported by WikiProject Computer science (marked as High-importance).


I've replaced one line with TeX. More of the same is needed in this article. Michael Hardy 01:25 Mar 29, 2003 (UTC)

I agree, and the reason I didn't go ahead with it in the first place is that I knew I was going to need to experiment with TeX itself to figure out the right ways to manufacture the various glyphs. Until then, I think the use of English words is acceptable. Dominus 00:02 Apr 5, 2003 (UTC)

Sorry about the link to one of my own peer-reviewed papers, but it is I think the simplest one justifying that BAN is decidable. David.Monniaux 17:06, 30 Jul 2004 (UTC)

Seems good to me (!); I've moved it into a references section. — Matt 09:35, 4 Aug 2004 (UTC)

Eh?[edit] weakness of BAN logic: the lack of a good semantics with a clear meaning in terms of knowledge and possible universes.

Erk...can someone reword this with a slightly clearer meaning?— Matt 09:39, 4 Aug 2004 (UTC)

Yes, I'm on it.


I've rewritten the intro. I look forward to feedback. --Davidstrauss 19:13, 29 July 2006 (UTC)

External links[edit]

Source: The Burrows-Abadi-Needham logic The link is dead as of (see sig/timestamp)--Bah23 13:01, 19 January 2007 (UTC)

Citeseer moved from NEC to PSU. I fixed the link. --Dominus 19:57, 19 January 2007 (UTC)