Optimization of a binary tree traversal with secure...

Details Optimization of a binary tree traversal with secure... Optimization of a binary tree traversal with secure...

2007-03-27

2007-03-27

Kim, Ahshik (Department: 2876)

Registers

Records

Conductive

C235S375000

Reexamination Certificate

active

10693687

ABSTRACT:
Methods and systems for the negotiation of a population of RFID tags with improved security is provided. In one aspect, a binary traversal is performed to singulate tags without using information that directly identifies the tags in the tag population. A key is generated to identify each RFID tag of the population of RFID tags. The generated key does not include bits identifying an item with which the particular RFID tag is associated. A binary tree algorithm is operated to identify one or more tags in the population of RFIDs tags using the generated keys. In another aspect, frequency hopping and/or spread spectrum techniques are used to provide improved security while negotiating tags. In another aspect, the reader causes the tags to scroll series of bits back to the reader for each bit sent to the tags to provide improved security.

REFERENCES:
patent: 3520406 (1970-07-01), Turner
patent: 3689885 (1972-09-01), Kaplan et al.
patent: 4225953 (1980-09-01), Simon et al.
patent: 4418411 (1983-11-01), Strietzel
patent: 4471345 (1984-09-01), Barrett, Jr.
patent: 4495496 (1985-01-01), Miller, III
patent: 4533871 (1985-08-01), Boetzkes
patent: 4598275 (1986-07-01), Ross et al.
patent: 4636950 (1987-01-01), Caswell et al.
patent: 4656463 (1987-04-01), Anders et al.
patent: 4862160 (1989-08-01), Ekchian et al.
patent: 4931788 (1990-06-01), Creswick
patent: 5124699 (1992-06-01), Tervoert et al.
patent: 5214409 (1993-05-01), Beigel
patent: 5245534 (1993-09-01), Waterhouse et al.
patent: 5266925 (1993-11-01), Vercellotti et al.
patent: 5289372 (1994-02-01), Guthrie et al.
patent: 5313052 (1994-05-01), Watanabe et al.
patent: 5339073 (1994-08-01), Dodd et al.
patent: 5365551 (1994-11-01), Snodgrass et al.
patent: 5390360 (1995-02-01), Scop et al.
patent: 5410315 (1995-04-01), Huber
patent: 5420577 (1995-05-01), Kim et al.
patent: 5430441 (1995-07-01), Bickley et al.
patent: 5434572 (1995-07-01), Smith
patent: 5434775 (1995-07-01), Sims et al.
patent: 5444223 (1995-08-01), Blama
patent: 5446447 (1995-08-01), Carney et al.
patent: 5478991 (1995-12-01), Watanabe et al.
patent: 5489908 (1996-02-01), Orthmann et al.
patent: 5499017 (1996-03-01), Beigel
patent: 5500650 (1996-03-01), Snodgrass et al.
patent: 5515053 (1996-05-01), Hecht et al.
patent: 5519381 (1996-05-01), Marsh et al.
patent: 5528222 (1996-06-01), Moskowitz et al.
patent: 5528232 (1996-06-01), Verma et al.
patent: 5537105 (1996-07-01), Marsh et al.
patent: 5539394 (1996-07-01), Cato et al.
patent: 5539775 (1996-07-01), Tuttle et al.
patent: 5541928 (1996-07-01), Kobayashi et al.
patent: 5550547 (1996-08-01), Chan et al.
patent: 5557280 (1996-09-01), Marsh et al.
patent: 5566441 (1996-10-01), Marsh et al.
patent: 5576692 (1996-11-01), Tompkins et al.
patent: 5583850 (1996-12-01), Snodgrass et al.
patent: 5591951 (1997-01-01), Doty
patent: 5627517 (1997-05-01), Theimer et al.
patent: 5627544 (1997-05-01), Snodgrass et al.
patent: 5640151 (1997-06-01), Reis et al.
patent: 5646607 (1997-07-01), Schurmann et al.
patent: 5648765 (1997-07-01), Cresap et al.
patent: 5648767 (1997-07-01), O'Connor et al.
patent: 5673037 (1997-09-01), Cesar et al.
patent: 5680459 (1997-10-01), Hook et al.
patent: 5686888 (1997-11-01), Welles, II et al.
patent: 5686902 (1997-11-01), Reis et al.
patent: 5689239 (1997-11-01), Turner et al.
patent: 5774876 (1998-06-01), Woolley et al.
patent: 5798693 (1998-08-01), Engellenner
patent: 5841770 (1998-11-01), Snodgrass et al.
patent: 5940006 (1999-08-01), MacLellan et al.
patent: 5995019 (1999-11-01), Chieu et al.
patent: 6107910 (2000-08-01), Nysen
patent: 6177858 (2001-01-01), Raimbault et al.
patent: 6226300 (2001-05-01), Hush et al.
patent: 6397334 (2002-05-01), Chainer et al.
patent: 6412086 (2002-06-01), Friedman et al.
patent: 6433671 (2002-08-01), Nysen
patent: 6531957 (2003-03-01), Nysen
patent: 6538563 (2003-03-01), Heng
patent: 6580358 (2003-06-01), Nysen
patent: 6714120 (2004-03-01), Blama et al.
patent: 6720888 (2004-04-01), Eagleson et al.
patent: 6725014 (2004-04-01), Voegele
patent: 6727803 (2004-04-01), Hulvey
patent: 6774766 (2004-08-01), Moyer
patent: 6950009 (2005-09-01), Nysen
patent: 2003/0019929 (2003-01-01), Stewart et al.
patent: 2004/0074963 (2004-04-01), Pierce et al.
patent: 2004/0135674 (2004-07-01), Shanks et al.
patent: 0 494 114 (1992-07-01), None
patent: 0 496 986 (1992-08-01), None
patent: 0 578 457 (1994-01-01), None
patent: 0 585 132 (1994-03-01), None
patent: 0 598 624 (1994-05-01), None
patent: 0 615 285 (1994-09-01), None
patent: WO 03/050757 (2003-06-01), None
International Search Report for Application No. PCT/US03/34036, mailed May 21, 2004.
Supplementary European Search Report for Application No. EP 03 77 7912, mailed Jul. 21, 2006 (3 pages).

Affiliated with

Also associated with

Rating

Optimization of a binary tree traversal with secure... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimization of a binary tree traversal with secure..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of a binary tree traversal with secure... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3734059