A simple protocol for selling multiple secrets to a single buyer without a trusted party

Consider the following problem: Alice (A) has k secrets and she is willing to sell any of them to Bob (B),but she wants to ensure that if Bob pays for only one secret, he cannot obtain any information about the others. Bob would like to buy some of the secrets from Alice, but he wants to ensure that Alice cannot obtain any information about which of her secrets he has obtained. This problem is known as secret selling of secrets. Although this problem has previously been solved by some sophisticated protocols, the aim of this paper is to propose a novel and simple protocol for this problem which requires neither a secure channel nor participation of a trusted party.

Keywords:

Cryptography , secret selling , discrete logarithm problem