Cryptography – Particular algorithmic function encoding – Nbs/des algorithm
Patent
1996-03-21
1997-09-09
Buczinski, Stephen C.
Cryptography
Particular algorithmic function encoding
Nbs/des algorithm
380 30, 380 45, H04L 900, H04K 100
Patent
active
056664141
ABSTRACT:
A given decryption key is decomposed into at least two parts, for example, a first subkey and a second subkey. The first subkey may be verifiably secret-shared among a set of one or more trustees, whereas the trustees preferably receive no information at all about the second subkey. Reconstruction of the first subkey by the trustees does not yield a decryption key useful by itself in decrypting ciphertexts. The trustees, however, also receive a guarantee that once they reveal their shares to a given entity, the entity has the capability of determining the second subkey. Generally, the generation of the second subkey will be carried out by the entity using a brute force technique, although the calculation may be performed by still another party (or even the trustees themselves in cooperation with the entity). Once the second subkey is determined, the guarantee ensures that combination of the first and second subkeys yields a given decryption key that may then be used to decrypt ciphertexts.
REFERENCES:
patent: 4265827 (1981-05-01), McDonald
patent: 4326098 (1982-04-01), Bouricius et al.
patent: 4879747 (1989-11-01), Leighton et al.
patent: 4908861 (1990-03-01), Brachtl et al.
patent: 4924514 (1990-05-01), Matyas et al.
patent: 4944009 (1990-07-01), Micali et al.
patent: 4995081 (1991-02-01), Leighton et al.
patent: 5081676 (1992-01-01), Chou et al.
patent: 5177791 (1993-01-01), Yeh et al.
patent: 5208853 (1993-05-01), Armbruster et al.
patent: 5214698 (1993-05-01), Smith, Sr. et al.
patent: 5276737 (1994-01-01), Micali
patent: 5315658 (1994-05-01), Micali
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 Diskussion 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.
Shamir, Adi, "How to Share a Secret", Communication of the ACM, vol. 22, No. 11, Nov. 1979, pp. 612-613.
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.
Desmedt, Yvo; and Frankel, Yair, "Threshold Cryptosystems", Advances in Cryptology--CRYPTO '89, pp. 307-315.
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.
Pedersen, Torben Pryds, "Distributed Provers with Applications to Undeniable Signatures", Advances in Cryptology--EUROCRYPT '91, Brighton, UK, Apr. 1991, pp. 221-242.
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.
Meyer, Carl H.; & Matgas, Stephen M., Cryptography: A New Dimension in Computer Data Security, 1982, pp. 350-428 (Chapters 8 and 9).
Beker, Henry; & Piper, Fred, Cipher Systems, 1982, pp. 292-305 (Sections 8.2 and 8.3).
Longley, Dennis, Data & Computer Security, 1987, pp. 120-323.
Konheim, Alan G., Cryptography--A Primer, 1981, pp. 285-293 (Chapter 7).
Denning D.E.R., Cryptograph & Data Security, 1982, pp. 161-179 (Sections 3.6 and 3.7).
Simmons, Gustavus 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.
Micali, S., "Fair Cryptosystems", MIT/LCS/TR-579 b, Nov. 1993.
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), Instituteof Mathematics and Computer Science, The Hebrew University, Jerusalem, Israel, 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.
Ito, Mitsuru; Saito, Akira; and Nishizeki, Takao, "Secret Sharing Scheme Realizing General Access Structure", Dept. of Electrical Communications, Tohoku University, Sendai, Miyagi 9890, Japan, pp. 3.6.1-3.6.4.
Bearer, Donald; "Multiparty Protocols Tolerating Half Faulty Processors"; Aiken Computation Lab, Harvard University, pp. 560-572.
Gong, Li; "Securely Replicating Authentication Services", Univ. of Cambridge Computer Lab., Cambridge, England, pp. 85-91.
Brassard, Gilles, "On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys", Univ. de Montreal, Dept. d'informatique et de recherche operationnelle, C.P. 6128, Montreal, Quebec, pp. 79-86.
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.
Christoffersson, Per; Ekhall, Stig-arne; & Fak, Viiveke; "Crypto Users' Handbook: A Guide for Implementors of Cryptographic Protection in Computer Systems", 1988, pp. 8-85.
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.
Goldreich, Oded, Silvio Micali and Avi Wigderson, "Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design" (Extended Abstract), 1986, pp. 174-187.
Graham, S.L and R.L. Rivest, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" Communications of the ACM, Feb. 1978, vol. 21, No. 2.
LandOfFree
Guaranteed partial key-escrow does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Guaranteed partial key-escrow, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Guaranteed partial key-escrow will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-74877