The present invention relates to the secure distribution of digitized value-added information, or media content, while preserving the ability of publishers to make available unsecured versions of the same value-added information, or media content, without adverse effect to the systems security.
Authentication, verification and authorization are all handled with a combination of cryptographic and steganographic protocols to achieve efficient, trusted, secure exchange of digital information.
This application also incorporates by reference the following applications: pending U.S. patent application Ser. No. 08/999,766, filed Jul. 23, 1997, entitled “Steganographic Method and Device”; U.S. patent application Ser. No. 08/772,222, filed Dec. 20, 1996, entitled “Z-Transform Implementation of Digital Watermarks” (issued as U.S. Pat. No. 6,078,664); U.S. patent application Ser. No. 09/456,319, filed Dec. 8, 1999, entitled “Z-Transform Implementation of Digital Watermarks” (issued as U.S. Pat. No. 6,853,726); U.S. patent application Ser. No. 08/674,726, filed Jul. 2, 1996, entitled “Exchange Mechanisms for Digital Information Packages with Bandwidth Securitization, Multichannel Digital Watermarks, and Key Management” (issued as U.S. Pat. No. 7,362,775); U.S. patent application Ser. No. 09/545,589, filed Apr. 7, 2000, entitled “Method and System for Digital Watermarking” (issued as U.S. Pat. No. 7,007,166); U.S. patent application Ser. No. 09/046,627, filed Mar. 24, 1998, entitled “Method for Combining Transfer Function with Predetermined Key Creation” (issued as U.S. Pat. No. 6,598,162); U.S. patent application Ser. No. 09/053,628, filed Apr. 2, 1998, entitled “Multiple Transform Utilization and Application for Secure Digital Watermarking” (issued as U.S. Pat. No. 6,205,249); U.S. patent application Ser. No. 09/281,279, filed Mar. 30, 1999, entitled “Optimization Methods for the Insertion, Protection, and Detection . . . ” (issued as U.S. Pat. No. 6,522,767); U.S. patent application Ser. No. 09/594,719, filed Jun. 16, 2000, entitled “Utilizing Data Reduction in Steganographic and Cryptographic Systems” (issued as U.S. Pat. No. 7,123,718) (which is a continuation-in-part of PCT application No. PCT/US00/06522, filed 14 Mar. 2000, which PCT application claimed priority to U.S. Provisional Application No. 60/125,990, filed 24 Mar. 1999); and U.S. patent application Ser. No. 09/731,040, entitled “Systems, Methods and Devices for Trusted Transactions,” filed Dec. 7, 2000 (issued as U.S. Pat. No. 7,159,116) which claimed priority to U.S. Application No. 60/169,274, filed Dec. 7, 1999, entitled “Systems, Methods And Devices For Trusted Transactions.” All of the patent applications previously identified in this paragraph are hereby incorporated by reference, in their entireties, as if fully stated herein.
The music industry is at a critical inflection point. Digital technology enables anyone to make perfect replica copies of musical recordings from the comfort of their home, or as in some circumstances, in an offshore factory. Internet technology enables anyone to distribute these copies to their friends, or the entire world. Indeed, virtually any popular recording is already likely available in the MP3 format, for free if you know where to look.
How the industry will respond to these challenges and protect the rights and livelihoods of copyright owners and managers and has been a matter of increasing discussion, both in private industry forums and the public media. Security disasters like the cracking of DVD-Video's CSS security system have increased doubt about the potential for effective robust security implementations. Meanwhile, the success of non-secure initiatives such as portable MP3 players lead many to believe that these decisions may have already been made.
Music consumers have grown accustomed to copying their music for their own personal use. This fact of life was written into law in the United States via the Audio Home Recording Act of 1992. Millions of consumers have CD players and purchase music in the Compact Disc format. It is expected to take years for a format transition away from Red Book CD Audio to reach significant market penetration.
Hence, a need exists for a new and improved system for protecting digital content against unauthorized copying and distribution.
A local content server system (LCS) for creating a secure environment for digital content is disclosed, which system comprises: a communications port in communication for connecting the LCS via a network to at least one Secure Electronic Content Distributor (SECD), which SECD is capable of storing a plurality of data sets, is capable of receiving a request to transfer at least one content data set, and is capable of transmitting the at least one content data set in a secured transmission; a rewritable storage medium whereby content received from outside the LCS may be stored and retrieved; a domain processor that imposes rules and procedures for content being transferred between the LCS and devices outside the LCS; and a programmable address module which can be programmed with an identification code uniquely associated with the LCS. The LCS is provided with rules and procedures for accepting and transmitting content data. Optionally, the system may further comprise: an interface to permit the LCS to communicate with one or more Satellite Units (SU) which may be connected to the system through the interface, which SUs are capable of receiving and transmitting digital content; at least one SU; and/or at least one SECD. The SECD may have a storage device for storing a plurality of data sets, as well as a transaction processor for validating the request to purchase and for processing payment for a request to retrieve one of the data sets. The SECD typically includes a security module for encrypting or otherwise securitizing data which the SECD may transmit.
A method for creating a secure environment for digital content for a consumer is also disclosed. As part of the method, a LCS requests and receives a digital data set that may be encrypted or scrambled. The digital data set may be embedded with at least one robust open watermark, which permits the content to be authenticated. The digital data set is preferably be embedded with additional watermarks which are generated using information about the LCS requesting the copy and/or the SECD which provides the copy. Once received by the LCS, the LCS exercises control over the content and only releases the data to authorized users. Generally, the data is not released until the LCS embeds at least one additional watermark based upon protected information associated with the LCS and/or information associated with the user.
Another embodiment of the method of the present invention comprises: connecting a Satellite Unit to an local content server (LCS), sending a message indicating that the SU is requesting a copy of a content data set that is stored on the LCS, said message including information about the identity of the SU; analyzing the message to confirm that the SU is authorized to use the LCS; retrieving a copy of the requested content data set; assessing whether a secured connection exists between the LCS and the SU; if a secured connection exists, embedding a watermark into the copy of the requested content data set, said watermark being created based upon information transmitted by the SU and information about the LCS; and delivering the content data set to the SU for its use.
The SU may also request information that is located not on the LCS, but on an SECD, in which case, the LCS will request and obtain a copy from the SECD, provided the requesting SU is authorized to access the information.
Digital technology offers economies of scale to value-added data not possible with physical or tangible media distribution. The ability to digitize information both reduces the cost of copying and enables perfect copies. This is an advantage and a disadvantage to commercial publishers who must weigh the cost reduction against the real threat of unauthorized duplication of their value-added data content. Because cost reduction is an important business consideration, securing payment and authenticating individual copies of digital information (such as media content) presents unique opportunities to information service and media content providers. The present invention seeks to leverage the benefits of digital distribution to consumers and publishers alike, while ensuring the development and persistence of trust between all parties, as well as with any third parties involved, directly or indirectly, in a given transaction.
In another approach that is related to this goal, there are instances where transactions must be allowed to happen after perceptually-based digital information can be authenticated. (Perceptually based information is information whose value is in large part, based upon its ability to be perceived by a human, and includes for example, acoustic, psychoacoustic, visual and psychovisual information.) The process of authenticating before distributing will become increasingly important for areas where the distributed material is related to a trust-requiring transaction event. A number of examples exist. These include virtual retailers (for example, an on-line music store selling CDs and electronic versions of songs); service providers (for example, an on-line bank or broker who performs transactions on behalf of a consumer); and transaction providers (for example, wholesalers or auction houses). These parties have different authentication interests and requirements. By using the teachings of this application, these interests and requirements may be separated and then independently quantified by market participants in shorter periods of time.
All parties in a transaction must authenticate information that is perceptually observable before trust between the parties can be established. In today's world, information (including perceptually rich information) is typically digitized, and as a result, can easily be copied and redistributed, negatively impacting buyers, sellers and other market participants. Unauthorized redistribution confuses authenticity, non-repudiation, limit of ability and other important “transaction events.” In a networked environment, transactions and interactions occur over a transmission line or a network, with buyer and seller at different points on the line or network. While such electronic transactions have the potential to add value to the underlying information being bought and sold (and the potential to reduce the cost of the transaction), instantaneous piracy can significantly reduce the value of the underlying data, if not wholly destroy it. Even the threat of piracy tends to undermine the value of the data that might otherwise exist for such an electronic transaction.
Related situations range from the ability to provably establish the “existence” of a virtual financial institution to determining the reliability of an “electronic stamp.” The present invention seeks to improve on the prior art by describing optimal combinations of cryptographic and steganographic protocols for “trusted” verification, confidence and non-repudiation of digitized representations of perceptually rich information of the actual seller, vendor or other associated institutions which may not be commercial in nature (confidence building with logo's such as the SEC, FDIC, Federal Reserve, FBI, etc. apply). To the extent that an entity plays a role in purchase decisions made by a consumer of goods and services relating to data, the present invention has a wide range of beneficial applications. One is enabling independent trust based on real world representations that are not physically available to a consumer or user. A second is the ability to match informational needs between buyers and sellers that may not be universally appealing or cost effective in given market situations. These include auction models based on recognition of the interests or demand of consumers and market participants which make trading profitable by focusing specialized buyers and sellers. Another use for the information matching is to establish limits on the liability of such institutions and profit-seeking entities, such as insurance providers or credit companies. These vendors lack appropriate tools for determining intangible asset risk or even the value of the information being exchanged. By encouraging separate and distinct “trust” arrangements over an electronic network, profitable market-based relationships can result.
The present invention can make possible efficient and openly accessible markets for tradable information. Existing transaction security (including on-line credit cards, electronic cash or its equivalents, electronic wallets, electronic tokens, etc.) which primarily use cryptographic techniques to secure a transmission channel—but are not directly associated or dependent on the information being sold—fails to meet this valuable need. The present invention proposes a departure from the prior art by separating transactions from authentication in the sale of digitized data. Such data may include videos, songs, images, electronic stamps, electronic trademarks, and electronic logos used to ensure membership in some institutional body whose purpose is to assist in a dispute, limit liability and provide indirect guidance to consumers and market participants, alike.
With an increasingly anonymous marketplace, the present invention offers invaluable embodiments to accomplish “trusted” transactions in a more flexible, transparent manner while enabling market participants to negotiate terms and conditions. Negotiation may be driven by predetermined usage rules or parameters, especially as the information economy offers potentially many competitive marketplaces in which to transact, trade or exchange among businesses and consumers. As information grows exponentially, flexibility becomes an advantage to market participants, in that they need to screen, filter and verify information before making a transaction decision. Moreover, the accuracy and speed at which decisions can be made reliably enables confidence to grow with an aggregate of “trusted transactions”. “Trusted transactions” beget further “trusted transactions” through experience. The present invention also provides for improvements over the prior art in the ability to utilize different independently important “modules” to enable a “trusted transaction” using competitive cryptographic and steganographic elements, as well as being able to support a wide variety of perceptually-based media and information formats. The envisioned system is not bound by a proprietary means of creating recognition for a good or service, such as that embodied in existing closed system. Instead, the flexibility of the present invention will enable a greater and more diverse information marketplace.
The present invention is not a “trusted system”, per se, but “trusted transactions” are enabled, since the same value-added information that is sought may still be in the clear, not in a protected storage area or closed, rule-based “inaccessible virtual environment”.
A related additional set of embodiments regards the further separation of the transaction and the consumer's identification versus the identification of the transaction only. This is accomplished through separated “trusted transactions” bound by authentication, verification and authorization in a transparent manner. With these embodiments, consumer and vendor privacy could be incorporated. More sophisticated relationships are anticipated between parties, who can mix information about their physical goods and services with a transparent means for consumers, who may not be known to the seller, who choose not to confide in an inherently closed “trusted system” or provide additional personal information or purchasing information (in the form of a credit card or other electronic payment system), in advance of an actual purchase decision or ability to observe (audibly or visibly) the content in the clear. This dynamic is inconsistent with the prior art's emphasis on access control, not transparent access to value-added information (in the form or goods or services), that can be transacted on an electronic or otherwise anonymous exchange.
These embodiments may include decisions about availability of a particular good or service through electronic means, such as the Internet, or means that can be modularized to conduct a transaction based on interconnection of various users (such as WebTV, a Nintendo or Sony game console with network abilities, cellular phone, PalmPilot, etc.). These embodiments may additionally be implemented in traditional auction types (including Dutch auctions). Consumers may view their anonymous marketplace transactions very differently because of a lack of physical human interactions, but the present invention can enable realistic transactions to occur by maintaining open access and offering strict authentication and verification of the information being traded. This has the effect of allowing legacy relationships, legacy information, and legacy business models to be offered in a manner which more closely reflects many observable transactions in the physical world. The tremendous benefits to sellers and consumers is obvious; existing transactions need not reduce their expectations of security. As well, the ability to isolate and quantify aspects of a transaction by module potentially allows for better price determinations of intangible asset insurance, transaction costs, advertising costs, liability, etc. which have physical world precedent.
It is contemplated that the publisher and/or owner of the copyrights will want to dictate restrictions on the ability of the purchaser to use the data being sold. Such restrictions can be implemented through the present invention, which presents a significant advantage over the prior art (which attempts to effect security through access control and attempted tight reigns over distribution). See U.S. Pat. No. 5,428,606 for a discussion on democratizing digital information exchange between publishers and subscribers of said information.
A goal for providers of value-added content is to maximize profits for the sale of their content. Marketing and promotion of the informational content cannot be eliminated, considering the ever-increasing amount of information vying for consumers and other market participant's attention. Nonetheless, in a market where the goods are speculatively valued, marketing budgets are inherently constrained, as you are trying to create demand for a product with little inherent value. Where such markets have participants, both buyers and sellers and their respective agents, with access to the same information in real time, market mechanisms efficiently price the market goods or services. These markets are characterized by “price commoditization” so buyers and sellers are limited to differentiating their offerings by selection and service. If the markets are about information itself, it has proven more difficult to accurately forecast the target price where sellers can maximize their profits. Quality and quantity provide different evaluation criteria of selection and service relating to the information being traded. The present invention regards a particular set of implementations of value-added content security in markets which may include unsecured and secure versions of the same value-added data (such as songs, video, research, pictures, electronic logos, electronic trademarks, value-added information, etc.).
Transactions for value-added information can occur without any physical location. So, there is a need for a secure personal content server for which the value added information can be offered for transactions in a manner similar to real world transactions. One feature is to offer seemingly similar value added information in differing quality settings. These settings have logical relationships with fidelity and discreteness and are determined by market participants. Another issue is that because purchasers may be anonymous to sellers, it is more important to have a particular value-added information object available so that market participants can fulfill their role are consumers.
One fundamental weakness of current information markets is the lack of mechanisms to ensure that buyers and sellers can reach pricing equilibrium. This deficit is related to the “speculative”, “fashion”, and “vanity” aspects of perceptual content (such as music, video, and art or some future recognition to purchasers). For other goods and services being marketed to an anonymous marketplace, market participants may never see (and indeed, may choose to never see, an actual location where the transaction may physically occur. A physical location may simply not exist. There are a number of such virtual operations in business today, which would benefit from the improvements offered under the present system.
The present invention also seeks to provide improvements to the art in enabling a realistic model for building trust between parties (or their agents) not in a “system”, per se. Because prior art systems lack any inherent ability to allow for information to flow freely to enable buyers and sellers to react to changing market conditions. The present invention can co-exist with these “trusted systems” to the extent that all market participants in a given industry have relatively similar information with which to price value-added data. The improvement over such systems, however, addresses a core features in most data-added value markets: predictions, forecasts, and speculation over the value of information is largely an unsuccessful activity for buyers and sellers alike. The additional improvement is the ability to maintain security even with unsecured or legacy versions of value-added information available to those who seek choices that fit less quantitative criteria—“aesthetic quality” of the information versus “commercial price”. Purchase or transaction decisions can be made first by authenticating an electronic version of a song, image, video, trademark, stamp, currency, etc.
Additional anticipated improvements include the ability to support varying pricing models such as auctions that are difficult or impossible to accomplish under existing prior art that leaves all access and pricing control with the seller alone, and the separation of the transaction from the exchange of the value-added information, which gives more control to buyers over their identities and purchasing habits, (both sensitive and separately distinct forms of “unrelated” value-added information). Essentially, no system known in the art allows for realistic protocols to establish trust between buyers and sellers in a manner more closely reflecting actual purchasing behavior of consumers and changing selling behavior of sellers. The goal in such transactions is the creation of trust between parties as well as “trusted relationships” with those parties. The present invention is an example of one such system for media content where the “aesthetic” or “gestalt” of the underlying content and its characteristics is a component of buying habits. Without an ability to open distribution systems to varying buyers and sellers, media content may be priced at less than maximum economic value and buyers may be deprived of a competitive, vigorous marketplace for exciting media content from many different creative participants.
To the extent that recognition plays such a key role in an information economy, value-added data should be as accessible as possible to the highest number of market participants in the interests of furthering creativity and building a competitive marketplace for related goods and services. This is to the benefit of both buyers and sellers as well as the other participants in such an economic ecosystem. The Internet and other transmission-based transactions with unknown parties presents a number of challenges to information vendors who wish to develop customer relations, trust and profitable sales. The information economy is largely an anonymous marketplace, thus, making it much more difficult to identify consumers and sellers. The present invention provides remedies to help overcome these weaknesses.
The present invention is concerned with methods and systems which enable secure, paid exchange of value-added information, while separating transaction protocols. The present invention improves on existing means for distribution control by relying on authentication, verification and authorization that may be flexibly determined by both buyers and sellers. These determinations may not need to be predetermined, although pricing matrix and variable access to the information opens additional advantages over the prior art. The present invention offers methods and protocols for ensuring value-added information distribution can be used to facilitate trust in a large or relatively anonymous marketplace (such as the Internet's World Wide Web).
We now define components of the preferred embodiments for methods, systems, and devices.
Local Content Server (LCS): A device or software application which can securely store a collection of value-added digital content. The LCS has a unique ID.
Secure Electronic Content Distributor (SECD): An entity, device or software application which can validate a transaction with a LCS, process a payment, and deliver digital content securely to a LCS. In cryptographic terms, the SECD acts as a “certification authority” or its equivalent. SECDs may have differing arrangements with consumers and providers of value-added information. (The term “content” is used to refer generally to digital data, and may comprise video, audio, or any other data that is stored in a digital format).
Satellite Unit (SU): A portable medium or device which can accept secure digital content from a LCS through a physical, local connection and which can either play or make playable the digital content. The SU may have other functionality as it relates to manipulating the content, such as recording. The SU has a unique ID. An SU may be a CD player, a video camera, a backup drive, or other electronic device which has a storage unit for digital data.
LCS Domain: A secure medium or area where digital content can be stored, with an accompanying rule system for transfer of digital content in and out of the LCS Domain. The domain may be a single device or multiple devices—all of which have some common ownership or control. Preferably, a LCS domain is linked to a single purchasing account. Inside the domain, one can enjoy music or other digital data without substantial limitations—as typically a license extends to all personal use.
SecureChannel™: A secure channel to pass individualized content to differentiate authentic content from legacy or unauthorized, pirated content. For example, the Secure Channel may be used as an auxiliary channel through which members of the production and distribution chain may communicate directly with individual consumers. Preferably, the Secure Channel is never exposed and can only be accessed through legitimate methods. SecureChannel may carry a value-adding component (VAC). The ability to provide consumers with value adding features will serve to give consumers an incentive to purchase new, secure hardware and software that can provide the additional enhanced services. The SecureChannel may also include protected associated data (“PAD”)—data which is associated with a user and/or a particular set of content.
Standard Quality: A transfer path into the LCS Domain which maintains the digital content at a predetermined reference level or degrades the content if it is at a higher quality level. In an audio implementation, this might be defined as Red Book CD Quality (44100 Hz., 16 bits, 2 channels). This transfer path can alternately be defined in terms of a subset of VAC's or a quality level associated with particular VAC's. If a VAC is not in the subset, it is not passed. If a VAC is above the defined quality level, it is degraded.
Low Quality: A transfer path into the LCS Domain which degrades the digital content to a sub-reference level. In an audio implementation, this might be defined as below CD Quality (for instance, 32000 Hz., 16 bits, 2 channels). This transfer path can alternately be defined in terms of an absence of VAC's or a degraded quality level associated with particular VAC's.
High Quality: A transfer path into the LCS Domain which allows digital content of any quality level to pass unaltered. This transfer path can alternately be defined in terms of a complete set of VAC's or the highest quality level available associated with particular VAC's.
Rewritable Media: An mass storage device which can be rewritten (e.g. hard drive, CD-RW, Zip cartridge, M-O drive, etc. . . . ).
Read-Only Media: A mass storage device which can only be written once (e.g. CD-ROM, CD-R, DVD, DVD-R, etc. . . . ). Note: pre-recorded music, video, software, or images, etc. are all “read only” media.
Unique ID: A Unique ID is created for a particular transaction and is unique to that transaction (roughly analogous to a human fingerprint). One way to generate a Unique ID is with a one-way hash function. Another way is by incorporating the hash result with a message into a signing algorithm will create a signature scheme. For example, the hash result may be concatenated to the digitized, value added information which is the subject of a transaction. Additional uniqueness may be observed in a hardware device so as to differentiate that device, which may be used in a plurality of transactions, from other similar devices.
Value-added: Value-added information is differentiated from non-commoditized information in terms of its marketability or demand, which can vary, obviously, from each market that is created for the information. By way of example, information in the abstract has no value until a market is created for the information (i.e., the information becomes a commodity). The same information can be packaged in many different forms, each of which may have different values. Because information is easily digitized, one way to package the “same” information differently is by different levels of fidelity and discreteness. Value is typically bounded by context and consideration.
Authentication: A receiver of a “message” (embedded or otherwise within the value-added information) should be able to ascertain the original of the message (or by effects, the origin of the carrier within which the message is stored). An intruder should not be able to successfully represent someone else. Additional functionality such as Message Authentication Codes (MAC) could be incorporated (a one-way hash function with a secret key) to ensure limited verification or subsequent processing of value-added data.
Verification: In cryptographic terms, “verification” serves the “integrity” function to prevent an intruder from substituting false messages for legitimate ones. In this sense, the receiver of the message (embedded or otherwise present within the value-added information) should be assured that the message was not modified or altered in transit.
One-way hash function: One-way hash functions are known in the art. A hash function is a function which converts an input into an output, which is usually a fixed-sized output. For example, a simple hash function may be a function which accepts a digital stream of bytes and returns a byte consisting of the XOR function of all of the bytes in the digital stream of input data. Roughly speaking, the hash function may be used to generate a “fingerprint” for the input data. The hash function need not be chosen based on the characteristics of the input. Moreover, the output produced by the hash function (i.e., the “hash”) need not be secret, because in most instances it is not computationally feasible to reconstruct the input which yielded the hash. This is especially true for a “one-way” hash function—one that can be used to generate a hash value for a given input string, but which hash cannot be used (at least, not without great effort) to create an input string that could generate the same hash value.
Authorization: A term which is used broadly to cover the acts of conveying official sanction, permitting access or granting legal power to an entity.
Encryption: For non digitally-sampled data, encryption is data scrambling using keys. For value-added or information rich data with content characteristics, encryption is typically slow or inefficient because content file sizes tend to be generally large. Encrypted data is called “ciphertext”.
Scrambling: For digitally-sampled data, scrambling refers to manipulations of the value-added or information rich data at the inherent granularity of the file format. The manipulations are associated with a key, which may be made cryptographically secure or broken into key pairs. Scrambling is efficient for larger media files and can be used to provide content in less than commercially viable or referenced quality levels. Scrambling is not as secure as encryption for these applications, but provides more fitting manipulation of media rich content in the context of secured distribution. Scrambled data is also called “ciphertext” for the purposes of this invention. Encryption generally acts on the data as a whole, whereas scrambling is applied often to a particular subset of the data concerned with the granularity of the data, for instance the file formatting. The result is that a smaller amount of data is “encoded” or “processed” versus strict encryption, where all of the data is “encoded” or “processed.” By way of example, a cable TV signal can be scrambled by altering the signal which provides for horizontal and vertical tracking, which would alter only a subset of the data, but not all of the data—which is why the audio signal is often untouched. Encryption, however, would generally so alter the data that no recognizable signal would be perceptually appreciated. Further, the scrambled data can be compared with the unscrambled data to yield the scrambling key. The difference with encryption is that the ciphertext is not completely random, that is, the scrambled data is still perceptible albeit in a lessened quality. Unlike watermarking, which maps a change to the data set, scrambling is a transfer function which does not alter or modify the data set.
The LCS Domain is a logical area inside which a set of rules governing content use can be strictly enforced. The exact rules can vary between implementations, but in general, unrestricted access to the content inside the LCS Domain is disallowed. The LCS Domain has a set of paths which allow content to enter the domain under different circumstances. The LCS Domain also has paths which allow the content to exit the domain.
A simple example provides insight into the scope of an LCS domain. If an LCS is assigned to an individual, then all music, video, and other content data which has lawfully issued to the individual may be freely used on that persons LCS domain (though perhaps “freely” is misleading, as in theory, the individual has purchased a license). A LCS Domain may comprise multiple SUs, for example, a video player, a CD player, etc. An individual may be authorized to take a copy of a song and play it in another's car stereo, but only while the individual's device or media is present. Once the device is removed, the friend's LCS will no longer have a copy of the music to play.
The act of entering the LCS Domain includes a verification of the content (an authentication check). Depending upon the source of the content, such verification may be easier or harder. Unvalidateable content will be subjected to a quality degradation. Content that can be validated but which belongs to a different LCS Domain will be excluded. The primary purpose of the validation is to prevent unauthorized, high-quality, sharing of content between domains.
When content leaves the LCS Domain, the exiting content is embedded with information to uniquely identify the exiting content as belonging to the domain from which the content is leaving. It is allowed to leave at the quality level at which the content was originally stored in the LCS Domain (i.e. the quality level determined by the validation path). For example, the exiting content may include an embedded digital watermark and an attached hash or digital signature; the exiting content may also include a time stamp—which itself may be embedded or merely attached). Once it has exited, the content cannot return to the domain unless both the watermark and hash can be verified as belonging to this domain. The presence of one or the other may be sufficient to allow re-entry, or security can be set to require the presence of more than one identification signal.
This system is designed to allow a certifiable level of security for high-quality content while allowing a device to also be usable with unsecured content at a degraded quality level. The security measures are designed such that a removal of the watermark constitutes only a partial failure of the system. The altered content (i.e., the content from which the watermark has been removed or the content in which the watermark has been degraded) will be allowed back into the LCS Domain, but only at a degraded quality level, a result of the watermark destruction and subsequent obscurity to the system, consumers will not be affected to the extent that the unauthorized content has only been degraded, but access has not been denied to the content. Only a complete forgery of a cryptographically-secure watermark will constitute a complete failure of the system. For a discussion on such implementations please see U.S. Pat. No. 5,613,004, U.S. Pat. No. 5,687,236, U.S. Pat. No. 5,745,569, U.S. Pat. No. 5,822,432, U.S. Pat. No. 5,889,868, U.S. Pat. No. 5,905,800, included by reference in their entirety and pending U.S. patent applications with Ser. No. 09/046,627 “Method for Combining Transfer Function . . . ” (issued as U.S. Pat. No. 6,598,162), Ser. No. 09/053,628 “Multiple Transform Utilization and Application for Secure Digital Watermarking” (issued as U.S. Pat. No. 6,205,249), Ser. No. 08/775,216 “Steganographic Method and Device” (issued as U.S. Pat. No. 5,687,236), Ser. No. 08/772,222 “Z-Transform Implementation . . . ” (issued as U.S. Pat. No. 6,078,664), Ser. No. 60/125,990 “Utilizing Data Reduction in Steganographic and Cryptographic Systems” which corresponds to U.S. patent application Ser. No. 09/594,719, filed Jun. 16, 2000, entitled “Utilizing Data Reduction in Steganographic and Cryptographic Systems” (issued as U.S. Pat. No. 7,123,718).
Provable security protocols can minimize this risk. Thus the embedding system used to place the watermark does not need to be optimized for robustness, only for imperceptibility (important to publishers and consumers alike) and security (more important to publishers than to consumers). Ideally, as previously disclosed, security should not obscure the content, or prevent market participants from accessing information, which in the long term, should help develop trust or create relationships.
The system can flexibly support one or more “robust” watermarks as a method for screening content to speed processing. Final validation, however, relies upon the fragile, secure watermark and its hash or digital signature (a secure time stamp may also be incorporated). Fragile watermarks, meaning that signal manipulations would affect the watermark, may be included as a means to affect the quality of the content or any additional attributes intended to be delivered to the consumer.
LCS Functions
The LCS provides storage for content, authentication of content, enforcement of export rules, and watermarking and hashing of exported content. Stored content may be on an accessible rewritable medium, but it must be stored as ciphertext (encrypted or scrambled), not plain text, to prevent system-level extraction of the content. This is in contrast to the prior art which affix or otherwise attach meta-data to the content for access control by the variously proposed systems.
Typically, an LCS receives secured data from one or more SECDs. The SECD transfers content only after it has been secured. For example, the SECD may use an individualized cryptographic container to protect music content while in transit. Such a container may use public/private key cryptography, ciphering and/or compression, if desired.
The LCS may be able to receive content from a SECD, and must be able to authenticate content received via any of the plurality of implemented paths. The LCS must monitor and enforce any rules that accompany received content, such as number of available copies. Finally, it is preferred for the LCS to watermark all exported material (with the exception of Path 6—see below) and supply a hash made from the unique ID of the LCS and the content characteristics (so as to be maintained perceptually within the information and increase the level of security of the watermark).
SU Functions
The SU enables the content to be usable away from the LCS. The SU is partially within the LCS Domain. A protocol must exist for the SU and LCS to authenticate any connection made between them. This connection can have various levels of confidence set by the level of security between the SU and LCS and determinable by a certification authority or its equivalent, an authorized site for the content, for example. The transfer of content from the SU to the LCS without watermarking is allowed. However, all content leaving the SU must be watermarked. Preferably, the SU watermark contains a hash generated from the SU's Unique ID and the content characteristics of the content being transferred. If the content came from a LCS, the SU watermark must also be generated based, in part, upon the hash received from the LCS. The LCS and SU watermarking procedures do not need to be the same. However, the LCS must be able to read the SU watermarks for all different types of SU's with which it can connect. The SU does not need to be able to read any LCS watermarks. Each LCS and SU must have separate Unique IDs.
Sample Embodiment
For a more complete understanding of the present invention, the objects and advantages thereof, reference is now made to the following descriptions taken in connection with the accompanying drawings in which:
FIG 8 is a sample embodiment for an SPCS Audio Server, and in particular shows how secured content packages are created as downloadable units. “PAD” refers to “Protected Associated Data”.
FIG 9 is a sample embodiment for an SPCS Audio Server, and in particular shows how the LCS works on the input side for an SPCS Audio Server. “PAD” refers to “Protected Associated Data”.
FIG 10 is a sample embodiment for an SPCS Audio Server, and in particular shows how the LCS works on the output side. “PAD” refers to “Protected Associated Data”.
The preferred embodiment of the present invention and its advantages are best understood by referring to
Path 1 depicts a secure distribution of digital content from a SECD to a LCS. The content can be secured during the transmission using one or more ‘security protocols’ (e.g., encryption or scrambling). Moreover, a single LCS may have the capability to receive content transmissions from multiple SECDs, and each SECD may use the same security protocols or different security protocols. In the context of
In
In
Optionally, even in the event of a watermark match, a hash may be checked as further verification; and if the hash matches, the content is allowed in at High Quality, but if there is no match, the content is rejected. If the extracted watermark does not match the expected watermark, or if the LCS is unable to identify any other method for verifying the content's authenticity, then the content may be denied access to the LCS Storage (i.e., the content may be rejected), or if preferred by the user, the content may be permitted into the system at a degraded quality level. It is the user's prerogative to decide how the system will treat non-authenticated content, as well as legacy content.
In
In
In
In
The system of the present invention is utilized to complete digital data transactions. A typical transaction would have the following steps:
1.) Using an LCS, a user connects to a SECD.
2.) The user reviews a collection of data sets which are available for license (which for purposes of this application, may be equated with a purchase). The user then selects a data set (e.g., a song or other content), and purchases (or otherwise obtains the right to receive) a copy of the data set. (The user may transmit purchase information, for example, credit card information, using digital security that is known in the art of electronic commerce.)
3.) The SECD transmits the secured content to the LCS. Before transmitting any digital content, the SECD embeds at least one watermark and may also transmit (perhaps through cryptography) at least one hash value along with the data being transmitted. The at least one hash value may be embedded with the at least one watermark or may be attached to the beginning or end of the data being transmitted. Alternately, the hash output may be combined in ways that are known in the art.
4.) The LCS optionally may send its public key to the SECD, in which case the SECD may use the LCS public key to apply an additional security measure to the data to be transmitted, before the data is actually transmitted to the LCS.
5.) The LCS receives the secured content transmitted by the SECD. The LCS may optionally use its private key to remove the additional layer of security which was applied with the LCS's public key.
6.) The LCS may authenticate the secure content that was received from the SECD by checking the watermark(s) and/or hash values. Optionally, the LCS may unpack the secured content from its security wrapper and/or remove any other layers of security. If the content can be authenticated, the content may be accepted into the LCS domain. Otherwise, it may be rejected.
Fragile Watermark Structure
A fragile watermark—one that is encoded in the LSB of each 16 bit sample—can actually hold all of the data that would typically comprise the information being transmitted in the SecureChannel™. At a typical sampling rate of 44.1 kHz, there is 88,200 16 bit samples for each second of data in the time domain (44,100.times.2 stereo channels). This provides 88,200 bits per second which may be used for storing a fragile watermark. A typical 3 minute stereo song could therefore accommodate 1.89 MB of data for a fragile watermark. (The watermark is called fragile, because it is easily removed without greatly sacrificing the quality of the audio data.) 1.89 MB represents an immense capacity relative to the expected size of the typical data to be transmitted in a SecureChannel (100-200 K).
Preferably, the fragile watermark is bound to a specific copy of a specific song, so that “information pirates” (i.e., would-be thieves) cannot detect a watermark and then copy it onto another song in an effort to feign authorization when none exists. A fragile watermark may also contain information which can be utilized by various receivers which might receive the signal being packaged. For instance, a fragile watermark may contain information to optimize the playback of a particular song on a particular machine. A particular example could include data which differentiates an MP3 encoded version of a song and an AAC encoded version of the same song.
One way to bind a fragile watermark to a specific data set is through the use of hash functions. An example is demonstrated by the following sequence of steps:
1.) A digital data set (e.g., a song) is created by known means (e.g., sampling music at 44.1 kHz, to create a plurality of 16 bit data sets). The digital data set comprises a plurality of sample sets (e.g., a plurality of 16 bit data sets).
2.) Information relative to the digital data set (e.g., information about the version of the song) is transformed into digital data (which we will call the SecureChannel data), and the SecureChannel data is then divided into a plurality of SecureChannel data blocks, each of which blocks may then be separately encoded.
3.) A first block of the SecureChannel data is then is encoded into a first block of sample sets (the first block of sample sets comprising—at a minimum—a sufficient number of sample sets to accommodate the size of the first block of Secure Channel Data), for example by overwriting the LSB of each sample in the first block of sample sets.
4.) A hash pool is created comprising the first block of encoded sample sets.
5.) A first hash value is then created using i) the hash pool, ii) a random (or pseudorandom) number seeded using a code that serves to identify the owner of the digital data set, and iii) the SecureChannel data;
6.) The first hash value is then encoded into a second block of sample sets, the second block of sample sets being sufficient in size to accommodate the size of the first hash value.
7.) The second block of sample sets is then added to the hash pool
8.) A second block of the SecureChannel data is then is encoded into a third block of sample sets.
9.) The third block of encoded sample sets is added to the hash pool.
10.) A second hash value is then created using i) the hash pool, ii) a random (or pseudorandom) number seeded using a code that serves to identify the owner of the digital data set, and iii) the SecureChannel data;
11.) The second hash value is then encoded into a fourth block of sample sets.
Steps 7-11 are then repeated for successive blocks of SecureChannel data until all of the SecureChannel data is encoded. Understand that for each block of SecureChannel data, two blocks of content data are utilized. Moreover, for efficiency, one could use a predetermined subset of the samples in the hash pool, instead of the whole block.
Each SecureChannel block may, for example, have the following structure:
In theory, each SecureChannel block may be of a different type of block (i.e., may begin with a different Blockldentifier). In operation, a software application (or even an ASIC) may read the Blockldentifier and determine whether it is a recognized block type for the particular application. If the application does not recognize the block type, the application may use the BlockLength to skip this block of SecureChannel.
Certain block types will be required to be present if the SecureChannel is going to be accepted. These might include an identity block and a SecureChannel hash block. The SecureChannel data may or may not be encrypted, depending on whether the data is transfer-restricted (a type of value-adding component, that is, VAC) or simply informative. For instance, user-added SecureChannel data need not be encrypted. A Blockldentifier may also be used to indicate whether a SecureChannel data block is encrypted or not.
Robust Open Watermark (ROW)
A Robust-Open Watermark may be used to divide content into three categories. (The term “open watermark” is used merely to indicate that the watermark relies on a secret which is shared by an entire class of devices, as opposed to a secure watermark—which is readable only by a single member of a class of devices.) A binary setting may be used, whereby one state (e.g., “1”) may be used to identify secure protected content—such as content that is distributed in a secured manner. When the LCS detects a secured status (e.g., by determining that the ROW is “1”), the content must be accompanied by an authenticatable SecureChannel before the content is permitted to enter the LCS Domain (e.g., electronic music distribution or EMD content). The other binary state (e.g., “0”) may be used to identify unsecured content, for example, non-legacy media that is distributed in a pre-packaged form (e.g. CD's). When the binary setting is “0”, the content may or may not have a SecureChannel. Such “0 content” shall only be admitted from a read-only medium in its original file format (e.g., a 0 CD shall only be admitted if it is present on a Redbook CD medium). On the other hand, if the ROW is absent, then the LCS will understand that the content is “legacy”. Legacy content may be admitted, or optionally, may be checked for a fragile watermark—and then admitted only if the fragile watermark is present. It would be possible to permit unfettered usage of legacy content—though again, it is the prerogative of the user who sets up the LCS.
Robust Forensic Watermark
Preferably, a robust forensic watermark is not accessible in any way to the consumer—or to “information pirates.” A forensic watermark may be secured by a symmetric key held only by the seller. A transaction ID may be embedded at the time of purchase with a hash matching the symmetric key. The watermark is then embedded using a very low density insertion mask (<10%), making it very difficult to find without the symmetric key. Retrieval of such a watermark is not limited by real-time/low cost constraints. The recovery will typically only be attempted on known pirated material, or material which is suspected of piracy. A recovery time of 2 hours on a 400 MHz PC may, therefore, be reasonable.
The system of the present invention contemplates the need for updating and replacing previously-embedded watermarks (which may be thought of generally as “renewing” a watermark). If someone is able to obtain the algorithms used to embed a watermark—or is otherwise able to crack the security, it would be desirable to be able to embed a new watermark using a secure algorithm. New watermarks, however, cannot be implemented with complete success over night, and thus, there inevitably will be transition periods where older SPCS are operating without updated software. In such a transition period, the content must continue to be recognizable to both the old SPCSs and the upgraded SPCSs. A solution is to embed both the original and the upgraded watermarks into content during the transition periods. Preferably, it is the decision of the content owner to use both techniques or only the upgraded technique.
The operation of the system of the present invention is complicated, however, by the presence of “legacy” digital content which is already in the hands of consumer (that is, digital content that was commercially distributed before the advent of watermarking systems) because legacy content will continue to be present in the future. Moreover, pirates who distribute unauthorized content will also complicate matters because such unauthorized copies are likely to be distributed in the same formats as legacy content. As it is unlikely that such unwatermarked content can ever be completely removed, the present system must try to accommodate such content.
Hardware can be configured to read old ROW content and extract the old ROW and insert in the content a new ROW.
Tables 1, 2 and 3 depict a sample embodiment for an SPCS Audio Server, and in particular show how secured content packages are created as downloadable units (Table 1), how the LCS works on the input side for an SPCS Audio Server (Table 2), and how the LCS works on the output side (Table 3). “PAD” refers to “Protected Associated Data”.
While the invention has been particularly shown and described by the foregoing detailed description, it will be understood by those skilled in the art that various other changes in form and detail may be made without departing from the spirit and scope of the invention.
This application is a continuation of U.S. application Ser. No. 12/287,443, filed Oct. 9, 2008, which is a continuation of U.S. application Ser. No. 10/049,101, which entered the US national stage Jul. 23, 2002, which is a national stage entry of PCT/US00/21189, filed Aug. 4, 2000, which claims the benefit of U.S. Patent Application Ser. No. 60/147,134, filed Aug. 4, 1999, entitled, “A Secure Personal Content Server” and U.S. Patent Application Ser. No. 60/213,489, filed Jun. 23, 2000, entitled “A Secure Personal Content Server.” The contents of U.S. application Ser. No. 12/287,443 and U.S. application Ser. No. 10/049,101 are incorporated by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
3947825 | Cassada | Mar 1976 | A |
3984624 | Waggener | Oct 1976 | A |
3986624 | Cates, Jr. et al. | Oct 1976 | A |
4038596 | Lee | Jul 1977 | A |
4200770 | Hellman et al. | Apr 1980 | A |
4218582 | Hellman et al. | Aug 1980 | A |
4339134 | Macheel | Jul 1982 | A |
4390898 | Bond et al. | Jun 1983 | A |
4405829 | Rivest et al. | Sep 1983 | A |
4424414 | Hellman et al. | Jan 1984 | A |
4528588 | Lofberg | Jul 1985 | A |
4672605 | Hustig et al. | Jun 1987 | A |
4748668 | Shamir et al. | May 1988 | A |
4789928 | Fujisaki | Dec 1988 | A |
4827508 | Shear | May 1989 | A |
4876617 | Best et al. | Oct 1989 | A |
4896275 | Jackson | Jan 1990 | A |
4908873 | Philibert et al. | Mar 1990 | A |
4939515 | Adelson | Jul 1990 | A |
4969204 | Melnychuk et al. | Nov 1990 | A |
4972471 | Gross et al. | Nov 1990 | A |
4977594 | Shear | Dec 1990 | A |
4979210 | Nagata et al. | Dec 1990 | A |
4980782 | Ginkel | Dec 1990 | A |
5050213 | Shear | Sep 1991 | A |
5073925 | Nagata et al. | Dec 1991 | A |
5077665 | Silverman et al. | Dec 1991 | A |
5111530 | Kutaragi | May 1992 | A |
5113437 | Best et al. | May 1992 | A |
5136581 | Muehrcke | Aug 1992 | A |
5136646 | Haber et al. | Aug 1992 | A |
5136647 | Haber et al. | Aug 1992 | A |
5142576 | Nadan | Aug 1992 | A |
5161210 | Druyvesteyn et al. | Nov 1992 | A |
5210820 | Kenyon | May 1993 | A |
5243423 | DeJean et al. | Sep 1993 | A |
5243515 | Lee | Sep 1993 | A |
5287407 | Holmes | Feb 1994 | A |
5319735 | Preuss et al. | Jun 1994 | A |
5327520 | Chen | Jul 1994 | A |
5341429 | Stringer et al. | Aug 1994 | A |
5341477 | Pitkin et al. | Aug 1994 | A |
5363448 | Koopman, Jr. et al. | Nov 1994 | A |
5365586 | Indeck et al. | Nov 1994 | A |
5369707 | Follendore, III | Nov 1994 | A |
5379345 | Greenberg | Jan 1995 | A |
5394324 | Clearwater | Feb 1995 | A |
5398285 | Borgelt et al. | Mar 1995 | A |
5406627 | Thompson et al. | Apr 1995 | A |
5408505 | Indeck et al. | Apr 1995 | A |
5410598 | Shear | Apr 1995 | A |
5412718 | Narasimhalv et al. | May 1995 | A |
5418713 | Allen | May 1995 | A |
5428606 | Moskowitz | Jun 1995 | A |
5437050 | Lamb | Jul 1995 | A |
5450490 | Jensen et al. | Sep 1995 | A |
5469536 | Blank | Nov 1995 | A |
5471533 | Wang et al. | Nov 1995 | A |
5478990 | Montanari et al. | Dec 1995 | A |
5479210 | Cawley et al. | Dec 1995 | A |
5487168 | Geiner et al. | Jan 1996 | A |
5493677 | Balogh et al. | Feb 1996 | A |
5497419 | Hill | Mar 1996 | A |
5506795 | Yamakawa | Apr 1996 | A |
5513126 | Harkins et al. | Apr 1996 | A |
5513261 | Maher | Apr 1996 | A |
5530739 | Okada | Jun 1996 | A |
5530751 | Morris | Jun 1996 | A |
5530759 | Braudaway et al. | Jun 1996 | A |
5539735 | Moskowitz | Jul 1996 | A |
5548579 | Lebrun et al. | Aug 1996 | A |
5568570 | Rabbani | Oct 1996 | A |
5579124 | Aijala et al. | Nov 1996 | A |
5581703 | Baugher et al. | Dec 1996 | A |
5583488 | Sala et al. | Dec 1996 | A |
5598470 | Cooper et al. | Jan 1997 | A |
5606609 | Houser et al. | Feb 1997 | A |
5613004 | Cooperman et al. | Mar 1997 | A |
5617119 | Briggs et al. | Apr 1997 | A |
5617506 | Burk | Apr 1997 | A |
5625690 | Michel et al. | Apr 1997 | A |
5629980 | Stefik et al. | May 1997 | A |
5633932 | Davis et al. | May 1997 | A |
5634040 | Her et al. | May 1997 | A |
5636276 | Brugger | Jun 1997 | A |
5636292 | Rhoads | Jun 1997 | A |
5640569 | Miller et al. | Jun 1997 | A |
5646997 | Barton | Jul 1997 | A |
5657461 | Harkins et al. | Aug 1997 | A |
5659726 | Sandford, II et al. | Aug 1997 | A |
5664018 | Leighton | Sep 1997 | A |
5673316 | Auerbach et al. | Sep 1997 | A |
5675653 | Nelson | Oct 1997 | A |
5677952 | Blakley et al. | Oct 1997 | A |
5680462 | Miller et al. | Oct 1997 | A |
5687236 | Moskowitz et al. | Nov 1997 | A |
5689587 | Bender et al. | Nov 1997 | A |
5696828 | Koopman, Jr. | Dec 1997 | A |
5719937 | Warren et al. | Feb 1998 | A |
5721788 | Powell et al. | Feb 1998 | A |
5734752 | Knox | Mar 1998 | A |
5737416 | Cooper et al. | Apr 1998 | A |
5737733 | Eller | Apr 1998 | A |
5740244 | Indeck et al. | Apr 1998 | A |
5745569 | Moskowitz et al. | Apr 1998 | A |
5748783 | Rhoads | May 1998 | A |
5751811 | Magnotti et al. | May 1998 | A |
5754697 | Fu et al. | May 1998 | A |
5754938 | Herz | May 1998 | A |
5757923 | Koopman, Jr. | May 1998 | A |
5765152 | Erickson | Jun 1998 | A |
5768396 | Sone | Jun 1998 | A |
5774452 | Wolosewicz | Jun 1998 | A |
5781184 | Wasserman | Jul 1998 | A |
5790677 | Fox et al. | Aug 1998 | A |
5799083 | Brothers et al. | Aug 1998 | A |
5809139 | Grirod et al. | Sep 1998 | A |
5809160 | Powell et al. | Sep 1998 | A |
5818818 | Soumiya et al. | Oct 1998 | A |
5822432 | Moskowitz et al. | Oct 1998 | A |
5828325 | Wolosewicz et al. | Oct 1998 | A |
5832119 | Rhoads | Nov 1998 | A |
5839100 | Wegener | Nov 1998 | A |
5842213 | Odom et al. | Nov 1998 | A |
5848155 | Cox | Dec 1998 | A |
5850481 | Rhoads | Dec 1998 | A |
5859920 | Daly et al. | Jan 1999 | A |
5860099 | Milios et al. | Jan 1999 | A |
5862260 | Rhoads | Jan 1999 | A |
5870474 | Wasilewski et al. | Feb 1999 | A |
5884033 | Duvall et al. | Mar 1999 | A |
5889868 | Moskowitz et al. | Mar 1999 | A |
5893067 | Bender et al. | Apr 1999 | A |
5894521 | Conley | Apr 1999 | A |
5901178 | Lee | May 1999 | A |
5903721 | Sixtus | May 1999 | A |
5905800 | Moskowitz et al. | May 1999 | A |
5905975 | Ausubel | May 1999 | A |
5912972 | Barton | Jun 1999 | A |
5915027 | Cox et al. | Jun 1999 | A |
5917915 | Hirose | Jun 1999 | A |
5918223 | Blum | Jun 1999 | A |
5920900 | Poole et al. | Jul 1999 | A |
5923763 | Walker et al. | Jul 1999 | A |
5930369 | Cox et al. | Jul 1999 | A |
5930377 | Powell et al. | Jul 1999 | A |
5940134 | Wirtz | Aug 1999 | A |
5943422 | Van Wie et al. | Aug 1999 | A |
5949055 | Fleet | Sep 1999 | A |
5963909 | Warren et al. | Oct 1999 | A |
5973731 | Schwab | Oct 1999 | A |
5974141 | Saito | Oct 1999 | A |
5991426 | Cox et al. | Nov 1999 | A |
5999217 | Berners-Lee | Dec 1999 | A |
6009176 | Gennaro et al. | Dec 1999 | A |
6029126 | Malvar | Feb 2000 | A |
6035398 | Bjorn | Mar 2000 | A |
6041316 | Allen | Mar 2000 | A |
6044471 | Colvin | Mar 2000 | A |
6049838 | Miller et al. | Apr 2000 | A |
6051029 | Paterson et al. | Apr 2000 | A |
6061793 | Tewfik et al. | May 2000 | A |
6067622 | Moore | May 2000 | A |
6069914 | Cox | May 2000 | A |
6078664 | Moskowitz et al. | Jun 2000 | A |
6081251 | Sakai et al. | Jun 2000 | A |
6081587 | Reyes et al. | Jun 2000 | A |
6081597 | Hoffstein et al. | Jun 2000 | A |
6088455 | Logan et al. | Jul 2000 | A |
6131162 | Yoshiura et al. | Oct 2000 | A |
6141753 | Zhao et al. | Oct 2000 | A |
6141754 | Choy | Oct 2000 | A |
6148333 | Guedalia et al. | Nov 2000 | A |
6154571 | Cox et al. | Nov 2000 | A |
6173322 | Hu | Jan 2001 | B1 |
6178405 | Ouyang | Jan 2001 | B1 |
6192138 | Yamadaji | Feb 2001 | B1 |
6199058 | Wong et al. | Mar 2001 | B1 |
6205249 | Moskowitz | Mar 2001 | B1 |
6208745 | Florenio et al. | Mar 2001 | B1 |
6226618 | Downs et al. | May 2001 | B1 |
6230268 | Miwa et al. | May 2001 | B1 |
6233347 | Chen et al. | May 2001 | B1 |
6233684 | Stefik et al. | May 2001 | B1 |
6240121 | Senoh | May 2001 | B1 |
6263313 | Milsted et al. | Jul 2001 | B1 |
6272634 | Tewfik et al. | Aug 2001 | B1 |
6275988 | Nagashima et al. | Aug 2001 | B1 |
6278780 | Shimada | Aug 2001 | B1 |
6278791 | Honsinger et al. | Aug 2001 | B1 |
6282300 | Bloom et al. | Aug 2001 | B1 |
6282650 | Davis | Aug 2001 | B1 |
6285775 | Wu et al. | Sep 2001 | B1 |
6301663 | Kato et al. | Oct 2001 | B1 |
6310962 | Chung et al. | Oct 2001 | B1 |
6330335 | Rhoads | Dec 2001 | B1 |
6330672 | Shur | Dec 2001 | B1 |
6345100 | Levine | Feb 2002 | B1 |
6351765 | Pietropaolo et al. | Feb 2002 | B1 |
6363483 | Keshav | Mar 2002 | B1 |
6373892 | Ichien et al. | Apr 2002 | B1 |
6373960 | Conover et al. | Apr 2002 | B1 |
6374036 | Ryan et al. | Apr 2002 | B1 |
6377625 | Kim | Apr 2002 | B1 |
6381618 | Jones et al. | Apr 2002 | B1 |
6381747 | Wonfor et al. | Apr 2002 | B1 |
6385324 | Koppen | May 2002 | B1 |
6385329 | Sharma et al. | May 2002 | B1 |
6385596 | Wiser et al. | May 2002 | B1 |
6389538 | Gruse et al. | May 2002 | B1 |
6398245 | Gruse et al. | Jun 2002 | B1 |
6405203 | Collart | Jun 2002 | B1 |
6415041 | Oami et al. | Jul 2002 | B1 |
6418421 | Hurtado et al. | Jul 2002 | B1 |
6425081 | Iwamura | Jul 2002 | B1 |
6430301 | Petrovic | Aug 2002 | B1 |
6430302 | Rhoads | Aug 2002 | B2 |
6442283 | Tewfik et al. | Aug 2002 | B1 |
6446211 | Colvin | Sep 2002 | B1 |
6453252 | Laroche | Sep 2002 | B1 |
6457058 | Ullum et al. | Sep 2002 | B1 |
6463468 | Buch et al. | Oct 2002 | B1 |
6480937 | Vorbach | Nov 2002 | B1 |
6480963 | Tachibana et al. | Nov 2002 | B1 |
6484264 | Colvin | Nov 2002 | B1 |
6493457 | Quackenbush et al. | Dec 2002 | B1 |
6502195 | Colvin | Dec 2002 | B1 |
6510513 | Danieli | Jan 2003 | B1 |
6522767 | Moskowitz et al. | Feb 2003 | B1 |
6522769 | Rhoads et al. | Feb 2003 | B1 |
6523113 | Wehrenberg | Feb 2003 | B1 |
6530021 | Epstein et al. | Mar 2003 | B1 |
6532284 | Walker et al. | Mar 2003 | B2 |
6539475 | Cox et al. | Mar 2003 | B1 |
6557103 | Boncelet, Jr. et al. | Apr 2003 | B1 |
6584125 | Katto | Jun 2003 | B1 |
6587837 | Spagna et al. | Jul 2003 | B1 |
6590996 | Reed | Jul 2003 | B1 |
6598162 | Moskowitz | Jul 2003 | B1 |
6606393 | Xie et al. | Aug 2003 | B1 |
6611599 | Natarajan | Aug 2003 | B2 |
6647424 | Pearson et al. | Nov 2003 | B1 |
6658010 | Enns et al. | Dec 2003 | B1 |
6665489 | Collart | Dec 2003 | B2 |
6668246 | Yeung et al. | Dec 2003 | B1 |
6668325 | Collberg et al. | Dec 2003 | B1 |
6674858 | Kimura et al. | Jan 2004 | B1 |
6687683 | Harada et al. | Feb 2004 | B1 |
6725372 | Lewis et al. | Apr 2004 | B1 |
6754822 | Zhao | Jun 2004 | B1 |
6775772 | Binding et al. | Aug 2004 | B1 |
6784354 | Lu et al. | Aug 2004 | B1 |
6785815 | Serret-Avila et al. | Aug 2004 | B1 |
6785825 | Colvin | Aug 2004 | B2 |
6792548 | Colvin | Sep 2004 | B2 |
6792549 | Colvin | Sep 2004 | B2 |
6795925 | Colvin | Sep 2004 | B2 |
6799277 | Colvin | Sep 2004 | B2 |
6804453 | Sasamoto | Oct 2004 | B1 |
6813717 | Colvin | Nov 2004 | B2 |
6813718 | Colvin | Nov 2004 | B2 |
6823455 | Macy et al. | Nov 2004 | B1 |
6834308 | Ikezoye et al. | Dec 2004 | B1 |
6842862 | Chow et al. | Jan 2005 | B2 |
6853726 | Moskowitz et al. | Feb 2005 | B1 |
6857078 | Colvin | Feb 2005 | B2 |
6865747 | Mercier | Mar 2005 | B1 |
6931534 | Jändel et al. | Aug 2005 | B1 |
6950941 | Lee et al. | Sep 2005 | B1 |
6957330 | Hughes | Oct 2005 | B1 |
6966002 | Torrubia-Saez | Nov 2005 | B1 |
6977894 | Achilles et al. | Dec 2005 | B1 |
6978370 | Kocher | Dec 2005 | B1 |
6983058 | Fukuoka | Jan 2006 | B1 |
6983337 | Diamant | Jan 2006 | B2 |
6986063 | Colvin | Jan 2006 | B2 |
6990453 | Wang et al. | Jan 2006 | B2 |
7007166 | Moskowitz et al. | Feb 2006 | B1 |
7020285 | Kirovski et al. | Mar 2006 | B1 |
7035049 | Yamamoto et al. | Apr 2006 | B2 |
7035409 | Moskowitz | Apr 2006 | B1 |
7043050 | Yuval | May 2006 | B2 |
7046808 | Metois et al. | May 2006 | B1 |
7050396 | Cohen et al. | May 2006 | B1 |
7051208 | Venkatesan et al. | May 2006 | B2 |
7058570 | Yu et al. | Jun 2006 | B1 |
7093295 | Saito | Aug 2006 | B1 |
7095715 | Buckman | Aug 2006 | B2 |
7095874 | Moskowitz et al. | Aug 2006 | B2 |
7103184 | Jian | Sep 2006 | B2 |
7107451 | Moskowitz | Sep 2006 | B2 |
7123718 | Moskowitz et al. | Oct 2006 | B1 |
7127615 | Moskowitz | Oct 2006 | B2 |
7150003 | Naumovich et al. | Dec 2006 | B2 |
7152162 | Moskowitz et al. | Dec 2006 | B2 |
7159116 | Moskowitz | Jan 2007 | B2 |
7162642 | Schumann et al. | Jan 2007 | B2 |
7177429 | Moskowitz et al. | Feb 2007 | B2 |
7177430 | Kim | Feb 2007 | B2 |
7206649 | Kirovski et al. | Apr 2007 | B2 |
7231524 | Burns | Jun 2007 | B2 |
7233669 | Candelore | Jun 2007 | B2 |
7240210 | Mihcak et al. | Jul 2007 | B2 |
7266697 | Kirovski et al. | Sep 2007 | B2 |
7286451 | Wirtz et al. | Oct 2007 | B2 |
7287275 | Moskowitz | Oct 2007 | B2 |
7289643 | Brunk et al. | Oct 2007 | B2 |
7343492 | Moskowitz et al. | Mar 2008 | B2 |
7346472 | Moskowitz et al. | Mar 2008 | B1 |
7362775 | Moskowitz | Apr 2008 | B1 |
7363278 | Schmelzer et al. | Apr 2008 | B2 |
7409073 | Moskowitz et al. | Aug 2008 | B2 |
7457962 | Moskowitz | Nov 2008 | B2 |
7460994 | Herre et al. | Dec 2008 | B2 |
7475246 | Moskowitz et al. | Jan 2009 | B1 |
7530102 | Moskowitz | May 2009 | B2 |
7532725 | Moskowitz et al. | May 2009 | B2 |
7568100 | Moskowitz et al. | Jul 2009 | B1 |
7647502 | Moskowitz | Jan 2010 | B2 |
7647503 | Moskowitz | Jan 2010 | B2 |
7664263 | Moskowitz | Feb 2010 | B2 |
7743001 | Vermeulen | Jun 2010 | B1 |
7761712 | Moskowitz | Jul 2010 | B2 |
7779261 | Moskowitz et al. | Aug 2010 | B2 |
8121343 | Moskowitz | Feb 2012 | B2 |
8161286 | Moskowitz | Apr 2012 | B2 |
8214175 | Moskowitz | Jul 2012 | B2 |
8265278 | Moskowitz | Sep 2012 | B2 |
8307213 | Moskowitz | Nov 2012 | B2 |
20010010078 | Moskowitz | Jul 2001 | A1 |
20010029580 | Moskowitz | Oct 2001 | A1 |
20010043594 | Ogawa et al. | Nov 2001 | A1 |
20020009208 | Alattar et al. | Jan 2002 | A1 |
20020010684 | Moskowitz | Jan 2002 | A1 |
20020026343 | Duenke | Feb 2002 | A1 |
20020047873 | Imanaka et al. | Apr 2002 | A1 |
20020056041 | Moskowitz | May 2002 | A1 |
20020057651 | Roberts | May 2002 | A1 |
20020071556 | Moskowitz et al. | Jun 2002 | A1 |
20020073043 | Herman et al. | Jun 2002 | A1 |
20020097873 | Petrovic | Jul 2002 | A1 |
20020103883 | Haverstock et al. | Aug 2002 | A1 |
20020152179 | Racov | Oct 2002 | A1 |
20020161741 | Wang et al. | Oct 2002 | A1 |
20030002862 | Rodriguez et al. | Jan 2003 | A1 |
20030005780 | Pahl et al. | Jan 2003 | A1 |
20030027549 | Kiel et al. | Feb 2003 | A1 |
20030126445 | Wehrenberg | Jul 2003 | A1 |
20030133702 | Collart | Jul 2003 | A1 |
20030200439 | Moskowitz | Oct 2003 | A1 |
20030219143 | Moskowitz et al. | Nov 2003 | A1 |
20040028222 | Sewell et al. | Feb 2004 | A1 |
20040037449 | Davis et al. | Feb 2004 | A1 |
20040049695 | Choi et al. | Mar 2004 | A1 |
20040059918 | Xu | Mar 2004 | A1 |
20040083369 | Erlingsson et al. | Apr 2004 | A1 |
20040086119 | Moskowitz | May 2004 | A1 |
20040093521 | Hamadeh et al. | May 2004 | A1 |
20040117628 | Colvin | Jun 2004 | A1 |
20040117664 | Colvin | Jun 2004 | A1 |
20040125983 | Reed et al. | Jul 2004 | A1 |
20040128514 | Rhoads | Jul 2004 | A1 |
20040225894 | Colvin | Nov 2004 | A1 |
20040243540 | Moskowitz et al. | Dec 2004 | A1 |
20050135615 | Moskowitz et al. | Jun 2005 | A1 |
20050160271 | Brundage et al. | Jul 2005 | A9 |
20050177727 | Moskowitz et al. | Aug 2005 | A1 |
20050246554 | Batson | Nov 2005 | A1 |
20060005029 | Petrovic et al. | Jan 2006 | A1 |
20060013395 | Brundage et al. | Jan 2006 | A1 |
20060013451 | Haitsma | Jan 2006 | A1 |
20060041753 | Haitsma | Feb 2006 | A1 |
20060101269 | Moskowitz et al. | May 2006 | A1 |
20060140403 | Moskowitz | Jun 2006 | A1 |
20060251291 | Rhoads | Nov 2006 | A1 |
20060285722 | Moskowitz et al. | Dec 2006 | A1 |
20070011458 | Moskowitz | Jan 2007 | A1 |
20070028113 | Moskowitz | Feb 2007 | A1 |
20070064940 | Moskowitz et al. | Mar 2007 | A1 |
20070079131 | Moskowitz et al. | Apr 2007 | A1 |
20070083467 | Lindahl et al. | Apr 2007 | A1 |
20070110240 | Moskowitz et al. | May 2007 | A1 |
20070113094 | Moskowitz et al. | May 2007 | A1 |
20070127717 | Herre et al. | Jun 2007 | A1 |
20070226506 | Moskowitz | Sep 2007 | A1 |
20070253594 | Lu et al. | Nov 2007 | A1 |
20070294536 | Moskowitz et al. | Dec 2007 | A1 |
20070300072 | Moskowitz | Dec 2007 | A1 |
20070300073 | Moskowitz | Dec 2007 | A1 |
20080005571 | Moskowitz | Jan 2008 | A1 |
20080005572 | Moskowitz | Jan 2008 | A1 |
20080016365 | Moskowitz | Jan 2008 | A1 |
20080022113 | Moskowitz | Jan 2008 | A1 |
20080022114 | Moskowitz | Jan 2008 | A1 |
20080028222 | Moskowitz | Jan 2008 | A1 |
20080046742 | Moskowitz | Feb 2008 | A1 |
20080075277 | Moskowitz et al. | Mar 2008 | A1 |
20080109417 | Moskowitz | May 2008 | A1 |
20080133927 | Moskowitz et al. | Jun 2008 | A1 |
20080151934 | Moskowitz et al. | Jun 2008 | A1 |
20090037740 | Moskowitz | Feb 2009 | A1 |
20090089427 | Moskowitz et al. | Apr 2009 | A1 |
20090190754 | Moskowitz et al. | Jul 2009 | A1 |
20090210711 | Moskowitz | Aug 2009 | A1 |
20090220074 | Moskowitz et al. | Sep 2009 | A1 |
20100002904 | Moskowitz | Jan 2010 | A1 |
20100005308 | Moskowitz | Jan 2010 | A1 |
20100064140 | Moskowitz | Mar 2010 | A1 |
20100077219 | Moskowitz | Mar 2010 | A1 |
20100077220 | Moskowitz | Mar 2010 | A1 |
20100098251 | Moskowitz | Apr 2010 | A1 |
20100106736 | Moskowitz et al. | Apr 2010 | A1 |
20100153734 | Moskowitz et al. | Jun 2010 | A1 |
20100182570 | Matsumoto et al. | Jul 2010 | A1 |
20100202607 | Moskowitz | Aug 2010 | A1 |
20100220861 | Moskowitz | Sep 2010 | A1 |
20100313033 | Moskowitz et al. | Dec 2010 | A1 |
20110019691 | Moskowitz | Jan 2011 | A1 |
20110069864 | Moskowitz et al. | Mar 2011 | A1 |
Number | Date | Country |
---|---|---|
0372601 | Jun 1990 | EP |
0565947 | Oct 1993 | EP |
0581317 | Feb 1994 | EP |
0581317 | Feb 1994 | EP |
0649261 | Apr 1995 | EP |
0651554 | May 1995 | EP |
0872073 | Jul 1996 | EP |
1547337 | Mar 2006 | EP |
1354276 | Dec 2007 | EP |
1005523 | Sep 1998 | NL |
WO 9514289 | May 1995 | WO |
WO9701892 | Jun 1995 | WO |
WO 9629795 | Sep 1996 | WO |
WO 9642151 | Dec 1996 | WO |
WO9726733 | Jan 1997 | WO |
WO 9724833 | Jul 1997 | WO |
WO9726732 | Jul 1997 | WO |
WO9802864 | Jul 1997 | WO |
WO 9744736 | Nov 1997 | WO |
WO9802864 | Jan 1998 | WO |
WO9837513 | Aug 1998 | WO |
WO 9952271 | Oct 1999 | WO |
WO 9962044 | Dec 1999 | WO |
WO 9963443 | Dec 1999 | WO |
WO 0057643 | Sep 2000 | WO |
WO0118628 | Mar 2001 | WO |
WO0143026 | Jun 2001 | WO |
WO0203385 | Jan 2002 | WO |
WO02003385 | Oct 2002 | WO |
Entry |
---|
George, Mercy; Chouinard, Jean-Yves; Georgana, Nicolas. Digital Watermarking of Images and Video using Direct Sequence Spread Spectrum Techniques. 1999 IEEE Canadian Conference on Electrical and Computer Engineering. vol. 1. Pub. Date: 1999. Relevant pp. 116-121. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=807181. |
US. Appl. No. 08/999,766, filed Jul. 23, 1997, entitled “Steganographic Method and Device”, published as 7568100 Jul. 28, 2009. |
EPO Application No. 96919405.9, entitled “Steganographic Method and Device”; published as EP0872073 (A2), Oct. 21, 1998. |
U.S. Appl. No. 11/050,779, filed Feb. 7, 2005, entitled “Steganographic Method and Device”, published as 20050177727 A1 Aug. 11, 2005. |
U.S. Appl. No. 08/674,726, filed Jul. 2, 1996, entitled “Exchange Mechanisms for Digital Information Packages with Bandwidth Securitization, Multichannel Digital Watermarks, and Key Management”, published as 7362775 Apr. 22, 2008. |
U.S. Appl. No. 09/545,589, filed Apr. 7, 2000, entitled “Method and System for Digital Watermarking”, published as 7007166 Feb. 28, 2006. |
U.S. Appl. No. 11/244,213, filed Oct. 5, 2005, entitled “Method and System for Digital Watermarking”, published as 2006-0101269 A1 May 11, 2006. |
U.S. Appl. No. 11/649,026, filed Jan. 3, 2007, entitled “Method and System for Digital Watermarking”, published as 2007-0113094 A1 May 17, 2007. |
U.S. Appl. No. 09/046,627, filed Mar. 24, 1998, entitled “Method for Combining Transfer Function with Predetermined Key Creation”, published as 6,598,162 Jul. 22, 2003. |
U.S. Appl. No. 10/602,777, filed Jun. 25, 2003, entitled “Method for Combining Transfer Function with Predetermined Key Creation”, published as 2004-0086119 A1 May 6, 2004. |
U.S. Appl. No. 09/053,628, filed Apr. 2, 1998, entitled “Multiple Transform Utilization and Application for Secure Digital Watermarking”, 6,205,249 Mar. 20, 2001. |
U.S. Appl. No. 09/644,098, filed Aug. 23, 2000, entitled “Multiple Transform Utilization and Application for Secure Digital Watermarking”, published as 7,035,409 Apr. 25, 2006. |
Jap. App. No. 2000-542907, entitled “Multiple Transform Utilization and Application for Secure Digital Watermarking”; which is a JP national stage of PCT/US1999/007262, published as WO/1999/052271, Oct. 14, 1999. |
U.S. Appl. No. 09/767,733, filed Jan. 24, 2001 entitled “Multiple Transform Utilization and Application for Secure Digital Watermarking”, published as 2001-0010078 A1 Jul. 26, 2001. |
U.S. Appl. No. 11/358,874, filed Feb. 21, 2006, entitled “Multiple Transform Utilization and Application for Secure Digital Watermarking”, published as 2006-0140403 A1 Jun. 29, 2006. |
U.S. Appl. No. 10/417,231, filed Apr. 17, 2003, entitled “Methods, Systems and Devices for Packet Watermarking and Efficient Provisioning of Bandwidth”, published as 2003-0200439 A1 Oct. 23, 2003. |
U.S. Appl. No. 09/789,711, filed Feb. 22, 2001, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data”, published as 2001-0029580 A1 Oct. 11, 2001. |
U.S. Appl. No. 11/497,822, filed Aug. 2, 2006, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data”, published as 2007-0011458 A1 Jan. 11, 2007. |
U.S. Appl. No. 11/599,964, filed Nov. 15, 2006, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data”, published as 2008-0046742 A1 Feb. 21, 2008. |
U.S. Appl. No. 11/599,838, filed Nov. 15, 2006, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data”, published as 2007-0226506 A1 Sep. 27, 2007. |
U.S. Appl. No. 10/369,344, filed Feb. 18, 2003, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digitized Data”, published as 2003-0219143 A1 Nov. 27, 2003. |
U.S. Appl. No. 11/482,654, filed Jul. 7, 2006, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digitized Data”, published as 2006-0285722 A1 Dec. 21, 2006. |
U.S. Appl. No. 09/594,719, filed Jun. 16, 2000, entitled “Utilizing Data Reduction in Steganographic and Cryptographic Systems”, published as 7,123,718 Oct. 17, 2006. |
U.S. Appl. No. 11/519,467, filed Sep. 12, 2006, entitled “Utilizing Data Reduction in Steganographic and Cryptographic Systems”, published as 2007-0064940 A1 Mar. 22, 2007. |
U.S. Appl. No. 09/731,040, filed Dec. 7, 2000, entitled “Systems, Methods and Devices for Trusted Transactions”, 2002-0010684 A1 Jan. 24, 2002. |
U.S. Appl. No. 11/512,701, filed Aug. 29, 2006, entitled “Systems, Methods and Devices for Trusted Transactions”, published as 2007-0028113 A1 Feb. 1, 2007. |
U.S. Appl. No. 10/049,101, filed Feb. 8, 2002, entitled “A Secure Personal Content Server”, published as 7,475,246 Jan. 6, 2009. |
PCT Application No. PCT/US00/21189, filed Aug. 4, 2000, entitled, “A Secure Personal Content Server”, Pub. No. WO/2001/018628 ; Publication Date: Mar. 15, 2001. |
U.S. Appl. No. 09/657,181, filed Sep. 7, 2000, entitled “Method and Device for Monitoring and Analyzing Signals”, published as 7,346,472 Mar. 18, 2008. |
U.S. Appl. No. 10/805,484, filed Mar. 22, 2004, entitled “Method and Device for Monitoring and Analyzing Signals”, published as 2004-0243540 A1 Dec. 2, 2004. |
U.S. Appl. No. 09/956,262, filed Sep. 20, 2001, entitled “Improved Security Based on Subliminal and Supraliminal Channels for Data Objects”, published as 2002-0056041 A1 May 9, 2002. |
U.S. Appl. No. 11/518,806, filed Sep. 11, 2006, entitled “Improved Security Based on Subliminal and Supraliminal Channels for Data Objects”, 2008-0028222 A1 Jan. 31, 2008. |
U.S. Appl. No. 11/026,234, filed Dec. 30, 2004, entitled “Z-Transform Implementation of Digital Watermarks” , published as 2005-0135615 A1 Jun. 23, 2005. |
U.S. Appl. No. 11/592,079, filed Nov. 2, 2006, entitled “Linear Predictive Coding Implementation of Digital Watermarks”, published as 2007-0079131 A1 Apr. 5, 2007. |
U.S. Appl. No. 09/731,039, filed Dec. 7, 2000, entitled “System and Methods for Permitting Open Access to Data Objects and for Securing Data within the Data Objects”, published as 2002-0071556 A1 Jun. 13, 2002. |
U.S. Appl. No. 11/647,861, filed Dec. 29, 2006, entitled “System and Methods for Permitting Open Access to Data Objects and for Securing Data within the Data Objects”, published as 2007-0110240 A1 May 17, 2007. |
Schneier, Bruce, Applied Cryptography, 2nd Ed., John Wiley & Sons, pp. 9-10, 1996. |
Menezes, Alfred J., Handbook of Applied Cryptography, CRC Press, p. 46, 1997. |
Merriam-Webster's Collegiate Dictionary, 10th Ed., Merriam Webster, Inc., p. 207. |
Brealy, et al., Principles of Corporate Finance, “Appendix A—Using Option Valuation Models”, 1984, pp. 448-449. |
Copeland, et al., Real Options: A Practitioner's Guide, 2001 pp. 106-107, 201-202, 204-208. |
Sarkar, M. “An Assessment of Pricing Mechanisms for the Internet-A Regulatory Imperative”, presented MIT Workshop on Internet Economics, Mar. 1995 http://www.press.vmich.edu/iep/works/SarkAsses.html on. |
Crawford, D.W. “Pricing Network Usage: A Market for Bandwidth of Market Communication?” presented MIT Workshop on Internet Economics, Mar. 1995 http://www.press.vmich.edu/iep/works/CrawMarket.html on March. |
Low, S.H., “Equilibrium Allocation and Pricing of Variable Resources Among User-Suppliers”, 1988. http://www.citesear.nj.nec.com/366503.html. |
Caronni, Germano, “Assuring Ownership Rights for Digital Images”, published proceeds of reliable IT systems, v15 '95, H.H. Bruggemann and W. Gerhardt-Hackel (Ed) Viewing Publishing Company Germany 1995. |
Zhao, Jian. “A WWW Service to Embed and Prove Digital Copyright Watermarks”, Proc. of the European conf. on Multimedia Applications, Services & Techniques Louvain-La-Nevve Belgium May 1996. |
Gruhl, Daniel et al., Echo Hiding. In Proceeding of the Workshop on Information Hiding. No. 1174 in Lecture Notes in Computer Science, Cambridge, England (May/Jun. 1996). |
Oomen, A.W.J. et al., A Variable Bit Rate Buried Data Channel for Compact Disc, J.AudioEng. Sc., vol. 43, No. 1/2, pp. 23-28 (1995). |
Ten Kate, W. et al., A New Surround-Stereo-Surround Coding Techniques, J. Audio Eng.Soc., vol. 40,No. 5,pp. 376-383 (1992). |
Gerzon, Michael et al., A High Rate Buried Data Channel for Audio Cd, presentation notes, Audio Engineering Soc. 94th Convention (1993). |
Sklar, Bernard, Digital Communications, pp. 601-603 (1988). |
Jyant, N.S. et al., Digital Coding of Waveforms, Prentice Hall Inc., Englewood Cliffs, NJ, pp. 486-509 (1984). |
Bender, Walter R. et al., Techniques for Data Hiding, SPIE Int. Soc. Opt. Eng., vol. 2420, pp. 164-173, 1995. |
Zhao, Jian et al., Embedding Robust Labels into Images for Copyright Protection, (xp 000571976), pp. 242-251, 1995. |
Menezes, Alfred J., Handbook of Applied Cryptography, CRC Press, p. 175, 1997. |
Schneier, Bruce, Applied Cryptography, 1st Ed., pp. 67-68, 1994. |
Ten Kate, W. et al., “Digital Audio Carrying Extra Information”, IEEE, CH 2847-2/90/0000-1097, (1990). |
Van Schyndel, et al., “A digital Watermark,” IEEE Int'l Computer Processing Conference, Austin,TX, Nov. 13-16, 1994, pp. 86-90. |
Smith, et al. “Modulation and Information Hiding in Images”, Springer Verlag, 1st Int'l Workshop, Cambridge, UK, May 30-Jun. 1, 1996, pp. 207-227. |
Kutter, Martin et al., “Digital Signature of Color Images Using Amplitude Modulation”, SPIE-E197, vol. 3022, pp. 518-527. |
Puate, Joan et al., “Using Fractal Compression Scheme to Embed a Digital Signature into an Image”, SPIE-96 Proceedings, vol. 2915, Mar. 1997, pp. 108-118. |
Swanson, Mitchell D.,et al., “Transparent Robust Image Watermarking”, Proc. of the 1996 IEEE Int'l Conf. on Image Processing, vol. 111, 1996 , pp. 211-214. |
Swanson, Mitchell D., et al. “Robust Data Hiding for Images”, 7th IEEE Digital Signal Processing Workshop, Leon, Norway. Sep. 1-4, 1996, pp. 37-40. |
Unknown, Zhao, Jian et al., “Embedding Robust Labels into Images for Copyright Protection”, Proceeding of the Know Right '95 Conference, pp. 242-251. |
Koch, E., et al., “Towards Robust and Hidden Image Copyright Labeling”, 1995 IEEE Workshop on Nonlinear Signal and Image Processing, Jun. 1995 Neos Marmaras pp. 4. |
Van Schyandel, et al., “Towards a Robust Digital Watermark”, Second Asain Image Processing Conference, Dec. 6-8, 1995, Singapore, vol. 2, pp. 504-508. |
Tirkel,A.Z., “A Two-Dimensional Digital Watermark”, DICTA '95, Univ. of Queensland, Brisbane, Dec. 5-8, 1995, pp. 7. |
Tirkel,A.Z., “Image Watermarking—A Spread Spectrum Application”, ISSSTA '96, Sep. 1996, Mainz, German, pp. 6. |
O'Ruanaidh, et al. “Watermarking Digital Images for Copyright Protection”, IEEE Proceedings, vol. 143, No. 4, Aug. 1996, pp. 250-256. |
Unknown, Cox, et al., Secure Spread Spectrum Watermarking for Multimedia, NEC Research Institude, Techinal Report 95-10, pp. 33. |
Kahn, D., “The Code Breakers”, The MacMillan Company, 1969, pp. xIII, 81-83, 513, 515, 522-526, 863. |
Boney, et al., Digital Watermarks for Audio Signals, EVSIPCO, 96, pp. 473-480 (Mar. 14, 1997). |
Dept. of Electrical Engineering, Del Ft University of Technology, Del ft the Netherlands, Cr.C. Langelaar et al.,“Copy Protection for Multimedia Data based on Labeling Techniques”, Jul. 1996 9 pp. |
Unknown, F. Hartung, et al., “Digital Watermarking of Raw and Compressed Video”, SPIE vol. 2952, pp. 205-213. |
Craver, et al., “Can Invisible Watermarks Resolve Rightful Ownerships?”, IBM Research Report, RC 20509 (Jul. 25, 1996) 21 pp. |
Press, et al., “Numerical Recipes in C”, Cambridge Univ. Press, 1988, pp. 398-417. |
Pohlmann, Ken C., “Principles of Digital Audio”, 3rd Ed., 1995, pp. 32-37, 40-48:138, 147-149, 332, 333, 364, 499-501, 508-509, 564-571. |
Pohlmann, Ken C., “Principles of Digital Audio”, 2nd Ed., 1991, pp. 1-9, 19-25, 30-33, 41-48, 54-57, 86-107, 375-387. |
Schneier, Bruce, Applied Cryptography, John Wiley & Sons, Inc., New York, 1994, pp. 68, 69, 387-392, 1-57, 273-275, 321-324. |
Boney, et al., Digital Watermarks for Audio Signals, Proceedings of the International Conf. on Multimedia Computing and Systems, Jun. 17-23, 1996 Hiroshima, Japan, 0-8186-7436-9196, pp. 473-480. |
Johnson, et al., “Transform Permuted Watermarking for Copyright Protection of Digital Video”, IEEE Globecom 1998, Nov. 8-12, 1998, New York New York vol. 2 1998 pp. 684-689 (ISBN 0-7803-4985-7). |
Rivest, et al., “Pay Word and Micromint: Two Simple Micropayment Schemes,” MIT Laboratory for Computer Science, Cambridge, MA, May 7, 1996 pp. 1-18. |
Bender, et al., “Techniques for Data Hiding”, IBM Systems Journal, (1996) vol. 35, Nos. 3 & 4,1996, pp. 313-336. |
Moskowitz, “Bandwith as Currency”, IEEE Multimedia, Jan.-Mar. 2003, pp. 14-21. |
Moskowitz, Multimedia Security Technologies for Digital Rights Management, 2006, Academic Press, “Introduction—Digital Rights Management” pp. 3-22. |
Rivest, et al., “PayWord and Micromint: Two Simple Micropayment Schemes,” MIT Laboratory for Computer Science, Cambridge, MA, Apr. 27, 2001, pp. 1-18. |
Tomsich, et al., “Towards a secure and de-centralized digital watermarking infrastructure for the protection of Intellectual Property”, in Electronic Commerce and Web Technologies, Proceedings (ECWEB)(2000). |
Moskowitz, “What is Acceptable Quality in the Application of Digital Watermarking: Trade-offs of Security; Robustness and Quality”, IEEE Computer Society Proceedings of Itcc 2002 Apr. 10, 2002 pp. 80-84. |
Lemma, et al. “Secure Watermark Embedding through Partial Encryption”, International Workshop on Digital Watermarking (“IWDW” 2006). Springer Lecture Notes in Computer Science 2006 (to appear) 13. |
Kocher, et al., “Self Protecting Digital Content”, Technical Report from the CRI Content Security Research Initiative, Cryptography Research, Inc. 2002-2003 14 pages. |
Sirbu, M. et al., “Net Bill: An Internet Commerce System Optimized for Network Delivered Services”, Digest of Papers of the Computer Society Computer Conference (Spring) Mar. 5, 1995 pp. 20-25 vol. CONF40. |
Schunter, M. et al., “A Status Report on the SEMPER framework for Secure Electronic Commerce”, Computer Networks and ISDN Systems, Sep. 30, 1998, pp. 1501-1510 vol. 30 No. 16-18 NL North Holland. |
Konrad, K. et al., “Trust and Electronic Commerce—more than a technical problem,” Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems Oct. 19-22, 1999, pp. 360-365 Lausanne. |
Kini, et al., “Trust in Electronic Commerce: Definition and Theoretical Considerations”, Proceedings of the 31st Hawaii Int'l Conf on System Sciences (Cat. No. 98TB100216). Jan. 6-9, 1998. pp. 51-61. Los. |
Steinauer D. D., et al., “Trust and Traceability in Electronic Commerce”, Standard View, Sep. 1997, pp. 118-124, vol. 5 No. 3, ACM, USA. |
Hartung, et al. “Multimedia Watermarking Techniques”, Proceedings of the IEEE, Special Issue, Identification & Protection of Multimedia Information, pp. 1079-1107 Jul. 1999 vol. 87 No. 7 IEEE. |
European Search Report & European Search Opinion in EP07112420. |
STAIND (The Singles 1996-2006), Warner Music—Atlantic, Pre-Release CD image, 2006, 1 page. |
Radiohead (“Hail to the Thief”), EMI Music Group—Capitol, Pre-Release CD image, 2003, 1 page. |
U.S. Appl. No. 60/169,274, filed Dec. 7, 1999, entitled “Systems, Methods and Devices for Trusted Transactions”. |
U.S. Appl. No. 60/234,199, filed Sep. 20, 2000, “Improved Security Based on Subliminal and Supraliminal Channels for Data Objects”. |
U.S. Appl. No. 09/671,739, filed Sep. 29, 2000, entitled “Method and Device for Monitoring and Analyzing Signals”. |
Unknown, Tirkel, A.Z., “A Two-Dimensional Digital Watermark”, Scientific Technology, 686, 14, date unknown. |
PCT International Search Report in PCT/US95/08159. |
PCT International Search Report in PCT/US96/10257. |
Supplementary European Search Report in EP 96919405. |
PCT International Search Report in PCT/US97/00651. |
PCT International Search Report in PCT/US97/00652. |
PCT International Search Report in PCT/US97/11455. |
PCT International Search Report in PCT/US99/07262. |
PCT International Search Report in PCT/US00/06522. |
Supplementary European Search Report in EP00919398. |
PCT International Search Report in PCT/US00/18411. |
PCT International Search Report in PCT/US00/33126. |
PCT International Search Report in PCT/US00/21189. |
Delaigle, J.-F., et al. “Digital Watermarking,” Proceedings of the SPIE, vol. 2659, Feb 1, 1996, pp. 99-110. |
Schneider, M., et al. “A Robust Content Based Digital Signature for Image Authentication,” Proceedings of the International Conference on Image Processing (IC. Lausanne) Sep. 16-19, 1996, pp. 227-230, IEEE ISBN. |
Cox, I. J., et al. “Secure Spread Spectrum Watermarking for Multimedia,” IEEE Transactions on Image Processing, vol. 6 No. 12, Dec. 1, 1997, pp. 1673-1686. |
Wong, Ping Wah. “A Public Key Watermark for Image Verification and Authentication,” IEEE International Conference on Image Processing, vol. 1 Oct. 4-7, 1998, pp. 455-459. |
Fabien A.P. Petitcolas, Ross J. Anderson and Markkus G. Kuhn, “Attacks on Copyright Marking Systems,” LNCS, vol. 1525, Apr. 14-17, 1998, pp. 218-238 ISBN: 3-540-65386-4. |
Ross Anderson, “Stretching the Limits of Steganography,” LNCS, vol. 1174, May/Jun. 1996, 10 pages, ISBN: 3-540-61996-8. |
Joseph J.K. O'Ruanaidh and Thierry Pun, “Rotation, Scale and Translation Invariant Digital Image Watermarking”, pre-publication, Summer 1997 4 pages. |
Joseph J.K. O'Ruanaidh and Thierry Pun, “Rotation, Scale and Translation Invariant Digital Image Watermarking”, Submitted to Signal Processing Aug. 21, 1997, 19 pages. |
OASIS (Dig Out Your Soul), Big Brother Recordings Ltd, Promotional CD image, 2008, 1 page. |
Rivest, R. “Chaffing and Winnowing: Confidentiality without Encryption”, MIT Lab for Computer Science, http://people.csail.mit.edu/rivest/Chaffing.txt Apr. 24, 1998, 9 pp. |
PortalPlayer, PP5002 digital media management system-on-chip, May 1, 2003, 4 pp. |
VeriDisc, “The Search for a Rational Solution to Digital Rights Management (DRM)”, http://64.244.235.240/news/whitepaper,/docs/veridisc.sub.--white.sub.--paper.pdf, 2001, 15 pp. |
Cayre, et al., “Kerckhoff s-Based Embedding Security Classes for WOA Data Hiding”, IEEE Transactions on Information Forensics and Security, vol. 3 No. 1, Mar. 2008, 15 pp. |
Wayback Machine, dated Jan. 17, 1999, http://web.archive.org/web/19990117020420/http://www.netzero.com/, accessed on Feb. 19, 2008. |
Namgoong, H., “An Integrated Approach to Legacy Data for Multimedia Applications”, Proceedings of the 23rd Euromicro Conference, vol., Issue 1-4, Sep. 1997, pp. 387-391. |
Wayback Machine, dated Aug. 26, 2007, http://web.archive,org/web/20070826151732/http://www.screenplaysmag.com/t-abid/96/articleType/ArticleView/articleId/495/Defaultaspx/. |
“YouTube Copyright Policy: Video Identification tool—YouTube Help”, accessed Jun. 4, 2009, http://www.google.com/support/youtube/bin/answer.py?h1=en&answer=83766, 3 pp. |
U.S. Appl. No. 12/665,002, filed Dec. 22, 2009, entitled “Method for Combining Transfer Function with Predetermined Key Creation”, published as 20100182570 A1 Jul. 22, 2010, p. 76. |
U.S. Appl. No. 12/592,331, filed Nov. 23, 2009, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data”, published as 20100077220 A1 Mar. 25, 2010, p. 77. |
U.S. Appl. No. 12/590,553, filed Nov. 10, 2009, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data”, published as 20100077219 A1 Mar. 25, 2010, p. 78. |
U.S. Appl. No. 12/590,681, filed Nov. 12, 2009, entitled “Optimization Methods for the Insertion, Protection, and Detection of Digital Watermarks in Digital Data”, published as 20100064140 A1 Mar. 11, 2010, p. 79. |
U.S. Appl. No. 12/655,036, filed Dec. 22, 2009, entitled “Utilizing Data Reduction in Steganographic and Cryptographic Systems”, published as 20100153734 A1 Jun. 17, 2010, p. 80 . |
U.S. Appl. No. 12/655,357, filed Dec. 22, 2009, entitled “Method and Device for Monitoring and Analyzing Signals”, published as 20100106736 A1 Apr. 29, 2010, p. 81. |
PCT Application No. PCT/US95/08159, filed Jun. 26, 1995, entitled, “Digital Information Commodities Exchange with Virtual Menuing”, published as WO/1997/001892; Publication Date: Jan. 16, 1997, F24. |
PCT Application No. PCT/US96/10257, filed Jun. 7, 1996, entitled “Steganographic Method and Device”—corresponding to—EPO Application No. 96919405.9, entitled “Steganographic Method and Device”, published as WO/1996/042151; Publication Date: Dec. 27, 1996; F19. |
PCT Application No. PCT/US97/00651, filed Jan. 16, 1997, entitled, “Method for Stega-Cipher Protection of Computer Code”, published as WO/1997/026732; Publication Date: Jul. 24, 1997. |
PCT Application No. PCT/US97/00652, filed Jan. 17, 1997, entitled, “Method for an Encrypted Digital Watermark”, published as WO/1997/026733; Publication Date: Jul. 24, 1997. |
PCT Application No. PCT/US97/11455, filed Jul. 2, 1997, entitled, “Optimization Methods for the Insertion, Protection and Detection of Digital Watermarks in Digitized Data”, published as WO/1998/002864; Publication Date: Jan. 22, 1998. |
PCT Application No. PCT/US99/07262, filed Apr. 2, 1999, entitled, “Multiple Transform Utilization and Applications for Secure Digital Watermarking”, published as WO/1999/052271; Publication Date: Oct. 14, 1999. |
PCT Application No. PCT/US00/06522, filed Mar. 14, 2000, entitled, “Utilizing Data Reduction in Steganographic and Cryptographic Systems”, published as WO/2000/057643; Publication Date: Sep. 28, 2000. |
PCT Application No. PCT/US00/18411, filed Jul. 5, 2000, entitled, “Copy Protection of Digital Data Combining Steganographic and Cryptographic Techniques”. |
PCT Application No. PCT/US00/33126, filed Dec. 7, 2000, entitled “Systems, Methods and Devices for Trusted Transactions”, published as WO/2001/043026; Publication Date: Jun. 14, 2001. |
EPO Divisional Patent Application No. 07112420.0, entitled “Steganographic Method and Device” corresponding to PCT Application No. PCT/US96/10257, published as WO/1996/042151, Dec. 27, 1996, cited herein above as F019. |
U.S. Appl. No. 60/222,023, filed Jul. 31, 2007 entitled “Method and apparatus for recognizing sound and signals in high noise and distortion”. |
U.S. Appl. No. 11/458,639 filed Jul. 19, 2006 entitled “Methods and Systems for Inserting Watermarks in Digital Signals”, published as 20060251291 A1 Nov. 9, 2006, p. 82. |
“Techniques for Data Hiding in Audio Files,” by Morimoto, 1995. |
Howe, Dennis Jul. 13, 1998 http://foldoc..org//steganography. |
CSG, Computer Support Group and CSGNetwork.com 1973 http://www.csgnetwork.com/glossarys.html. |
QuinStreet Inc. 2010 What is steganography?—A word definition from the Webopedia Computer Dictionary http://www.webopedia.com/terms/steganography.html. |
Graham, Robert Aug. 21, 2000 “Hacking Lexicon” http://robertgraham.com/pubs/hacking-dict.html. |
Farkex, Inc 2010 “Steganography definition of steganography in the Free Online Encyclopedia” http://encyclopedia2. Thefreedictionary.com/steganography. |
Horowitz, et al., The Art of Eletronics. 2nd Ed., 1989, pp. 7. |
Jimmy eat world (“futures”), Interscope Records, Pre-Release CD image, 2004, 1 page. |
Aerosmith (“Just Push Play”), Pre-Release CD image, 2001, 1 page. |
Phil Collins(Testify) Atlantic, Pre-Release CD image, 2002, 1 page. |
U. are U. Reviewer's Guide (U are U Software, 1998). |
U. are U. wins top honors!—Marketing Flyer (U. are U. Software, 1998). |
Digital Persona, Inc., U. are U. Fingerprint Recognition System: User Guide (Version 1.0, 1998). |
Digital Persona White Paper pp. 8-9 published Apr. 15, 1998. |
Digital Persona, Inc., “Digital Persona Releases U. are. U Pro Fingerprint Security Systems for Windows NT, 2000, '98, '95”, (Feb. 2000). |
U.S. Appl. No. 11/599,838, filed Nov. 15, 2006. |
U.S. Appl. No. 11/899,662, filed Sep. 7, 2007. |
U.S. Appl. No. 10/369,344, filed Feb. 18, 2003. |
U.S. Appl. No. 11/482,654, filed Jul. 7, 2006. |
U.S. Appl. No. 12/215,812, filed Jun. 30, 2008. |
U.S. Appl. No. 12/901,568, filed Oct. 10, 2010. |
U.S. Appl. No. 11/497,822, filed Aug. 2, 2006. |
U.S. Appl. No. 12/217,834, filed Jul. 9, 2008. |
U.S. Appl. No. 11/897,790, filed Aug. 31, 2007. |
U.S. Appl. No. 12/462,799, filed Aug. 10, 2009. |
U.S. Appl. No. 11/899,661, filed Sep. 7, 2007. |
U.S. Appl. No. 12/590,681, filed Nov. 19, 2009. |
U.S. Appl. No. 11/897,791, filed Aug. 31, 2007. |
U.S. Appl. No. 12/590,553, filed Nov. 10, 2009. |
U.S. Appl. No. 12/592,331, filed Nov. 23, 2009. |
U.S. Appl. No. 11/599,964, filed Nov. 15, 2006. |
U.S. Appl. No. 13/212,264, filed Aug. 18, 2011. |
U.S. Appl. No. 08/674,726, filed Jul. 2, 1996. |
U.S. Appl. No. 09/545,589, filed Apr. 7, 2000. |
U.S. Appl. No. 11/244,213, filed Oct. 5, 2005. |
U.S. Appl. No. 12/009,914, filed Jan. 23, 2008. |
U.S. Appl. No. 12/005,230, filed Dec. 26, 2007. |
U.S. Appl. No. 12/803,168, filed Jun. 21, 2010. |
U.S. Appl. No. 11/649,026, filed Jan. 3, 2007. |
U.S. Appl. No. 12/803,194, filed Jun. 21, 2010. |
U.S. Appl. No. 12/892,900, filed Sep. 28, 2010. |
U.S. Appl. No. 08/489,172, filed Jun. 7, 1995. |
U.S. Appl. No. 08/775,216, filed Dec. 31, 1996. |
U.S. Appl. No. 08/999,766, filed Jul. 23, 1997. |
U.S. Appl. No. 11/894,476, filed Aug. 21, 2007. |
U.S. Appl. No. 11/050,779, filed Feb. 7, 2005. |
U.S. Appl. No. 12/802,519, filed Jun. 8, 2010. |
U.S. Appl. No. 12/383,916, filed Mar. 30, 2009. |
U.S. Appl. No. 11/894,443, filed Aug. 21, 2007. |
U.S. Appl. No. 12/913,751, filed Oct. 27, 2010. |
U.S. Appl. No. 13/803,889, filed Mar. 14, 2013. |
U.S. Appl. No. 08/587,943, filed Jan. 17, 1996. |
U.S. Appl. No. 09/046,627, filed Mar. 24, 1998. |
U.S. Appl. No. 10/602,777, filed Jun. 25, 2003. |
U.S. Appl. No. 11/512,701, filed Aug. 29, 2006. |
U.S. Appl. No. 11/895,388, filed Aug. 24, 2007. |
U.S. Appl. No. 12/655,002, filed Dec. 22, 2009. |
U.S. Appl. No. 13/556,420, filed Jul. 24, 2012. |
U.S. Appl. No. 13/794,584, filed Mar. 12, 2013. |
U.S. Appl. No. 09/731,039, filed Dec. 7, 2000. |
U.S. Appl. No. 11/647/861, filed Dec. 29, 2006. |
U.S. Appl. No. 12/383,879, filed Mar. 30, 2009. |
U.S. Appl. No. 12/886,732, filed Sep. 21, 2010. |
U.S. Appl. No. 13/572,641, filed Aug. 11, 2012. |
U.S. Appl. No. 13/794,742, filed Mar. 12, 2013. |
U.S. Appl. No. 10/049,101, filed Jul. 23, 2002. |
U.S. Appl. No. 12/287,443, filed Oct. 9, 2008. |
U.S. Appl. No. 13/413,691, filed Mar. 7, 2012. |
U.S. Appl. No. 13/796,538, filed Mar. 12, 2013. |
U.S. Appl. No. 09/657,181, filed Sep. 7, 2000. |
U.S. Appl. No. 12/005,229, filed Dec. 26, 2007. |
U.S. Appl. No. 12/655,357, filed Dec. 22, 2009. |
U.S. Appl. No. 13/035,964, filed Feb. 26, 2011. |
U.S. Appl. No. 13/487,119, filed Jun. 1, 2012. |
U.S. Appl. No. 13/802,384, filed Mar. 13, 2013. |
U.S. Appl. No. 10/417/231, filed Apr. 17, 2003. |
U.S. Appl. No. 11/900,065, filed Sep. 10, 2007. |
U.S. Appl. No. 11/900,066, filed Sep. 10, 2007. |
U.S. Appl. No. 12/383,289, filed Mar. 23, 2009. |
U.S. Appl. No. 13/273,930, filed Oct. 14, 2011. |
U.S. Appl. No. 13/551,097, filed Jul. 17, 2012. |
U.S. Appl. No. 13/488,357, filed Jun. 4, 2012. |
U.S. Appl. No. 13/488,395, filed Jun. 4, 2012. |
U.S. Appl. No. 09/053,628, filed Apr. 2, 1998. |
U.S. Appl. No. 09/644,098, filed Aug. 23, 2000. |
U.S. Appl. No. 11/358,874, filed Feb. 21, 2006. |
U.S. Appl. No. 12/799,894, filed May 4, 2010. |
U.S. Appl. No. 09/731,040, filed Dec. 7, 2000. |
U.S. Appl. No. 13/826,858, filed Mar. 14, 2013. |
U.S. Appl. No. 13/797,744, filed Mar. 12, 2013. |
U.S. Appl. No. 09/594,719, filed Jun. 16, 2000. |
U.S. Appl. No. 11/519,467, filed Sep. 12, 2006. |
U.S. Appl. No. 12/655,036, filed Dec. 22, 2009. |
U.S. Appl. No. 13/423,650, filed Mar. 19, 2012. |
U.S. Appl. No. 13/802,471, filed Mar. 13, 2013. |
U.S. Appl. No. 08/772,222, filed Dec. 20, 1996. |
U.S. Appl. No. 09/456,319, filed Dec. 8, 1999. |
U.S. Appl. No. 11/826,234, filed Dec. 30, 2004. |
U.S. Appl. No. 11/592,879, filed Nov. 2, 2006. |
U.S. Appl. No. 12/798,959, filed Apr. 14, 2010. |
U.S. Appl. No. 11/518,806, filed Sep. 11, 2006. |
U.S. Appl. No. 13/429,396, filed Mar. 25, 2012. |
U.S. Appl. No. 61/794,141, filed Mar. 15, 2013. |
Sep. 14, 2010, U.S. Appl. No. 12/383,916. |
Nov. 17, 2010, Review of draft master IDS, correction to cite publications in lieu of filed applications, per RAN instructions. |
Dec. 9, 2010, U.S. Appl. No. 11/900,065. |
Nov. 30, 2010, U.S. Appl. No. 12/799,894. |
Nov. 21, 2011, U.S. Appl. No. 12/287,443. |
Jan. 12, 2012, U.S. Appl. No. 12/803,194. |
Jan. 12, 2012, U.S. Appl. No. 12/655,002. |
Jan. 12, 2012, U.S. Appl. No. 13/035,964. |
Jan. 12, 2012, U.S. Appl. No. 11/900,065. |
Mar. 7, 2012, U.S. Appl. No. 11/900,065. |
Aug. 30, 2012, U.S. Appl. No. 13/413,691. |
Sep. 17, 2012, U.S. Appl. No. 13/556,420. |
Nov. 26, 2012, U.S. Appl. No. 13/035,964. |
Apr. 16, 2013, U.S. Appl. No. 13/035,964. |
Number | Date | Country | |
---|---|---|---|
20130185397 A1 | Jul 2013 | US |
Number | Date | Country | |
---|---|---|---|
60147134 | Aug 1999 | US | |
60213489 | Jun 2000 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13413691 | Mar 2012 | US |
Child | 13796538 | US | |
Parent | 12287443 | Oct 2008 | US |
Child | 13413691 | US | |
Parent | 10049101 | US | |
Child | 12287443 | US |