System and method for order-preserving encryption for...

Electrical computers and digital processing systems: support – Data processing protection using cryptography – By stored data protection

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S803000, C707S804000

Reexamination Certificate

active

07873840

ABSTRACT:
A system, method, and computer program product to automatically eliminate the distribution information available for reconstruction from a disguised dataset. The invention flattens input numerical values into a substantially uniformly distributed dataset, then maps the uniformly distributed dataset into equivalent data in a target distribution. The invention allows the incremental encryption of new values in an encrypted database while leaving existing encrypted values unchanged. The flattening comprises (1) partitioning, (2) mapping, and (3) saving auxiliary information about the data processing, which is encrypted and not updated. The partitioning is MDL based, and includes a growth phase for dividing a space into fine partitions and a prune phase for merging some partitions together.

REFERENCES:
patent: 5077793 (1991-12-01), Falk et al.
patent: 5673316 (1997-09-01), Auerback et al.
patent: 5719941 (1998-02-01), Swift et al.
patent: 5724573 (1998-03-01), Agrawal et al.
patent: 5734885 (1998-03-01), Agrawal et al.
patent: 5930789 (1999-07-01), Agrawal et al.
patent: 6094651 (2000-07-01), Agrawal et al.
patent: 6105133 (2000-08-01), Fielder et al.
patent: 6226742 (2001-05-01), Jakubowski et al.
patent: 6490720 (2002-12-01), Carlsen et al.
patent: 6651048 (2003-11-01), Agrawal et al.
patent: 2002/0129260 (2002-09-01), Benfield et al.
patent: 2002/0186839 (2002-12-01), Parker et al.
patent: 11212455 (1999-08-01), None
Towards Traceability across Sovereign, Distributed RFID Databases Rakesh Agrawal; Alvin Cheung; Karin Kailing; Stefan Schonauer; Database Engineering and Applications Symposium, 2006. IDEAS '06. 10th International Publication Year: 2006, pp. 174-184.
Rights protection for categorical data Sion, R.; Atallah, M.; Prabhakar, S.; Knowledge and Data Engineering, IEEE Transactions on vol. 17, Issue 7, Jul. 2005 pp. 912-926.
Rights protection for discrete numeric streams Sion, R.; Atallah, M.; Prabhaka, S.; Knowledge and Data Engineering, IEEE Transactions on vol. 18, Issue 5, May 2006 pp. 699-714.
A survey of data protection technologies Chung-Yen Chang; Electro Information Technology, 2005 IEEE International Conference on May 22-25, 2005 p. 6.
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.
N. Ahituv, Y. Lapid, and S. Neumann. Processing encrypted data. Communications of the ACM, 30(9):777-780, 1987.
G. Bebek. Anti-tamper database research: Inference control techniques. Technical Report EECS 433 Final Report, Case Western Reserve University, Nov. 2002.
L. Bouganimand, P. Pucheral. Chip-secured data access: Confidential data on untrusted servers. In Proc. of the VLDB Conference, p. 131-142,Hong Kong, China, Aug. 2002.
C. Boyens and O. Gunther. Trust is not enough: Privacy and security in ASP and web service environments. In 6th East-European Conference on Advances in Databases and Information Systems, Bratislava, Slovakia, Sep. 2002.
Z. J. Czech, G. Havas, and B. S. Majewski. An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters, 43(5):257-264, 1992.
E. Damiani, S. D. C. di Vimercati, S. Jajodia, S. Paraboschi, and P. Samarati. Balancing confidentiality and efficiency in untrusted relational DBMSs. In Proc. of the 10th ACM Conf. on Computer and Communications Security (CCS), Oct. 2003.
D. Denning. Cryptography and Data Security. Addison-Wesley, 1982.
J. Domingo-Ferrer and J. Herrera-Joancomarti. A privacy homomorphism allowing field operations on encrypted data, 1998.
J. Domingo i Ferror. A new privacy homomorphism and applications. Information Processing Letters, 60(5):277-282, 1996.
J. Feigenbaum, M. Y. Liberman, and R. N. Wright. Cryptographic protection of databases and software. In Proc. of the DIMACS Workshop on Distributed Computing and Cryptography, 1990.
E. A. Fox, Q. F. Chen, A. M. Daoud, and L. S. Heath. Order preserving minimal perfect hash functions and information retrieval. ACM Transactions on Information Systems (TOIS), 9:281-308, 1991.
S. C. Gultekin Ozsoyoglu, David Singer. Anti-tamper databases: Querying encrypted databases. In Proc. of the 17th Annual IFIP WG 11.3 Working Conference on Database and Applications Security, Estes Park, Colorado, Aug. 2003.
H. Hacigumus, B. R. Iyer, C. Li, and S. Mehrotra. Executing SQL over encrypted data in the database-service-provider model. In Proc. of the ACM SIGMOD Conf. on Management of Data, Madison,Wisconsin, Jun. 2002.
H. Hacigumus, B. R. Iyer, and S. Mehrotra. Providing database as a service. In Proc. of the Int'l Conf. on Data Engineering, San Jose, California, Mar. 2002.
T. Hamilton. Error sends bank files to eBay. The Toronto Star, Sep. 15, 2003.
Y. E. Ioannidis. The history of histograms (abridged). In Proc. of 29th Int'l Conf. on Very Large Data Bases (VLDB), Berlin, Germany, Sep. 2003.
A. Konig and G. Weikum. Combining histograms and parametric curve fitting for feedback-driven query result-size estimation. In Proc. of the 25th Int'l Conference on Very Large Databases (VLDB '99), 1999.
M. Mehta, R. Agrawal, and J. Rissanen. SLIQ: A fast scalable classifier for data mining. In Proc. of the Fifth Int'l Conference on Extending Database Technology (EDBT), Avignon, France, Mar. 1996.
T. M. Mitchell. Machine Learning, chapter 6. McGraw-Hill, 1997.
Oracle Corporation. Database Encryption in Oracle 8i, Aug. 2000.
W. H. Press, S. A. Teukolsky,W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, second edition, 1992.
J. Rissanen. Stochastic Complexity in Statistical Inquiry. World Scientific Publ. Co., 1989.
R. L. Rivest, L.Adelman, and M. L. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation, p. 169-178, 1978.
California's Senate Bill 1386 http://info.sen.ca.gov/pub/01-02/bill/sen/sb1351-1400/sb1386bill20020926chaptered.html.
D. R. Stinson. Cryptography: Theory and Practice. CRC Press, 2nd edition, 2002.
R. Vingralek. Gnatdb: A small-footprint, secure database system. In Proc. of the VLDB Conference, p. 884-893,Hong Kong, China, Aug. 2002.
National Institute of Standards and Technology, U.S. Department of Commerce. Digital Signature Standard, May 1994.
R. Rivest. The MD5 message digest algorithm. RFC 1320, Apr. 1992.
[27] D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In IEEE Symp. on Security and Privacy, Oakland, California, 2000.
Schneier. Applied Cryptography. John Wiley, second edition, 1996.
Kazuo Ohta, “A Secure and Efficient Broadcast Technique for Encrypted Communication”, NTT Review US, vol. 2, No. 2, Mar. 1990, pp. 107-115.
Kazuo Ohta, “A Secure and Efficient Broadcast Technique for Encrypted Communication”, NTT Review JP, vol. 39, No. 2, 1990. pp. 765-774.
Edward Sciore et al., “Using Semantic Values to Facilitate Interoperability Among Heterogeneous Information Systems”, ACM Transactions on Database Systems, vol.19, No. 2, Jun. 1994, pp. 254-290.

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

System and method for order-preserving encryption for... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for order-preserving encryption for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for order-preserving encryption for... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2707021

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