System and method for committing to a set

Data processing: database and file management or data structures – Data integrity – Using checksum

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07831573

ABSTRACT:
The disclosed embodiments relate to a system and method of committing to a data set, comprising forming a directed acyclic graph adapted to encode the data set, the directed acyclic graph having a plurality of pointers and a plurality of nodes wherein at least one node has multiple parents, the directed acyclic graph having at least one root node and a plurality of leaf nodes. Further, disclosed embodiments comprise committing to the directed acyclic graph to produce a committed-to data set and producing a plurality of proofs about the committed-to data set such that a combination of the plurality of proofs does not reveal information about which nodes have multiple parents, each proof comprising a trace from one of the plurality of nodes to at least one different node, the trace comprising the identities of the nodes and pointers traversed.

REFERENCES:
patent: 5754938 (1998-05-01), Herz et al.
patent: 5794210 (1998-08-01), Goldhaber et al.
patent: 5848396 (1998-12-01), Gerace
patent: 5857175 (1999-01-01), Day et al.
patent: 5933811 (1999-08-01), Angles et al.
patent: 5974398 (1999-10-01), Hanson et al.
patent: 5987252 (1999-11-01), Leino et al.
patent: 5991734 (1999-11-01), Moulson
patent: 6047327 (2000-04-01), Tso et al.
patent: 6085216 (2000-07-01), Huberman et al.
patent: 6108639 (2000-08-01), Walker et al.
patent: 6182050 (2001-01-01), Ballard
patent: 6182068 (2001-01-01), Culliss
patent: 6195698 (2001-02-01), Lillibridge et al.
patent: 6199067 (2001-03-01), Geller
patent: 6324519 (2001-11-01), Eldering
patent: 6353925 (2002-03-01), Stata et al.
patent: 6396833 (2002-05-01), Zhang et al.
patent: 6539377 (2003-03-01), Culliss
patent: 6546390 (2003-04-01), Pollack et al.
patent: 6560588 (2003-05-01), Minter
patent: 6567507 (2003-05-01), Shaffer et al.
patent: 6614764 (2003-09-01), Rodeheffer et al.
patent: 6618814 (2003-09-01), Gaur et al.
patent: 6654743 (2003-11-01), Hogg et al.
patent: 6665710 (2003-12-01), Bates et al.
patent: 6670964 (2003-12-01), Ward et al.
patent: 6681059 (2004-01-01), Thompson
patent: 6718365 (2004-04-01), Dutta
patent: 6721275 (2004-04-01), Rodeheffer et al.
patent: 6735589 (2004-05-01), Bradley et al.
patent: 6738978 (2004-05-01), Hendricks et al.
patent: 6771290 (2004-08-01), Hoyle
patent: 6832207 (2004-12-01), Shkedi
patent: 6834195 (2004-12-01), Brandenberg et al.
patent: 6850247 (2005-02-01), Reid et al.
patent: 6937291 (2005-08-01), Gryskiewicz
patent: 6938021 (2005-08-01), Shear et al.
patent: 6983311 (2006-01-01), Haitsuka et al.
patent: 7010176 (2006-03-01), Kusunoki
patent: 7034848 (2006-04-01), Sobol
patent: 7035469 (2006-04-01), Laaksonen
patent: 7061509 (2006-06-01), Dischert et al.
patent: 7064867 (2006-06-01), Lapstun et al.
patent: 7065247 (2006-06-01), Lapstun et al.
patent: 7130841 (2006-10-01), Goel et al.
patent: 7155508 (2006-12-01), Sankuratripati et al.
patent: 7260573 (2007-08-01), Jeh et al.
patent: 7305691 (2007-12-01), Cristofalo
patent: 7310612 (2007-12-01), McQueen et al.
patent: 2001/0036224 (2001-11-01), Demello et al.
patent: 2001/0041566 (2001-11-01), Xanthos et al.
patent: 2001/0042132 (2001-11-01), Mayadas
patent: 2002/0048369 (2002-04-01), Ginter et al.
patent: 2002/0052778 (2002-05-01), Murphy et al.
patent: 2002/0082923 (2002-06-01), Merriman et al.
patent: 2002/0099605 (2002-07-01), Weitzman et al.
patent: 2002/0102992 (2002-08-01), Koorapaty et al.
patent: 2002/0124098 (2002-09-01), Shaw
patent: 2002/0138353 (2002-09-01), Schreiber et al.
patent: 2002/0156677 (2002-10-01), Peters et al.
patent: 2002/0178257 (2002-11-01), Cerrato
patent: 2003/0014304 (2003-01-01), Calvert et al.
patent: 2003/0023589 (2003-01-01), Castle
patent: 2003/0028451 (2003-02-01), Ananian
patent: 2003/0033199 (2003-02-01), Coleman
patent: 2003/0037041 (2003-02-01), Hertz
patent: 2003/0046244 (2003-03-01), Shear et al.
patent: 2003/0050839 (2003-03-01), Shiomi
patent: 2003/0110497 (2003-06-01), Yassin et al.
patent: 2003/0149572 (2003-08-01), Newton et al.
patent: 2003/0171995 (2003-09-01), Dezonno et al.
patent: 2003/0187726 (2003-10-01), Bull et al.
patent: 2003/0212745 (2003-11-01), Caughey
patent: 2004/0133793 (2004-07-01), Ginter et al.
patent: 2004/0153456 (2004-08-01), Charnock et al.
patent: 2004/0168190 (2004-08-01), Saari et al.
patent: 2004/0193602 (2004-09-01), Liu et al.
patent: 2004/0215711 (2004-10-01), Martin et al.
patent: 2005/0177387 (2005-08-01), Mojsa
patent: 2005/0183143 (2005-08-01), Anderholm et al.
patent: 2005/0265313 (2005-12-01), Poikselka
patent: 2006/0058948 (2006-03-01), Blass et al.
patent: 2006/0090184 (2006-04-01), Zito et al.
patent: 2007/0067297 (2007-03-01), Kublickis
patent: 2008/0077558 (2008-03-01), Lawrence et al.
patent: WO-97/17774 (1997-05-01), None
patent: WO-9834189 (1998-08-01), None
Martel, Chip et al., “A General Model for Authenticated Data Structures,” Dec. 6, 2001, UC Davis Department of Computer Science, pp. 1-18.
Mark Lillibridge, Translucent Sums: A Foundation for Higher-Order Mosule Systems, Dec. 12, 1996.
Mark Lillibridge, Exceptions Are Strictly More Powerful Than Call/CC, Jul. 1995.
Mark Lillibridge, Unchecked Exceptions can be Strictly More Powerful than Call/CC, Nov. 25, 1995.
Robert Harper and Mark Lillibridge, Operational Interpretation of an Extension of Fw with Control Operators, Jan. 1993.
Robert Harper and Mark Lillibridge, Polymorphic Type Assignment and CPS Conversion, 1993.
Mark Lillibridge, et al., A Cooperative Internet Backup Scheme, Jun. 2003.
Cormac Flanaganet al., Extended Static Checking for Java, Jun. 2002.
Philippe Golle, et al., Incentives for Sharing in Peer-to-Peer Networks, Nov. 2001.
Robert Harper, et al., A Type-Theoretic Approach to Higher-Order Modules with Sharing, Jan. 1994.
Robert Harper, et al., Explicit Polymorphism and CPS conversion, Jan. 1993.
Robert Harper, et al., Polymorphic Type Assignment and CPS Conversion, Jun. 1992.
Bernardo A. Huberman and Rajan M. Lukose, Social Dilemmas and Internet Congestion, Jul. 25, 1997.
Bernardo A. Huberman et al., Strong Regularities in World Wide Web Surfing, Apr. 1998.
Rajan M. Lukose, et al., Surfing as a Real Option, 1998.
Lada A. Adamic, Search in power-law networks, Sep. 28, 2001.
Dejan S. Milojicic, et al., Peer-to-Peer Computing, Mar. 8, 2002.
Eytan Adar, et al., Shock: Aggregating Information While Preserving Privacy, 2003.
Lada A. Adamic et al., Local Search in Unstructured Networks, Jun. 3, 2002.
Rajan M. Lukose, Shock: Communicating with Computational Messages and Automatic Private Profiles, 2003.
A Methodology for Managing Risk in Electronic Transactions over the Internet, 2000.
Marcos K. Aguilera, et al., Block-Level Security for Network-Attached Disks, Mar. 2003.
Rafail Ostrovsky, et al., Efficient Consistency Proofs for Generalized Queries on a Committed Database, Jul. 20, 2004.
Silvio Micali, et al., Zero-Knowledge Sets, 2003.
Ralph C. Merkle, Protocols for Public Key Cryptosystems, 1980.
Chip Martel, et al., A General Model for Authenticated Data Structures, Dec. 6, 2001.
Borders, Kevin et al., “Web Tap: Detecting Covert Web Traffic”,University of Michigan, Department of Electrical Engineering and Computer Science, (Oct. 25-29, 2004), 1-11.
“Oxford English Dictionary Online Definitition of “Spyware”, OED.com, (Aug. 2004), 7-8.
Stern, Richard H., “FTC cracks down on spyware and PC hijacking, but not true lies”,IEEE Computer Society, (Feb. 2005), 1-4.
Gallagher, et al., “A Framework for Targeting Banner Advertising on the Internet”,IEEE 13th Annual Hawwaii International Conference, 1997.
Gain Corporation, “GAIN-Home”, http://www.gatoradvertisinginformationnetwork.com, 1-2.
Webcash Generator, “A Get Paid to Surf and Free Money Programs”, http://www.webcashgenerator.com, (Aug. 11, 2002),1-2.
Kraut, et al., “Markets for Attention: Will Postage for Email Help?”CSCW'02-ACM, (Nov. 16, 2002), 1-10.
Olsen, Stefanie “In Search of Profits-Tech News” CNET News.Com http:/
ews.com/2030-1032-1000366.html, (May 8, 2003), 1-4.
Damgard, et al., “The Theory and Implementa

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 committing to a set 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 committing to a set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for committing to a set will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4250017

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