
full text - Repost: HW question help (from https://ift.tt/WVGUtuw, HW question help)
Mining:
Exchanges:
Donations:
I've been stuck on this question for at least 15 hours, so I would desperately appreciate anyone's help. Here is the problem:A has two messages, m0 and m1, and B knows which of the two he wants. Give a scheme where: - B obtains only the one message he wants - A doesn't know which message B chose(You can use any mixture you want of symmetric and asymmetric key crypto.)
Social Media Icons