Find link

language: af: Afrikaans als: Alemannisch [Alemannic] am: አማርኛ [Amharic] an: aragonés [Aragonese] ar: العربية [Arabic] arz: مصرى [Egyptian Arabic] as: অসমীয়া [Assamese] ast: asturianu [Asturian] az: azərbaycanca [Azerbaijani] azb: تۆرکجه [Southern Azerbaijani] ba: башҡортса [Bashkir] bar: Boarisch [Bavarian] bat-smg: žemaitėška [Samogitian] be: беларуская [Belarusian] be-tarask: беларуская (тарашкевіца) [Belarusian (Taraškievica)] bg: български [Bulgarian] bn: বাংলা [Bengali] bpy: বিষ্ণুপ্রিয়া মণিপুরী [Bishnupriya Manipuri] br: brezhoneg [Breton] bs: bosanski [Bosnian] bug: ᨅᨔ ᨕᨘᨁᨗ [Buginese] ca: català [Catalan] ce: нохчийн [Chechen] ceb: Cebuano ckb: کوردیی ناوەندی [Kurdish (Sorani)] cs: čeština [Czech] cv: Чӑвашла [Chuvash] cy: Cymraeg [Welsh] da: dansk [Danish] de: Deutsch [German] el: Ελληνικά [Greek] en: English eo: Esperanto es: español [Spanish] et: eesti [Estonian] eu: euskara [Basque] fa: فارسی [Persian] fi: suomi [Finnish] fo: føroyskt [Faroese] fr: français [French] fy: Frysk [West Frisian] ga: Gaeilge [Irish] gd: Gàidhlig [Scottish Gaelic] gl: galego [Galician] gu: ગુજરાતી [Gujarati] he: עברית [Hebrew] hi: हिन्दी [Hindi] hr: hrvatski [Croatian] hsb: hornjoserbsce [Upper Sorbian] ht: Kreyòl ayisyen [Haitian] hu: magyar [Hungarian] hy: Հայերեն [Armenian] ia: interlingua [Interlingua] id: Bahasa Indonesia [Indonesian] io: Ido is: íslenska [Icelandic] it: italiano [Italian] ja: 日本語 [Japanese] jv: Basa Jawa [Javanese] ka: ქართული [Georgian] kk: қазақша [Kazakh] kn: ಕನ್ನಡ [Kannada] ko: 한국어 [Korean] ku: Kurdî [Kurdish (Kurmanji)] ky: Кыргызча [Kirghiz] la: Latina [Latin] lb: Lëtzebuergesch [Luxembourgish] li: Limburgs [Limburgish] lmo: lumbaart [Lombard] lt: lietuvių [Lithuanian] lv: latviešu [Latvian] map-bms: Basa Banyumasan [Banyumasan] mg: Malagasy min: Baso Minangkabau [Minangkabau] mk: македонски [Macedonian] ml: മലയാളം [Malayalam] mn: монгол [Mongolian] mr: मराठी [Marathi] mrj: кырык мары [Hill Mari] ms: Bahasa Melayu [Malay] my: မြန်မာဘာသာ [Burmese] mzn: مازِرونی [Mazandarani] nah: Nāhuatl [Nahuatl] nap: Napulitano [Neapolitan] nds: Plattdüütsch [Low Saxon] ne: नेपाली [Nepali] new: नेपाल भाषा [Newar] nl: Nederlands [Dutch] nn: norsk nynorsk [Norwegian (Nynorsk)] no: norsk bokmål [Norwegian (Bokmål)] oc: occitan [Occitan] or: ଓଡ଼ିଆ [Oriya] os: Ирон [Ossetian] pa: ਪੰਜਾਬੀ [Eastern Punjabi] pl: polski [Polish] pms: Piemontèis [Piedmontese] pnb: پنجابی [Western Punjabi] pt: português [Portuguese] qu: Runa Simi [Quechua] ro: română [Romanian] ru: русский [Russian] sa: संस्कृतम् [Sanskrit] sah: саха тыла [Sakha] scn: sicilianu [Sicilian] sco: Scots sh: srpskohrvatski / српскохрватски [Serbo-Croatian] si: සිංහල [Sinhalese] simple: Simple English sk: slovenčina [Slovak] sl: slovenščina [Slovenian] sq: shqip [Albanian] sr: српски / srpski [Serbian] su: Basa Sunda [Sundanese] sv: svenska [Swedish] sw: Kiswahili [Swahili] ta: தமிழ் [Tamil] te: తెలుగు [Telugu] tg: тоҷикӣ [Tajik] th: ไทย [Thai] tl: Tagalog tr: Türkçe [Turkish] tt: татарча/tatarça [Tatar] uk: українська [Ukrainian] ur: اردو [Urdu] uz: oʻzbekcha/ўзбекча [Uzbek] vec: vèneto [Venetian] vi: Tiếng Việt [Vietnamese] vo: Volapük wa: walon [Walloon] war: Winaray [Waray] yi: ייִדיש [Yiddish] yo: Yorùbá [Yoruba] zh: 中文 [Chinese] zh-min-nan: Bân-lâm-gú [Min Nan] zh-yue: 粵語 [Cantonese]

jump to random article

searching for Alice and Bob 131 found (209 total)

alternate case: alice and Bob

Principle of locality (2,796 words) [view diff] exact match in snippet view article find links to article

spatially separated, locations. The two measurements are named for Alice and Bob. Alice performs measurements (A) and gets a result a {\displaystyle

Bob. Alice and Bob must then each respond to Charlie with bits a , b ∈ { 0 , 1 } {\displaystyle a,b\in \{0,1\}} respectively. Now, once Alice and Bob send

(homophonous with halve). For example: Alice and Bob have three children. [In response to the question "Have Alice and Bob arrived?"] They have. Lexical stress

general theory of quantum games. It is played between two players, Alice and Bob, and arbitrated by a referee. The referee outputs the pay-off for the

Palma and Tenerife can be compared to the quantum characters Alice and Bob. Alice and Bob share the entangled state above, with photon 2 being with Alice

version of coin flipping answers the following cryptographic problem: Alice and Bob are recently divorced, living in two separate cities, and want to decide

two or more social outcomes. (For example, in the Alice and Bob case, N consisted of Alice and Bob, and X consisted of the four color options ⟨Blue, Yellow⟩

MIT Press published two collections of articles from Quanta Magazine, Alice and Bob Meet the Wall of Fire and The Prime Number Conspiracy. In May 2022 the

teleportation transfers one qubit from Alice and Bob by communicating two classical bits under the assumption that Alice and Bob have a pre-shared Bell state,

protocol assumes the availability of an authenticated channel between Alice and Bob. Key (cryptography) Key management Diffie–Hellman key exchange Elliptic-curve

opponent, say Eve, coerces honest parties Alice and Bob into establishing a secret key where at least one of Alice and Bob does not know that the secret key is

communication between Alice and Bob. If Eve tries to learn information about the key being established, discrepancies will arise causing Alice and Bob to notice.

Both Alice and Bob announce these bits publicly and run a check to see if more than a certain number of them agree. If this check passes, Alice and Bob proceed

the tallest building in London etc. for x, we may substitute both Alice and Bob, or all the numbers between 0 and 10, or all the buildings in London

languages are inspired by security protocol notation (also known as "Alice and Bob" notation). The key to these languages is the communication primitive

is lacking in the Diffie–Hellman key exchange protocol. Two parties, Alice and Bob, agree on a group G {\displaystyle G} with generator g {\displaystyle

knowledge. For example, in the Muddy Children Puzzle with two children (Alice and Bob, G = { a , b } {\displaystyle G=\{a,b\}} ), if they both have muddy

comes to distributing encryption keys. It allows two distant parties Alice and Bob to expand a small initial secret key into an arbitrarily long secret

string with a similar function to the cryptographic hash function. Alice and Bob hold n {\displaystyle n} -bit strings x {\displaystyle x} and y {\displaystyle

at least turn X {\displaystyle X} . Assume there are two children, Alice and Bob, and that only Alice is muddy ( X = 1 {\displaystyle X=1} ). Alice knows

} Alternatively, in a non-symmetric key system, everyone, not just Alice and Bob, knows the encryption key; but the decryption key cannot be inferred

security of YAK is disputed (see below and the talk page). Two parties, Alice and Bob, agree on a group G {\displaystyle G} with generator g {\displaystyle

examples of 2PC is Yao's Millionaires' problem, in which two parties, Alice and Bob, are millionaires who wish to determine who is wealthier without revealing

known prior distribution.: 234–236  Suppose there are two bidders, Alice and Bob, whose valuations a {\displaystyle a} and b {\displaystyle b} are drawn

computational theorist Andrew Yao. The problem discusses two millionaires, Alice and Bob, who are interested in knowing which of them is richer without revealing

measured his qubit, the outcome would be the same as for Alice. Thus, Alice and Bob would each seemingly have random outcome. Through communication they

shown to operate against your interests one would not use it. Suppose Alice and Bob wish to communicate securely – they may choose to use cryptography.

exclude. If it's possible, then what I said doesn't apply. I said, Alice and Bob are making a decision out of a cause. A cause lies in their past and

Bodlaender. Its rules are as follows: Alice and Bob color the vertices of a graph G with a set k of colors. Alice and Bob take turns, coloring properly an

introduced the name "k-calculus".: 109  Consider two inertial observers, Alice and Bob, moving directly away from each other at constant relative velocity

_{B}} for Alice and Bob respectively. Alice and Bob can both perform local measurements on their own subsystems, for instance, Alice and Bob measure x

Assume parts of a maximally entangled Bell state are distributed to Alice and Bob. Alice could send bits to Bob in the following way: If Alice wishes

an item. As an example, suppose 4 items have to be divided between Alice and Bob. Some possible picking sequences are: AABB - Alice picks two items,

remainder 0.4 is largest). Now, suppose that we activate the same rule on Alice and Bob alone, with their combined allocation of 2. The normalized entitlements

Transaction 2 BEGIN; SELECT name FROM users WHERE age > 17; -- retrieves Alice and Bob BEGIN; INSERT INTO users VALUES (3, 'Carol', 26); COMMIT; SELECT name

no one received a majority of the vote. In Scenario 3, assume that Alice and Bob are eligible candidates, but Carol is not. Using Robert's Rules of Order

signature, the original one-time one-bit signature scheme. Suppose Alice and Bob want to resolve some dispute via coin flipping. If they are physically

considerably less (only around 16%). Secondly, two of those three (Alice and Bob) will be out of position to David on later betting rounds. A common

protocol (2009) allows for increased transmission distances between Alice and Bob by using two mutually unbiased bases and introducing a minimum index

quantum entropy. To interpret a conditional information measure, suppose Alice and Bob were to share a bipartite quantum state ρ A B {\displaystyle \rho _{AB}}

preparation, state discrimination, and entanglement transformations. Alice and Bob are given a quantum system in the product state | 00 ⟩ = | 0 ⟩ A ⊗ |

compute the polarization (see figure). In other words, two people, Alice and Bob, looking at the same solid, may calculate different values of P, and

of a simple instant messaging protocol that employs forward secrecy: Alice and Bob each generate a pair of long-term, asymmetric public and private keys

Initially, Alice and Bob go to w and Chana and Dana go to x. Each pair eats their item simultaneously. After 1/2 minute, Alice and Bob each have 1/2

shown on the right. The table shows the valuations (in dollars) of Alice and Bob to the four possible subsets of the set of two items: {apple, bread}

Alice and Bob. In all examples, the utilities are weakly-convex and continuous. A. Many PEEF allocations: The total endowment is (4,4). Alice and Bob

where the person solicited commits the crime. In such a situation, both Alice and Bob could be charged with the crime as accomplices, which would preclude

cost 1. So the cost of serving him alone is 2+1=3. The cost of serving Alice and Bob is 2+2+2=6 (by building only F1). The cost of serving Bob and Carl is

language can be used. Alice and Bob have secret values x {\displaystyle x} and y {\displaystyle y} , respectively. Alice and Bob wish to learn if x = y

a value x to Bob (the receiver). The communication channel between Alice and Bob is imperfect, and can introduce errors. An error-correcting code is

illustrates the difference. In all examples there are two partners, Alice and Bob. Alice receives the left part and Bob receives the right part. Note

Carol has a lock on the high hand with her 10-high straight flush, but Alice and Bob are still competing for the low half of the pot. Bob holds an 8-7-6-2-A

spacelike separated spacetime point Q. Thus, for example, if two parties Alice and Bob have each two agents, with the first agent of Bob sending a secret message

Pincer, Mallet, Emma & Patrolman "Deep in Your Heart" – Bob "Let's Go" – Alice and Bob "It's Your Fault" – Mr. & Mrs. Van Guilder "Wild and Reckless (Reprise)"

(\psi (P_{A}))^{b})=\rho (\psi (g)^{ab})} which is the shared secret of Alice and Bob. This scheme is based on the ElGamal encryption. Key Generation Alice

An example of a SIP message exchange between two users, Alice and Bob, to establish and end a direct media session.

one-parameter unitary groups Wigner's theorem Ouellette, Jennifer. "Alice and Bob Meet the Wall of Fire". Quanta Magazine. Retrieved 15 June 2023. "Lecture

not initially held by Alice but rather in an auction in which both Alice and Bob are buyers: the car will go to Bob and the price will be anywhere between

telecommunications and cryptography, the following algorithm can be used: Alice and Bob each privately choose a random word, e.g. bubblejet and knockback respectively

Steinhaus. Consider a land asset that has to be divided among 3 heirs: Alice and Bob who think that it's worth 3 million dollars, and George who thinks that

animation from the Perimeter Institute exploring the question with Alice and Bob in Wonderland Portals: Physics Astronomy Stars Spaceflight Outer space

commonly between two websites, to ensure mutual traffic. For example, Alice and Bob have websites. If Bob's website links to Alice's website and Alice's

decrypts and verifies Alice's signature using her asymmetric public key. Alice and Bob are now mutually authenticated and have a shared secret. This secret

long-term responsibility in mind. In operation, "There are two debaters, Alice and Bob. Alice takes the podium, makes her argument. Then Bob takes her place

Internet mail gateway which also does any necessary reformatting. If Alice and Bob work for the same company, the entire transaction may happen completely

Professional. pp. 188–. ISBN 978-0-201-79429-8. Tanya Janca (14 October 2020). Alice and Bob Learn Application Security. Wiley. pp. 15–. ISBN 978-1-119-68740-5.

Nash-equilibrium in which the item goes to Bob. Additionally, if the valuations of Alice and Bob are random variables drawn independently from the same distribution

authentic (n.b., this is critical) copy of each other's public keys, Alice and Bob can compute a shared secret offline. The shared secret can be used,

generation of a public and a private key. The public key is known by both Alice and Bob and the private key is only known by Bob. To generate the key pair two

are one or more heaps of objects, and two players (we'll call them Alice and Bob), take turns choosing a heap and removing 1 or more objects from it

that these two entangled qubits are separated, with one each given to Alice and Bob. Alice makes a measurement of her qubit, obtaining—with equal probabilities—either

Security Testing". www.softwaretestinghelp.com. Tanya Janca (2020). Alice and Bob Learn Application Security. John Wiley & Sons. pp. 140–. ISBN 978-1-119-68735-1

conjuncts. For example, from knowing it not to be the case that both Alice and Bob showed up to their date, it does not follow who did not show up. The

this, although they suspect it with some probability. For example, Alice and Bob may sometimes optimize as individuals and sometimes collude as a team

$104,000 (more below on why the sale price should be this amount). Alice and Bob have entered into a forward contract. Bob, because he is buying the

the most change from the classical game. In this version of the game, Alice and Bob each have an operator Q that allows for a payout equal to mutual cooperation

message to Bob that Bob could decrypt, but the adversary, Eve, could not. Alice and Bob maintained an advantage over Eve, in that they shared a key used for

might take an unbounded time – depending on the exact valuations of Alice and Bob. Using the IA procedure, the main BTP procedure creates IAs for all

where A {\displaystyle A} and B {\displaystyle B} are identities of Alice and Bob respectively. Removing the mandatory requirement in MQV that a certificate

remaining in the hand without betting. Carol bets, adding $2 to the pot. Alice and Bob both call, each adding $2 to the pot. The pot now contains $12. Second

project's first year (year 1), BBN designed and built a full QKD system (Alice and Bob), with an attenuated laser source (~ 0.1 mean photon number) running

Example 1. There are two items for sale and two potential buyers: Alice and Bob, with the following valuations: Alice values each item as 5, and both

that the third ball came from each of the urns. Consider two friends, Alice and Bob, who live far apart from each other and who talk together daily over

is an economy with two commodities (x and y) and two traders (e.g. Alice and Bob). In one situation, the initial endowments are (20,0) and (0,10), i

share both region 1 and region 2 between Alice and Bob. However, such allocation cannot be PO since Alice and Bob could both gain by swapping their shares

that z is not a valid signature of m under the key, gx; i.e., z ≠ mx. Alice and Bob have agreed an integer, k, which sets the computational burden on Alice

cake, say X ⊆ C, which is valued differently by some two partners, say Alice and Bob. Let Y := C \ X. Let ax=VAlice(X) and bx=VBob(X) and ay=VAlice(Y) and

including Stay Up Late, that depict a pair of anthropomorphic rats named Alice and Bob in sexually suggestive poses. Between 1988 and 1993, Swords donated

28 August 2024. Espinoza, Antonio; Tolley, William (August 2017). "Alice and Bob, who the FOCI are they?: Analysis of end-to-end encryption in the LINE

problem is that the MAC is only authenticating a string of bytes, while Alice and Bob need to authenticate the way the message was constructed as well. If

Here are some examples to illustrate the concept of relevance. If Alice and Bob are planning to go on a trip next weekend and Alice tells Bob (1) Next

node Alice sends data to node Bob, node Eve (in the same domain as Alice and Bob) will not be able to easily eavesdrop their communication. G.hn supports

overdetermination, whereby an effect has multiple causes. For instance, suppose Alice and Bob both throw bricks at a window and it breaks. If Alice hadn't thrown

February 22, 2009. Kaliski, Burt (October 22, 1997). "Growing Up with Alice and Bob: Three Decades with the RSA Cryptosystem". Archived from the original

declare a winner, especially if one was, anyway, having a pub lunch. Alice and Bob play the game using the basic version and handling plurals using method

6-spot cards wild. Bob opens for $1, Carol raises to $2, David folds, Alice and Bob call. Bob discards two cards, and receives two replacements. Carol draws

abstraction of the Bell state and the Bell measurement respectively. If Alice and Bob share two qubits Y and Z in an entangled state and Alice performs a

lifetime which had been lost in failed business ventures. However, Henry, Alice and Bob felt badly about Wilkie, who suffered from a heart condition and rheumatic

{b}}}=(B^{-1}a_{1}B,\ldots ,B^{-1}a_{n}B)} to Alice. Shared key: The key shared by Alice and Bob is the group element K = A − 1 B − 1 A B ∈ G {\displaystyle K=A^{-1}B^{-1}AB\in

multi-agent systems or Knowledge-based systems research. The logicians Alice and Bob are sitting in their dark office wondering whether or not it is raining

= n = 2 secret shares for s, giving the three sets of two shares to Alice and Bob, Alice and Carol, and Bob and Carol. For example, imagine that the board

following: From conclusive evidence it not to be the case that both Alice and Bob showed up to their date, one cannot derive conclusive evidence, tied

construction, and error analysis. Codebook Generation. We first describe how Alice and Bob agree on a random choice of code. They have the channel x → ρ x {\displaystyle

the games is finite, predetermined in length, and has two players (Alice and Bob). At each turn, Alice chooses an integer or a number of integers (an

Micciancio's FHE references Vinod Vaikuntanathan's FHE references "Alice and Bob in Cipherspace". American Scientist. September 2012. Retrieved 2018-05-08

that formation of "pairs" from the two records of measurement results (Alice and Bob) had to be done after the experiment which in fact exposes the experiment

computation first introduced by Yao in 1979. Two parties (normally called Alice and Bob) each hold a piece of data and want to solve some computational task

\mathbf {O} )} played on X {\displaystyle X} is a game with two players Alice and Bob. 1st round: Alice chooses an open cover U 1 {\displaystyle {\mathcal

100), so no goods are transferred. Instead, Good 2 is split between Alice and Bob: Alice receives 95 156 {\displaystyle {\frac {95}{156}}} th of the good

amplification. The goal of quantum key distribution is for two parties, Alice and Bob, to share a common secret string through communications over public

of each qubits. Using classical insecure, but authenticated, channel Alice and Bob communicate and discard measurements where Bob used the different basis

situation, even when there is high conflict. Suppose that two friends, Alice and Bob, want to see a film at the cinema one evening, and that there are only

determine the heirs of a person who has died intestate. For example, Alice and Bob are a married, retired couple with no offspring. They die in a plane

The game is that two players, Alice and Bob construct a proper incidence coloring. The rules are stated below: Alice and Bob color the incidences of a graph

Hurewicz game played on X {\displaystyle X} is a game with two players Alice and Bob. 1st round: Alice chooses an open cover U 1 {\displaystyle {\mathcal

a set game played on X {\displaystyle X} is a game with two players Alice and Bob. 1st round: Alice chooses an open ω {\displaystyle \omega } -cover U

utilitarian rule might be not RM. For example, suppose there are two agents, Alice and Bob, with the following utilities: u A ( y A ) = y A 2 {\displaystyle

particles. The authentication is based on public information. Imagine Alice and Bob wish to engage in quantum key distribution on an ad hoc basis, i.e.

is z, then Charlie learns that his z is the maximum value, whereas Alice and Bob learn (if x, y and z are distinct), that their input is not equal to

split the photons, keep one photon, and send the rest to Bob. After Alice and Bob announce the basis information, Eve can measure the intercepted photon

circuit and obtains the encrypted outputs. We call Bob the evaluator. Alice and Bob communicate to learn the output. The Boolean circuit for small functions

to the cabaret. There a sea captain meets her and is smitten. Later, Alice and Bob are married. The captain, however, is still obsessed with Alice and

about what happens after that. An example: A system has two users, Alice and Bob. Alice has a file secret.txt, which is only allowed to be read and edited

January 2, 2024. James Maude (December 29, 2023). "The Adventures of Alice and Bob: Episode 45: The Secure Shell Exploit and Kids Hacking ISPs" (Podcast)

\mathbf {O} )} played on X {\displaystyle X} is a game for two players, Alice and Bob. It has an inning per each natural number n {\displaystyle n} . At the

keep a larger fraction of the pot. In this example, the players are Alice and Bob. Alice chooses first, and also has the highest reward if Bob chooses

If x*≤x and y*≥y, and one of the inequalities is strict, then both Alice and Bob prefer the middle piece over any other piece, so whoever won't get it

l B e B ] {\displaystyle E[l_{B}^{e_{B}}]} , which are assigned to Alice and Bob, respectively, as indicated by the subscripts. Each party starts the

ciphertext so that another user can also decrypt. Suppose the two users are Alice and Bob. Alice has some messages: M1, M2, … Mn. She intends to encrypt them

with Charlie who is friends with David. The geodesic distance between Alice and Bob is one, between Alice and Charlie is two, and between Alice and David

following caption: "I cant wait to show these to Dorothy, Carol and to Alice and Bob, Spring 1954, While drawing funny pictures to entertain overseas military