Abstract
Oblivious transfer (OT) is an important cryptographic primitive. In this paper, we propose a practical server-aided k-out-of-n oblivious transfer (\(OT_n^k\)) protocol based on the Decisional Diffie-Hellman (DDH) assumption. Our construction is the first one that is applicable in cloud computing environment. Unlike the original OT which only contains the receiver R and sender S, the server-aided OT setting also contains cloud servers who provide a vast amount of computational resources, therefore the sender and receiver can outsource the computational work to the cloud servers. In the proposed protocol, the receiver R sends only two group elements to the sender S, and S sends 2n group elements back to R. The computation cost of R and S is the most efficient comparing with other known schemes. In our protocol, the receiver R computes \(2k+3\) modular exponentiations and the sender computes 2.5n modular exponentiations. The communication rounds of the protocol is three, including one extra round from the receiver R to the cloud servers. The choices of the receiver R is protected against the sender S and cloud servers, meanwhile, the input values of S which are not chosen are still secret to R.
This work is supported by the National Natural Science Foundation of China under grant No. 61173139 and No. 61572294.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162–167 (1986)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game C A completeness theorem for protocols with honest majority. In: 19th STOC, pp. 218–229 (1987)
Goldreich, O.: Foundations of Cryptography: Volume 2 C Basic Applications. Cambridge University Press, Cambridge (2004)
Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52–78. Springer, Heidelberg (2007)
Hazay, C., Lindell, Y.: Protocols, Efficient Secure Two-Party: Techniques and Constructions. Springer, Heidelberg (2010)
Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 329–346. Springer, Heidelberg (2011)
Lindell, Y.: Fast cut-and-choose based protocols for malicious and covert adversaries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 1–17. Springer, Heidelberg (2013)
Li, J., Huang, X., Li, J., Chen, X., Xiang, Y.: Securely outsourcing attribute-based encryption with checkability. IEEE Trans. Parallel Distrib. Syst. 25(8), 2201–2210 (2014)
Li, J., Li, J., Chen, X., Jia, C., Lou, W.: Identity-based encryption with outsourced revocation in cloud computing. IEEE Trans. Comput. 64(2), 425–437 (2015)
Kamara, S., Mohassel, P., Raykova, M.: Outsourcing multi-party computation. Cryptology ePrint Archive, 2011/272 (2011)
Kamara, S., Mohassel, P., Riva, B.: Salus: a system for server-aided secure function evaluation. In Proceedings of the ACM Conference on Computer and Communications Security, pp. 797–808 (2012)
Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. IEEE Trans. Parallel Distrib. Syst. 25(9), 2386–2396 (2014)
Chen, X., Li, J., Susilo, W.: Efficient fair conditional payments for outsourcing computations. IEEE Trans. Inf. Forensics Secur. 7(6), 1687–1694 (2012)
Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical report, Harvard University (1981)
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637–647 (1985)
Brassard, G., Crépeau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234–238. Springer, Heidelberg (1987)
Brassard, G., Crepeau, C., Robert, J.M.: Information theoretic reductions among disclosure problems. In: Proceedings of 28th Annual Symposium on Foundations of Computer Science (FOCS 1987), pp. 427–437. IEEE (1987)
Brassard, G., Crepeau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Trans. Inf. Theory 42(6), 1769–1780 (1996)
Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 573–590. Springer, Heidelberg (1999)
Stern, J.P.: A new and efficient all-or-nothing disclosure of secrets protocol. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 357–371. Springer, Heidelberg (1998)
Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Proceedings of 12th Annual Symposium on Discrete Algorithms (SODA), pp. 448–457 (2001)
Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 119. Springer, Heidelberg (2001)
Tzeng, W.-G.: Efficient 1-out-n oblivious transfer schemes. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, p. 159. Springer, Heidelberg (2002)
Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554–571. Springer, Heidelberg (2008)
Mu, Y., Zhang, J., Varadharajan, V.: \(m\) out of \(n\) oblivious transfer. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 395–405. Springer, Heidelberg (2002)
Chu, C.-K., Tzeng, W.-G.: Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 172–183. Springer, Heidelberg (2005)
Camenisch, J.L., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 573–590. Springer, Heidelberg (2007)
Green, M., Hohenberger, S.: Blind identity-based encryption and simulatable oblivious transfer. Cryptology ePrint Archive, 2007/235 (2007)
Zeng, B., Tang, X., Xu, P., Jing, J.: Practical frameworks for t-out-of- oblivious transfer with security against covert and malicious adversaries. Cryptology ePrint Archive, 2011/001 (2011)
Zeng, B.,Tartary, C., Xu, P., Jing, J., Tang, X.: A practical framework for t-out-of-n oblivious transfer with security against covert adversaries. IEEE Trans. Inf. Forensics Secur. 7(2) (2012)
Guo, F., Mu, Y., Susilo, W.: Subset membership encryption and its applications to oblivious transfer. IEEE Trans. Inf. Forensics Secur. 9(7), 1098–1107 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Wei, X., Zhao, C., Jiang, H., Xu, Q., Wang, H. (2016). Practical Server-Aided k-out-of-n Oblivious Transfer Protocol. In: Huang, X., Xiang, Y., Li, KC. (eds) Green, Pervasive, and Cloud Computing. Lecture Notes in Computer Science(), vol 9663. Springer, Cham. https://doi.org/10.1007/978-3-319-39077-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-39077-2_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39076-5
Online ISBN: 978-3-319-39077-2
eBook Packages: Computer ScienceComputer Science (R0)