Abstract
Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply the subgroup membership problem to private information retrieval schemes following the method by Kushilevitz and Ostrovsky. The resulting scheme has the same communication complexity as that of Kushilevitz and Ostrovsky.
Chapter PDF
References
Ambainis, A.: Upper Bound on the Communication Complexity of Private Information Retrieval, Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 1256. Springer-Verlag, (1997) 401–407
Cachin, C., Micali, S., Stadler, M.: Computationally Private Information Retrieval with Polylogarithmic Communication, Advances in Cryptology. Lecture Notes in Computer Science, Vol. 1592. Springer-Verlag, (1999) 402–414
Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private Information Retrieval, IEEE Symposium on Foundations of Computer Science. (1995) 41–50
Chor, B., Gilboa, N.: Computationally Private Information Retrieval ACM Symposium on Theory of Computing. (1997) 304–313
Goldwasser, S., Micali, S.: Probabilistic Encryption, J. Computer and System Science 28 (1984) 270–299
Kushilevitz, E., Ostrovsky, R.: Replication Is not Needed: Single Database, Computationally-private Information Retrieval, IEEE Symposium on Foundations of Computer Science. (1997) 364–373
Kurosawa, K, Tsujii, S.: A General Method to Construct Public Key Residue Cryptosystems, Transactions of the IEICE E-73, (1990) 1068–1072
Naccache, D., Stern, J.: A New Public-key Cryptosystem, Advances in Cryptology. Lecture Notes in Computer Science, Vol. 1233. Springer-Verlag, (1997) 27–36
Ostrofsky, R., Shoup, V.: Private Information Storage, ACM Symposium on Theory of Computing. (1997) 294–303
Okamoto, T., Uchiyama, S.:A New Public-key Cryptosystem as Secure as Factoring, Advances in Cryptology. Lecture Notes in Computer Science, Vol. 1403. Springer-Verlag, (1998) 308–318
Paillier, P.: Public-key Cryptosystems Based on Composite Degree Residuosity Classes, Advances in Cryptology. Lecture Notes in Computer Science, Vol. 1592. Springer-Verlag, (1999) 223–238
Saito, T., Koshiba, T., Yamamura, A.: The Decision Diffie-Hellman assumption and the Quadratic Residuosity Assumption, IEICE Transactions on Fundamentals of Electronics (1) E84-A, (2001) 165–171
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamura, A., Saito, T. (2001). Private Information Retrieval Based on the Subgroup Membership Problem. In: Varadharajan, V., Mu, Y. (eds) Information Security and Privacy. ACISP 2001. Lecture Notes in Computer Science, vol 2119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47719-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-47719-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42300-3
Online ISBN: 978-3-540-47719-8
eBook Packages: Springer Book Archive