Protocols for Secure Remote Database Access with Approximate Matching
暂无分享,去创建一个
[1] Yuval Ishai,et al. Improved upper bounds on information-theoretic private information retrieval (extended abstract) , 1999, STOC '99.
[2] Dan Gusfield. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[3] Martín Abadi,et al. On Hiding Information from an Oracle , 1987, Proceeding Structure in Complexity Theory.
[4] Yuval Ishai,et al. Protecting data privacy in private information retrieval schemes , 1998, STOC '98.
[5] Jon M. Kleinberg,et al. Two algorithms for nearest-neighbor search in high dimensions , 1997, STOC '97.
[6] Tal Malkin,et al. A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication , 1997 .
[7] Z. Galil,et al. Pattern matching algorithms , 1997 .
[8] Paul F. Syverson,et al. Anonymous connections and onion routing , 1997, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).
[9] Hanan Samet. Multidimensional Data Structures , 1999, Algorithms and Theory of Computation Handbook.
[10] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[11] Christian Cachin,et al. Efficient private bidding and auctions with an oblivious third party , 1999, CCS '99.
[12] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[13] C. Faloutsos. Eecient Similarity Search in Sequence Databases , 1993 .
[14] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[15] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[16] Adi Shamir,et al. How to share a secret , 1979, CACM.
[17] Niv Gilboa,et al. Computationally private information retrieval (extended abstract) , 1997, STOC '97.
[18] Josh Benaloh,et al. Dense Probabilistic Encryption , 1999 .
[19] Eyal Kushilevitz,et al. Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[20] Moni Naor,et al. Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..
[21] Michael K. Reiter,et al. Crowds: anonymity for Web transactions , 1998, TSEC.
[22] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[23] Moti Yung,et al. Distributing the power of a government to enhance the privacy of voters , 1986, PODC '86.
[24] Thomas S. Huang,et al. Image processing , 1971 .
[25] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[26] Martín Abadi,et al. On hiding information from an oracle , 1987, STOC '87.
[27] Rafail Ostrovsky,et al. Universal service-providers for database private information retrieval (extended abstract) , 1998, PODC '98.
[28] A. Guttmma,et al. R-trees: a dynamic index structure for spatial searching , 1984 .
[29] Shafi Goldwasser,et al. Multi party computations: past and present , 1997, PODC '97.
[30] Dawn Xiaodong Song,et al. Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.
[31] Eugene H. Spafford,et al. Secure outsourcing of scientific computations , 2001, Adv. Comput..
[32] Bruce Schneier,et al. Applied cryptography : protocols, algorithms, and source codein C , 1996 .
[33] Anil K. Jain. Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.
[34] S. Arya. Nearest neighbor searching and applications , 1996 .
[35] Wojciech Rytter,et al. Text Algorithms , 1994 .
[36] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.