The present invention relates to security systems and methods, and is particularly illustrated with reference to digital watermark-based security systems.
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, preferably without leaving human-apparent evidence of alteration.
Digital watermarking systems typically have two primary components: an embedding component that embeds the watermark in the media content, and a reading component that detects and reads the embedded watermark. The embedding component embeds a watermark pattern by altering data samples of the media content. Many suitable techniques are detailed in the above-cited patent documents. In the present disclosure, however, it should be understood that references to watermarking encompass not only the assignee's watermarking technology, but can likewise be practiced with any other watermarking technology. The physical manifestation of watermarked information most commonly takes the form of altered signal values, such as slightly changed pixel values, picture luminance, picture colors, DCT coefficients, instantaneous audio amplitudes, etc. However, a watermark can also be manifested in other ways, such as changes in the surface micro-topology of a medium, localized chemical changes (e.g. in photographic emulsions), localized variations in optical density, localized changes in luminescence, etc. The reading component analyzes content to detect whether a watermark pattern is present. In applications where the watermark encodes information, the reading component extracts this information from the detected watermark.
One aspect of the present invention is a security system based on digital watermarks. A digital watermark preferably includes a key or access information. The security system analyzes the access information to regulate access or to determine whether to allow access to a computer or secure area.
The foregoing and other features, aspects and advantages of the present invention will be even more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
a-5d are diagrams illustrating the presentation of digitally watermarked documents in a sequence to form a combination.
In accordance with a first embodiment of the present invention, a document 12 includes plural-bit data steganographically encoded thereon (e.g., via digital watermarking). The document 12 can be a photo ID (e.g., a driver's license, student ID, identification document, employee badge, passport, etc.), 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, an image, a printed document, badge, a photograph, a graphic, or virtually any other type of document or physical object.
The encoding of the document 12 can encompass artwork or printing on the document, the document's background, background pattern or tint, a laminate layer applied to the document, surface texture, pixel or luminance variation, graphic, etc. If a photograph is present, it too can be encoded. A variety of watermark encoding techniques are detailed in the above cited patents and applications; artisans in the field know many more.
The encoded document 12 is presented to an input device 14 for image capture. The input device 14 can include a digital camera, digital camera, web camera, flatbed scanner, a hand scanner (including an imaging mouse), a video camera, CCD array, etc., etc. Input device 14 communicates with computer 16.
Computer 16 can be a general purpose or dedicated computer, including electronic processing circuitry (e.g., a CPU) 18, memory 20, a communication interface 22 (e.g., communications port and/or a device driver stored in memory 20, etc.) with the input device 14, a monitor or other output device (e.g., printer, etc.) 24, and optionally a network connection (e.g., communications hardware and/or software) 26. The network connection 26 can be used to connect, e.g., through an intranet, Ethernet, wireless network, internet, or otherwise, to a remote computer (not shown in
Suitable software programming instructions, stored in memory 20 for execution by the electronic processing circuitry 18, can be used to effect various types of functionality for the present embodiment.
One such functionality detects and decodes digital watermarks. Another functionality provides security for network or computer access. Yet another functionality provides document verification for authorized access to a secure area or network location.
It should be appreciated that while the
We initially note that the mere process of giving somebody a security token—be it an identification document, USB token, proximity card, their fingerprint, etc—weakens the security of the system. We believe that using digital watermarks is inherently a more secure method for secure access because digital watermarks can be covert and they can hide in any document.
Now consider our security enhancements using the
In one implementation, a steganographically encoded document 12 is preferably covert, in that a causal visual examination of the document 12 generally does not reveal the steganographic data. As such, document 12 can be placed in a stack of documents (or if an image, hung on the wall or placed in a frame on a desk). Thus, a would-be-intruder is clueless as to which document, if any, includes the access information.
Now consider, for example, a new employee's first day at a secure facility. As she begins her day she is provided with a digitally watermarked document (e.g., an ID badge or pass) to allow access into the secure facility or to her computer. The watermark includes a payload having access information. In one implementation, the access information is associated with the employee's employee number or with the employee's personal information. (For example, the access information may include a hash of the employee's name, birth date, employment start date, favorite XBox® title or movie, etc. Or the access information may include a hash of the employee's biometric information. The biometric information can be a facial scan/print, fingerprint, retinal identifier, voice sample, DNA representation, etc., etc. For more information on hashing techniques, see e.g., assignee's U.S. patente application Ser. No. 10/027,783, filed Dec. 19, 2001 (published as US 2002-0126872 A1), and U.S. patent application Ser. No. 10/094,593, filed Mar. 6, 2002 (published as US 2002-0170966 A1). Each of these published U.S. Patent documents is herein incorporated by reference.). In another implementation, the access information is selected to match a particular security algorithm for a computer workstation or door access.
The employee presents the encoded document 12 to input device 14. Input device 14 captures an image of document 12 and communicates such to computer 16. Steganographic decoding software stored in memory 20 and executed by CPU 18 searches the captured image of document 12 for steganographic encoding, such as a digital watermark. Once found, the digital watermark is decoded to recover the digital watermark payload, e.g., including access information. The access information is then provided to a security software module. (Of course the digital watermark detection software and the security software can be integrated, or can be separate software modules. In some implementations the modules are implemented via hardware.).
The security software module uses the payload' access information to determine whether to allow access. For example, the access information may include a code (e.g., a numeric or alpha-numeric code). If the code matches or otherwise coincides with a predetermined code, access is granted. In one implementation, the code is a cryptographic permutation of the predetermined code. The predetermined code can be stored locally in computer 16 or can be retrieved from a central database. The predetermined code can be user specific, for example, the code can be unique per employee. (A random generator can be used to generate a random code, which is embedded as the payload. The random code is stored in an employee security database record to be indexed with the employee number. In this case, the digital watermark includes the employee's employee number or other identifier. Alternatively, the employee is prompted to enter her employee number, which is used to index the database.). In still another implementation, the employee must provide other access information (e.g., birth date, favorite movie title, etc.), which is then compared to the access information stored on the document.
If the access information includes a biometric hash, the user is prompted to provide a biometric sample. For example, if the hash includes retinal scan data, computer 16 preferably includes or communicates with a retinal scanner. The same (or complimentary) hashing algorithm is preformed on the retinal scan sample to produce a hash (i.e., a “sampled hash”). The payload is decoded from the embedded document 12 to retrieve the payload hash. The payload hash is compare with the sampled hash to verify authenticity. If authentic, access is allowed.
An employee document 12 can be frequently changed or replaced, e.g., every day (or every week, every time the employee leaves a secure facility, etc.). Consider an inventive security method with reference to
The identifier is decoded from the watermark (step 32). The identifier is used to interrogate the database to retrieve the employee's security watermark access information (step 34). As an optional step, the retrieved access information can be compared with the decode access information to further verify the collected document 12. New watermark access information (e.g., a new code) is generated (step 36). In some cases the new access information mirrors the old access information. More preferably, however, is to provide entirely new access information. This new access information is used to update the employee's security watermark access information in the database. A new document 12′ is provided to the employee (step 38). The new document 12′ includes a steganographic payload with the new access information.
To further obscure the security process new document 12′ is preferably a new (or different type of) document, or differently sized document, perhaps even on a different substrate, etc. (For example, if document 12 is a traditional employee badge, new document 12′ can be a family photograph, graphic or digitally watermarked Word or Excel document. The new document 12′ is used the next day (or next facility entry) for building entry, workstation access, etc. The old watermarked document 12′ is preferably destroyed and the corresponding old digital watermarked payload (and code) is deleted from or marked as inactive in the database.
One strength of our inventive system is the fact that outsiders do not know that document 12 or 12′ is an access token. This strength becomes evident, for example, when the digital watermark is embedded in a family picture, graphic or arbitrary Word/Excel document. Further, since documents are everywhere—it is extremely difficult for a would-be-thief to know which document is the access token even IF they know such documents are used as tokens. Not knowing what document is even used, or even that documents are used as the security token enables the security method to remain secret.
In another biometric-based implementation, a steganographic payload (e.g., a digital watermark payload) designates a specific “type” of biometric data for sampling. One type of biometric data is a fingerprint, another type is behavioral characteristics—including signatures, handwriting and voice patterns, still another type is a retinal scan, other types include face maps, DNA samples, blood type, hand geometry, handwriting, iris, vein patterns, and so on. In one example of this implementation, a biometric type is randomly chosen (or otherwise chosen). A corresponding biometric sample is taken from a human subject (e.g., employee). The biometric sample is hashed (or a reduced bit representation of the sample is produced), and the hash is steganographically encoded in a document. The document also includes biometric “type” data to indicate which type of biometric data that the hash represents. To verify authenticity, the encoded document is decoded to retrieve the hash and a biometric “type” data. The employee yields a fresh biometric sample of the type indicated by the steganographic type data. A corresponding hashing algorithm is preformed on the fresh biometric sample, and is then compared with the decoded biometric hash.
In a second example of this implementation, and with reference to
Watermark-based Combination Lock
In parent application Ser. Nos. 10/275,197 and PCT/US01/14014 we disclose a digital watermark-based combination lock. The combination lock responds to a digitally watermarked card positioned at various angles or orientations. A document orientation is analogous to a lock “tumble.” The card is positioned in a correct sequence of tumbles to unlock the watermark-based combination lock.
An alternative to the above-described inventive combination lock requires a user to present a plurality of cards in a proper sequence (or combination) to unlock a computer system or secure area. For example, in
In one implementation, a combination comprises a predetermined sequence of cards positioned at differing angles and/or scales. For example, a combination may include a first card having a first identifier and being positioned at a first angle or orientation, and a second card having a second identifier and being positioned at a second angle or orientation. A card's orientation is readily discernable by a digital watermark orientation component, e.g., as disclosed in parent application Ser. Nos. 10/275,197 and PCT/US01/14014. In some cases the first card corresponds to a first side of an identification document, and the second card corresponds to a second side of the same identification document.
In another implementation, a user must perform the combination in a given amount of time. This restriction helps to prevent a would-be-thief from arbitrarily or systematically presenting different combinations, in hopes of stumbling onto the right combination. Alternatively, a predetermined number of consecutive wrongly entered combinations freezes the account or lock. (For example, after two wrong combination attempts, the lock is frozen and must be reset by a system administrator or via a predetermined procedure, such as with a password/PIN.).
In still another implementation, each combination lock card includes both a robust and fragile digital watermark. Then if someone tries to crack the system by scanning and printing the watermarked cards, the fragile mark predictably degrades or is otherwise lost. The watermark detection software (and/or access software) allows access when the cards are shown in the proper order of presentation AND they each include both the robust and fragile mark. (In a related implementation, only one or a few of the combination cards include a fragile watermark. Or at least one of the combination cards includes a fragile watermark that converts to a robust watermark upon scanning and printing.). Various fragile watermarking techniques can be found, e.g., in assignee's U.S. patent application Ser. Nos. 09/234,780, 09/433,104, 09/498,223, 09/562,516, 09/567,405, 09/625,577, 09/630,243, 09/645,779, 09/689,226, 09/689,289, 09/689,293, and 09/898,901, and in PCT Patent Application No. PCT/US02/20832 (published as WO 03/005291). Each of these patent documents is herein incorporated by reference.
Unlocking a Screen Saver or Application with a Digital Watermark
A specific example of our inventive techniques is now described in relation to a system and method for using a digital watermark embedded in a document to unlock a computer workstation screensaver or sleep mode. With reference to
In some Windows versions, a user must toggle
Our improvement becomes evident at initial logon and/or once a screensaver is activated. Take the screensaver case. To access the conventional username/password box, a user first must present a digitally watermarked document for analysis instead of typing
From a system level, we can augment the Windows login with our digital watermark detection requirements. For example, we can modify or replace the Windows GINA file (e.g., “msgina.dll”) to improve the logon process. (It will be appreciated that GINA stands for Graphical Identification aNd Authorization and describes an interface for the validation of logon credentials.). Our modified GINA then initiates (or cooperates with) watermark detection to facilitate access information authentication. Input device 14 captures an image of a digitally watermarked document. A watermark detector analyses the captured image data to detect a digital watermark. A watermark payload or message is decoded once the digital watermark is detected. The payload preferably includes a code or access information to unlock the logon or screensaver. The screensaver is deactivated if the code matches or otherwise provides the predetermined key. Otherwise, the user is denied access to the system via the locked screen saver. The user is preferably unable to exit the screensaver or logon process by any method (e.g.,
After successfully entering in the proper password for that access information and/or that workstation, the screensaver will deactivate and return the user to the desktop.
In another implementation, the digitally watermarked document provides a necessary password/PIN without further user input.
In yet another implementation, the digital watermark payload carries an encryption key, which is used to decrypt the computer 16's memory or computer files stored in memory.
Now consider some extensions of our inventive techniques. A document includes a digital watermark having a payload. The payload corresponds to user age group or access permission. The digitally watermarked card is presented to a screen saver, not only to unlock the screen saver, but also to set appropriate computer settings. For example, consider an implementation where the
Concluding Remarks
The foregoing are just exemplary implementations of security 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.
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.
To provide a comprehensive disclosure without unduly lengthening this specification, the above-mentioned 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. 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. For example, the number of documents comprising a combination lock (e.g., 4) can be varied without departing from the scope of the present invention.
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.
This application claims the benefit of U.S. Provisional Patent Application No. 60/361,749, filed Mar. 4, 2002. This application is a continuation-in-part of U.S. patent application Ser. No. 10/275,197, filed Mar. 4, 2003, which is the National Stage of International Application No. PCT/US01/14014 (published as WO 01/84438), filed Apr. 30, 2001. This application is also related to the following U.S. patent application Ser. Nos.: 09/790,322 (published as US2001-0037313 A1), 09/562,049, 09/343,104, 09/503,881, 09/562,516, 09/562,524, 09/571,422, 09/636,102, and is also related to U.S. Pat. Nos. 5,862,260, 6,345,104, 6,449,377 and 6,522,770. Each of these patent documents is herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4590366 | Rothfjell | May 1986 | A |
4675746 | Tetrick et al. | Jun 1987 | A |
4689477 | Goldman | Aug 1987 | A |
4728984 | Daniele | Mar 1988 | A |
4807031 | Broughton et al. | Feb 1989 | A |
4972476 | Nathans | Nov 1990 | A |
5018767 | Wicker | May 1991 | A |
5091966 | Bloomberg et al. | Feb 1992 | A |
5221833 | Hecht | Jun 1993 | A |
5237164 | Takada | Aug 1993 | A |
5284364 | Jain | Feb 1994 | A |
5319453 | Copriviza et al. | Jun 1994 | A |
5329108 | Lamoure | Jul 1994 | A |
5337361 | Wang et al. | Aug 1994 | A |
5379345 | Greenberg | Jan 1995 | A |
5384846 | Berson et al. | Jan 1995 | A |
5436970 | Ray et al. | Jul 1995 | A |
5449896 | Hecht et al. | Sep 1995 | A |
5471533 | Wang et al. | Nov 1995 | A |
5495581 | Tsai | Feb 1996 | A |
5515451 | Tsuji et al. | May 1996 | A |
5629770 | Brassil et al. | May 1997 | A |
5636292 | Rhoads | Jun 1997 | A |
5646997 | Barton | Jul 1997 | A |
5652626 | Kawakami et al. | Jul 1997 | A |
5659726 | Sandford, II et al. | Aug 1997 | A |
5694471 | Chen et al. | Dec 1997 | A |
5721788 | Powell et al. | Feb 1998 | A |
5740244 | Indeck et al. | Apr 1998 | A |
5748783 | Rhoads | May 1998 | A |
5768426 | Rhoads | Jun 1998 | A |
5787186 | Schroeder | Jul 1998 | A |
5799092 | Kristol et al. | Aug 1998 | A |
5810666 | Mero et al. | Sep 1998 | A |
5835639 | Honsinger et al. | Nov 1998 | A |
5841886 | Rhoads | Nov 1998 | A |
5845008 | Katoh et al. | Dec 1998 | A |
5864622 | Marcus | Jan 1999 | A |
5907149 | Marckini | May 1999 | A |
5912974 | Holloway et al. | Jun 1999 | A |
5933086 | Tischendorf et al. | Aug 1999 | A |
5949055 | Fleet et al. | Sep 1999 | A |
6024287 | Takai et al. | Feb 2000 | A |
6076738 | Bloomberg et al. | Jun 2000 | A |
6263087 | Miller | Jul 2001 | B1 |
6289108 | Rhoads | Sep 2001 | B1 |
6292092 | Chow et al. | Sep 2001 | B1 |
6343138 | Rhoads | Jan 2002 | B1 |
6408082 | Rhoads et al. | Jun 2002 | B1 |
6408330 | DeLaHuerga | Jun 2002 | B1 |
6417663 | Piernot et al. | Jul 2002 | B1 |
6424725 | Rhoads et al. | Jul 2002 | B1 |
6496595 | Pucheck et al. | Dec 2002 | B1 |
6546112 | Rhoads | Apr 2003 | B1 |
6674886 | Davis et al. | Jan 2004 | B2 |
6675165 | Rothschild | Jan 2004 | B1 |
6727996 | Silverbrook et al. | Apr 2004 | B1 |
6735324 | Mckinley et al. | May 2004 | B1 |
6751336 | Zhao et al. | Jun 2004 | B2 |
6782116 | Zhao et al. | Aug 2004 | B1 |
6830196 | Silverbrook et al. | Dec 2004 | B1 |
6866195 | Knowles | Mar 2005 | B2 |
6871789 | Hilton et al. | Mar 2005 | B2 |
6947571 | Rhoads et al. | Sep 2005 | B1 |
6965873 | Rhoads | Nov 2005 | B1 |
7027612 | Patterson et al. | Apr 2006 | B2 |
7043052 | Rhoads | May 2006 | B2 |
7050603 | Rhoads et al. | May 2006 | B2 |
7058687 | Rhoads | Jun 2006 | B2 |
7072490 | Stach | Jul 2006 | B2 |
7080041 | Nagel | Jul 2006 | B2 |
7099019 | Silverbrook et al. | Aug 2006 | B2 |
7181042 | Tian | Feb 2007 | B2 |
7239734 | Alattar et al. | Jul 2007 | B2 |
20010023421 | Numano et al. | Sep 2001 | A1 |
20010026377 | Ikegami | Oct 2001 | A1 |
20020126889 | Pikler et al. | Sep 2002 | A1 |
20030026421 | Morlet | Feb 2003 | A1 |
20030052768 | Maune | Mar 2003 | A1 |
20040036574 | Bostrom | Feb 2004 | A1 |
20040128512 | Sharma et al. | Jul 2004 | A1 |
20050013462 | Rhoads | Jan 2005 | A1 |
20050262350 | Boutant et al. | Nov 2005 | A1 |
Number | Date | Country |
---|---|---|
29 43 436 | May 1981 | DE |
493 091 | Dec 1991 | EP |
629972 | Dec 1994 | EP |
0736860 | Oct 1996 | EP |
642060 | Apr 1999 | EP |
3-185585 | Aug 1991 | JP |
9603286 | Feb 1996 | WO |
Number | Date | Country | |
---|---|---|---|
20040243806 A1 | Dec 2004 | US |
Number | Date | Country | |
---|---|---|---|
60361749 | Mar 2002 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10275197 | US | |
Child | 10382359 | US |