Abstract
Suppose that Bob has a databaseDand that Alice wants to perform a search queryqonD(e.g., “isqinD?”).Since Alice is concerned about her privacy, she does not want Bob to know the queryqor the response to the query. How could this be done? There are elegant cryptographic techniques for solving this problem under various constraints (such as “Bob should know neitherqnor the answer to the query” and “Alice should learn nothing aboutDother than the answer to the query”), while optimizing various performance criteria (e.g., amount of communication).
We consider the version of this problem where the query is of the type “isq approximatelyinD?”for a number of different notions of “approximate”, some of which arise in image processing and template matching, while others are of the string-edit type that arise in biologicalsequence comparisons. New techniques are needed in this framework of approximate searching, because each notion of “approximate equality”introduces its own set of difficulties; using encryption is more problem-atic in this framework because the items that are approximately equal cease to be so after encryption or cryptographic hashing. Practical pro-tocols for solving such problems make possible new forms of e-commerce between proprietary database owners and customers who seek to query the database, with privacy.
We first present four secure remote database access models that are used in the e-commerce, each of which has different privacy requirement.We then present our solutions for achieving privacy in each of these four models.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Agrawal, C. Faloutsos and A. Swami Efficient similarity search in sequence databases. InProceeding of the Fourth Int’l Conference on Foundations of Data Organization and Algorithms October 1993. Also in Lecture Notes in Computer Science 730, Springer Verlag, 1993, 69–84.
A. Apostolico and Z. Galil, editors.Pattern Matching Algorithms.Oxford University Press, 1997.
S. Arya. Ph.d thesis: Nearest neighbor searching and applications. Technical Report CS-TR-3490, University of Maryland at College Park, June 1995.
M. Atallah and J. Rice. Secure outsourcing of scientific computations. Technical Report COAST TR 98–15, Department of Computer Science, Purdue University, 1998.
N. Beckmann, H-P. Kriegel, R. Schneider, B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. InACM SIGMOD Workshop on Data Mining and Knowledge Discoverypages 322–331, Atlantic City, NJ, 1990.
C. Cachin, S. Micali and M. Stadler. Computationally private information retrieval with polylogarithmic communication.Advances in Cryptology: EUROCRYPT ‘89,Lecture Notes in Computer Science, 1592:402–414, 1999.
B. Chor, N. Gilboa and M. Naor. Private information retrieval by keywords. Technical Report TR CS0917, Department of Computer Science, Technion, 1997.
B. Chor and N. Gilboa. Computationally private information retrieval (extended abstract).In Proceedings of the twenty-ninth annual ACM symposium on Theory of computingEl Paso, TX USA, May 4–6 1997.
B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private information retrieval. InProceedings of IEEE Symposium on Foundations of Computer ScienceMilwaukee, WI USA, October 2325 1995.
M. Crochemore and W. Rytter.Text Algorithms.Oxford University Press, 1994.
G. Di-Crescenzo, Y. Ishai and R. Ostrovsky.Universal service-providers for database private information retrieval. InProceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, September 21 1998.
Y. Gertner, S. Goldwasser and T. Malkin. A random server model for private information retrieval. In2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM ‘88)1998.
Y. Gertner, Y. Ishai, E. Kushilevitz and T. Malkin. Protecting data privacy in private information retrieval schemes. InProceedings of the thirtieth annual ACM symposium on Theory of computingDallas, TX USA, May 24–26 1998.
O. Goldreich. Secure multi-party com-putation (working draft).Available fromhttp://www.wisdom.weizmann.ac.il/home/oded/public_html/foc.html/home/oded/public_html/foc.html/foc.html
S. Goldwasser. Multiparty computations: Past and present.In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computingSanta Barbara, CA USA, August 21–24 1997.
O. Goldreich, S. Micali and A. Wigderson. How to play any mental game. InProceedings of the 19th annual ACM symposium on Theory of computingpages 218–229, 1987.
R. Gonzalezi and R. Woods.Digital Image Processing. Addison-Wesley, Reading, MA, 1992.
D. Gusfield.Algorithms on Strings Trees and Sequences: Computer Science and Comutational Biology. Cambridge University Press, 1997.
A. Guttman. R-trees: a dynamic index structure for spatial searching. InACM SIGMOD Workshop on Data Mining and Knowledge Discoverypages 163–174, Boston, MA, 1984.
Y. Ishai and E. Kushilevitz. Improved upper bounds on information-theoretic private information retrieval (extended abstract). InProceedings of the thirty-first annual ACM symposium on Theory of computingAtlanta, GA USA, May 1–4 1999.
A. Jain.Fundamentals of Digital Image Processing.Prentice Hall, Englewood Cliffs, NJ, 1989.
J. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In Proceedings of the 29th ACM Symposium on Theory of Computing, 1997.
E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. InProceedings of the 38th annual IEEE computer society conference on Foundation of Computer Science, Miami Beach, Florida USA, October 20–22 1997.
M. K. Reiter and A. D. Rubin. Crowds: anonymity for web transaction.ACM Transactions on Information and System Security1(1):Pages 66–92, 1998.
Hanan Samet. Multidimensional data structures. In Mikhail J. Atallah, editorAlgorithms and Theory of Computation Handbookchapter 18. CRC Press, 1999.
D. Song, D. Wagner and A. Perrig. Practical techniques for searches on encrypted data.In Proceedings of 2000 IEEE Symposium on Security and PrivacyOakland, California, USA, May 14–17 2000.
P. F. Syverson, D. M. Goldschlag and M. G. Reed. Anonymous connections and onion routing. InProceedings of 1997 IEEE Symposium on Security and PrivacyOakland, California, USA, May 5–7 1997.
A. Yao. Protocols for secure computations. InProceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Du, W., Atallah, M.J. (2001). Protocols for Secure Remote Database Access with Approximate Matching. In: Ghosh, A.K. (eds) E-Commerce Security and Privacy. Advances in Information Security, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1467-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1467-1_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5568-7
Online ISBN: 978-1-4615-1467-1
eBook Packages: Springer Book Archive