Answered step by step
Verified Expert Solution
Question
00
1 Approved Answer
The secure dating problem: Suppose Alice and Bob are trying to figure out whether the other has a crush on her/him. But both of them
The secure dating problem: Suppose Alice and Bob are trying to figure out whether the other has a crush on her/him. But both of them will feel embarrassed if he/she revealed his/her interest but the other has no feeling. Can we design a communication protocol, such that the following requirements are satisfied? Only when both of them like the other, they will find out this fact; otherwise, both parties will only output " not interested", and learn nothing else. To see an example for the second requirement, suppose Alice likes Bob, but Bob has no interests, after they run the protocol, both Alice and Bob will output "the other does not have interest on me", i.e., Bob will never find out Alice likes him when he does not have interest himself. The secure dating problem: Suppose Alice and Bob are trying to figure out whether the other has a crush on her/him. But both of them will feel embarrassed if he/she revealed his/her interest but the other has no feeling. Can we design a communication protocol, such that the following requirements are satisfied? Only when both of them like the other, they will find out this fact; otherwise, both parties will only output " not interested", and learn nothing else. To see an example for the second requirement, suppose Alice likes Bob, but Bob has no interests, after they run the protocol, both Alice and Bob will output "the other does not have interest on me", i.e., Bob will never find out Alice likes him when he does not have interest himself
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access with AI-Powered Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started