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

10459013

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: 5204966 (1993-04-01), Wittenberg et al.
patent: 5491752 (1996-02-01), Kaufman et al.
patent: 5742807 (1998-04-01), Masinter
patent: 5903651 (1999-05-01), Kocher
patent: 5933604 (1999-08-01), Inakoshi
patent: 5966542 (1999-10-01), Tock
patent: 6006200 (1999-12-01), Boies et al.
patent: 6289334 (2001-09-01), Reiner 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: 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/0128274 (2004-07-01), Snapp 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: 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).
Copy of 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).

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-3817331

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