Search results

Page title matches

• Alice and Bob
  ...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>{{citation
  5 KB (793 words) - 05:49, 8 April 2024
• Talk:Alice and Bob
  #REDIRECT [[Talk:Alice and Bob/Draft]]
  38 bytes (6 words) - 15:19, 2 October 2013
• Template:Alice and Bob/Metadata
  | pagename = Alice and Bob | abc = Alice and Bob
  957 bytes (100 words) - 07:19, 15 March 2024
• Talk:Alice and Bob/Draft
  Do you know when (approximately?) Alice and Bob first appeared? Could they be immigrants from game theory? ...itional reason" for the names and says "there are hundreds of papers about Alice and Bob". The original [[RSA]] paper, 1978, uses Alice & Bob. Beyond that, I've no
  7 KB (1,011 words) - 15:19, 2 October 2013
• Alice and Bob/Definition
  151 bytes (19 words) - 19:25, 2 December 2008
• Alice and Bob/Related Articles
  130 bytes (13 words) - 22:10, 18 April 2012
• Alice and Bob/External Links
  * '''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-frida
  658 bytes (98 words) - 19:09, 18 April 2012
• CZ:Approval Announcements/Alice and Bob
  #REDIRECT [[Alice and Bob]]
  27 bytes (4 words) - 09:40, 28 April 2012

Page text matches

• Alice and Bob/External Links
  * '''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-frida
  658 bytes (98 words) - 19:09, 18 April 2012
• Bob & Carol & Ted & Alice
  In a bit of inside humor, [[Alice and Bob]], and sometimes the other characters, are used to name roles in [[cryptogr
  460 bytes (66 words) - 12:39, 30 November 2009
• CZ:Approval Announcements/Alice and Bob
  #REDIRECT [[Alice and Bob]]
  27 bytes (4 words) - 09:40, 28 April 2012
• Talk:Alice and Bob
  #REDIRECT [[Talk:Alice and Bob/Draft]]
  38 bytes (6 words) - 15:19, 2 October 2013
• Paul and Carole/Definition
  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
• Template:Alice and Bob/Metadata
  | pagename = Alice and Bob | abc = Alice and Bob
  957 bytes (100 words) - 07:19, 15 March 2024
• Arthur and Merlin/Definition
  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
• Alice and Bob
  ...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>{{citation
  5 KB (793 words) - 05:49, 8 April 2024
• Arthur and Merlin
  '''Arthur''' and '''Merlin''' are a pair of players (like [[Alice and Bob]]) used
  530 bytes (75 words) - 18:06, 24 April 2012
• Man-in-the-middle attack
  ...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 themse
  7 KB (1,015 words) - 05:48, 8 April 2024
• Diffie-Hellman/Related Articles
  {{r|Alice and Bob}}
  608 bytes (77 words) - 15:58, 11 January 2010
• Diffie-Hellman
  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^ab. Alice knows a and
  6 KB (954 words) - 05:48, 8 April 2024
• Talk:Alice and Bob/Draft
  Do you know when (approximately?) Alice and Bob first appeared? Could they be immigrants from game theory? ...itional reason" for the names and says "there are hundreds of papers about Alice and Bob". The original [[RSA]] paper, 1978, uses Alice & Bob. Beyond that, I've no
  7 KB (1,011 words) - 15:19, 2 October 2013
• Perfect forward secrecy
  For example, assume [[Alice and Bob]] have ongoing communication that involves both [[session key]]s which chan
  2 KB (253 words) - 05:49, 8 April 2024
• User:Sandy Harris/Articles
  {{rpl|Alice and Bob}}
  2 KB (243 words) - 17:48, 13 March 2024
• Entanglement (physics)
  .../sub>. Once the inputs are received, no communication is permitted between Alice and Bob until the outputs are provided. The input ''x''_A 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
• Reference (philosophy)
  ...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 sugges
  7 KB (1,174 words) - 07:33, 20 April 2024
• CZ:Approval Announcements
  {{Notice|Alice and Bob|NAA|}}
  4 KB (458 words) - 03:09, 8 March 2024
• User talk:Sandy Harris/Sandbox
  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 used
  28 KB (4,396 words) - 06:22, 16 December 2008
• User talk:Approval Manager
  ...ge article. It might be quick & simple to approve some shorter ones such [[Alice and Bob]], [[Rot 13]] or [[Caesar cipher]]. The most interesting short one is Crypt
  5 KB (762 words) - 14:38, 18 March 2024