Search results
Jump to navigation
Jump to search
Page title matches
- ...most familiar names in network security are neither vendors nor geeks: Try Alice and Bob.<ref name=networld>{{citation Alice and Bob were introduced in the original paper (1978)<ref>{{citation5 KB (793 words) - 05:49, 8 April 2024
- 151 bytes (19 words) - 19:25, 2 December 2008
- 130 bytes (13 words) - 22:10, 18 April 2012
- * '''The Alice and Bob After Dinner Speech''' ''given at the Zurich Seminar, April 1984, by John G ...d Navabi about Alice, Bob and friends. <br>(see ''Musical Geek Friday #14: Alice and Bob)'', Peteris Krumins' blog, [http://www.catonmat.net/blog/musical-geek-frida658 bytes (98 words) - 19:09, 18 April 2012
Page text matches
- * '''The Alice and Bob After Dinner Speech''' ''given at the Zurich Seminar, April 1984, by John G ...d Navabi about Alice, Bob and friends. <br>(see ''Musical Geek Friday #14: Alice and Bob)'', Peteris Krumins' blog, [http://www.catonmat.net/blog/musical-geek-frida658 bytes (98 words) - 19:09, 18 April 2012
- In a bit of inside humor, [[Alice and Bob]], and sometimes the other characters, are used to name roles in [[cryptogr460 bytes (66 words) - 12:39, 30 November 2009
- Names used for certain pairs of players in game theory and cryptology; see [[Alice and Bob]].93 bytes (16 words) - 19:39, 29 April 2012
- In game theory, names used instead of [[Alice and Bob]] for players in certain games, the [[Arthur-Merlin game]]s.150 bytes (22 words) - 18:16, 24 April 2012
- ...most familiar names in network security are neither vendors nor geeks: Try Alice and Bob.<ref name=networld>{{citation Alice and Bob were introduced in the original paper (1978)<ref>{{citation5 KB (793 words) - 05:49, 8 April 2024
- '''Arthur''' and '''Merlin''' are a pair of players (like [[Alice and Bob]]) used530 bytes (75 words) - 18:06, 24 April 2012
- ...acker Edward, for Eavesdropper or EvilDoer. Edward's goal is to trick both Alice and Bob into talking to him instead of each other. Alice's message go to Edward who ...r can defeat whatever authentication mechanism is in play. For example, if Alice and Bob do a [[Diffie-Hellman]] key negotiation, they much each authenticate themse7 KB (1,015 words) - 05:48, 8 April 2024
- {{r|Alice and Bob}}608 bytes (77 words) - 15:58, 11 January 2010
- Conventionally, the two communicating parties are A and B or [[Alice and Bob]]. Now Alice and Bob can both calculate the shared secret S = g<sup>ab</sup>. Alice knows a and6 KB (954 words) - 05:48, 8 April 2024
- For example, assume [[Alice and Bob]] have ongoing communication that involves both [[session key]]s which chan2 KB (253 words) - 05:49, 8 April 2024
- .../sub>. Once the inputs are received, no communication is permitted between Alice and Bob until the outputs are provided. The input ''x''<sub>A</sub> is an element o It may seem that the apparata A, B are of no use for Alice and Bob. Significantly, this is an illusion.24 KB (3,745 words) - 02:21, 26 October 2013
- ...the designer of the [[Sunderland Bridge]], what actually makes it so that Alice and Bob are both talking about the same person? To alleviate this, some have sugges7 KB (1,174 words) - 07:33, 20 April 2024
- In describing cryptographic systems, the players are traditionally called [[Alice and Bob]], or just A and B. We use these names throughout the discussion below. One big payoff is that two users (traditionally, A and B or [[Alice and Bob]]) need not share a secret key in order to communicate securely. When used52 KB (8,332 words) - 05:49, 8 April 2024
- *{{pl|Alice and Bob}}9 KB (1,159 words) - 17:35, 14 March 2024
- The [[Diffie-Hellman]] key agreement protocol allows two parties (A and B or Alice and Bob) to agree on a key in such a way that an eavesdropper who intercepts the en40 KB (6,219 words) - 05:49, 8 April 2024