Method and system for secure facsimile delivery and registration

Information

  • Patent Grant
  • 8630011
  • Patent Number
    8,630,011
  • Date Filed
    Monday, April 9, 2012
    12 years ago
  • Date Issued
    Tuesday, January 14, 2014
    10 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Nguyen; Madelein A
    Agents
    • Choate Hall & Stewart LLP
    • Haulbrook; William R.
Abstract
A secure fax transmission system can be used to assure the intended recipient of a confidential document being sent via facsimile is the only person that will have access to the document once it is sent. An application module communicates with a client user interface over a first network and communicates with a recipient fax machine over a second network. The application module receives information associated with a confidential document being sent via facsimile. Prior to sending the document, the application module determines if the recipient fax number has been previously registered as a secure fax number. The application module then sends the document to the recipient if the recipient fax number is registered a secure. If the recipient fax number is not registered as secure, the application module sends a request for registration to the recipient fax number.
Description
FIELD OF THE INVENTION

The invention relates generally to the field of facsimile transmissions and more particularly to secure methods of delivering documents via facsimile.


BACKGROUND OF THE INVENTION

Facsimile (referred to herein as “fax”) technology has become a common and inexpensive means for transmitting documents using publicly available telephone lines. The ability to deliver important documents directly to a recipient is an essential capability of many businesses. However, documents often contain sensitive or private information, and it remains difficult for the sender of a confidential document to be assured that only the indented recipient has access to the document once it is delivered via fax.


In the past, systems and methods have been introduced in an attempt to address this concern. One such method comprises the installation of a software application on both the sending and receiving fax machines, the utilization of personal computers to access secure fax servers, or both. One drawback to this method is that recipients who have never previously received a fax from a specific sender, or who normally do not receive secure fax messages, are required to purchase and install hardware and software prior to receiving a secure fax. Another method includes the use of so-called “facsimile store-and-forward facilities,” or “F-SAFF's.” The users of such systems are required to maintain some form of “inbox,” often located on a computer, from which they can retrieve incoming faxes. To receive an incoming fax, a user logs in using, for example, an ID and password, or enters a personal identification number. Again, this method requires the recipient to perform some function before the sender initializes the transmission. Furthermore, a recipient must re-enter the ID, password, or PIN each time they need to retrieve a confidential document.


As a specific example, a medical professional often must verify a patient's medical history with an insurance company or another physician. Such information is considered personal and confidential, and professionals that transmit this information can be held responsible for its security. However, physicians' offices often send and receive fax messages that do not require secure transmission, and the frequency of receiving information from any one particular sender can be low. Therefore, it is often difficult to justify the hardware, software, training, and maintenance costs associated with maintaining a secure fax server.


Given the need to send and receive confidential documents via fax without requiring recipients to purchase additional computers or software, or subscribe to any additional services, there exists a need for the senders of secure faxes to receive and store recipient fax information as a secure destination.


SUMMARY OF THE INVENTION

The present invention allows an operator of a sending fax machine to request assurances from the prospective recipient of a confidential document that the receiving fax machine is secure. Furthermore, the operator can then store the recipient's fax number as a secure destination for future transmissions. In addition, a sender of a confidential document can send a request to an intended recipient of the confidential document requesting the registration the recipient fax number as secure. Additionally, the invention includes the hardware and software means necessary to implement the claimed methods.


In one aspect of the invention, the sender of a confidential document determines if an intended recipient of a confidential fax has previously registered the receiving facsimile number with the sender as a secure destination. The method can also include delaying transmission of the document until the recipient has registered the receiving facsimile number.


In another aspect of the invention, the sender of a confidential document, upon learning that the recipient fax number is not secure, sends a request to the intended recipient of the confidential document. The request can include a unique identification number or other electronically readable printed symbol, for example, that can be used to register the recipient fax machine with the sender. In one version of the invention, the sender can register the recipient fax machine number, while in another version of the invention the system can automatically register the recipient fax machine if the registration request includes a machine readable code. In another version of the system, the system can use both methods of registration.


The method described above can further include the sender storing the recipient's fax number on a local computer for future reference and retrieval. This approach can enable the sender to send subsequent confidential documents without the recipient having to re-register the fax number or login to any application to retrieve incoming faxes. In another example, the method can include sending a registration request for each individual document sent to a recipient fax number. In another variation of the invention, the method allows the sender to stipulate a validity period for each recipient fax number, after the expiration of which the recipient must reregister the recipient fax number.


In yet another aspect, the invention includes a secure facsimile transmission system. The secure fax transmission system includes a sender user interface, a database module, a communications module, and an application module. The sender user interface communicates with a sender, the database module and the application module over a first communications network and the communications module communicates with a recipient fax machine over a second communications network. The application module receives information associated with a confidential document to be sent via facsimile from the sender user interface. The application module can also include a storage module to allow it to store documents that have not been released for transmission. Additionally, the secure fax transmission system includes a communications module to allow the transmission of documents to a recipient fax machine via public telephone lines. The database module includes a storage facility for storing recipient fax numbers that have been previously registered as secure.





BRIEF DESCRIPTION OF THE DRAWINGS

The above and further advantages of this invention may be better understood by referring to the following description in conjunction with the accompanying drawings. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.



FIG. 1 illustrates one exemplary embodiment of the prior art including a first fax machine transmitting a document to a second fax machine over a communications network.



FIG. 2 illustrates one exemplary embodiment of a secure fax transmission system according to the present invention.



FIG. 3 illustrates another embodiment of a secure fax transmission system according to the present invention.



FIG. 4 illustrates a more detailed embodiment of a secure fax transmission system according to the present invention.



FIG. 5 illustrates one exemplary embodiment of the steps performed by the sender of a confidential document to transmit a document via fax according to the present invention.



FIG. 6 illustrates an embodiment of the steps performed by the sender of a confidential document to register a recipient fax number as secure according to the present invention.



FIG. 7 illustrates an embodiment of a request to register a recipient fax number as secure according to the present invention.





DETAILED DESCRIPTION


FIG. 1 illustrates one embodiment of a document transmission system 100 using fax machines 102, 108 according to the prior art. The system 100 includes a sending fax machine 102, a document to be delivered via fax 104, a communications network 106, a recipient fax machine 108, and a facsimile copy of the document 110. The user of such a system places the document 104 in the sending fax machine 102 and identifies the recipient fax machine 108 to the sending fax machine 102 by entering the recipient fax machine number into the sending fax machine 102. The sending fax machine 102 then transmits an electronic representation of the document 104 via the communications network 106. The recipient fax machine 108 sends a response to the sending fax machine 102 signaling that it is ready to receive the electronic representation of the document 104. As the receiving fax machine 108 receives the electronic representation of the document from the sending machine 102, the receiving fax machine 108 prints a facsimile copy of the document 110.



FIG. 2 illustrates an embodiment of a secure fax transmission system 200 that includes a client computer 102, a first communications network 204, a second communications network 106, and a recipient fax machine 108. The client 202 includes a sender user interface, and it can communicate with an application server which can reside on the same computer. The application is in communication with the communications module, which is communicates with a second communications network 106, such as the public telephone lines. The second communications network 106 is in communications with a recipient fax machine 108. It should be noted that FIG. 2 is an exemplary embodiment intended only to illustrate and not limit the invention.


The first communications network 204 and the second communications network 106 can be a local-area network (LAN) such as an Intranet, a medium-area network (MAN), public telephone lines, or a wide area network (WAN) such as the Internet or the World Wide Web (i.e., web). Exemplary embodiments of the communication paths 204, 106 can include standard telephone lines, LAN or WAN links (e.g., T1, T3, 56 kb, X.25), broadband connections (ISDN, Frame Relay, ATM), and wireless connections. The connections over the communication paths 204, 106 can be established using a variety of communication protocols (e.g., TCP/IP, IPX, SPX, NetBIOS, Ethernet, RS232, and direct asynchronous connections).


The client computer 202 can be any personal computer (e.g., 286, 386, 486, Pentium, Macintosh computer), Windows-based terminal, network computer, wireless device, information appliance, RISC Power PC, X-device, workstation, mini computer, main frame computer, personal digital assistant, or other computing device that has a windows-based desktop, can connect to a network, and has sufficient persistent storage for executing a small, display presentation program. Windows-oriented platforms supported by the client computer 202 can include, without limitation, WINDOWS 3.x, WINDOWS 95, WINDOWS 98, WINDOWS NT 3.51, WINDOWS NT 4.0, WINDOWS 2000, WINDOWS CE, WINDOWS ME, MAC/OS, Java, and UNIX. The client computer 202 can include a visual display device (e.g., a computer monitor), a data entry device (e.g., a keyboard), persistent or volatile storage (e.g., computer memory) for storing downloaded application programs, a processor, and a mouse.


The client computer 202 includes a sender user interface 208. The interface 208 can be text driven (e.g., DOS) or graphically driven (e.g., Windows). In one embodiment, the sender user interface 208 can use web browser, such as Internet Explorer™ developed by Microsoft Corporation (Redmond, Wash.), to connect to the local network 204. In a further embodiment, the web browser uses the existing Secure Socket Layer (SSL) support, developed by Netscape Corporation, (Mountain View, Calif.) to establish the connection to the local network 204 as a secure network.



FIG. 3 illustrates another embodiment of the invention. The sender user interface 208 can reside on one or more client machines 202, 202′ and the application module can reside on a server computer 304. The client machine 202 communicates with the server machine 304 over a communications network 302. In another embodiment, the application module can reside on a separate server from the sender client 202. The client machines 202, 202′ and the application server machine 304 can be any personal computer described above. Likewise, the communication network 302 can be any communications network described above. In one embodiment, the application server 304 hosts one or more applications that the client 202 can access. In another embodiment, the application server 304 can be a member of a server farm, which is a logical group of one or more servers that are administered as a single entity. In the embodiment shown, the server farm includes the server 304, a second server 306, and a third server 308.



FIG. 4 is a more detailed illustration of one embodiment of the invention. The client machine 202 hosts a communication module 402 which facilitates communication with other computers, fax machines, and the like. In addition, the client machine 202 hosts software 404 comprising a client interface module 406, an application module 408, and a database module 410. The client interface module 406 receives instructions from the sender user interface 208 (not shown) and sends the instructions to the application module 408. The application module 408 then parses the instructions to isolate the recipient fax number. The applications module 408 then communicates with the database module 410 to determine if the recipient fax number has been previously stored in the database module 410 and identified as secure. If the application module 408 determines that the recipient fax number is secure, it releases the document and the document is sent to the recipient fax machine 108 using the communications module 402, the first communications network 204, and the second communications network 106.


Referring to FIGS. 5 and 6, the process of the secure fax transmission system can typically be broken down into two sub-processes: 1) fax transmission and 2) recipient registration.



FIG. 5 illustrates one embodiment of the fax transmission sub-process. For example, the sender of a confidential document 104 identifies the intended recipient of the fax, step 502. The sender then enters, retrieves, or somehow otherwise associates a fax number to the recipient, step 504. The sender then releases the document to the application module by selecting the appropriate function on the sender user interface, step 506. The application module then queries the database module to determine if the fax number associated with the recipient has previously been registered as secure, step 508. The application module then determines, based on the response from the database module, if the fax number is secure, decision step 510. If the application module determines that the recipient fax number has previously been registered as secure, the application module releases the document to the communications module and the document is faxed to the recipient, step 510. Conversely, if the application module determines that the recipient fax number has not been previously registered as a secure fax, or that the registration has expired, the application module instructs the communication module to send a registration request to the recipient fax number, step 512.


In an alternative example, the user can instruct the application module to delay the release of each individual document until a unique, document specific registration request has been received from the intended recipient of the secure document.



FIG. 6 illustrates the recipient registration sub-process. Following the step of sending a request for registration, 510, the sender awaits the receipt of the acknowledged registration from the intended recipient. In one embodiment, the sender determines if the registration request has been received, decision step 604. If the registration request has not been received, the sender instructs the application module to hold the document by selecting the appropriate option on the sender client interface, step 606. If the completed registration request has been received, the sender instructs the application module to store the recipient fax number in the database module as a secure fax number by selecting the appropriate option on the sender client interface, step 608. The application module then releases the document to the communications module, which sends the document to the secure fax number, step 610.


An additional feature allows the sender to identify a validity period for the registration. In one approach, the sender identifies the validity period by entering a period of time, expiration date, or the like into the sender user interface when the document is released to the application module. In another approach, when the sender receives the completed registration request, the sender instructs the application module to store the recipient fax number in the database module as a secure fax number and associates the validity period or expiration date with the recipient fax number. The application module then releases the document to the communications module, which sends the document to the secure fax number. In addition, when the application module receives a request to release future documents to previously registered recipient fax numbers, the application module queries the database module to check that the registration exists, and has not expired.


In one alternative approach, the request for registration can include a unique bar code or other electronically readable symbol. When the recipient of the registration request sends the request back to the sender, the communications module recognizes the incoming message as a fax, and sends it to the application module. The application module can then scan the incoming fax and recognize the document as a registration request for a particular recipient by reading the electronically readable symbol. The application module can then automatically send instructions to the database module to store the recipient fax number as a secure fax number. In addition, the application module can instruct the communications module to send the document to the intended recipient. In another feature, the application module sends the registration request to the database module to be stored as a record of acceptance of registration.


Further, although some steps illustrated in FIGS. 5 and 6 are described as a linear flow of operations, the steps can be performed at various times before, during, or after the performed tasks. The steps illustrated can also be performed simultaneously. Consequently, FIGS. 5 and 6 are intended only to illustrate, and not limit, the invention.



FIG. 7 illustrates another feature of the invention is the use of a request registration message that can be sent to the intended recipient of a confidential document. The request for registration document may include, but is not limited to, data elements such as: a sender name; a sender company; a sender phone number; a sender fax number; a recipient name; a recipient company; a recipient phone number; a recipient fax number; an expiration date of the registration; a unique alpha-numeric identification number; a bar code; a printed symbolic representation of data, and the like. Additionally, instructions may be included in the request for registration to assist the recipient in registering their fax number as secure.


By employing the methods and system described above, the secure fax transmission system increases the confidence of a sender of confidential documents that the documents will only be seen by the intended recipient without requiring the recipient to modify their systems, or continually enter codes to receive subsequent fax documents.


While the invention has been particularly shown and described with reference to specific preferred embodiments, it should be understood by those skilled in the art that various changes in form and detail can be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims
  • 1. A method of delivering documents via facsimile, comprising: identifying a recipient of a document to be sent via facsimile;identifying a corresponding recipient facsimile number for the document to be sent via facsimile;determining, by a processor of a computing device, if the recipient facsimile number has been registered as a secure facsimile number, wherein determining comprises: querying a database module comprising a list of secure facsimile numbers, anddetermining, responsive to querying, a result, wherein the result identifies whether the recipient facsimile number is on the list of secure facsimile numbers;transmitting, by the processor, a registration request to the recipient facsimile number when either (a) the recipient facsimile number has not been previously registered as a secure facsimile number or (b) registration of the facsimile number as a secure facsimile number has expired;delivering, by the processor, the document via facsimile and one or more previously unsent documents to the recipient facsimile number after the recipient facsimile number is registered as a secure facsimile number.
  • 2. The method of claim 1 further comprising assigning a unique identifier to the document being sent via facsimile.
  • 3. The method of claim 2 wherein the unique identifier is at least one of a bar code,an alpha-numeric code, anda unique printed image.
  • 4. The method of claim 1, further comprising registering the recipient facsimile number as a secure facsimile number, wherein the registration comprises receiving a confirmation that the facsimile number is a secure facsimile number; and storing the recipient facsimile number as a secure facsimile number, wherein the recipient facsimile number is stored in the database as a secure recipient facsimile number.
  • 5. The method of claim 4 further comprising sending a request to register a recipient facsimile number for each document being sent to one recipient of a facsimile.
  • 6. The method of claim 4 further comprising assigning a unique identifier to the recipient facsimile number.
  • 7. The method of claim 4 wherein the step of receiving a confirmation further comprises processing the confirmation.
  • 8. The method of claim 7 wherein the processing step comprises the confirmation being reviewed by a human operator.
  • 9. The method of claim 7 wherein the processing step comprises the confirmation being automatically reviewed by electronic means.
  • 10. The method of claim 9 where the electronic means comprises optical character recognition.
  • 11. The method of claim 4 wherein the step of storing the recipient facsimile number further comprises storing an expiration date of the registration.
  • 12. The method of claim 4 wherein the step of storing the recipient facsimile number further comprises storing a validity period for the registration.
  • 13. The method of claim 4 wherein the step of storing the recipient facsimile number further includes identifying the received registration as a record of accepting the registration.
  • 14. A system for delivering documents to a recipient via facsimile in a secure method, comprising: a database comprising a list of secure facsimile numbers;a memory having instructions stored thereon, wherein the instructions, when executed, by a processor of a computing device, cause the processor to: determine if a facsimile number associated with a recipient is stored in the database and is identified as a secure facsimile number, wherein the determining step comprises: (i) querying the database, and(ii) determining, responsive to querying, whether the recipient facsimile number is on the list of secure facsimile numbers;transmit a request to register the recipient facsimile number as a secure facsimile number when either (a) the recipient facsimile number has not been previously registered as a secure facsimile number or (b) registration of the facsimile number as a secure facsimile number has expired; andtransmit, by the processor of the computing device, the document via facsimile and one or more previously unsent documents to the recipient facsimile number after the recipient facsimile number is registered as a secure facsimile number.
  • 15. The system of claim 14 further comprising a character recognition module for automatically reading printed symbols.
  • 16. The system of claim 14 wherein the printed symbols comprise at least one of a bar code,an alpha-numeric code, anda unique printed image.
  • 17. The system of claim 14, wherein the instructions, when executed, by a processor of a computing device, further cause the processor to: register the recipient facsimile number as a secure facsimile number, wherein the registration comprises receiving a confirmation that the facsimile number is a secure facsimile number; and store the recipient facsimile number as a secure facsimile number, wherein the recipient facsimile number is stored in the database as a secure recipient facsimile number.
  • 18. The system of claim 14, wherein the instructions, when executed, by a processor of a computing device, further cause the processor to assign a unique identifier to the recipient facsimile number.
  • 19. The method of claim 14, wherein the step of receiving a confirmation further comprises processing the confirmation.
RELATED APPLICATIONS

The present application is a continuation application of and claims priority to U.S. Utility application Ser. No. 11/538,628, entitled “Method and System for Secure Facsimile Delivery and Registration” and filed Oct. 4, 2006, which is a divisional application of U.S. Utility application Ser. No. 10/365,674, entitled “Method and System for Secure Facsimile Delivery and Registration” and filed Feb. 11, 2003.

US Referenced Citations (151)
Number Name Date Kind
4392021 Slate Jul 1983 A
4958235 Sims et al. Sep 1990 A
4974254 Perine et al. Nov 1990 A
4985919 Naruse et al. Jan 1991 A
4994926 Gordon et al. Feb 1991 A
5155601 Toyama Oct 1992 A
5166977 Ross Nov 1992 A
5168376 Motohama Dec 1992 A
5202920 Takahashi Apr 1993 A
5255106 Castro Oct 1993 A
5291302 Gordon et al. Mar 1994 A
5339174 Harris Aug 1994 A
5339361 Schwalm et al. Aug 1994 A
5404231 Bloomfield Apr 1995 A
5417488 Horton May 1995 A
5452099 Von Meister Sep 1995 A
5459584 Gordon et al. Oct 1995 A
5465300 Altschuler et al. Nov 1995 A
5530755 Pailles et al. Jun 1996 A
5535277 Shibata et al. Jul 1996 A
5539530 Reifman et al. Jul 1996 A
5552897 Mandelbaum et al. Sep 1996 A
5553145 Micali Sep 1996 A
5555307 Le Corre et al. Sep 1996 A
5587809 Le Corre et al. Dec 1996 A
5590196 Moreau Dec 1996 A
5615269 Micali Mar 1997 A
5621539 Brown et al. Apr 1997 A
5629982 Micali May 1997 A
5666420 Micali Sep 1997 A
5671285 Newman Sep 1997 A
5673316 Auerbach et al. Sep 1997 A
5771101 Bramall Jun 1998 A
5790665 Micali Aug 1998 A
5805719 Pare et al. Sep 1998 A
5812670 Micali Sep 1998 A
5835726 Shwed et al. Nov 1998 A
5859967 Kaufeld et al. Jan 1999 A
5903721 Sixtus May 1999 A
5909289 Shibata et al. Jun 1999 A
5982505 Jeon Nov 1999 A
6011847 Follendore, III Jan 2000 A
6014228 Castro Jan 2000 A
6014631 Teagarden et al. Jan 2000 A
6023345 Bloomfield Feb 2000 A
6073118 Gormish et al. Jun 2000 A
6134326 Micali Oct 2000 A
6137884 Micali Oct 2000 A
6141750 Micali Oct 2000 A
6148301 Rosenthal Nov 2000 A
6157706 Rachelson Dec 2000 A
6161181 Haynes, III et al. Dec 2000 A
6182118 Finney et al. Jan 2001 B1
6192165 Irons Feb 2001 B1
6192407 Smith et al. Feb 2001 B1
6266159 Otsuka et al. Jul 2001 B1
6427032 Irons et al. Jul 2002 B1
6430691 Di Santo et al. Aug 2002 B1
6470086 Smith Oct 2002 B1
6487599 Smith et al. Nov 2002 B1
6570667 Hattori et al. May 2003 B1
6594032 Hiroki et al. Jul 2003 B1
6609196 Dickinson, III et al. Aug 2003 B1
6625642 Naylor et al. Sep 2003 B1
6670537 Hughes et al. Dec 2003 B2
6744761 Neumann et al. Jun 2004 B1
6744936 Irons et al. Jun 2004 B2
6760752 Liu et al. Jul 2004 B1
6867876 Czyszczewski et al. Mar 2005 B1
6952281 Irons et al. Oct 2005 B1
6977740 Mandalia Dec 2005 B1
7050188 Yajima et al. May 2006 B1
7080409 Eigeles Jul 2006 B2
7082538 Bouchard et al. Jul 2006 B2
7116433 Toyoda Oct 2006 B1
7151834 Cannon et al. Dec 2006 B1
7168036 Klotz, Jr. et al. Jan 2007 B2
7283270 Boire-Lavigne et al. Oct 2007 B2
7463377 Aoki Dec 2008 B2
7596691 Koue et al. Sep 2009 B2
7631193 Hoffman Dec 2009 B1
8045203 Henry et al. Oct 2011 B2
20020002675 Bush Jan 2002 A1
20020007453 Nemovicher Jan 2002 A1
20020049618 McClure et al. Apr 2002 A1
20020054334 Harrison et al. May 2002 A1
20020055909 Fung et al. May 2002 A1
20020078052 Cheng Jun 2002 A1
20020087861 Segev et al. Jul 2002 A1
20020091928 Bouchard et al. Jul 2002 A1
20020093674 Ferlitsch et al. Jul 2002 A1
20020099938 Spitz Jul 2002 A1
20020138547 Cherry et al. Sep 2002 A1
20020157028 Koue et al. Oct 2002 A1
20030031341 Rhoads Feb 2003 A1
20030043403 Tashima Mar 2003 A1
20030046363 Ezato Mar 2003 A1
20030058478 Aoki Mar 2003 A1
20030065623 Corneil et al. Apr 2003 A1
20030070074 Geller et al. Apr 2003 A1
20030086124 Parry May 2003 A1
20030095289 Mitani May 2003 A1
20030099336 Speeney et al. May 2003 A1
20030105725 Hoffman Jun 2003 A1
20030115448 Bouchard Jun 2003 A1
20030120729 Kim et al. Jun 2003 A1
20030163431 Ginter et al. Aug 2003 A1
20030163529 Yamaguchi Aug 2003 A1
20030163552 Savitzky et al. Aug 2003 A1
20030164986 Boire-Lavigne et al. Sep 2003 A1
20030217034 Shutt Nov 2003 A1
20040015779 Shorter Jan 2004 A1
20040023656 Purdy et al. Feb 2004 A1
20040042034 Tiffan et al. Mar 2004 A1
20040073613 Plewnia Apr 2004 A1
20040111375 Johnson Jun 2004 A1
20040111644 Saunders et al. Jun 2004 A1
20040125396 Burke Jul 2004 A1
20040158733 Bouchard Aug 2004 A1
20040184092 Ogawa Sep 2004 A1
20040205137 Chen et al. Oct 2004 A1
20040205616 Rosenberg et al. Oct 2004 A1
20040230807 Baird et al. Nov 2004 A1
20040267876 Kakivaya et al. Dec 2004 A1
20050055337 Bebo et al. Mar 2005 A1
20050097046 Singfield May 2005 A1
20050097171 Hikichi May 2005 A1
20050102354 Hollenbeck et al. May 2005 A1
20050125319 Johnson Jun 2005 A1
20050131815 Fung et al. Jun 2005 A1
20050182656 Morey Aug 2005 A1
20050195447 Os Sep 2005 A1
20050225791 Lee Oct 2005 A1
20050257247 Moriconi et al. Nov 2005 A1
20060028689 Perry et al. Feb 2006 A1
20060064389 Doll-Steinberg Mar 2006 A1
20060293989 Morrison et al. Dec 2006 A1
20070013960 Gordon et al. Jan 2007 A9
20070112854 Franca May 2007 A1
20070180032 Pearson Aug 2007 A1
20070208875 Plewnia Sep 2007 A1
20070208931 Koue et al. Sep 2007 A1
20080007793 Filbrich et al. Jan 2008 A1
20080123124 Smithson May 2008 A1
20080126513 Bouchard et al. May 2008 A1
20080147506 Ling Jun 2008 A1
20090164781 Bouchard Jun 2009 A1
20090178111 Moriconi et al. Jul 2009 A1
20090290692 Fong et al. Nov 2009 A1
20100290087 Van Hoof et al. Nov 2010 A1
20110216889 Howell et al. Sep 2011 A1
Foreign Referenced Citations (8)
Number Date Country
1329852 May 1994 CA
2189211 Mar 1998 CA
1234253 Aug 2007 EP
WO-9914979 Mar 1999 WO
WO-9934304 Jul 1999 WO
WO-0135273 May 2001 WO
WO-0152485 Jul 2001 WO
WO-03036515 May 2003 WO
Non-Patent Literature Citations (4)
Entry
International Search Report for PCT/US02/34673 (3 pgs.).
FlowPort User Guide; Aug. 2000; Xerox Corporation; pp. 2-4, 3-10, 4-3, 4-6, 5-3, 5-4, 5-5, 5-18, and 5-38.
Hardcopy Electronic Document Exchange, www.omtool.com accessed via Wayback Machine Internet Archive, “estimated publication date” of May 12, 2002.
Menezes, A.J. et al., Handbook for Applied Cryptography, Prentice Hall, Inc., 553-561 (1997).
Related Publications (1)
Number Date Country
20120194877 A1 Aug 2012 US
Divisions (1)
Number Date Country
Parent 10365674 Feb 2003 US
Child 11538628 US
Continuations (1)
Number Date Country
Parent 11538628 Oct 2006 US
Child 13442185 US