Alice has an item x and Bob has a set of five distinct items y1, y2, y3, y4, and

Question

Alice has an item x and Bob has a set of five distinct items y1, y2, y3, y4, and y5. Design a protocol through which Alice (but not Bob) finds out whether her x equals five items; Alice should not find out anything other than the answer yes (“Yes” or “No”) to the above question, and Bob should not know that answer. Do not use a hash-based solution because even though the probability of a colission is small, Alice requires that no such collision can occur (but using encryption is fine, because in that case two distinct items that are encrypted with the same key will result in two different ciphertext). Alice has an item x and Bob has a set of five distinct items y1, y2, y3, y4, and y5. Design a protocol through which Alice (but not Bob) finds out whether her x equals five items; Alice should not find out anything other than the answer yes (“Yes” or “No”) to the above question, and Bob should not know that answer. Do not use a hash-based solution because even though the probability of a colission is small, Alice requires that no such collision can occur (but using encryption is fine, because in that case two distinct items that are encrypted with the same key will result in two different ciphertext). Alice has an item x and Bob has a set of five distinct items y1, y2, y3, y4, and y5. Design a protocol through which Alice (but not Bob) finds out whether her x equals five items; Alice should not find out anything other than the answer yes (“Yes” or “No”) to the above question, and Bob should not know that answer. Do not use a hash-based solution because even though the probability of a colission is small, Alice requires that no such collision can occur (but using encryption is fine, because in that case two distinct items that are encrypted with the same key will result in two different ciphertext). Alice has an item x and Bob has a set of five distinct items y1, y2, y3, y4, and y5. Design a protocol through which Alice (but not Bob) finds out whether her x equals five items; Alice should not find out anything other than the answer yes (“Yes” or “No”) to the above question, and Bob should not know that answer. Do not use a hash-based solution because even though the probability of a colission is small, Alice requires that no such collision can occur (but using encryption is fine, because in that case two distinct items that are encrypted with the same key will result in two different ciphertext).

Explanation / Answer

Answer:

Items of Alice = {x}

Items of bob = {y1, y2, y3, y4, y5}

Procedure:

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.