Information integration across autonomous enterprises

Data processing: database and file management or data structures – Database and file access – Query optimization

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S770000, C713S193000

Reexamination Certificate

active

08041706

ABSTRACT:
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.

REFERENCES:
patent: 5826261 (1998-10-01), Spencer
patent: 5963642 (1999-10-01), Goldstein
patent: 5978789 (1999-11-01), Griffin et al.
patent: 6148295 (2000-11-01), Megiddo et al.
patent: 6421657 (2002-07-01), Sinnott, Jr.
patent: 6449609 (2002-09-01), Witkowski
patent: 6477534 (2002-11-01), Acharya et al.
patent: 6507840 (2003-01-01), Ionnidis et al.
patent: 6519591 (2003-02-01), Cereghini et al.
patent: 6532458 (2003-03-01), Ghaudhuri et al.
patent: 6928554 (2005-08-01), Dettinger et al.
patent: 7290150 (2007-10-01), Agrawal et al.
patent: 2001/0013035 (2001-08-01), Cohen
patent: 2002/0091989 (2002-07-01), Cole et al.
patent: 2002/0161757 (2002-10-01), Mock et al.
patent: 2003/0014373 (2003-01-01), Perge et al.
patent: 2003/0055814 (2003-03-01), Chen et al.
patent: 2003/0061205 (2003-03-01), Cleghorn et al.
patent: 2003/0112969 (2003-06-01), Algesheimer et al.
Du, Protocols for Secure Remote Database Access with Approximate Matching, 2000, pp. 1-20.
N. R. Adam and J. C. Wortman. Security-control methods for statistical databases. ACMComputing Surveys, 21(4):515-556, Dec. 1989.
R. Agrawal and J. Kiernan. Watermarking relational databases. In 28th Int'l Conference on Very LargeDatabases, Hong Kong, China, Aug. 2002.
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, 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. An XPath-based preference language for P3P. In Proc. of the 12th Int'l World Wide Web Conference,Budapest, Hungary, May 2003.
R. Agrawal and R. Srikant. Privacy preserving data mining. In ACM SIGMOD Conference on Management of Data, pp. 439-450, Dallas, Texas, May 2000.
S. Ajmani, R. Morris, and B. Liskov. A trusted third-party computation service. Technical Report MIT-LCS-TR-847, MIT, May 2001.
M. Bellare and P. Rogaway. Random 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.
J. C. Benaloh and M. De Mare. One-way accumulators: A decentralized 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. Springer-Verlag.
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.
C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Theory and Application of Cryptographic Techniques, pp. 402-414, 1999.
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.
F. Chin and G. Ozsoyoglu. Auditing and inference control in statistical databases. IEEE Transactions on Software Eng., SE-8(6):113-139, Apr. 1982.
B. Chor and N. Gilboa. Computationally private information retrieval. In Proc. of 29th ACM Symposium on Theory of Computing, pp. 304-313, 1997.
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In IEEE Symposium on Foundations of Computer Science, pp. 41-50, 1995.
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.
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.
W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, Nov. 1976.
D.Dobkin, A. Jones, and R. Lipton. Secure databases: Protection against user influence. ACM Transactions on Database Systems, 4(1):97-106, Mar. 1979.
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.
A. Elmagarmid, M. Rusinkiewicz, and A. Sheth, editors. Management of Heterogeneous& Autonomous Database Systems. Morgan Kaufmann, 1999.
A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In Proc. of the 8th ACM SIGKDD Int'l Conference on Knowledge Discovery and Data Mining, Edmonton, Canada, Jul. 2002.
I. Fellegi. On the question of statistical confidentiality. Journal of the American Statistical Assoc., 67(337):7-18, Mar. 1972.
A. Fiat 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.
Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. In ACM Symposium on Theory of Computing, pp. 151-160, 1998.
O. Goldreich. Secure multi-party computation. Working Draft, Version 1.3, Jun. 2001.
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.
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.
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.
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.
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.
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.
Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177-206, 2002.
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.
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 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, 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.
B. Preneel. Analysis and design of cryptographic hash functions. Ph.D. dissertation, Katholieke Universiteit Leuven, 1992.
M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
S. J. Rizvi and J. R. Haritsa. Privacy-preserving association rule mining. In Proc. of the 28th Int'l Conference on Very Large Databases, Aug. 2002.
G

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Information integration across autonomous enterprises does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Information integration across autonomous enterprises, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information integration across autonomous enterprises will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4254508

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.