|Publication number||US6912285 B2|
|Application number||US 09/792,949|
|Publication date||Jun 28, 2005|
|Filing date||Feb 26, 2001|
|Priority date||Feb 24, 2000|
|Also published as||US8335919, US8924719, US20010055396, US20050180576, US20130283039, US20150207784, WO2001063831A1|
|Publication number||09792949, 792949, US 6912285 B2, US 6912285B2, US-B2-6912285, US6912285 B2, US6912285B2|
|Original Assignee||Tumbleweed Communications Corp.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (17), Non-Patent Citations (4), Referenced by (43), Classifications (19), Legal Events (6)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This application claims priority to U.S. Provisional Application Ser. No. 60/184,785, filed Feb. 24, 2000, which is co-pending and incorporated by reference herein.
1. Field of the Invention
The invention relates to secure transmission of documents, and more particularly, to transmission of documents to a large number of recipients, securely and efficiently.
2. Description of Related Art
The Internet and corporate networks have made the transmission of documents and messages via e-mail commonplace. Bulk messaging has also become commonplace, such as for advertising and promotional purposes. For bulk messaging, typically a user on one computer composes a message and addresses it to an e-mail group. The message is transmitted to a server, which substitutes the individual addresses of all the target recipients in the group, which may number in the thousands, and transmits the message individually to each target recipient.
Unlike advertising and promotional uses, many businesses require that their communications take place securely. When messages are to be transmitted across an insecure network, such as the Internet, security is typically accomplished by encrypting the message in a manner that can be decrypted only with knowledge of a decryption key. Since only the intended recipient is expected to have the decryption key, only that recipient will be able to open the message and view its contents. Encryption may be performed using a symmetrical encryption algorithm, in which the encryption key matches the decryption key, or by an asymmetric algorithm, in which the encryption key is different from the decryption key. One popular form of asymmetric encryption is public/private key encryption, described in “Public-key Cryptography Standards,” RSA Data Security, Inc. (1991), and in Rivest U.S. Pat. No. 4,405,829, both incorporated by reference herein.
According to the public/private key crypto system, each target recipient has both a private key that only the recipient knows, and a public key that is publicly available. When a sender desires to send a message securely to one of the target recipients, the sender encrypts the message using the target recipient's public key. Only the target recipient then is able to open the message and view its contents.
Secure messaging becomes problematical when the sender desires to send the message to a large number of target recipients. If a public/private key cryptosystem is to be used, then the sender must encrypt the message N times, once using the public key of each of the N target recipients, and then send the message separately to each of the target recipients. If the document to be transmitted is large, and/or if N is in the thousands, this can be a formidable task. The encryption part of the task can be minimized if all of the target recipients share a single decryption key, because then the sender need encrypt the message only once. But the need for all recipients to have the decryption key poses risks both in the transmission and in the storage of the key. This solution also does not overcome the need for the sender to transmit the message separately, once to each of the N target recipients.
Accordingly, there is a need for a more efficient mechanism for secure bulk transmission of messages.
According to the invention, roughly described, a sender first encrypts the message once. The message can be decrypted with a message decryption key. These can be symmetric or asymmetric keys. For each recipient, the sender then encrypts the message decryption key with the recipient's public key. The sender then sends the encrypted message and the encrypted message decryption keys to a store-and-forward server. Subsequently, one or more recipients connect to the server and retrieve the encrypted message and the message encryption key that has been encrypted with the recipient's public key. Alternatively, the server can forward these items to each individual recipient. The recipient then decrypts the encrypted message decryption key with the recipient's private key, resulting in an un-encrypted message decryption key. The recipient then decrypts the message using the un-encrypted message decryption key.
The invention will be described with respect to particular embodiments thereof, and reference will be made to the drawings, in which:
In step 214, the sender encrypts the message decryption key N times—once using the public key of each of the N target recipients. This yields N encrypted message decryption keys. In step 216, the sender sends the encrypted message, the addresses of the target recipients, and the list of encrypted message decryption keys to the server 112. It will be appreciated that one of the target recipients could be a third-party monitor, such as a government agency that is permitted to view the message if required by law.
Optionally, the sender can also send to the server 112 (or the server itself generate) a digital signature protecting all of the encrypted decryption keys associated with a particular encrypted message. The list of encrypted decryption keys thereafter cannot be tampered with without being detectable by reference to the digital signature. A digital signature is created by digesting the list, or significant portions of the list, using a well-known digesting algorithm, and then encrypting the digest with the sender's (or server's) private key of a public/private pair. In order to check for tampering, an auditor repeats the digesting of the list of encrypted decryption keys, to form a new digest, and then decrypts the digital signature using the sender's (or the server's) public key, to recover the original digest, and then compares the two for equality. A satisfactory digesting algorithm is that describe in R. Rivest, “MD5 Message-Digest Algorithm”, Internet Engineering Task Force RFC No. 1321 (April 1992), incorporated by reference herein.
On the server 112, the encrypted message and the encrypted decryption keys are stored as illustrated in FIG. 4. The encrypted message is stored at 410. In conjunction with the encrypted message 410, the server stores each of the encrypted decryption keys 412-1, 412-2, . . . , 412-N. One of the encrypted decryption keys can, as mentioned above, optionally be a monitor's decryption key 414. Optionally also stored in conjunction with the encrypted message 410, is a digital signature 416 protecting the list of encrypted decryption keys. The elements illustrated in
In one embodiment, the server maintains a document management system which not only stores multiple encrypted messages and their associated encrypted decryption keys, but also provides logical and structured restricted access to the various items by individual senders and individual recipients. For example, one such document management system allows senders to change the message stored on the server 112, while not allowing other senders to do so and while not allowing any recipient to do so. Another such document management system allows senders to add, delete or change entries in the list of encrypted decryption keys for messages that were transmitted by the sender, while not allowing such modifications by other senders or by any recipient. Yet another such document management system, when accessed by a particular recipient, shows the recipient only those messages on which the particular recipient is identified as a target recipient, hiding any messages for which there is no encrypted decryption key for the particular recipient.
It will be appreciated that the above-described mechanism is capable of many variations. As one example, in step 216, the sending of the encrypted message and list of encrypted message decryption keys need not take place in a single transmission. Some of all of the encrypted message decryption keys can be sent earlier or later than the encrypted message.
As another example, encrypted decryption keys could be bundled into the message and the single message with the encrypted decryption keys could be broadcast to all recipients without compromising the security of the mechanism.
As yet another example, public and private keys for encrypting the decryption keys could be replaced with symmetric private keys without affecting the security or efficiency of the mechanism.
As still another example, server 112 could be eliminated and the message with the encrypted decryption keys could be broadcast to all recipients and any other listeners, and only the target recipients will be able to decrypt the message and the security of the mechanism is not compromised.
As yet another example, for one or more of the target recipients, the sender can multiply encrypt the recipient's message decryption key, thereby requiring multiple entities to be involved in the decryption of the message decryption key. For example, the sender may first encrypt the message decryption key with the target recipient's public key, yielding a “partially-encrypted” message decryption key. The sender may then re-encrypt the partially-encrypted message decryption key, using the public key of an authorizer, thus yielding the final encrypted message decryption key. Upon receipt of the message, the recipient first has the encrypted decryption key decrypted by the authorizer, using the authorizer's private key. This recovers the partially-encrypted message decryption key. The recipient then decrypts the partially-encrypted message decryption key, using the recipient's private key, thus yielding the un-encrypted message decryption key. Alternatively, the order of encryption for the multiple parties can be reversed, as long as the decryption sequence takes place in the same order as the encryption sequence.
The foregoing description of preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Obviously, many modifications and variations will be apparent to practitioners skilled in this art. In particular, and without limitation, any and all variations described, suggested or incorporated by reference in the Background section of this patent application are specifically incorporated by reference into the description herein of embodiments of the invention. The embodiments described herein were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention for various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4405829||Dec 14, 1977||Sep 20, 1983||Massachusetts Institute Of Technology||Cryptographic communications system and method|
|US4868877||Feb 12, 1988||Sep 19, 1989||Fischer Addison M||Public key/signature cryptosystem with enhanced digital signature certification|
|US5005200||Mar 7, 1989||Apr 2, 1991||Fischer Addison M||Public key/signature cryptosystem with enhanced digital signature certification|
|US5016274||Nov 8, 1988||May 14, 1991||Silvio Micali||On-line/off-line digital signing|
|US5081678||Jun 28, 1989||Jan 14, 1992||Digital Equipment Corporation||Method for utilizing an encrypted key as a key identifier in a data packet in a computer network|
|US5497422||Sep 30, 1993||Mar 5, 1996||Apple Computer, Inc.||Message protection mechanism and graphical user interface therefor|
|US5564106||Mar 9, 1995||Oct 8, 1996||Motorola, Inc.||Method for providing blind access to an encryption key|
|US5633932||Dec 19, 1995||May 27, 1997||Intel Corporation||Apparatus and method for preventing disclosure through user-authentication at a printing node|
|US5646992 *||Sep 23, 1993||Jul 8, 1997||Digital Delivery, Inc.||Assembly, distribution, and use of digital information|
|US5673316||Mar 29, 1996||Sep 30, 1997||International Business Machines Corporation||Creation and distribution of cryptographic envelope|
|US5719938||Aug 1, 1994||Feb 17, 1998||Lucent Technologies Inc.||Methods for providing secure access to shared information|
|US5739512||May 30, 1996||Apr 14, 1998||Sun Microsystems, Inc.||Digital delivery of receipts|
|US5794207||Sep 4, 1996||Aug 11, 1998||Walker Asset Management Limited Partnership||Method and apparatus for a cryptographically assisted commercial network system designed to facilitate buyer-driven conditional purchase offers|
|US5812671 *||Jul 17, 1996||Sep 22, 1998||Xante Corporation||Cryptographic communication system|
|US5953419 *||May 6, 1996||Sep 14, 1999||Symantec Corporation||Cryptographic file labeling system for supporting secured access by multiple users|
|US5956406||Mar 20, 1997||Sep 21, 1999||Alcatel Alstrom Compagnie Generale D'electricite||Method of setting up secure communications and associated encryption/decryption system|
|US6118873||Apr 24, 1998||Sep 12, 2000||International Business Machines Corporation||System for encrypting broadcast programs in the presence of compromised receiver devices|
|1||Rivest, R., "The MD5 Message-Digest Algorithm", Internet Engineering Task Force RFC No. 1321 (Apr. 1992).|
|2||Schneier, "Applied Cryptography," 2nd Edition, Section 22.7, 1996, pp. 523-525.|
|3||Schneier, "Applied Cryptography," 2nd Edition, Section 6.3, 1996, pp. 137-139.|
|4||Schneier, "Applied Cryptography," 2nd Edition,Section 3.1, 1996, pp. 47-52.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7277716||Feb 4, 2005||Oct 2, 2007||Richard J. Helferich||Systems and methods for delivering information to a communication device|
|US7280838||Mar 18, 2005||Oct 9, 2007||Richard J. Helferich||Paging transceivers and methods for selectively retrieving messages|
|US7403787||Mar 21, 2005||Jul 22, 2008||Richard J. Helferich||Paging transceivers and methods for selectively retrieving messages|
|US7680890||Mar 31, 2006||Mar 16, 2010||Wei Lin||Fuzzy logic voting method and system for classifying e-mail using inputs from multiple spam classifiers|
|US7693285 *||Mar 6, 2002||Apr 6, 2010||Entrust, Inc.||Secure communication apparatus and method|
|US7702898 *||May 7, 2003||Apr 20, 2010||Wireless Applications Pty Ltd.||Method for authenticating and verifying SMS communications|
|US7835757||Apr 20, 2010||Nov 16, 2010||Wireless Science, Llc||System and method for delivering information to a transmitting and receiving device|
|US7843314||Dec 8, 2006||Nov 30, 2010||Wireless Science, Llc||Paging transceivers and methods for selectively retrieving messages|
|US7953814||Feb 28, 2006||May 31, 2011||Mcafee, Inc.||Stopping and remediating outbound messaging abuse|
|US7957695||Nov 24, 2009||Jun 7, 2011||Wireless Science, Llc||Method for integrating audio and visual messaging|
|US8099046||Oct 6, 2004||Jan 17, 2012||Wireless Science, Llc||Method for integrating audio and visual messaging|
|US8107601||Nov 13, 2006||Jan 31, 2012||Wireless Science, Llc||Wireless messaging system|
|US8116741||Jul 3, 2008||Feb 14, 2012||Wireless Science, Llc||System and method for delivering information to a transmitting and receiving device|
|US8116743||Nov 14, 2006||Feb 14, 2012||Wireless Science, Llc||Systems and methods for downloading information to a mobile device|
|US8134450||Feb 6, 2009||Mar 13, 2012||Wireless Science, Llc||Content provision to subscribers via wireless transmission|
|US8224294||Oct 15, 2009||Jul 17, 2012||Wireless Science, Llc||System and method for delivering information to a transmitting and receiving device|
|US8295450||Nov 7, 2008||Oct 23, 2012||Wireless Science, Llc||Wireless messaging system|
|US8355702||May 17, 2011||Jan 15, 2013||Wireless Science, Llc||System and method for delivering information to a transmitting and receiving device|
|US8363793||Apr 20, 2011||Jan 29, 2013||Mcafee, Inc.||Stopping and remediating outbound messaging abuse|
|US8374585||May 17, 2011||Feb 12, 2013||Wireless Science, Llc||System and method for delivering information to a transmitting and receiving device|
|US8484295||Dec 21, 2005||Jul 9, 2013||Mcafee, Inc.||Subscriber reputation filtering method for analyzing subscriber activity and detecting account misuse|
|US8498387||Aug 15, 2011||Jul 30, 2013||Wireless Science, Llc||Wireless messaging systems and methods|
|US8560006||Feb 11, 2013||Oct 15, 2013||Wireless Science, Llc||System and method for delivering information to a transmitting and receiving device|
|US8670564||Aug 14, 2007||Mar 11, 2014||Key Holdings, LLC||Data encryption system and method|
|US8732462 *||Jul 7, 2011||May 20, 2014||Ziptr, Inc.||Methods and apparatus for secure data sharing|
|US8738708||Sep 29, 2006||May 27, 2014||Mcafee, Inc.||Bounce management in a trusted communication network|
|US8856530||Sep 21, 2011||Oct 7, 2014||Onyx Privacy, Inc.||Data storage incorporating cryptographically enhanced data protection|
|US8924719 *||Dec 17, 2012||Dec 30, 2014||Axway Inc.||Mechanism for efficient private bulk messaging|
|US9015472||Mar 10, 2006||Apr 21, 2015||Mcafee, Inc.||Marking electronic messages to indicate human origination|
|US9071953||Dec 20, 2010||Jun 30, 2015||Wireless Science, Llc||Systems and methods providing advertisements to a cell phone based on location and external temperature|
|US9160755||Aug 17, 2006||Oct 13, 2015||Mcafee, Inc.||Trusted communication network|
|US9167401||Mar 26, 2014||Oct 20, 2015||Wireless Science, Llc||Wireless messaging and content provision systems and methods|
|US9210111||Dec 25, 2012||Dec 8, 2015||Mcafee, Inc.||Stopping and remediating outbound messaging abuse|
|US9369415||Jan 30, 2015||Jun 14, 2016||Mcafee, Inc.||Marking electronic messages to indicate human origination|
|US9560064||Nov 30, 2015||Jan 31, 2017||Mcafee, Inc.||Stopping and remediating outbound messaging abuse|
|US9560502||Jun 3, 2014||Jan 31, 2017||Wireless Science, Llc||Methods of performing actions in a cell phone based on message parameters|
|US9756021||Nov 12, 2012||Sep 5, 2017||Soprano Design Limited||Secure messaging|
|US20030172262 *||Mar 6, 2002||Sep 11, 2003||Ian Curry||Secure communication apparatus and method|
|US20060098678 *||May 7, 2003||May 11, 2006||Tan Clarence N||Method for authenticating and verifying sms communications|
|US20100030858 *||Aug 4, 2008||Feb 4, 2010||Chasin C Scott||Method and system for centralized contact management|
|US20110197275 *||Apr 20, 2011||Aug 11, 2011||Mcafee, Inc.||Stopping and remediating outbound messaging abuse|
|US20130013921 *||Jul 7, 2011||Jan 10, 2013||Ziptr, Inc.||Methods and apparatus for secure data sharing|
|USRE44364||May 16, 2005||Jul 9, 2013||Emc Corporation||Method of encrypting information for remote access while maintaining access control|
|U.S. Classification||380/284, 380/45, 380/283|
|International Classification||H04L9/08, H04L29/06, H04L9/30|
|Cooperative Classification||H04L63/0428, H04L63/061, H04L63/0471, H04L63/0442, H04L9/0825, H04L63/12, H04L9/083, H04L63/0435, H04L63/062|
|European Classification||H04L63/04B1, H04L63/04B, H04L63/04B2, H04L9/08B|
|Jul 18, 2001||AS||Assignment|
Owner name: VALICERT, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:JEVANS, DAVID;REEL/FRAME:012009/0204
Effective date: 20010714
|Sep 1, 2006||AS||Assignment|
Owner name: TUMBLEWEED COMMUNICATIONS CORP., CALIFORNIA
Free format text: MERGER;ASSIGNOR:VALICERT INCORPORATED;REEL/FRAME:018231/0329
Effective date: 20030222
|Sep 9, 2008||FPAY||Fee payment|
Year of fee payment: 4
|Jan 6, 2009||AS||Assignment|
Owner name: AXWAY INC., ARIZONA
Free format text: MERGER;ASSIGNOR:TUMBLEWEED COMMUNICATIONS CORP.;REEL/FRAME:022062/0244
Effective date: 20081230
|Oct 11, 2012||FPAY||Fee payment|
Year of fee payment: 8
|Dec 27, 2016||FPAY||Fee payment|
Year of fee payment: 12