Information integration across autonomous enterprises
Patent 7290150 Issued on October 30, 2007. Estimated Expiration Date: June 9, 2023. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
A system, method, and computer program product for processing a query spanning separate databases while revealing only minimal information beyond a query answer, by executing only specific information-limiting protocols according to query type.
Other References
A. C. Yao. How to generate and exchange secrets. In Proc. of the 27th Annual Symposium on Foundations of Computer Science, pp. 162-167, Toronto, Canada, Oct. 1986.
G. Wiederhold. Intelligent integration of information. In Proc. of the ACM SIGMOD Conf. on Management of Data, Washington, DC, 1993.
J. Valdya and C. W. Clifton. Privacy preserving association rule mining in vertically partitioned data. In Proc. of the 8th ACM SIGKDD Int'l Conference on Knowledge Discovery and Data Mining, Edmonton, Canada, Jul. 2002.
D. R. Stinson. Cryptography: Theory and Practice, chapter 4. Chapman & Hall/CRC, second edition, 2002.
S. W. Smith and D. Safford. Practical private information retrieval with secure coprocessors. Research Report RC 21806, IBM, Jul. 2000.
A. Shoshani. Statistical databases: Characteristics, problems and some solutions. In Proc. of the Eigth Int'l Conference on Very Large Databases, pp. 208-213,Mexico City, Mexico, Sep. 1982.
C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28 4:656-715, 1949.
A. Shamir, R. L. Rivest, and L. M. Adleman. Mental poker. Technical Memo MIT LCS TM 125, Laboratory for Computer Science, MIT, Feb. 1979.
G. Salton and M. McGill. Introduction toModern Information Retrieval. McGraw Hill, New York, 1983.
S. J. Rizvi and J. R. Haritsa. Privacy preserving association rule mining. In Proc. of the 28th In'l Conference on Very Large Databases, Aug. 2002.
M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR 81, Aiken Computation Laboratory, Harvard University, 1981.
B. Preneel. Analysis and design of cryptographic hash functions. Ph.D. dissertation, Katholieke Universiteit Leuven, 1992.
M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. of the 1st ACM Conference on Electronic Commerce, pp. 129-139, Denver, Colorado, Nov. 1999.
M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Proc. of the 12th Annual ACM SIAM Symposium on Discrete Algorithms, pp. 448-457, Washington DC, USA, Jan. 2001.
M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proc. of the 31th ACM Symposium on Theory of Computing, pp. 245-254, Atlanta, Georgia, 1999.
M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. of the ACM Symposium on Theory of Computing, pp. 590-599, 2001.
Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177-206, 2002.
E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. of the IEEE Symp. on Found. of Computer Science (FOCS), 1997.
M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Jun. 2002.
N. Jefferies, C. Mitchell, and M. Walker. A proposed architecture for trusted third party services. In Cryptography Policy and Algorithms Conference. Springer LNCS v 1029 pp. 98-104, Jul. 1995.
P. Ipeirotis and L. Gravano. Distributed search over the hidden web: Hierarchical database sampling and selection. In 28th Int'l Conference on Very Large Databases, Hong Kong, China, Aug. 2002.
B. A. Huberman, M. Franklin, and T. Hogg. Enhancing privacy and trust in electronic communities. In Proc. of the 1st ACM Conference on Electronic Commerce, pp. 78-86, Denver, Colorado, Nov. 1999.
L. M. Haas, R. J. Miller, B. Niswonger, M. T. Roth, P. M. Schwarz, and E. L. Wimmers. Transforming heterogeneous data with database middleware: Beyond integration. IEEE Data Engineering Bulletin, 22(1), 1999.
O. Goldreich. Secure multi-party computation. Working Drat, Version 1.3, Jun. 2001.
Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. In ACM Symposium on Theroy of Computing, pp. 151-160, 1998.
A. Flat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko, editor Advances in Cryptology, Proceedings of Crypto 86. vol. 263 of Lecture Notes in computer Science, pp. 186-194. Springer-Verlag, 1987.
I. Fellegi. On the question of statistical confidentiality. Journal of the American Statistical Assoc., 67(337):7-18, Mar. 1972.
A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of assiciation rules. In Proc. of the 8th ACM SIGKDD Int'l Conference on Knowledge Discovery and Data Mining, Edmonton, Canada, Jul. 2002.
A. Elmagarmid, M. Rusinkiewicz, and A. Sheth, editors. Management of Heterogeneous & Autonomous Database Systems. Morgan Kaufmann, 1999.
T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, IT-31(4):469-472, Jul. 1985.
D.Dobkin, A. Jones, and R. Lipton. Secure databases: Protection against user influence. ACM Transactions on Database Systems, 4(1):97-106, Mar. 1979.
W. Diffie and M. Hellman. New directions in crytography. IEEE Transactions on Information Theory, IT-22(6):644-654, Nov. 1976.
D. Denning, P. Denning, and M. Schwartz. The tracker: A threat to statistical database security. ACM Transactions on Database Systems, 4(1):76-96, Mar. 1979.
U. Dayal and H.-Y. Hwang. View definition and generalization for database integration in a multidatabase system. IEEE Transactions on Software Eng., 10(6):628-645, 1984.
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In IEEE Symposium on Foundations of Computer Science, pp. 41-50, 1995.
B. Chor and N. Giboa. Computationally private information retrieval. In Proc. of 29th ACM Symposium on Theory of Computing, pp. 304-313, 1997.
F. Chin and G. Ozsoyoglu. Auditing and Inference control in statistical databases. IEEE Transactions on Software Eng., SE-8(6):113-139, Apr. 1982.
S. Chawathe, H. Garcia-Molina, J. Hammer, K. Ireland, Y. Papakonstantinou, J. Ullman, and J. Widom. The TSIMMIS project: Integration of heterogeneous Information sources. In 16th Meeting of the Information Processing Society of Japan, pp. 7-18, Tokyo, Japan, 1994.
C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polyogarithmic communication. In Theory and Application of Cryptographic Techniques, pp. 402-414, 1999.
D. Boneh. The Decision diffie-hellman problem. In Proc. of the 3rd International Algorithmic Number Theory Symposium, vol. 1423 of Lecture Notes in computer Science, pp. 48-63, Portland, Oregon, USA, Jun. 1998. Springer-Verlag.
J. C. Benaloh and M. de Mare. One-way accumulators: A decentrallzed alternative to digital signatures. In Advances in Cryptology—EUROCRYPT'93, Workshop on the Theory and Application of Cryptographic Techniques, vol. 765 of Lecture Notes in Computer Science, pp. 274-285, Lofthus, Norway, May 1993. Speinger-Verlag.
M. Bellare and P. Rogaway. Randon oracles are practical: A paradigm for designing efficient protocols. In Proc. of the First ACM Conf. on Computer and Communications Security, pp. 62-73, Fairfax, Virginia, 1993.
S. Ajmani, R. Morris, and B. Liskov. A trusted third-party computation service. Technical Report MIT-LCS-TR-847, MIT, May 2001.
R. Agrawal and R. Srikant. Privacy preserving data mining. In ACM SIGMOD Conference on Management of Data, pp. 439-450, Dallas, Texas, May 2000.
R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. An XPath-based preference language for P3P. In Proc. of the 12th In'l World Wide Web Conference,Budapest, Hungary, May 2003.
R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Implementing P3P using database technology. In Proc. of the 19th Int'l Conference on Data Engineering, Bangalore, India, Mar. 2003.
R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Hippocratic databases. In Proc. of the 28th Int'l Conference on Very Large Databases, Hong Kong, China, Aug. 2002.
R. Agrawal and J. Kiernan. Watermarking relational databases. In 28th Int'l Conference on Very Large Databases, Hong Kong, China, Aug. 2002.
N. R. Adam and J. C. Wortman. Security control methods for statistical databases. ACMComputing Surveys, 21(4):515-556, Dec. 1989.
Hakan Hacigumus, Bala Iyer, Chen Li, Sharaf Mehrotra, UC Irvine—“Executing SQL Over Encrypted Data in the Databased-Service-Provider Model”, Proceedings of the 2002 ACM SIGMOND, International Conference on Management of Data, 2002, pp. 216-227.
Chris Clifton, Murat Kantarcioglu, Jaideep Vaidya, Xiaodong Lin, Micharl Y. Zhu, Purdue University, IN—“Tools for Privacy Preserving Distributed Data Mining”, ACM SIGKDD Exploration Newsletter, vol. 4, Issu 2, 2002, pp. 28-34.
June 9, 2023. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
