What if you desire to express your love to someone, but fear the consequences if he or she does not return your feelings?
It’s an age old problem - how many of us know someone who asks a friend to go talk to so-and-so to “see if she likes me?”
Just in time for Valentines day, I found this reference to this research paper, Romantic Cryptography, on Light Blue Touchpaper:
Abstract. We show how Alice and Bob can establish whether they love
each other, but without the embarrassment of revealing that they do if
the other party does not share their feelings.
This is a “secure multiparty computation” of the AND function, where
the participants cooperate in producing the result of the AND, but without
learning the input bit contributed by the other party unless the result
implies it.
It’s an interesting algorithm involving scales and “voting” with weighted balls such that no information is revealed unless both parties indicate interest.
They provide some interesting variations using Love/Don’t Love images that only produce an image if both parties fancy the other:
The paper is short, and is certainly worth a skim at the least.






