
	Where results make sense

Topic: BAN logic

Related Topics

Kerberos (protocol)

In the News (Tue 22 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	BAN logic (Site not responding. Last check: 2007-10-07)
		BAN logic is primarily concerned with the beliefs of principals (more precisely, abstract statements that principals are reasonably entitled to believe or ought to believe).
		BAN logic cannot really prove the security of a protocol; it can only catch certain kinds of subtle errors, help us to reason about the protocol, and help us identify and formalize our assumptions and analysis.
		The BAN logic work spurred a whole slew of papers on the subject: some pointed out limitations of the logic, while others extended it, automated it, or applied it.
	www-db.stanford.edu /~manku/quals/summaries/wagner-banlogic.htm (229 words)

	[No title]
		The GNY logic The Gong, Needham and Yahalom extensions to the BAN logic are often referred to as the GNY logic.
		A semantics for the BAN logic Abadi and Tuttle define a semantics for the BAN logic.
		The BAN logic is reformulated to define the semantics precisely.
	www.citi.umich.edu /techreports/trash/TXT/citi-tr-93-7.txt (14539 words)

	A Logic of Authentication by Burrows, Abadi and Needham
		When BAN logic divided time in two epochs, and was only interested in the present, [2] suggests otherwise: a formula generated some time ago in the past, might still be fresh.
		When in basic BAN logic protocol definition, idealisation and analysis were separate tasks, here it is presented a method that combines the definition and the analysis of a protocol: when the specification is complete the analysis is complete.
		The BAN logic [1] was the first suggestion to formalise the description and the analysis of authentication protocols in 1989.
	www.tml.hut.fi /Opinnot/Tik-110.501/1995/ban.html (3742 words)

	Security Protocols over Open Networks and Distributed Systems: Formal Methods for their Analysis, Design, and ...
		BAN logic of belief belongs to the class of KD45 modal logics which practically means that any fact is only a belief and does not need to be universal in time and space.
		According to Liebl it is difficult to prove properties of the BAN logic, such as completeness, and the logic does not take into consideration the release of message contents and the interaction of the runs at different time of the same protocol [54].
		For the application of BAN Logic [94], the approach is based on a parser that translates members of a limited class of protocol specifications into BAN Logic.
	www.dmst.aueb.gr /dds/pubs/jrnl/1997-CompComm-Formal/html/formal.htm (11061 words)

	Security risk profile for interconnected open distributed systems with varying sensitivity
		BAN Logic considers authentication as a function of message freshness and integrity and is using a formal model for the authentication protocol messages based a predefined set of axioms.
		BAN Logic has been successfully used to uncover a number of unknown flaws [5] [19] [47] as well as superfluous operations in widely used protocols [5] [48] [19] [49] [47].
		BAN Logic can not be extended to zero knowledge protocols [20], and can not detect parallel session multiple-role flaws nor stale reflected message flaws [37], although it can detect run external attack flaws [4].
	www.dmst.aueb.gr /dds/pubs/conf/1997-SafeComp-Formal/html/doc.html (4544 words)

	Engler expects drilling ban
		While continuing to insist that environmental risks are minuscule from onshore wells bored into bedrock beneath the lakes, Engler said in an interview that he expects the Legislature to pass a ban and for it to become law.
		Supporters of the ban argue that even minor risks should not be considered in exchange for what they say are probably small amounts of oil and gas beneath the lakes.
		Sikkema said that, in light of opposition to drilling from the gubernatorial candidates, a ban was vital to protect state taxpayers.
	www.freep.com /news/mich/engler29_20020129.htm (470 words)

	[No title]
		But the NRA scuttled the entire legislation when it told its supporters that it did not want the liability protection, which was the industry's main legislative goal for the year, to pass along with Feinstein's amendment.
		Furthering the politics is the president himself, who wants all the great taste of being publicly for an assault weapons ban but without the heavy substance that can weigh an elected official down during a campaign.
		Moreover, the renewal of the assault weapons ban is supported by every major national law enforcement organization in the country.
	www.bradycampaign.org /ler/docs/opeds/blocking_extension_defies_logic.doc (613 words)

	Reason (Site not responding. Last check: 2007-10-07)
		The ban's logic had far more to do with the guns' cosmetic features, which made them look like scary weapons from the movies, than with their actual functioning.
		So, perhaps that ban sent such a powerful and effective we're-not-messing-around message from the Congress that criminals of all sorts—a cowardly and superstitious lot—were intimidated permanently.
		So, a pointless ban, and a wedge in on banning certain weapons for completely arbitrary reasons, is marked for death—thanks to the wonders of sunsetting.
	www.reason.com /links/links071504.shtml (908 words)

	Introduction
		All these approaches are, just like BAN logic itself, restricted in their description of reality -- the world can only be described through the (belief) eyes of the participants.
		Therefore, we have not only looked for a precise semantics for BAN logic (and a proof of its soundness), but we have also chosen the semantics in such a way that it enables us to reason about knowledge (and, as a result, about the rightness of the participants' beliefs).
		We present the axioms of the logic in a general form: one can derive statements about the beliefs of principals, but also about the rightness of those beliefs (or of statements in general, independent of any beliefs).
	dimacs.rutgers.edu /Workshops/Security/program2/bleeker/node1.html (490 words)

	[No title]
		The earliest such logic is commonly referred to as the BAN logic and is due to Burrows, Abadi, and Needham.
		Use of the BAN logic requires that the user transform each message in the protocol into formulas about that message, so that the inferences can be made within the logic.
		Craigen and Saaltink attempt this by embedding the BAN logic in EVES.
	www.cs.cmu.edu /~marrero/abstract.html (2110 words)

	FirearmNews.com: Print this News Article! (Site not responding. Last check: 2007-10-07)
		The ban targeted a variety of semi-automatic weapons in the midst of a public debate designed to conflate them with actual automatic military assault rifles.
		However, crime in general was on a downward slump through the '90s, with total violent crimes (including rape, robbery, aggravated and simple assault, and homicide) beginning a precipitous drop after 1994 as well--to the lowest levels ever recorded by 2002.
		Or, just maybe, forces other than banning so-called assault weapons were at work in the drops in firearm deaths in the past decade.
	www.firearmnews.com /print/index.asp?id=5793 (269 words)

	Analyzing cryptographic protocols (Site not responding. Last check: 2007-10-07)
		The systems based on modal logic consists of various statements about belief in or knowledge about messages in a distributed system, with rules for deriving beliefs from other beliefs and knowledge from other knowledge and beliefs.
		The BAN logic is only used to reason about authentication, and is not able to prove secrecy.
		Also, the BAN logic does not attempt to model the distinction between seeing a message and understanding it; they are both treated the same way.
	www.pasta.cs.uit.no /thesis/html/ronnya/node30.html (693 words)

	CIS 6930 Cryptographic Protocols
		In fact, many authors [BAN, GNY et all] praise the merits of their analysis techniques with their ability to discover the flaw in the Needham and Schroeder protocol.
		The following is the Nessett protocol for authentication, which he used to claim that BAN logic has a flaw in it.
		SVO presented a logic for analyzing cryptographic protocols which encompasses a unification of four of its predecessors in the BAN family of logics, namely those given in [GNY90], [AT91], [vO93], and BAN itself [BAN89].
	www.cise.ufl.edu /~nemo/crypto/giri.htm (1679 words)

	NICTA FM Group - Semantical Investigations into BAN-like Logics - Thu Nov 25 2004 (Site not responding. Last check: 2007-10-07)
		BAN-logic is an epistemic logic for verification of security protocols proposed by Burrows, Abadi and Needham in the late 80'es.
		From a practical point of view, BAN logic has turned out to be quite successful: It produces short and informative derivations which can reveal quite subtle protocol errors.
		We use this idea to build a new semantics for BAN logic which we claim avoids the problems of the previous semantics, and we show how the idea can be used to build semantics for richer logics up to and including first-order BAN logic.
	www.cse.unsw.edu.au /~formalmethods/seminars/20041125_Dam.html (267 words)

	Re: Traits for BAN logic, TAOS auth, URI/IIIR stuff... (Site not responding. Last check: 2007-10-07)
		There is something essentially wrong (or at least tricky) in mixing a modal logic (such as the BAN logic) with Larch.
		In fact, some of the techniques that Mike Burrows and I suggested for SSL (and which made it into the RFC) are hard to model in the BAN logic and in related logics.
		(In the original BAN logic, there is a bit of an identification between beliefs and things recently said.) I hope this helps.
	www.research.compaq.com /SRC/larch/msg00200.html (326 words)

	Digital Systems Research Center: Report 39 (Site not responding. Last check: 2007-10-07)
		In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required initial assumptions of the participants and their final beliefs.
		This paper starts with an informal account of the problem, goes on to explain the formalism to be used, and gives examples of its application to protocols from the literature, both with conventional shared-key cryptography and with public-key cryptography.
		Some of the examples are chosen because of their practical importance, while others serve to illustrate subtle points of the logic and to explain how we use it.
	ftp.digital.com /pub/DEC/SRC/research-reports/abstracts/src-rr-039.html (235 words)

	CHACS Publications for 1994
		However, fuzzy logic is the wrong way to go since a single fuzzy metric of system security hides the information that was used to generate the metric and since there is an inherent danger of giving quantitative fuzzy metrics more credence than they really deserve.
		We use the results to point out the similarities and differences between the NRL Protocol Analyzer and BAN logic, and discuss the issues this raises with respect to the possible integration of the two.
		This logic encompasses a unification of four of its predecessors in the BAN family of logics including BAN itself.
	chacs.nrl.navy.mil /publications/CHACS/1994/index1994.html (2938 words)

	GNY Logic (Site not responding. Last check: 2007-10-07)
		GNY logic is based on BAN logic and is an extension of the framework of BAN.
		It has a much finer level of detail than BAN and can cover more types of protocols, however GNY was developed in response to the limitations and flaws in the BAN logic [13].
		GNY appears to be the most promising logic system to use for analysis of a protocol and offers the best opportunities for automation.
	www.cs.uct.ac.za /Research/DNA/SPEAR/report10/node14.html (187 words)

	On a Limitation of BAN Logic - Boyd, Mao (ResearchIndex)
		In the past few years a lot of attention has been paid to the use of special logics to analyse cryptographic protocols, foremost among these being the logic of Burrows, Abadi and Needham (the BAN logic).
		In this paper a limitation of the BAN logic is illustrated with two examples.
		These show that it is easy for the BAN logic to approve protocols that are in practice unsound.
	citeseer.ist.psu.edu /boyd93limitation.html (501 words)

	Fast, Automatic Checking of Security Protocols
		In encoding the BAN logic and its accompanying sample protocols, we had to make several adjustments and additions to the logic as originally presented [4], to account for rules and assumptions that were missing or implicit.
		AUTLOG is an extension of the BAN logic, proposed by Kessler and Wedel [8].
		As in theorem proving, we manipulate the syntactic representation, i.e., the logic, of the entity we are verifying; by restricting the nature of the logic, however, unlike machine-assisted theorem proving, we enumerate the entire theory rather than (with human assistance) develop lemmas and theorems as needed.
	www-2.cs.cmu.edu /afs/cs.cmu.edu/project/venari/www/usenix96-kindred-wing.html (5577 words)

	SvO Logic imp.: Applying rule to tautologies only.
		I have attached a pvs file used to analyze a protocol with BAN logic in PVS.
		In this specification, axioms are used to represent the logical postulates of BAN.
		P believes Y -> P believes (P believes Y)..." In the BAN logic adaption to PVS, the axioms used to implement the logical postulates could be attached to the conjecture for a cyptographic protocol with the lemma rule of PVS.
	pvs.csl.sri.com /mail-archive/pvs-help/msg00403.html (510 words)

	Re: Traits for BAN logic, TAOS auth, URI/IIIR stuff...
		In message <9501112028.AA29708@grant.pa.dec.com>, ma@pa.dec.com writes: > >[...] There is something essentially wrong (or at >least tricky) in mixing a modal logic (such as the BAN logic) with >Larch.
		Even so, I expect I'll learn quite a bit about all this before I get to the parts of S-HTTP that can't be modeled by BAN logic, or by Larch at all.
		(In the original BAN logic, there is >a bit of an identification between beliefs and things recently said.) OK.
	nms.lcs.mit.edu /Larch/archive/msg00201.html (626 words)

	Talk:Burrows-Abadi-Needham logic - Wikipedia, the free encyclopedia
		Until then, I think the use of English words is acceptable.
		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.
		...one weakness of BAN logic: the lack of a good semantics with a clear meaning in terms of knowledge and possible universes.
	en.wikipedia.org /wiki/Talk:Burrows-Abadi-Needham_logic (159 words)

	Examples
		Example 6: BAN Logic for Protocol Verification introduces concepts of key distribution and authentication protocols.
		The belief logic developed by Burroughs, Abadi, and Needham (BAN Logic) is introduced and applied to the Otway-Rees key distribution protocol.
		Example 6a: A Logic for Authentication and Access Control in Distributed Systems (Under Development) introduces the syntax and semantics of a logic for authentication and access control in distributed systems.
	www.ecs.syr.edu /faculty/chin/CSE774/syllabus/examples.html (487 words)

	BAN Logic (Site not responding. Last check: 2007-10-07)
		BAN logic was one of the first published security logics.
		It has been one of the most influential and is probably the best known security logic system [20].
		BAN was also intended to be a base for further research into security logics [6] and in this regard it has been successful.
	www.cs.uct.ac.za /Research/DNA/SPEAR/report10/node13.html (110 words)

	Xunzi (Hsün Tzu) [Internet Encyclopedia of Philosophy]
		Other philosophers, particularly the Mohist school, were developing sophisticated views on logic and the principles of argumentation around Xunzi’s time, and other thinkers were known for their paradoxes that played with language to show its limits.
		Though Xunzi was undoubtedly influenced by the principles of argument developed by the Mohists, he had no patience for the dialectical games and disputation for its own sake that were popular at the time.
		Again, however, his primary concern was preserving the Way in the face of attacks, which in Xunzi's view included questions about the nature of language that were arising at the time.
	www.iep.utm.edu /x/xunzi.htm (5952 words)

	[No title]
		Also, he pointed out that the abstraction of "freshness" used in BAN logic was not completely successful, because it combines two distinct notions: functional dependence (or correspondence), and recency.
		One of the features of this logic, compared to some other knowledge-based security logics such as BAN logic, is that it has a precise semantics with respect to a well-defined model of computation with an operational semantics for protocols.
		Grit Denker (SRI) described the use of rewriting logic to specify security protocols and the use of Maude, an interpreter for rewriting logic, as an analysis tool; this is joint work with J. Meseguer (SRI) and C. Talcott (Stanford).
	www.ieee-security.org /Cipher/ConfReports/conf-rep-LICS.html (1106 words)

Try your search on: Qwika (all wikis)