Hypercubes and Private Information Retrieval

  • Anirban Basu
  • Rui Xu
  • Juan Camilo Corena
  • Shinsaku Kiyomoto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10631)


In geometry, a hypercube is a regular polytype – a generalisation of a 3-dimensional cube to \(\lambda \)-dimensions, with mutually perpendicular sides of equal lengths. For \(\lambda = 0, 1, 2, 3, \text {and}\,4\), a hypercube is a point, a straight line segment, a square, a cube and a tesseract respectively. In this paper, we apply the concept of hypercubes in computationally private information retrieval (CPIR) based on additively homomorphic cryptosystems and optimise it further at the cost of a measurable privacy loss.


Privacy Hypercubes Information retrieval 


  1. 1.
    Chang, Y.-C.: Single database private information retrieval with logarithmic communication. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 50–61. Springer, Heidelberg (2004). Scholar
  2. 2.
    Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4(11), 171–181 (1978)Google Scholar
  3. 3.
    Blakley, G., Meadows, C.: A database encryption scheme which allows the computation of statistics using encrypted data. In: 1985 IEEE Symposium on Security and Privacy, p. 116. IEEE (1985)Google Scholar
  4. 4.
    Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information from an oracle. J. Comput. Syst. Sci. 39(1), 21–50 (1989)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Locally random reductions: improvements and applications. J. Cryptol. 10(1), 17–36 (1997)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Beaver, D., Feigenbaum, J.: Hiding instances in multioracle queries. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 37–48. Springer, Heidelberg (1990). Scholar
  7. 7.
    Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 41–50. IEEE (1995)Google Scholar
  8. 8.
    Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. J. ACM 45(6), 965–982 (1998)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Chor, B., Gilboa, N.: Computationally private information retrieval. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 304–313. ACM (1997)Google Scholar
  10. 10.
    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). Scholar
  11. 11.
    Damgård, I., Jurik, M.: A generalisation, a simplification and some applications of paillier’s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119–136. Springer, Heidelberg (2001). Scholar
  12. 12.
    Coney, L., Hall, J.L., Vora, P.L., Wagner, D.: Towards a privacy measurement criterion for voting systems. In: Proceedings of the 2005 National Conference on Digital Government Research, pp. 287–288. Digital Government Society of North America (2005)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.KDDI ResearchFujiminoJapan

Personalised recommendations