US 6,026,163 AGrant
Distributed Split-Key Cryptosystem and Applications
Issue Date:2000-02-15
•4 Claims
•1 Drawing Sheets
Abstract
A distributed split-key cryptosystem and application in a public-key setting wherein each of a plurality of trustees independently selects his own secret-public key pair. The trustees combine their public encryption keys into a single public encryption key. Using this combined public key for an electronic auction and other secure transactions.
Metadata
Inventor
- Silvio Micali
Application Information
Application Number:US 7664486
Filing Date:1996-12-12
Priority Date:1996-12-12
Art Unit:277
Classifications
IPC:
H04K 100
Field of Search:
3807057134;21;25;28;29;30;43;44;45;46;49;591;37;74;77;78;80168;171
Patent Drawings (1 sheets)
Description
Technical Field
The present invention relates to secure communications.
Background of the Invention
Recently, systems have been developed by which a secret decryption key is in the hands of several trustees, so that each trustee holds a guaranteed piece of the key, while he cannot predict the full key. Examples of such systems include Micali's Fair Cryptosystems and the Clipper Chip.
We want to develop such a system in a public key setting so that the secret key that is guaranteed to be shared among some trustees is the secret decryption key corresponding to a given public encryption key. The inventive system does not work by having an initial entity who (1) computes a public-secret key pair, and (2) divides the secret key among various trustees in a proper way. Indeed, whether or not such entity blows itself up after doing so (e.g., as suggested by Desmet), the doubt exists that leakage of the secret decryption key may have occurred, either maliciously or by accident.
Summary of the Invention
Accordingly, the present invention works by having each trustee independently select his own secret-public key pair, and then having the trustees combine their public encryption keys into a single public encryption key. To this combined public key corresponds a combined secret key, such that the individual secret keys selected by the trustees are guaranteed to be pieces of this combined secret key. Thus, while no one knows said combined secret key (and indeed while, possibly, this secret key has never been computed, if so wanted), the trustees are guaranteed that they can reconstruct this key, or, alternatively, that they can decrypt any message encrypted with the combined public key without revealing its corresponding secret key.
Brief Description of Drawings
The sole FIGURE illustrates a bid and auction process according to the present invention.
Detailed Description of the Preferred Embodiment
Let us exemplify one way to achieve our goals with the Diffie-Hellman public-key cryptosystem. The skilled in the art will have no difficulty in obtaining similar results for other public-key cryptosystems.
In the Diffie-Hellman system, there is a prime p and a generator g common to all users. A user X chooses his own secret key x at random between 1 and p-1, and sets his public key to be g.sup.x mod p. Let now y and g.sup.y mod p be, respectively, the secret and public keys of user Y. Then X and Y essentially share the secret key g.sup.xy mod p. Indeed, each of X and Y can compute this "common secret key" by raising the other's public key to his own secret key mod p. On the other hand, without knowledge of x or y, no other user can, given the public keys g.sup.x mod p and g.sup.y mod p, based on any known method, feasibly compute the secret key g.sup.xy mod p. Thus X or Y can use this key to secure communications between each other (e.g., by using it as the key of a symmetric cipher).
Let now T.sub.1, . . . , T.sub.n be our trustees. Then, each T.sub.i chooses a secret key x.sub.i and a matching public key g.sup.xi mod p. Then the combined public key is set to be the product of these public keys mod p, g.sup.z mod p (i.e., g.sup.z =g.sup.xl+. . . +xn mod p). This key can be made public or otherwise known to a group of users. Alternatively, the individual trustees' public keys can be made known, so that anyone can compute the combined public key from the individual trustees' public keys, just as the trustees themselves did.
Notice that each trustee has a share of the corresponding secret key, z, of the combined secret key so computed. Indeed, this combined secret key would be z=x.sub.1 +.sup.. . . x.sub.n mod p-1. Thus each trustee is guaranteed to have a piece of this combined key. Indeed, if the trustees want, they could reveal their secret keys and thus easily compute z. Notice that a trustee cannot reveal a false piece of z without being caught. For instance, if trustee T.sub.1 reveals a piece p.sub.1 other than x.sub.1, anyone can detect that g.sup.p1 .noteq.g.sup.x1 T.sub.1 's public key.
Assume now that user Alice wishes to encrypt a message m with the combined public key. Then she selects a (preferably) temporary secret key a and its corresponding public key g.sup.a mod p; computes the secret key g.sup.az mod p; encrypts m conventionally with said key g.sup.az. ; and sends this ciphertext to a proper recipient together with the temporary public-key g.sup.a mod p.
At this point, the encryption of Alice's message is known, while the message can be revealed by either Alice herself (e.g., by releasing a), or by the collection of Trustees; for instance, by having them release their individual secret keys x.sub.i, and thus the combined secret key z.
This method can be used for applications other than law-enforcement ones. For instance, it can be used for simultaneous (sealed-bid) electronic auctions, which is illustrated in the sole Figure, which shows bidders B.sub.1 . . . B.sub.m submitting sealed bids b.sub.1 . . . b.sub.m in a system having n trustees, T.sub.1 . . . T.sub.n. Indeed, users, like Alice, may encrypt their bids with a proper combined key (preferably indicating within the secret bid their own identities in order, among other things, to avoid that their bids can be "copied" by others). At the appropriate time, all bids will be revealed; for instance, by having the trustees release their individual x.sub.i, values so that the combined secret key z can be reconstructed, and thus all secret keys g.sup.az mod p are also reconstructed and used for decrypting all bids.
Notice that no one can leak an individual bid, before the proper time, without the consent of the user who made it. In fact, for decrypting a bid the cooperation of all trustees would be needed, and it is extremely unlikely that such an improper collusion will ever occur if the Trustees are chosen to be trustworthy (or properly functioning machines). Thus, each individual bidder is protected, and so are the trustees (e.g., from some frivolous accusation of bid leakage).
It should be appreciated that such an auction mechanism is just one application of the inventive technology. The system can also be implemented so that certain prescribed sets of trustees (e.g., any majority of trustees rather than all trustees) suffice for reconstructing the combined secret key. Also, decryption of user messages may occur without revealing the combined secret key, if so wanted.
While the invention has been disclosed in connection with the preferred embodiments shown and described in detail, various modifications and improvements thereon will become readily apparent to those skilled in the art. Accordingly, the spirit and scope of the present invention is to be limited only by the following claims.
Claims
What is claimed is:
1. A method for an electronic auction with encrypted bids, comprising: having each of a plurality of trustees generate an individual public key with a corresponding individual secret key; combining the individual public keys of the plurality of trustees into a combined public key; encrypting a bid of a user with the combined public key; reconstructing a combined secret key corresponding to the combined public key from the individual secret keys of the plurality of trustees; and using the combined secret key to decrypt the user's bid.
2. A method according to claim 1, wherein the bid of a user is encrypted together with an indication of an identity of the user.
3. A method according to claim 1, wherein the bid of the user includes an indication of an identity of the user.
4. A method as in claim 1, wherein the bid of the user in encrypted so as to avoid that the bid of the user is copied by another user.
Patent Citations (60)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4200770 | 1980-04-01 | Hellman et al. | |
| US4218582 | 1980-08-01 | Hellman et al. | |
| US4326098 | 1982-04-01 | Bouricius et al. | |
| US4375579 | 1983-03-01 | Davida et al. | |
| US4405829 | 1983-09-01 | Rivest et al. | |
| US4438824 | 1984-03-01 | Mueller-Schloer | |
| US4458109 | 1984-07-01 | Mueller-Schloer | |
| US4879747 | 1989-11-01 | Leighton et al. | |
| US4885777 | 1989-12-01 | Takaragi et al. | |
| US4908861 | 1990-03-01 | Brachtl et al. | |
| US4924514 | 1990-05-01 | Matyas et al. | |
| US4933970 | 1990-06-01 | Shamir | |
| US4944009 | 1990-07-01 | Micali et al. | |
| US4953209 | 1990-08-01 | Ryder, Sr. et al. | |
| US4995081 | 1991-02-01 | Leighton et al. | |
| US5005200 | 1991-04-01 | Fischer | |
| US5018196 | 1991-05-01 | Takaragi et al. | |
| US5081676 | 1992-01-01 | Chou et al. | |
| US5124117 | 1992-06-01 | Tatebayashi et al. | |
| US5136643 | 1992-08-01 | Fischer | |
| US5150411 | 1992-09-01 | Maurer | |
| US5177791 | 1993-01-01 | Yeh et al. | |
| US5199070 | 1993-03-01 | Matsuzaki et al. | |
| US5202977 | 1993-04-01 | Pasetes, Jr. et al. | |
| US5208853 | 1993-05-01 | Armbruster et al. | |
| US5214698 | 1993-05-01 | Smith, Sr. et al. | |
| US5214700 | 1993-05-01 | Pinkas et al. | |
| US5220501 | 1993-06-01 | Lawlor et al. | |
| US5224162 | 1993-06-01 | Okamoto et al. | |
| US5276737 | 1994-01-01 | Micali | |
| US5315658 | 1994-05-01 | Micali | |
| US5373558 | 1994-12-01 | Chaum | |
| US5440634 | 1995-08-01 | Jones et al. | |
| US5453601 | 1995-09-01 | Rosen | |
| US5455407 | 1995-10-01 | Rosen | |
| US5497421 | 1996-03-01 | Kaufman et al. | |
| US5509071 | 1996-04-01 | Petrie, Jr. et al. | |
| US5511121 | 1996-04-01 | Yacobi | |
| US5521980 | 1996-05-01 | Brands | |
| US5553145 | 1996-09-01 | Micali | |
| US5557346 | 1996-09-01 | Lipner et al. | |
| US5610982 | 1997-03-01 | Micali | |
| US5615269 | 1997-03-01 | Micali | |
| US5633928 | 1997-05-01 | Lenstra et al. | |
| US5664017 | 1997-09-01 | Gressel et al. | |
| US5666414 | 1997-09-01 | Micali | |
| US5666420 | 1997-09-01 | Micali | |
| US5675649 | 1997-10-01 | Brennan et al. | |
| US5761306 | 1998-01-01 | Lewis | |
| US5794207 | 1998-08-01 | Walker | |
| US5796830 | 1998-08-01 | Johnson et al. | |
| US5799086 | 1998-08-01 | Sudia | |
| US5809144 | 1998-09-01 | Sirbu | |
| US5812670 | 1998-09-01 | Micali | |
| US5815573 | 1998-09-01 | Johnson et al. | |
| US5841865 | 1998-11-01 | Sudia | |
| US5850442 | 1998-12-01 | Muftic | |
| US5850451 | 1998-12-01 | Sudia | |
| US5857022 | 1999-01-01 | Sudia | |
| US5872849 | 1999-02-01 | Sudia |
Non-Patent Literature (55)
- Needham et al "Using Encryption for Authentication in Large Networks of Computers", Communications of the ACM, vol. 21, No. 12, Dec. 1978, pp. 993-999.
- Chor et al., "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults", Extended Abstract, IEEE, 1985, pp. 383-395.
- Even, S., "Secure Off-Line Electronic Fund Transfer Between Nontrusting Parties", Abstract, Jan. 31, 1988, 10 pps.
- Shamir, A., "How to Share a Secret", Communications of the ACM, vol. 22, No. 11, Nov. 1979, pp. 612-613.
- Chaum, D., "Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms", Communications of the ACM, vol. 24, No. 2, Feb. 1981, pp. 84-88.
- Desmedt, et al., "Threshold Cryptosystems", EE & CS Department, University of Wisconsin-Milwaukee.
- Rabin, M., "How to Exchange Secrets", May 20, 1981, pp. 1-21.
- Kolata, G., Cryptographers Gather to Discuss Research--Analyses of how to break codes and new ways to use codes were featured at the meeting, Science, vol. 214, No. 6, 1981, pp. 646-647.
- Blum, M., "How to Exchange (Secret) Keys", ACM Transactions on Computer Systems, vol. 1, No. 2, May 1983, pp. 175-193.
- Luby, et al., "How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin", IEEE, 1983, pp. 11-21.
- Even et al., "A Randomized Protocol for Signing Contracts", Communications of the ACM, vol. 28, No. 6, Jun. 1985, pp. 637-647.
- Goldreich et al., "How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority", Proceedings of the 27.sup.th Annual IEEE ACM Symposium on Theory of computing, May 1987, pp. 218-229.
- Goldwasser et al., "The Knowledge complexity of Interactive Proof Systems", Siam Journal of Computing, vol. 18, No. 1, Feb. 1989, pp. 186-208.
- Damgard, I., "Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals", Extended Abstract, pp. 328-335, Proceedings of Crypto '88.
- Chaum et al., "Untraceable Electronic Cash", Extended Abstract, pp. 319-327, Proceedings of Crypto '88.
- Dolev et al., "Non-Malleable Cryptography", Extended Abstract, Communications of the ACM, Mar. 1991, pp. 542-552.
- Batelaan et al., "Internet Billing Service Design and Protype implementation", Carnegie Mellon University Information Networking Institute 1992 Final Project, Mar. 30, 1993, 16 pps.
- Burk et al., "Digital Payment Systems Enabling Security and Unobservability", Computers & Security, vol. 8, 1989, pp. 399-415.
- Rabin, M., "Transaction Protection by Beacons", Harvard University, Cambridge, MA, Nov. 1981, 21 pps.
- Ben-Or et al., "A Fair Protocol for Signing Contracts", IEEE Transactions On Information Theory, vol. 36, No. 1, Jan. 1990, pp. 40-46.
- Rivest, et al., "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, Feb. 1978, pp. 120-126.
- Goldreich et al., "Proofs That Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems", Journal of the Association for Computing Machinery, vol. 38, No. 1, Jul. 1991, pp. 691-729.
- Leighton, Tom; & Micali, S., "New Approaches to Secret-Key Exchange", Apr. 1993.
- Leighton, Tom; & Kilian, Joseph, "Failsafe Key Escrow", Aug. 1994.
- Rabin, Tal; & Ben-Or, Michael; "Verifiable Secret Sharing and Multiparty Protocols with Honest Majority" (Extended Abstract), Institute of Mathematics and Computer Science, The Hebrew University, Jerusalem, Irasel, Aug. 1989, pp. 73-85.
- Karnin, Ehud D.; Greene, Jonathan W.; & Hellman, Martin E., "On Secret Sharing Systems", IEEE Transactions on Information Theory, vol. IT-29, No. 1, Jan. 1983.
- Meyer, Carl H. & Matyas, Stephen M., "Cryptography: a New Dimension in Computer Data Security", Cryptography Competency Center, IBM Corporation, Kingston, New York, 1982 pp. 350-541.
- Micali, S., "Fair Cryptosystems", MIT/LCS/TR-579.b, Nov. 1993.
- B. Schneier; Applied Cryptography, Second Edition; May 22, 1995; John Wiley & Son, Inc.
- Yao, Andrew C., "Protocols for Secure Computations" (Extended Abstract) 1982, University of California, Berkeley, CA., pp. 160-169.
- Micali, Silvio and Philip Rogaway, "Secure Computation" (Abstract) Undated.
- Ben-Or, Michael, Shafi Goldwasser and Avi Wigderson, "Completeness Theorms for Non-Cryptographic Fault-Tolerant Distributed Computation" (Extended Abstract) ACM, 1988, pp. 1-10.
- Longley, Dennis and Shain, Michael; "Data & Computer Security: Dictionary of standards concepts and terms", 1987, pp. 10-421.
- Chor, Benny, Shafi Goldwasser, Silvio Micali and Baruch Awerbauch, "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults" (Extended Abstract), Massachusetts Institute of Technology Laboratory for Computer Science, 1985, pp. 383-395.
- Graham, S.L. adn R.L. Rivest, "A Method for Obtaining Digital Signatures and Public-Key cryptosystems" Communications of the ACM, Feb. 1978, vol. 21, No. 2.
- Micali, S., "Fair Public-Key Cryptosystems", Cryptosystems, May 20, 1992.
- Pederson, Torben Pryds, "Distributed Provers with Applications to Undeniable Signatures", Eurocrypt '91 Abstracts, Univ. Of Sussex, Brighton, UK, 8th-11th Apr. 1991, pp. 117-122.
- Beth, Th., "Zur Diskission gestellt, Informatic Spektrum", vol. 13, 1990, pp. 204-215.
- Feldman, Paul, "A Practical Scheme for Noninteractive Verifiable Secret Sharing", 1987, pp. 427-437.
- Blakley, G.R., "Safeguarding Cryptographic Keys, AFIPS-Conference Proceedings", vol. 48, National Computer Conference, 1979, pp. 313-317.
- DeMillo, Richard A., Davida, George I., Dobkin, David P.; Harrison, Michael A.; and Lipton, Richard J., "Cryptology in Revolution: Mathematics and Models", San Francisco, CA, Jan. 5-6, 1981, pp. 152-155.
- Simmons, Gustavus J., "How to (Really) Share a Secret", Advances in Cryptology--Crypto '88, pp. 390-448.
- Benaloh, Josh Cohen, "Secret Sharing Homorphisms: Keeping Shares of A Secret Secret", Advances in Cryptology-Crypto '86, pp. 251-260.
- Galil, Zvi; & Yung, Moti, "Partitioned Encryption & Achieving Simultaneity by Partitioning", Oct. 19, '87, pp. 81-88.
- Feldman, Paul Neil, "Optimal Algorithms for Byzantine Agreement", May 13, 1988.
- Diffie, Whitfield; & Hellman, Martin E., "New Directions in Crytography", IEEE Transactions on Information Theory, vol. IT-22, No. 6, Nov. 1976, pp. 644-654.
- Chaum, David, Claude Crepeau and Ivan Damgdrd, "Multiparty Unconditionally Secure Protocols"(Extended Abstract) ACM, 1988, pp. 11-19.
- G. simmons, "How to Insure that Data Acquired to Verify Treaty Compliance are Trustworthy", Proceedings IEEE, vol. 76 No. 5, May 1988.
- Merkle, Ralph C., "A Digital Signature Based on a Conventional Encryption Function", 1987.
- Brassard, et al. "Mimimum Disclosure Proofs of Knowledge", Journal of Computer and System Sciences 37, pp. 156-189, 1988.
- Beker, Henry; & Piper, Fred, Cipher Systems, 1982, pp. 292-305 (Sections 8.2 and 8.3).
- Konheim, Alan G., Cryptography--A Primer, 1981, pp. 285-293 (Chapter).
- Denning D.E.R., Cryptograph & Data Security, 1982, pp. 161-179 (Sections 3.6 and 3.7).
- Simmons, Gustvus J., Contemporary Cryptology The Science of Information Integrity, 1992, pp. 325-419 and 615-630 (Chapters 6, 7 and 13).
- Micali, S., "Fair Public Key Cryptosystems", Advances in Cryptology--Crypto '92, Aug. 1992.