Efficient Traceable Oblivious Transfer and Its Applications
Oblivious transfer (OT) has been applied widely in privacy-sensitive systems such as on-line transactions and electronic commerce to protect users’ private information. Traceability is an interesting feature of such systems that the privacy of the dishonest users could be traced by the service provider or a trusted third party (TTP). However, previous research on OT mainly focused on designing protocols with unconditional receiver’s privacy. Thus, traditional OT schemes cannot fulfill the traceability requirements in the aforementioned applications. In this paper, we address this problem by presenting a novel traceable oblivious transfer (TOT) without involvement of any TTP. In the new system, an honest receiver is able to make a fixed number of choices with perfect receiver privacy. If the receiver misbehaves and tries to request more than a pre-fixed number of choices, then all his previous choices could be traced by the sender. We first give the formal definition and security model of TOT, then propose an efficient TOT scheme, which is proven secure under the proposed security model.
KeywordsOblivious transfer Secret sharing Privacy Traceability
This work is supported by the National Key R&D Program of China (2017YFB0802000), the National Natural Science Foundation of China (Nos. 61772418, 61402366). Yinghui Zhang is supported by New Star Team of Xi’an University of Posts & Telecommunications (2016-02).
- 2.Ashton, K.: That internet of things? Thing (1999)Google Scholar
- 6.Camenisch, J., Dubovitskaya, M., Neven, G.: Oblivious transfer with access control. In: Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009, Chicago, Illinois, USA, 9–13 November 2009, pp. 131–140 (2009)Google Scholar
- 7.Camenisch, J., Dubovitskaya, M., Neven, G., Zaverucha, G.M.: Oblivious transfer with hidden access control policies. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 192–209. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19379-8_12CrossRefGoogle Scholar
- 9.Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: IEEE Symposium on Foundations of Computer Science, p. 136 (2001)Google Scholar
- 22.Rabin, M.O.: How to exchange secrets by oblivious transfer (1981)Google Scholar
- 23.Teranishi, I., Furukawa, J., Sako, K.: k-times anonymous authentication. IEICE Trans. 92-A(1), 147–165 (2009)Google Scholar
- 24.Yao, A.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3–5 November 1982, pp. 160–164 (1982)Google Scholar
- 25.Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27–29 October 1986, pp. 162–167 (1986)Google Scholar