Skip to main content
SpringerLink
Log in
Book cover

International Conference on Security and Privacy in Communication Systems

SecureComm 2013: Security and Privacy in Communication Networks pp 380–392Cite as

(k − n) Oblivious Transfer Using Fully Homomorphic Encryption System

  • Conference paper

  • 2016 Accesses

Abstract

Oblivious Transfer(OT) protocol allows a client retrieving one or multiple records from a server without letting the server know about the choice of the client. OT has been one of the emerging research areas for last several years. There exist many practical applications of OT, especially in digital media subscription. In this paper, we propose a fully homomorphic encryption based secure k out of n oblivious transfer protocol. This novel protocol, first ever to use fully homomorphic encryption mechanism for integers numbers, allows the client choosing its desired records by sending encrypted indexes to the server, server works on encrypted indexes and sends back encrypted result without knowing which records the client was interested in. From the encrypted response of the server, the client only can decrypt its desired records. The security analysis demonstrates that, the desired security and privacy requirement of OT is ensured by the proposed protocol. Some optimizations are also introduced in the proposed solution to reduce transmission overhead.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, M.: Three application of oblivious transfer: Part i: Coin flipping by telephone; part ii: How to exchange secrets; part iii: How to send certified electronic mail (2001)

    Google Scholar 

  2. Líšková, L., Stanek, M.: Efficient Simultaneous Contract Signing. In: Deswarte, Y., Cuppens, F., Jajodia, S., Wang, L. (eds.) Security and Protection in Information Processing Systems. IFIP, vol. 147, pp. 440–455. Springer, Boston (2004)

    Google Scholar 

  3. Min Sun, H., Hang Wang, K., Fu Hung, C.: Towards privacy preserving digital rights management using oblivious transfer (2006)

    Google Scholar 

  4. Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119–135. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Wang, W., Deng, B., Li, Z.: Application of oblivious transfer protocol in distributed data mining with privacy-preserving. In: Proceedings of the First International Symposium on Data, Privacy, and E-Commerce, ISDPE 2007, pp. 283–285. IEEE Computer Society, Washington, DC (2007)

    Google Scholar 

  6. van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24–43. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. FIPS-PUB.197: Advanced encryption standard. Federal Information Processing Standards Publications, US Department of Commerce/N.I.S.T., National Technical Information Service (2001)

    Google Scholar 

  8. FIPS-Pub.46: Data encryption standard. National Bureau of Standards, US Department of Commerce (1977)

    Google Scholar 

  9. Zeng, Z., Dayton, B.H.: The approximate gcd of inexact polynomials. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ISSAC 2004, pp. 320–327. ACM, New York (2004)

    Google Scholar 

  10. Rabin, M.: How to Exchange Secrets by Oblivious Transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)

    Google Scholar 

  11. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120–126 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  12. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28, 637–647 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval (extended abstract). In: Proc. of the 38th Annu. IEEE Symp. on Foundations of Computer Science, pp. 364–373 (1997)

    Google Scholar 

  14. Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 573–590. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  15. Laur, S., Lipmaa, H.: A new protocol for conditional disclosure of secrets and its applications. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 207–225. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: Proc. of 5th ISTCS, pp. 174–183 (1997)

    Google Scholar 

  17. Murugesan, M., Jiang, W., Nergiz, A.E., Uzunbaz, S.: k-out-of-n oblivious transfer based on homomorphic encryption and solvability of linear equations. In: CODASPY 2011, pp. 169–178 (2011)

    Google Scholar 

  18. El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  19. Clarkson, J.B.: Dense probabilistic encryption. In: Proceedings of the Workshop on Selected Areas of Cryptography, pp. 120–128 (1994)

    Google Scholar 

  20. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 113–124. ACM, New York (2011)

    Chapter  Google Scholar 

  22. Kaosar, M., Paulet, R., Yi, X.: Fully homomorphic encryption based two-party association rule mining. Data and Knowledge Engineering 76-78, 1–15 (2012)

    Article  Google Scholar 

  23. Kaosar, M., Paulet, R., Yi, X.: Secure two-party association rule mining. In: Australasian Information Security Conference, AISC 2011 (2011)

    Google Scholar 

  24. Yi, X., Kaosar, M., Paulet, R., Bertino, E.: Single-database private information retrieval from fully homomorphic encryption. IEEE Transactions on Knowledge and Data Engineering 25, 1125–1134 (2013)

    Article  Google Scholar 

  25. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 169–178. ACM, New York (2009)

    Google Scholar 

  26. NIST: Recommendation for random number generation using deterministic random bit generators. U.S. Department of Commerce, National Institute of Standards and Technology (NIST) Special Publication 800-90A (January 2012)

    Google Scholar 

  27. Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 309–325. ACM, New York (2012)

    Google Scholar 

  28. Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully Homomorphic Encryption over the Integers with Shorter Public Keys. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487–504. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Mathematics, Charles Sturt University, Australia

    Mohammed Kaosar, Quazi Mamun & Rafiqul Islam

  2. School of Engineering and Science, Victoria University, Australia

    Xun Yi

Authors
  1. Mohammed Kaosar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quazi Mamun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rafiqul Islam
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xun Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Mathematics, Charles Sturt University, Wagga Wagga, NSW, Australia

    Tanveer Zia

  2. School of Information Technologies, University of Sydney, Darlington, NSW, Australia

    Albert Zomaya

  3. Department of Computing, Macquarie University, Australia, Australia

    Vijay Varadharajan

  4. Department of EECS, University of Michigan, Ann Arbor, MI, USA

    Morley Mao

Rights and permissions

Reprints and permissions

Copyright information

© 2013 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Kaosar, M., Mamun, Q., Islam, R., Yi, X. (2013). (k − n) Oblivious Transfer Using Fully Homomorphic Encryption System. In: Zia, T., Zomaya, A., Varadharajan, V., Mao, M. (eds) Security and Privacy in Communication Networks. SecureComm 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 127. Springer, Cham. https://doi.org/10.1007/978-3-319-04283-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04283-1_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04282-4

  • Online ISBN: 978-3-319-04283-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation