Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Burrows–Abadi–Needham logic
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
'''Burrows–Abadi–Needham logic''' (also known as the '''BAN logic''') is a set of rules for defining and analyzing information exchange protocols. Specifically, BAN logic helps its users determine whether exchanged information is trustworthy, secured against eavesdropping, or both. BAN logic starts with the assumption that all information exchanges happen on media vulnerable to tampering and public monitoring. This has evolved into the popular security mantra, "Don't trust the network." A typical BAN logic sequence includes three steps:<ref>{{cite web | url = http://www.cl.cam.ac.uk/~rja14/Papers/SEv2-c03.pdf | publisher = UT Austin CS | title = Course material on BAN logic }}</ref> # Verification of message origin # Verification of message [[Freshness (cryptography)|freshness]] # Verification of the origin's trustworthiness. BAN logic uses [[postulate]]s and [[definition]]s – like all [[axiomatic system]]s – to analyze [[authentication]] [[Protocol (computing)|protocols]]. Use of the BAN logic often accompanies a [[security protocol notation]] formulation of a protocol and is sometimes given in papers.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)