<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=167.236.248.70</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=167.236.248.70"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/167.236.248.70"/>
	<updated>2026-08-03T20:46:46Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Primary_line_constants&amp;diff=24576</id>
		<title>Primary line constants</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Primary_line_constants&amp;diff=24576"/>
		<updated>2013-10-15T14:38:03Z</updated>

		<summary type="html">&lt;p&gt;167.236.248.70: /* Velocity */  typo &amp;#039;geven&amp;#039; - &amp;#039;given&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{no footnotes|date=June 2013}}&lt;br /&gt;
&#039;&#039;&#039;Yahalom&#039;&#039;&#039; is an authentication and secure key-sharing protocol designed for use on an insecure network such as the Internet. Yahalom uses a trusted arbitrator to distribute a shared key between two people. This protocol can be considered as an improved version of [[Wide Mouth Frog protocol]] (with additional protection against [[man-in-the-middle attack]]), but less secure than [[Needham-Schroeder]].&lt;br /&gt;
&lt;br /&gt;
== Protocol description ==&lt;br /&gt;
If [[Alice and Bob|Alice]] (A) initiates the communication to Bob (B) with S is a server trusted by both parties, the protocol can be specified as follows using [[security protocol notation]]:&lt;br /&gt;
* A and B are identities of Alice and Bob respectively&lt;br /&gt;
* &amp;lt;math&amp;gt;K_{AS}&amp;lt;/math&amp;gt; is a [[symmetric key]] known only to A and S&lt;br /&gt;
* &amp;lt;math&amp;gt;K_{BS}&amp;lt;/math&amp;gt; is a symmetric key known only to B and S&lt;br /&gt;
* &amp;lt;math&amp;gt;N_A&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;N_B&amp;lt;/math&amp;gt; are [[cryptographic nonce|nonces]] generated by A and B respectively&lt;br /&gt;
* &amp;lt;math&amp;gt;K_{AB}&amp;lt;/math&amp;gt; is a symmetric, generated key, which will be the [[session key]] of the session between A and B&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;A \rightarrow B: A, N_A&amp;lt;/math&amp;gt;&lt;br /&gt;
:Alice sends a message to Bob requesting communication.&lt;br /&gt;
&amp;lt;math&amp;gt;B \rightarrow S: B,\{A, N_A, N_B\}_{K_{BS}}&amp;lt;/math&amp;gt;&lt;br /&gt;
:Bob sends a message to the Server encrypted under &amp;lt;math&amp;gt;K_{BS}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&amp;lt;math&amp;gt;S \rightarrow A: \{B, K_{AB}, N_A, N_B\}_{K_{AS}}, \{A, K_{AB}\}_{K_{BS}}&amp;lt;/math&amp;gt;&lt;br /&gt;
:The Server sends to Alice a message containing the generated session key &amp;lt;math&amp;gt;K_{AB}&amp;lt;/math&amp;gt; and a message to be forwarded to Bob.&lt;br /&gt;
&amp;lt;math&amp;gt;A \rightarrow B: \{A, K_{AB}\}_{K_{BS}}, \{N_B\}_{K_{AB}}&amp;lt;/math&amp;gt;&lt;br /&gt;
:Alice forwards the message to Bob and verifies &amp;lt;math&amp;gt;N_A&amp;lt;/math&amp;gt; has not changed. Bob will verify &amp;lt;math&amp;gt;N_B&amp;lt;/math&amp;gt; has not changed when he receives the message.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- The novelty of this protocol is that Bob is the first participant to contact the trusted arbitrator. — this sentence is copyvio from Bruce Schneier // vlsergey --&amp;gt;&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Kerberos (protocol)|Kerberos]]&lt;br /&gt;
* [[Otway-Rees]]&lt;br /&gt;
* [[Neuman-Stubblebine protocol|Neuman-Stubblebine]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
* {{cite book&lt;br /&gt;
  |last = Schneier&lt;br /&gt;
  |first = Bruce&lt;br /&gt;
  |authorlink = Bruce Schneier&lt;br /&gt;
  |title = Applied Cryptography&lt;br /&gt;
  |publisher = [[John Wiley &amp;amp; Sons]]&lt;br /&gt;
  |year = 1996&lt;br /&gt;
  |pages = 57–58&lt;br /&gt;
  |isbn = 0-471-12845-7}}&lt;br /&gt;
* M. Burrows, M. Abadi, R. Needham [http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-RR-39.pdf A Logic of Authentication], Research Report 39, Digital Equipment Corp. Systems Research Center, Feb. 1989&lt;br /&gt;
* M. Burrows, M. Abadi, R. Needham [http://portal.acm.org/citation.cfm?id=77649 A Logic of Authentication]. ACM Transactions on Computer Systems, v. 8, n. 1, Feb. 1990, pp. 18—36&lt;br /&gt;
&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Cryptographic protocols]]&lt;br /&gt;
[[Category:Computer access control protocols]]&lt;br /&gt;
&lt;br /&gt;
{{crypto-stub}}&lt;/div&gt;</summary>
		<author><name>167.236.248.70</name></author>
	</entry>
</feed>