Digital watermarking systems

Abstract
A variety of systems responsive to watermarked documents are detailed. In one, watermarking is employed to facilitate secure online transactions. In another, a system for exchanging data is provided. One system includes a user terminal and a central site. The user terminal includes a watermark reader, and a capture device to capture an image of a watermarked document. The central site includes a database of image hashes. The user terminal communicates with the central site. The watermark reader reads a watermark and computes a hash of a captured image, and passes the hash to the central site for comparison with the database of image hashes.
Description
FIELD OF THE INVENTION

The present invention relates to hidden data systems, and is particularly illustrated with reference to documents employing digital watermarks.


BACKGROUND AND SUMMARY OF THE INVENTION

Digital watermarking technology, a form of steganography, encompasses a great variety of techniques by which plural bits of digital data are hidden in some other object without leaving human-apparent evidence of alteration. Many such techniques are detailed in the above-cited documents.


In accordance with one embodiment of the present invention, watermarking is employed to facilitate e-commerce transactions. More particularly, watermarking is employed to assure that an on-line purchaser of goods has physical custody of the credit card being charged. Without such custody, the credit card issuer will refuse the requested transaction.


According to another embodiment, a method of commerce over the internet between a user and a merchant is provided. The user is in possession of a document including an embedded watermark. The method includes the steps of: i) extracting identifying data from the watermark, and passing the identifying data to a central site; ii) at the central site, identifying a financial institution identifier associated with the document and passing the identifier and a session ticket to the user; iii) contacting the financial institution via the financial institution identifier and passing the session ticket to obtain an authentication ticket; iv) passing the authentication ticket from the user to the merchant to facilitate a transaction; and v) providing the authentication ticket from the merchant to the financial institution.


In still another embodiment, a method of verifying data is provided. The method includes the steps of: i) digitally capturing an image; ii) computing a hash of the captured image; and iii) comparing the hash with a database of hashes, the database of hashes comprising hashes corresponding to previously captured images.


A system for exchanging data is provided according to yet another embodiment. The system includes a user terminal and a central site. The user terminal includes a watermark reader, and a capturing device to capture an image. The central site includes a database of image hashes. The user terminal communicates with the central site. Also, the reader reads a watermark and computes a hash of a captured image and passes the hash to the central site for comparison with the database of image hashes.


According to another embodiment, a method is provided for commerce over a communications system between a user and a merchant. The system includes a central computer, a user computer, a merchant computer and a financial institution computer. The user computer includes a watermark reader. The various computers communicate via a network. The method includes the steps of: i) accessing the merchant computer from the user computer; ii) launching on the user computer the watermark reader to read a document comprising an embedded watermark, the watermark reader extracting identifying data from the watermark; iii) accessing the central computer from the user computer to obtain a URL for the financial institution computer and a ticket, the URL being identified from the extracted identifying data; iv) passing the ticket from the user computer to the financial institution computer to obtain an authorization; v) upon receipt of the authorization, passing the authorization from the user computer to the merchant computer; and vi) passing the authorization from the merchant computer to the financial institution computer.


A computer readable medium having a data structure stored thereon is provided according to another embodiment. The data structure includes a document identifier, a document type identifier; a hash of an image from which the document identifier and document type identifier were extracted from.


The foregoing and other features and advantages of the present invention will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a system according to an illustrative embodiment of the present invention.



FIG. 2 illustrates a system according to an illustrative embodiment of the present invention.



FIGS. 3
a through 8 further illustrate the system of FIG. 2.





DETAILED DESCRIPTION

In accordance with one embodiment 10 of the present invention, a document 12 includes plural-bit digital data steganographically encoded therein (e.g., by digital watermarking). The document can be a photo ID (e.g., a driver's license, student ID, or passport), a value document (e.g., a banknote, stock certificate, or other financial instrument), a credit card, a product manual, bank or credit account card, registration card, or virtually any other type of document.


The encoding of the document can encompass artwork or printing on the document, the document's background, a laminate layer applied to the document, surface texture, etc. If a photograph is present, it too can be encoded. A variety of watermark encoding techniques are detailed in the cited patents and applications; artisans in the field know many more.


For expository convenience, this section focuses on photo ID cards and credit cards, but it will be recognized that the invention is not so limited.


In an illustrative embodiment, the card is encoded with a payload of 32 bits. This payload is processed before encoding, using known techniques (e.g., convolutional coding, turbo codes, etc.), to improve its reliable detection in adverse conditions. In other embodiments, a payload larger or smaller than 32 bits can naturally be used (e.g., 8–256 bits).


The encoded card is presented to a reader station 14 for reading. The reader station 14 includes an input device 16 and a processor 18.


The input device 16 can take various forms, including a flatbed scanner, a hand scanner (including an imaging mouse), a video camera, etc.


The processor 18 can be a general purpose or dedicated computer, incorporating a CPU 20, memory 22, an interface 24 to the input device, a display screen or other output device 26, and optionally a network connection 28. The network connection can be used to connect, through an intranet, internet, or otherwise, to a remote computer 30.


Suitable software programming instructions, stored in memory 22 of processor 18, or in a memory of remote computer 30, can be used to effect various types of functionality for embodiment 10.


One functionality is to increase security for credit card-based e-commerce transactions. Presently, all that is required to purchase goods on-line is a credit card number. Credit card numbers may be obtained illicitly in numerous ways, from dumpster diving to intercepting unencrypted internet transmissions, or by hacking into an online database.


In accordance with this application of the invention, a bank or other entity that issues credit cards may offer a service to its subscribers that requires physical presentment of a credit card before certain purchases (e.g., on-line purchases) can be made. If a subscriber has elected to participate in such a program, the issuer will refuse to authorize payment for any transaction in which the credit card has not been physically presented.


In one such arrangement, a subscriber's home computer, with associated web cam, serves as the reader station 14. On presenting the credit card to the web cam 16, software in the computer decodes a watermark encoded in the credit card artwork, surface texture, etc. Only if this watermark is properly decoded is the card deemed to be present.


The actual verification process can take numerous forms. In one, the credit card number is not passed to the vendor until it is locally verified by reference to the watermark data. In one such arrangement, the card number is provided to the computer in one of various ways (e.g., by typing into a web form presented by internet browser software; by serving from a secure cache, etc.). Before, or after, the computer decodes the watermark data from the physical credit card presented to the web cam. The computer then checks for a predetermined type of correspondence between the credit card number and the watermark data (e.g., the credit card number, processed by a hash function, must yield the watermark payload). Only if the watermark data and credit card number properly correspond is the credit card number transmitted from the browser to the vendor. This approach has, as one of its advantages, that the data exchange protocols between the user, the vendor, and the issuer, needn't be changed.


In another arrangement, both the decoded watermark data and the credit card number are passed to the vendor, and from the vendor to the card issuer. The card issuer can then confirm that the watermark data and credit card number correspond in a predetermined manner, and authorize the transaction if such correspondence is found. This approach has as one of its advantages that the correspondence check is not made at the user's computer, thereby making the verification algorithms employed more secure against hacking.


In still other arrangements, the user does not enter the credit card information at the time of the transaction. Instead, the card number may have already been stored at a remote site on the internet, e.g., at a vendor's database. A cookie stored on the user's computer may be checked by the vendor to determine the identity of the consumer, and thereby identify the corresponding credit card number.


To guard against unauthorized charging in this context, the issuer can refuse charge authorization when the card number is forwarded to it by the vendor. With its refusal, the issuer can provide an error code that indicates, to the vendor, that the user must demonstrate physical custody of the card before the charge will be authorized. The vendor can then query the user computer for this information. If the user has not already done so, the card can be presented to the web cam, and the decoded watermark data then passed to the vendor, and then to the issuer for confirmation of the necessary correspondence.


The back-and-forth just described can be overcome by storing data in the cookie indicating that physical presentment of that user's credit card is required before any credit card transaction can be approved. Such indicia can be added to the cookie the first time a charge authorization is refused for lack of such presentment. Thereafter, when the vendor detects such indicia in the user cookie, it can query the user for watermark data (e.g., inviting the user to present the credit card to the web cam, if necessary) before passing the transaction data to the issuer.


If this (or other) physical presentment technology becomes sufficiently widespread, standards may evolve by which vendors can discern—from data on the user's computer—whether physical presentment is required for credit card transactions. In such case, individual vendor cookies on a user's machines needn't be updated. Instead, a single datum (a cookie or otherwise)—referred to by all vendors—can be used to flag the need for presentment.


(The reference to “other” physical presentment technology anticipates that alternative arrangements may be employed to confirm user custody of a credit card. These may involve magnetic stripe readers, detection of other physical features, communication with a processor-, memory-, or other circuitry-embedded in a card, etc.)


Secure Transaction System


A secure transaction system is described with reference to FIG. 2. FIG. 2 illustrates system 40, which facilitates a transaction for goods, financial instruments, services, etc. The transaction occurs online (e.g., over the internet). However, the principles described herein are equally applicable to transactions occurring over dedicated networks, wireless networks, intranets, WANs, LANs, etc. The overall system 40 components are described with reference to FIG. 2. Further system operations are described with respect to FIGS. 3a8.


In the present invention, communication between a client and a host (or a plurality of hosts) is facilitated. The client and host may both reside locally, or may communicate over remote channels. Communication between the client and host may occur via internet protocols (e.g., TCP/IP), or other communication techniques. In one embodiment, the client is maintained on a user terminal (or user computer, server, etc.), while the host resides on a central site. In another embodiment, the client and host are incorporated within a local system. In still another embodiment, the host is dispersed throughout various sites. These and other such variations are within the scope of the present invention.


With reference to FIG. 2, system 40 includes a user terminal 42, merchant site 44, central site 46, financial institution site 48, and (optionally) remote terminal 50. The user terminal 42 may include a general purpose or dedicated computer incorporating at least a CPU, memory, interface to an input device (e.g., web cam, digital video camera, scanner, and/or still digital camera, etc.) 43, a display (or other output device), and a network connection. The network connection may be used to connect through an intranet, the internet, or otherwise communicate with sites 44, 46, and/or 48. Of course, the user terminal 42 may alternatively include a portable computing unit, such as a personal financial assistant, PocketPC, PalmPilot, etc., with associated components and/or wireless, cable, phone or other networking access. Suitable client software programming instructions, stored in the user terminal memory, or in a memory of a remote computer, can be used to effect various types of functionality for the user terminal 42.


Merchant site 44, central site 46, and financial site 48 each include a computer or server (or a plurality of interconnected servers). As will be appreciated by those skilled in the art, these computers maintain and execute software, e.g., for hosting (and/or supporting) web pages, communication, database management, etc. These sites 44, 46, and 48 also maintain suitable software program instructions to facilitate the system operations described herein. Of course, system 40 may include a plurality of merchant and financial sites, and additional and/or alternative central sites.


With reference to FIG. 3a, a user initiates an online purchase by accessing a website or other interface supported by merchant site 44, e.g., with the aid of an interface residing on user terminal 42. The interface may include a dialog box, web browser, application, and/or other communication mechanism. .A secure, session-oriented internet protocol (“SIP”) connection is preferably created between the merchant site 44 and the user terminal 42. This type of connection helps to prevent unauthorized eavesdropping by a third party.


In one embodiment, the user makes a transaction selection via the merchant's website and proceeds to an online checkout location. The checkout location is preferably a graphical user interface (e.g., a dialog box), which allows the user to select at least one secure checkout option 60. Of course, the checkout could be integrated into another application or interface. As shown in FIG. 3b, one secure checkout option 60 is a “PortalCard™” checkout option. A PortalCard™ may be a digitally watermarked credit card, access token, voucher, check, note, other watermarked document, etc. The documents discussed above are broadly defined so as to include a PortalCard™. (For consistency, the term “document” will be used hereafter instead of PortalCard™). Upon selecting the secure checkout option 60, a watermark decoder (e.g., a browser software plug-in) is launched on the user terminal 42. As an alternatively arrangement, instead of launching the decoder upon selecting the secure checkout option 60, the decoder remains active in the operating background. Of course, the decoder may be integrated into other applications, such as an operating system, software application, independent software module, device, system, etc., as discussed in assignee's Ser. No. 09/636,102 application. Such a decoder detects and reads an embedded watermark (or watermarks) from a signal suspected of containing the watermark. The watermark preferably includes additional data, such as a plural-bit message, payload and/or identification bits, which is extracted by the decoder.


Preferably, the user is prompted to position or to otherwise arrange the document 62 for image capture by input device 43 (FIG. 4). The decoder examines a captured image (or images) and reads the digital watermark to extract the additional data. The additional data may include a document ID (PIDBK) and a document type identifier (DT). These identifiers may be concatenated strings or may be segmented within the additional data (or payload). (The symbol ∥ in the drawings represents concatenated data.). Of course, the data could be combined in another manner, such as in segments, packets or blocks. The document ID uniquely identifies the document and may optionally be associated with a user account (e.g., a credit or cash account). The length of the document identifier is preferably selected based on application and/or system requirements. In an illustrative embodiment, the document identifier includes 8–256 bits (e.g., 8, 32, 44, 64, 128, etc. bits). To provide further security, the document ID may be encrypted with a symmetric key (BK) from the document's issuing institution (e.g., a bank). Preferably, only the issuing institution has possession of the symmetric key.


Software executing at user terminal 42 preferably computes a hash of each captured image. This software may be included as part of the watermark decoder, or may be a separate application or module. Each captured image will generally have a unique hash associated with it. Even images of the same document will have unique features respectively associated with them due to environmental changes (e.g., positioning of the document relative to the camera, background changes, orientation, lighting, etc.). Examples of common hashing algorithms include MD2, MD5, MD11, SHA, and SHA1. Of course, these and other hashing algorithms can be effectively used with the present invention. A computed hash is represented by IH in the figures.


As shown in FIG. 5, the user terminal 42 contacts and establishes a secure communications channel with the central site 46. The user terminal 42 passes a request to the central site 46. The request preferably includes the encrypted document ID (PIDBK), document type (DT), unique image hash (IH), the user terminal's IP address (CIP), and a timestamp (TIMEc) of the request. Of course, the request could include more or less information depending on need and system implementation. Encrypting the request with a central site public key (DKU) provides additional security. In FIG. 5 the encrypted request is represented by:

[PIDBK∥DT∥IH∥TIMEC∥CIP]DKU.

The central site 46 has a corresponding private key to facilitate decryption of the request.


The user terminal 42 may obtain a timestamp in various ways. For example, a timestamp may be obtained by online synchronization of user terminal 42 with central site 46. The user terminal 42 may alternatively maintain or gain access to (e.g., via the internet) an atomic clock.


The central site 46 decrypts a request using the corresponding private key. The central site 46 then has access to the request's components, including the encrypted document ID, document type, unique image hash, the user terminal's IP address, and timestamp. As discussed above, the document ID is preferably encrypted with the issuing financial institution's symmetric key, thus preventing the central site 46 from decrypting or otherwise accessing the document ID—providing a further level of security for system 40.


If provided in a request, the hash (IH) is used as an additional security measure. The central site 46 compares the hash against all other hashes received and stored from the user terminal 42. For even further security, the hash is compared against all stored hashes, or a subset of the stored hashes. A match indicates that the hash was computed from an identical image. Such a match is a near impossibility for a legitimate request when considering background changes, orientation, position variations, etc. A match may suggest that an attack via capture and playback is being carried out. Accordingly, the request is preferably dropped (e.g., is not processed) if a match is found. As an alternative to dropping the request, the central site 46 could query the user for additional verification (e.g., a PIN, password, or instructions to recapture the image).


The timestamp can also be used as an additional security feature. The central site 46 checks whether the timestamp is within an acceptable time window. Preferably, the central site 46 will not process the request if the timestamp indicates that the request was stamped outside of the window. This technique also helps to prevent capture and playback by an unauthorized third party.


The central site 46 identifies corresponding information by using the document type identifier (DT) as an index or reference. For example, the document type identifier is used to index into a database of URLs. These URLs respectively correspond to various financial institutions, which have issued watermarked documents. The central site 46 matches the document type identifier (DT) with a URL (e.g., URLB) corresponding to the document's issuing institution. In this example, the issuing institution is financial institution 48.


The central site 46 provides a session ticket (TD). The session ticket preferably includes the encrypted document ID (PIDBK), a timestamp for the return ticket (TIMED) and an IP address for the user terminal 42. The session ticket is preferably encrypted with the financial institution's public key (BKU). Such encryption helps to prevent a malicious or unauthorized user of the user terminal 42 from interpreting and modifying the session ticket (TD). The user's IP address may be verified at a later stage of the transaction process. Such IP address verification helps prevent misdirection of the session receipt. The session ticket and the URL of the financial institution (URLB) are returned to the user terminal 42 (e.g., URLB∥TD in FIG. 5).


With reference to FIG. 6, upon receipt of the URLB and session ticket (TD) the user's client (e.g., client software residing at user terminal 42) contacts financial institution 42 via the URLB. The client (via user terminal 42) passes the session ticket (TD), merchant site URL (e.g., URLM), and the transaction details to financial institution 48. The transaction details preferably include the amount of the online purchase. The connection with the financial institution 48 is preferably secure (e.g., through a secure session internet protocol connection).


The financial institution 48 decrypts the session ticket with its corresponding private key. The user terminal IP address and return timestamp may be verified to determine any misdirection or playback attack. The financial institution 48 now has access to the encrypted document ID, which it decrypts with its symmetric key. The decrypted document ID is used to index or otherwise locate the user's account. In some cases, the document ID may include the user's account number. The user's corresponding account may be queried to determine if the user has sufficient funds (or credit) for the transaction amount. The financial institution may optionally prompt the user terminal 42 for a second form of identification (e.g., a PIN or password) before authoring the transaction. In an alternative embodiment, the PIN (or other verification) is collected and included in the session ticket, thus providing further efficiency for the system.


The financial institution 48 provides an authorization ticket (TB) to the user terminal 42 upon authorization of a transaction (FIG. 6). An authorization ticket preferably includes the document ID, a timestamp for the ticket, the user terminal's IP address, the merchant's URL, and the amount of the transaction. The authorizing ticket is used to help facilitate payment to the merchant. The authorization ticket is preferably encrypted using a symmetric key (BK) associated with the financial institution. Since only the financial institution 48 knows the symmetrical key, encrypting the authorization ticket as such prevents a malicious user or merchant from interpreting or modifying the authorization ticket (IB).


The user's client residing at terminal 42 passes the bank authorization ticket (TB) to the merchant site 44, as shown in FIG. 7. The client may also pass additional information such as shipping and handling information. This information is optionally stored locally at the user terminal 42, and submitted automatically to the merchant site 44 with the authorization ticket. The user may also be presented with a dialog screen, which allows entry and/or changes to shipping and handling requirements. Since the bank authorization ticket is encrypted with a symmetrical key, the authorization ticket cannot be meaningfully decrypted or altered by the user.


As shown in FIG. 8, the merchant site 44 verifies the authorization of the credit/payment by passing the authorization ticket (TB) back to the financial institution 48, along with any other details of the transaction (e.g., merchant ID, user information, contract terms, etc.). The merchant site 44 may contact the financial institution 48 via the internet, or through secure, dedicated channels. The authorization ticket cannot be meaningfully decrypted or altered by the merchant. Accordingly, the financial institution can be assured that the ticket contains the original amount and merchant URL that was reported by the user terminal 42. Also, the user is protected since her account details are never exposed to the merchant.


Existence of the authorization ticket signals to the financial institution 48 that a “PortalCard” purchase option was used for the transaction. After decrypting the authorization ticket, these details can be used to verify the transaction details. The ticket timestamp can also be used to prevent duplicate transaction submissions. The financial institution 48 confirms validity of the authorization ticket to the merchant site 44. Optionally, the user then receives a confirmation from the Merchant site 44 that the transaction has been successfully completed.


The following discussion is presented to summarize some of the features and functionality of system 40. A user begins an online purchase by accessing a merchant website. A decoder, residing on the user's site, reads (or identifies) a watermarked document. The client residing on a user terminal contacts a central site to obtain a URL for a financial institution's authentication server and to get a session ticket. The client contacts the financial institution's server via the URL and passes the session ticket to the bank to obtain an authorization ticket. The client then passes the authorization ticket to the merchant. The merchant includes the authorization ticket in its financial transaction with the financial institution. Preferably, these steps are seamlessly carried out by the user's computer (e.g., the client software), in conjunction with the merchant website, central site, and financial institution site.


System 40 offers many advantages. For example, system 40 provides a secure transaction system for online purchases via layers of message encryption and obtaining secure communication channels. According to one embodiment, a merchant is prevented from accessing user credit information (e.g., account or document ID). System 40 also prevents an unscrupulous user from changing price or transaction details, since the authorization ticket is securely encrypted. The above-described hash matching techniques also provide a unique feature of the present invention. The hash matching helps to prevent capture and playback attacks. These and other advantages are apparent from the detailed description.


Alternative Embodiments


There are many variations and alternative arrangements of system 40. Of course, such modifications fall within the scope of the present invention. For example, additional security measures may be taken in event that a user accesses the transaction system (e.g., merchant site 44, central site 46 and financial institution 48, etc.) through remote site 50 (FIG. 4). For example, input device 51 and its link to a remote site 50 may include an encrypted link (or links), using a key negotiated by camera 51 and software resident on the remote site 50. Secure encryption techniques may also be used for a link between remote site 52 and the system.


In another alternative arrangement, a watermark is not decoded by the user terminal 42 (e.g., a decoder operating on user terminal 42). Instead, the decoder determines whether a watermark is present within a captured image. If a watermark is present, a block of image data (e.g., all or some of the captured image) is passed as a request to central site 46. Preferably, the request includes the image data (IBLOCK), a timestamp (TIMEC), and the user terminal's IP address (CIP). The request may be encrypted with a central site public key (DKU) for additional security. An encrypted request is represented in FIG. 5 as [IBLOCK∥TIMEC∥CIP]DKU. The central site 46 decrypts the request and then extracts the watermark from the image data. Additional data (e.g., the encrypted document ID and document type identifier) can then be extracted from the watermark. This alternative arrangement shifts a majority of the decoding from the user terminal 42 to the central site 46. Shifting the decoding away from the user terminal 42 may provide an advantage, particularly if a third party could intercept the data stream from the user terminal 42 to the central site 46. In this alternative arrangement, the intercepted stream will not be in a decoded form—which significantly reduces the amount of revealed data. Also, since the decoding processes (or a majority of the processes) are maintained securely by central site 46, there is less of the decoding algorithms (and/or software code) to attack at the user terminal 42.


Upon receiving the image block, the central site 46 may optionally record the image data or a hash of the image data. The hash is then used to match against other hashes corresponding to the user terminal 42, as discussed above.


A premise of these ideas also finds application beyond online purchases. One application is to verify permissions, add security to logins, and/or to facilitate account access (e.g., a bank account, credit account, access to restricted or hidden network layers, etc.). For example, a user establishes a link with the central site 46 via an embedded object to obtain a corresponding permission authenticator URL. The central site 46 generates a session ticket with appropriate data (identifiers, IP addresses, etc.). The user terminal 42 passes the session ticket to the authenticator (e.g., bank, corporation, etc.) for authorization. The authenticator authorizes access by providing an authorization ticket or other enabling data (corresponding password, new URL, etc.). Such modifications are within the scope of the present invention.


Additional Security Features


To deter use of precision photocopy apparatuses to reproduce document faces (while retaining the associated watermark), the face of the document can be provided with a reflective layer, e.g., in the form of an overlay or varnish. In the bright illumination of a photocopier, such layer mirrors the light back onto the photodetectors, preventing them from accurately reproducing the watermark pattern. In contrast, when presented to a web cam or other such imaging device, no bright illumination is typically present, so the photosensors are not overwhelmed and the document can be used for its intended authentication purpose.


Concluding Remarks


The foregoing are just exemplary implementations of secure online transaction systems. It will be recognized that there are a great number of variations on these basic themes. The foregoing illustrates but a few applications of the detailed technology. There are many others.


Consider, for example, the use of embedded watermark data in a document to allow access to a resource. A card may be used to grant physical access through a normally locked door. Or a card may be used to logon to a computer network—with directory privileges tied to the data decoded from the card.


Entry of a user's PIN code, or other identity check, may be desirable in certain contexts, e.g., to guard against granting access to a person who has found or stolen someone else's card. Security is further enhanced when a user possesses both i) a physical document, and ii) corresponding verification data (e.g., password, PIN, retinal scan, voice recognition, biometric verification data, etc). To illustrate, in order to gain system or network access (or to login), a user must demonstrate physical possession of document. A compliant reader reads and extracts embedded data from the document. The embedded data is used to index or otherwise identify corresponding verification data. The corresponding verification data is preferably predetermined and stored for comparison. The user is prompted to provide the verification data (e.g., to provide a PIN, yield to a fingerprint or retinal scan, etc.). (The user may be prompted to provide such verification data prior to, or after, presentment of the document). System access is granted only when the provided verification data correctly corresponds with the predetermined verification data. This multi-step security (e.g., physical possession and verification data) is valuable in many environments, including authentication to a network, access to a software application, verification of identity, verification of permissions, login security, restricted access management, etc. The basic system functionality as shown in FIG. 2 may be used to facilitate such. Of course, a link between a client and host also may be used to facilitate such a verification process.


In some cases, the data encoded in the card fully replicates certain information associated with the card (e.g., the bearer's last name or initials, or OCR printing, or mag-stripe data, etc.). Or the encoded data can be related to other information on the card in a known way (e.g., by a hash function based on the bearer's printed name, or the full-text card contents). Or the encoded data can be unrelated to other information on the card. In many embodiments, the data encoded in the card may serve as an index to a larger repository of associated data stored in a remote database, e.g., on computer 30. Thus, for example, an index datum read from a passport may allow a passport inspector to access a database record corresponding to the encoded data. This record may include a reference photograph of the passport holder, and other personal and issuance data. If the data obtained from the database does not match the text or photograph included on the card, then the card has apparently been altered.


Whereas specific bit lengths and string names have been used for illustrative purposes, it will be appreciated that the present invention is not so limited. Instead, data of differing lengths and names may be used. Also, whereas specific components for the various tickets have been used for illustrative purposes, it will be appreciated by those skilled in the art that a ticket could include alternative components, so long as some form of identifying features remain.


To provide a comprehensive disclosure without unduly lengthening this specification, the above-detailed patent documents are incorporated herein by reference.


Having described and illustrated the principles of the invention with reference to illustrative embodiments, it should be recognized that the invention is not so limited.


As a further alternative, the embedded data may be infrared (IF) or ultraviolet (UV) sensitive. The embedding can be effected using IF or UV ink. For example, the CCD or CMOS detector of most cameras (under normal lighting) detects some of the UV spectrum. The effect can be enhanced by illuminating the object with black light in order to fluoresce the mark at the time of imaging—making the mark visible to the camera. Earlier disclosure relating to use of UV inks is provided in co-pending U.S. patent application Ser. No. 09/562,516, filed May 1, 2000, and 60/257,822, filed Dec. 21, 2000, each of which are hereby incorporated by reference.


The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this and the incorporated-by-reference patent/applications are also contemplated.


The above-described methods and functionality can be facilitated with computer executable software stored on computer readable mediums, such as electronic memory circuits, RAM, ROM, magnetic media, optical media, removable media, etc. Such software may be stored on a user terminal, and/or distributed throughout a network. Data structures representing the various data strings may also be stored on such computer readable mediums.


In view of the wide variety of embodiments to which the principles and features discussed above can be applied, it should be apparent that the detailed embodiments are illustrative only and should not be taken as limiting the scope of the invention. Rather, we claim as our invention all such modifications as may come within the scope and spirit of the following claims and equivalents thereof.

Claims
  • 1. A method of verifying data comprising; digitally capturing an image;computing a first hash of the captured image;comparing the first hash with a database of hashes, the database of hashes comprising hashes corresponding to previously captured images; andidentifying an attack when the first hash matches at least one hash in the database.
  • 2. The method of claim 1, further comprising: enabling further processing when the first hash fails to match any of the hashes in the database.
  • 3. A method of verifying data comprising: digitally capturing an image;computing a first hash of the captured image; comparing the first hash with a database of hashes, the database of hashes comprising hashes corresponding to previously captured images, wherein the captured image comprises an embedded watermark,extracting data from the watermark;encrypting a request, the request comprising the extracted data and the first hash; andsending the encrypted request to an external computer, wherein said comparing is performed at said external computer.
  • 4. A method of verifying data comprising: digitally capturing an image;computing a first hash of the captured image;comparing the first hash with a database of hashes, the database of hashes comprising hashes corresponding to previously captured images, wherein the captured image comprises an embedded plural-bit watermark,extracting plural-bit date from the watermark;encrypting a request comprising a block of image data from the image;sending the encrypted request to an external computer; wherein said computing and said comparing are performed at the external computer.
  • 5. A system for exchanging data comprising: a user terminal comprising a watermark reader, and a capturing device to capture an image of a watermarked document; anda central site comprising a database of image hashes, wherein said user terminal communicates with said central site, and wherein said reader reads a watermark and computes a hash of a captured image and passes the hash to said central site for comparison with said database of image hashes.
  • 6. A method of preventing online attacks, comprising: capturing an encoded image;extracting data from the encoded image;computing a hash of the captured image;comparing the hash against previously determined hashes; andlinking the extracted data to other data when the hash does not match any of the previously determined hashes.
  • 7. A method of preventing online attacks, comprising: capturing an encoded image;extracting data from the encoded image;computing a hash of the captured image;comparing the hash against previously determined hashes; anddisregarding the extracted data when the hash matches at least one of the previously determined hashes.
  • 8. A method comprising: maintaining a database including a plurality of hashes stored therein;receiving through a network a first hash derived from image data, the first hash being derived remotely relative to performance of said method;determining whether the first hash has been previously received with reference to at least the plurality of hashes stored in the database;disregarding a request associated with the first hash if the first hash has been previously received.
  • 9. A method comprising: maintaining a database including a plurality of hashes stored therein;receiving through a network a request and a first hash derived from image data, the first hash being derived remotely relative to performance of said method;determining whether the first hash has been previously received with reference to at least the plurality of hashes stored in the database;as a condition of executing the request, requesting validation information from a user associated with the request when the first hash has been previously received; andexecuting the request when at least one of the following is met: i) the first hash has not been previously received; and ii) proper validation information is received from a user.
RELATED APPLICATION DATA

This application claims the benefit of U.S. Provisional Application No. 60/257,822, filed Dec. 21, 2000. This patent application is also a continuation-in-part of U.S. application Ser. No. 09/562,049, filed May 1, 2000. These applications are hereby incorporated by reference. The subject matter of the present application is related to that disclosed in U.S. applications Ser. No. 09/127,502, filed Jul. 31, 1998 (now U.S. Pat. No. 6,345,104); Ser. No. 09/074,034, filed May 6, 1998 (now U.S. Pat. No. 6,449,377); Ser. No. 09/343,104, filed Jun. 29, 1999; Ser. No. 09/503,881, filed Feb. 14, 2000 (now U.S. Pat. No. 6,614,914); Ser. No. 09/547,664, filed Apr. 12, 2000; Ser. No. 09/562,516, filed May 1, 2000; Ser. No. 09/562,524, filed on May 1, 2000 now U.S. Pat. No. 6,724,912); Ser. No. 09/571,422, filed May 15, 2000 (now U.S. Pat. No. 6,947,571); 09/636,102, filed Aug. 10, 2000; and in U.S. Pat. No. 5,862,260. Each of these patent documents is hereby incorporated by reference.

US Referenced Citations (220)
Number Name Date Kind
3805238 Rothfjell Apr 1974 A
3845391 Crosby Oct 1974 A
3891829 Dobras Jun 1975 A
3894756 Ward Jul 1975 A
3984624 Waggener Oct 1976 A
4131367 French et al. Dec 1978 A
4238849 Gassmann Dec 1980 A
4313197 Maxemchuk Jan 1982 A
4325083 Rouchon et al. Apr 1982 A
4345011 Drexhage Aug 1982 A
4367488 Leventer et al. Jan 1983 A
4379947 Warner Apr 1983 A
4380027 Leventer et al. Apr 1983 A
4395600 Lundy et al. Jul 1983 A
4414635 Gast et al. Nov 1983 A
4425642 Moses et al. Jan 1984 A
4528588 Löfberg Jul 1985 A
4547074 Hinoda et al. Oct 1985 A
4547804 Greenberg Oct 1985 A
4597495 Knosby Jul 1986 A
4672605 Hustig et al. Jun 1987 A
4675746 Tetrick et al. Jun 1987 A
4679068 Lillquist et al. Jul 1987 A
4750173 Blüthgen Jun 1988 A
4751571 Lillquist Jun 1988 A
4807031 Broughton et al. Feb 1989 A
4855725 Fernandez Aug 1989 A
4855827 Best Aug 1989 A
4888798 Earnest Dec 1989 A
4908836 Rushforth et al. Mar 1990 A
4908873 Philibert et al. Mar 1990 A
4917500 Lugos Apr 1990 A
4947028 Gorog Aug 1990 A
4965449 Suzuki et al. Oct 1990 A
4969041 O'Grady et al. Nov 1990 A
4977594 Shear Dec 1990 A
4990092 Cummings Feb 1991 A
4998010 Chandler et al. Mar 1991 A
5023907 Johnson Jun 1991 A
5047614 Bianco Sep 1991 A
5053956 Donald et al. Oct 1991 A
5059126 Kimball Oct 1991 A
5103459 Gilhousen et al. Apr 1992 A
5113518 Durst et al. May 1992 A
5138712 Corbin Aug 1992 A
5146457 Veldhuis et al. Sep 1992 A
5200822 Bronfin et al. Apr 1993 A
5202828 Vertelney et al. Apr 1993 A
5229841 Taranowski et al. Jul 1993 A
5243423 DeJean et al. Sep 1993 A
5262860 Fitzpatrick Nov 1993 A
5284364 Jain Feb 1994 A
5288976 Citron Feb 1994 A
5298731 Ett Mar 1994 A
5303388 Kreitman et al. Apr 1994 A
5319735 Preuss et al. Jun 1994 A
5337358 Axelrod et al. Aug 1994 A
5339095 Redford Aug 1994 A
5341293 Vertelney et al. Aug 1994 A
5385371 Izawa Jan 1995 A
5413486 Burrows et al. May 1995 A
5428731 Powers Jun 1995 A
5437552 Baer et al. Aug 1995 A
5446273 Leslie Aug 1995 A
5452414 Rosendahl et al. Sep 1995 A
5459489 Redford Oct 1995 A
5461711 Wang et al. Oct 1995 A
5463209 Figh Oct 1995 A
5466158 Smith, III Nov 1995 A
5484292 McTaggart Jan 1996 A
5493677 Bfalogh et al. Feb 1996 A
5495411 Ananda Feb 1996 A
5495581 Tsai Feb 1996 A
5496071 Walsh Mar 1996 A
5524933 Kunt et al. Jun 1996 A
5525798 Berson et al. Jun 1996 A
5530852 Meske Jun 1996 A
5537336 Joyce Jul 1996 A
5545883 Sasou et al. Aug 1996 A
5548645 Ananda Aug 1996 A
5553143 Ross et al. Sep 1996 A
5569549 Redford Oct 1996 A
5579479 Plum Nov 1996 A
5586216 Degen et al. Dec 1996 A
5587784 Pines et al. Dec 1996 A
5597307 Redford et al. Jan 1997 A
5604516 Herrod et al. Feb 1997 A
5613004 Cooperman et al. Mar 1997 A
5624265 Redford et al. Apr 1997 A
5629980 Stefik et al. May 1997 A
5634012 Stefik May 1997 A
5636276 Brugger Jun 1997 A
5638443 Stefik et al. Jun 1997 A
5640193 Wellner Jun 1997 A
5646997 Barton Jul 1997 A
5646999 Saito Jul 1997 A
5650608 Redford et al. Jul 1997 A
5652626 Kawakami et al. Jul 1997 A
5652714 Peterson et al. Jul 1997 A
5657462 Brouwer et al. Aug 1997 A
5659164 Schmid Aug 1997 A
5663766 Sizer, II Sep 1997 A
5671277 Ikenoue et al. Sep 1997 A
5693693 Auslander et al. Dec 1997 A
5715403 Stefik Feb 1998 A
5721788 Powell Feb 1998 A
5729251 Nakashima Mar 1998 A
5734119 France Mar 1998 A
5739814 Ohara et al. Apr 1998 A
5745569 Moskowitz et al. Apr 1998 A
5745604 Rhoads Apr 1998 A
5748763 Rhoads May 1998 A
5765152 Erickson Jun 1998 A
5765176 Bloomberg Jun 1998 A
5768426 Rhoads Jun 1998 A
5774452 Wolosewicz Jun 1998 A
5778102 Sandford, II et al. Jul 1998 A
5799092 Kristol et al. Aug 1998 A
5801687 Peterson Sep 1998 A
5809317 Kogan Sep 1998 A
5818441 Throckmorton Oct 1998 A
5822436 Rhoads Oct 1998 A
5828325 Wolosewicz et al. Oct 1998 A
5841886 Rhoads Nov 1998 A
5845281 Benson Dec 1998 A
5848155 Cox Dec 1998 A
5848413 Wolff Dec 1998 A
5848424 Scheinkman et al. Dec 1998 A
5852673 Young Dec 1998 A
5857038 Owada et al. Jan 1999 A
5862260 Rhoads Jan 1999 A
5862321 Lamming et al. Jan 1999 A
5869819 Knowles et al. Feb 1999 A
5872589 Morales Feb 1999 A
5886337 Rockstein et al. Mar 1999 A
5892900 Ginter et al. Apr 1999 A
5893910 Martineau et al. Apr 1999 A
5905248 Russell et al. May 1999 A
5905800 Moskowitz et al. May 1999 A
5907149 Marckini May 1999 A
5918223 Blum et al. Jun 1999 A
5920861 Hall et al. Jul 1999 A
5920878 DeMont Jul 1999 A
5926822 Garman Jul 1999 A
5932863 Rathus et al. Aug 1999 A
5933798 Linnartz Aug 1999 A
5974141 Saito Oct 1999 A
5983218 Suyeda-Mahmood Nov 1999 A
5991876 Johnson et al. Nov 1999 A
6031914 Tewfik et al. Feb 2000 A
6061451 Muratani et al. May 2000 A
6064764 Bhaskaran et al. May 2000 A
6081827 Reber et al. Jun 2000 A
6122403 Rhoads Sep 2000 A
6199076 Logan et al. Mar 2001 B1
6209092 Linnartz Mar 2001 B1
6216228 Chapman et al. Apr 2001 B1
6226387 Tewfik et al. May 2001 B1
6236971 Stefik et al. May 2001 B1
6243480 Zhao et al. Jun 2001 B1
6256638 Dougherty Jul 2001 B1
6292092 Chow et al. Sep 2001 B1
6301360 Bocionek Oct 2001 B1
6310956 Morito et al. Oct 2001 B1
6311214 Rhoads Oct 2001 B1
6321981 Ray et al. Nov 2001 B1
6345104 Rhoads Feb 2002 B1
6400272 Holtzman et al. Jun 2002 B1
6425081 Iwamura Jul 2002 B1
6434561 Durst, Jr. et al. Aug 2002 B1
6449377 Rhoads Sep 2002 B1
6493457 Quackenbush et al. Dec 2002 B1
6504941 Wong Jan 2003 B1
6526449 Philyaw et al. Feb 2003 B1
6557103 Boncelet et al. Apr 2003 B1
6577336 Safai Jun 2003 B1
6631404 Philyaw Oct 2003 B1
6664976 Lofgren et al. Dec 2003 B1
6834308 Ikezoye et al. Dec 2004 B1
6871789 Hilton et al. Mar 2005 B1
20010001854 Schena et al. May 2001 A1
20010026377 Ikegami Oct 2001 A1
20010026618 Van Wie et al. Oct 2001 A1
20010026629 Oki Oct 2001 A1
20010029580 Moskowitz Oct 2001 A1
20010032186 Iwamura Oct 2001 A1
20010032312 Runje et al. Oct 2001 A1
20010037210 Hirayama Nov 2001 A1
20010037378 Hirayama Nov 2001 A1
20010047426 Hunter Nov 2001 A1
20010047428 Hunter Nov 2001 A1
20010054149 Kawaguchi et al. Dec 2001 A1
20010056468 Okayasu et al. Dec 2001 A1
20010056573 Kovac et al. Dec 2001 A1
20020010684 Moskowitz Jan 2002 A1
20020019946 Iwamura Feb 2002 A1
20020023058 Taniguchi et al. Feb 2002 A1
20020026867 Hasegawa et al. Mar 2002 A1
20020029257 Watanabe et al. Mar 2002 A1
20020034032 Sugiyama et al. Mar 2002 A1
20020042808 Smith et al. Apr 2002 A1
20020042884 Wu et al. Apr 2002 A1
20020046171 Hoshino Apr 2002 A1
20020048621 Boyd et al. Apr 2002 A1
20020049908 Shimosato et al. Apr 2002 A1
20020056041 Moskowitz May 2002 A1
20020059238 Saito May 2002 A1
20020059580 Kalker et al. May 2002 A1
20020061120 Carr et al. May 2002 A1
20020071556 Moskowitz et al. Jun 2002 A1
20020080396 Silverbrook et al. Jun 2002 A1
20020111857 Harris et al. Aug 2002 A1
20020126872 Brunk et al. Sep 2002 A1
20020172425 Venkatesan et al. Nov 2002 A1
20020178410 Haitsma et al. Nov 2002 A1
20030065922 Fredlund et al. Apr 2003 A1
20030097568 Choi et al. May 2003 A1
20030101162 Thompson et al. May 2003 A1
20040254890 Sancho et al. Dec 2004 A1
20050071377 Mihcak et al. Mar 2005 A1
Foreign Referenced Citations (41)
Number Date Country
493091 Jul 1992 EP
650146 Oct 1994 EP
953938 Nov 1999 EP
1117246 Jul 2001 EP
1134710 Sep 2001 EP
1137244 Sep 2001 EP
1139244 Oct 2001 EP
1173001 Jan 2002 EP
1199878 Apr 2002 EP
07-108786 Apr 1995 JP
07-093567 Sep 1995 JP
9216913 Oct 1992 WO
9427228 Nov 1994 WO
9514289 May 1995 WO
9520291 Jul 1995 WO
9601464 Jan 1996 WO
9603736 Feb 1996 WO
WO 9603286 Feb 1996 WO
9619795 Jun 1996 WO
9619821 Jun 1996 WO
9627259 Sep 1996 WO
9629749 Sep 1996 WO
9636163 Nov 1996 WO
9701137 Jan 1997 WO
9702552 Jan 1997 WO
9706502 Feb 1997 WO
9732262 Sep 1997 WO
0143080 Jun 2001 WO
WO 0143080 Jun 2001 WO
WO 0175629 Oct 2001 WO
WO 0197128 Dec 2001 WO
WO 0203385 Jan 2002 WO
WO 0207425 Jan 2002 WO
WO 0207442 Jan 2002 WO
WO 0213073 Feb 2002 WO
WO 0219589 Mar 2002 WO
WO 0223489 Mar 2002 WO
WO 0227617 Apr 2002 WO
WO 0227720 Apr 2002 WO
0237331 May 2002 WO
WO 0939713 May 2002 WO
Related Publications (1)
Number Date Country
20010037313 A1 Nov 2001 US
Provisional Applications (1)
Number Date Country
60257822 Dec 2000 US
Continuation in Parts (1)
Number Date Country
Parent 09562049 May 2000 US
Child 09790322 US