Two-in-One Oblivious Signatures Secure in the Random Oracle Model
An oblivious signature is a kind of digital signature providing privacy protection for the signature requester. According to the pioneer work introduced by Chen in 1994, it is defined in two different types; an oblivious signature with n messages and, an oblivious signature with n keys. In an oblivious signature with n messages, it allows a signature requester to get a signature on 1-out-of-n messages while during the signing process, the signer cannot find out which one of the n messages has been signed. In an oblivious signature with n keys, it allows a signature requester to get a signature signed by 1-out-of-n signers while during the signing process, no one except the requester can know who has really signed the message. In 2008, Tso et al. gave formal definitions on the models of oblivious signatures and gave an example on the construction of oblivious signatures based on the Schnorr signature. In this paper, we follow Tso et al.’s work but combine the two functionalities into one scheme. We called it Two-in-one oblivious signature. In out scheme, a signature requester can ask 1-out-of-\(n_1\) signers to sign 1-out-of-\(n_2\) messages. At the end of our protocol, no one (including the \(n_1\) possible-signers) knows who has really signed the message as well as which one of the \(n_2\) message has been signed. The scheme is useful in many applications such as e-cash, e-voting and e-auction etc. We will give a formal model on our scheme and give a rigorous security proof based on the random oracle model.
Keywords1-out-of-n signature Oblivious signature Oblivious transfer Privacy protection Schnorr signature
This research was supported by the Ministry of Science of Technology, Taiwan, under the grants MOST 105-2221-E-004-001-MY3, MOST 104-2218-E-001-002 and by Taiwan Information Security Center (TWISC), Academia Sinica.
- 4.Chaum, D.: Blind signatures for untraceable payments. Advances in Cryptology -CRYPTO 1982, pp. 199–203. Springer, Heidelberg (1983)Google Scholar
- 8.Fiat, A., Shamir, A.: How to prove yourself: a randomized protocol for signing contracts. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)Google Scholar
- 10.Kaliski, Jr. B.S.: Privacy preserving data querying. U.S. Patent No. 20,160,085,987. 24. March 2016Google Scholar
- 14.Rial, A., Danezis, G.: Privacy-preserving smart metering. In: Proceedings of the \(10\)th Annual ACM Workshop on Privacy in the Electronic Society, pp. 49–60 (2011)Google Scholar
- 17.Song, C., Yin, X., Liu, Y.: A practical electronic voting protocol based upon oblivious signature scheme, In: Proceedings of 2008 International Conference on Computational Intelligence and Security, pp. 381–384. IEEE (2008)Google Scholar
- 22.Yi, X., Rao, F.Y., Bertino, E., Bouguettaya, A.: Privacy-preserving association rule mining in cloud computing. In: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, pp. 439–450 (2015)Google Scholar