Method and system for efficiently retrieving secured data by...

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000

Reexamination Certificate

active

07549053

ABSTRACT:
A method and system for efficiently retrieving secured data by securely pre-processing provided access information, provides data store security based on only a single piece of access information, which is generally public, such as the proper name of a business or individual that is used to retrieve mailing address information. The access information is hashed for access to a secured data store and efficient access and low data storage for permutations of input access information are provided by verifying the presence of an entry for the hashed access information in a look-up table. If an entry is found, the data store is accessed using the hashed access information, but if an entry is not found, another look-up table corresponding to another information type may be tried or the input access information permuted and retried.

REFERENCES:
patent: 4871903 (1989-10-01), Carrell et al.
patent: 5204966 (1993-04-01), Wittenberg et al.
patent: 5420403 (1995-05-01), Allum et al.
patent: 5491752 (1996-02-01), Kaufman et al.
patent: 5742807 (1998-04-01), Masinter
patent: 5819291 (1998-10-01), Haimowitz et al.
patent: 5893120 (1999-04-01), Nemes
patent: 5903651 (1999-05-01), Kocher
patent: 5933604 (1999-08-01), Inakoshi
patent: 5966542 (1999-10-01), Tock
patent: 6006200 (1999-12-01), Boles et al.
patent: 6289334 (2001-09-01), Reiner et al.
patent: 6289450 (2001-09-01), Pensak et al.
patent: 6308247 (2001-10-01), Ackerman et al.
patent: 6347376 (2002-02-01), Attwood et al.
patent: 6457012 (2002-09-01), Jatkowski
patent: 6516320 (2003-02-01), Odom et al.
patent: 6754785 (2004-06-01), Chow et al.
patent: 6763344 (2004-07-01), Osentoski et al.
patent: 7124408 (2006-10-01), Parthasarathy et al.
patent: 7159119 (2007-01-01), Wilson et al.
patent: 7302582 (2007-11-01), Snapp et al.
patent: 2001/0044783 (2001-11-01), Weisberg et al.
patent: 2002/0049670 (2002-04-01), Moritsu et al.
patent: 2003/0028783 (2003-02-01), Collins et al.
patent: 2003/0177021 (2003-09-01), Dutta
patent: 2004/0065598 (2004-04-01), Ross et al.
patent: 2004/0111443 (2004-06-01), Wong et al.
patent: 2004/0128247 (2004-07-01), Sato et al.
patent: 2004/0128274 (2004-07-01), Snapp et al.
patent: 2004/0181670 (2004-09-01), Thune et al.
patent: 2004/0210763 (2004-10-01), Jonas
patent: 2005/0060556 (2005-03-01), Jonas
patent: 2005/0066182 (2005-03-01), Jonas et al.
patent: 44 21 640 (1995-08-01), None
patent: 0 381 418 (1990-08-01), None
patent: WO 2004/023711 (2004-03-01), None
Carter et al., “Exact and Approximate Membership Testers,” ACM 10thSTOC, pp. 59-65, (1978).
Bellare et al.; “Collision-Resistant Hashing: Towards Making UOWHFs Practical”; Proceedings of the Annual Int'l Cryptology Conference (CRYPTO); Berlin, Springer, Germany; vol. Conf. 17, pp. 470-484, (1997).
International Search Report for PCT/US01/26125 mailed Mar. 26, 2002.
“IBM DB2 Anonymous Resolution Version 3.8 Technical Information,” Publication of IBM Corporation, USA, May 2005 (2 pages).
Friedrich, Andrew, “IBM DB2 Anonymous Resolution: Knowledge Discovery Without Knowledge Disclosure,” Whitepaper of IBM Corporation, USA, May 2005 (23 pages).
“DB2 Anonymous Resolution for Public Safety, Corrections, & Criminal Intelligence,” Publication of IBM Corporation, USA, Feb. 2005 (2 pages).
“DB2 Anonymous Resolution,” Publication of IBM Corporation, USA, May 2005 (2 pages).
Lohr, Steve, “I.B.M. Software Aims to Provide Security Without Sacrificing Privacy,” The New York Times, May 24, 2005 (2 pages).
“Application of DB2 Anonymous Resolution to the Financial Services Industry,” Whitepaper of IBM Corporation, USA, May 2005 (17 pages).
Office Action, dated Jul. 16, 2008, for U.S. Appl. No. 11/638,445, filed Dec. 14, 2006 (9 pages).
Pre-Interview Communication, dated Sep. 12, 2008 for U.S. Appl. No. 11/231,989, filed Sep. 22, 2005 (3 pages); and Second Preliminary Amendment, filed Aug. 20, 2008, including listing of pending claims (9 pages).
PCT International Search Report, dated Oct. 17, 2003 and Written Opinion, dated Aug. 2, 2004 for International Application No. PCT/US03/18412 (12 pages).
PCT Written Opinion, dated Feb. 13, 2003, International Preliminary Examination Report, completed May 6, 2003, and International Search Report, dated Mar. 26, 2002, for International Application No. PCT/US01/26125 (12 pages).
PCT International Search Report, dated May 23, 2003, for International Application No. PCT/US03/06672 (5 pages), PCT International Preliminary Examination Report, completed Oct. 31, 2003, mailed Nov. 12, 2003 (4 pages).
First Examination Report from the Government of India Patent Office, dated Dec. 1, 2006 for Patent Application No. 577/KOLNP/2005 (3 pages).
Notice of Allowance and Allowability, dated Jul. 1, 2008, for U.S. Appl. No. 10/377,989, filed Feb. 28, 2003 (5 pages); Office Action, mailed Apr. 15, 2005 (4 pages); and Response to Office Action filed Aug. 15, 2005, including listing of allowed claims (10 pages).
Office Action, dated Nov. 28, 2006, for U.S. Appl. No. 10/344,990, filed Feb. 20, 2003 (4 pages).
Office Action, dated Apr. 4, 2006, for U.S. Appl. No. 10/344,990, filed Feb. 20, 2003 (8 pages).
Office Action, dated Oct. 27, 2005, for U.S. Appl. No. 10/459,013, filed Jun. 11, 2003 (12 pages).
Office Action, dated Mar. 24, 2005, for U.S. Appl. No. 10/459,013, filed Jun. 11, 2003 (14 pages).
Office Action, dated Sep. 3, 2004, for U.S. Appl. No. 10/459,013, filed Jun. 11, 2003 (12 pages).
Office Action, dated Sep. 20, 2004, for U.S. Appl. No. 10/377,989, filed Sep. Feb. 28, 2003 (4 pages).
Office Action, dated Aug. 7, 2008, for U.S. Appl. No. 10/231,989, filed Sep. 22, 2005 (15 pages).
Pre-Interview Communication, dated Sep. 12, 2008, for U.S. Appl. No. 11/231,989, filed Sep. 22, 2005 (3 pages).
Pre-Interview First Office Action, dated Dec. 2, 2008, for U.S. Appl. No. 11/231,989, filed Sep. 22, 2005 (3 pages).
Interview Summary, dated Nov. 30, 2004, for U.S. Appl. No. 10/459,013, filed Jun. 11, 2003 (2 pages).
Interview Summary, dated Sep. 21, 2005, for U.S. Appl. No. 10/459,013, filed Jun. 11, 2003 (2 pages).
Notice of Allowance and Allowability, dated Jul. 17, 2007, for U.S. Appl. No. 10/344,990 (6 pages), with Response to Office Action, filed May 29, 2007, including listing of allowed claims (22 pages).
Notice of Allowance and Allowability, dated May 17, 2006, for U.S. Appl. No. 10/459,013 (16 pages), with Reply Under 37 C.F.R. § 1.111, filed Apr. 27, 2006, including listing of allowed claims (9 pages).
PCT Written Opinion, dated Feb. 13, 2003, for International Application No. PCT/US01/26125 (4 pages).
PCT International Search Report, dated Mar. 26, 2002, for International Application No. PCT/US01/26125 (4 pages).
PCT Written Opinion, dated Sep. 7, 2006, for International Application No. PCT/US03/12711 (8 pages).
Supplementary European Search Report, dated Feb. 17, 2009, for European Application No. 03739087.9-1525 (3 pages).
Chinese Office Action, dated Nov. 21, 2008, for Chinese Application No. 03824536.1 (14 pages).

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

Method and system for efficiently retrieving secured data by... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for efficiently retrieving secured data by..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for efficiently retrieving secured data by... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4129294

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