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 any of Bob's five items; Alice should not find out anything other than the answer ("Yes" or "No") to the above question, and Bob should not know that answer or any secret from Alice. Do not use a hash-based solution because even though the probability of a colission is small, Alice requires that no such colission 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 ciphertexts).
NOTE: THE SOLUTION FOR THIS SHOULD BE MATHEMATICALLY EXACT.

Answer 1

The protocol shows that the items of Alice = {x} and the items of Bob = {y1, y2, y3, y4, y5}

How to depict the protocol

The ways to design the protocol will be:

• Alice will get Bob's public key.
• Alice will send a communication to Bob encrypted through Bob's community key.
• Bob's motivation has a clandestine key.

• Through the top-secret key, Bob will try to work out the communication.
• Bob will give a response called yes or no.
• Bob doesn't know what substances are with Alice.

• If Alice Alice gets any of the responses as yes then Alice's item is equivalent to any of Bob's five items.

• If Alice's items are not equal to Bob's items then Alice will get a response as no.

It should be noted that protocol is important for relaying datagrams across the network boundaries.

Learn more about protocol on:

brainly.com/question/17062016