Cryptography – Particular algorithmic function encoding – Nbs/des algorithm
Patent
1993-12-29
1996-07-23
Gregory, Bernarr E.
Cryptography
Particular algorithmic function encoding
Nbs/des algorithm
380 23, 380 30, 380 49, H04L 932, H04L 930, H04L 900
Patent
active
055398260
ABSTRACT:
A method is provided for authentication of encrypted messages. A non-malleable public-key encryption technique is employed, so that an eavesdropper cannot employ an encrypted message, previously overheard, to generate a message which, when sent to a recipient, which would pass as a message originating from a valid sender. In a preferred embodiment, a protocol is provided in which, in response to a message authentication request from a sender, a recipient sends the sender a string, encrypted according to the sender's non-malleable public key. The sender decrypts the string using its private key, and sends the recipient a message which is a function of the string and the message to be authenticated. Because of the non-malleability of the public keys, an eavesdropper cannot impersonate the sender or the recipient and produce a disinformation message which would nevertheless contain the correct authorization string.
REFERENCES:
patent: 4723284 (1988-02-01), Munck et al.
patent: 4853961 (1989-08-01), Pastor
patent: 4935962 (1990-06-01), Austin
patent: 5073935 (1991-12-01), Pastor
patent: 5124117 (1992-06-01), Tatebayashi et al.
patent: 5142578 (1992-08-01), Matyas et al.
patent: 5142579 (1992-08-01), Anderson
patent: 5144662 (1992-09-01), Welmer
patent: 5144667 (1992-09-01), Pogue, Jr. et al.
patent: 5148485 (1992-09-01), Dent
patent: 5159633 (1992-10-01), Nakamura
patent: 5164988 (1992-11-01), Matyas et al.
D. E. R. Denning, Cryptography and Data Security; (Addison-Wesley; Reading, Mass., U.S.A.; 1983); pp. 7-16.
R. E. Lennon et al., Transaction Response Message Authentication (Public Key and Des), KI881-197, vol. 26, No. 8 Jan. 1984.
R. E. Lennon et al., Public-Key Enciphering/Deciphering Transformations Using a Conventional Algorithm, vol. 25, No. 3A, pp. 1241-1249, Aug. 1982.
W. Alexi et al., RSA and Rabin Functions: Certain Parts are as Hard as the Whole, 1988 Society for Industrial and Applied Mathematics, Siam J. Comput, vol. 17, No. 2, Apr. 1988, pp. 194-209.
M. Bellare et al., How to Sign Given Any Trapdoor Function, ACM-0-89791-264-0/88 0005/0032, pp. 32-42, 1988. (Extended Abstract).
M. Blaum et al., Noninteractive Zero-Knowledge, 1991 Society for Industrial Applied Math., Siam J. Comput. vol. 20, No. 6, pp. 1084-1118, Dec. 1991.
M. Blaum et al., Non-Interactive Zero-Knowledge and Its Application (Extended Abstract), ACM-0-89791-264-0/88/0005/0103, 1988.
M. Blaum, et al., An Efficient Probabilistic Public-Key Encryption Scheme Which Hides all Partial Information, Proc. of Crypto 84, pp. 289-299.
B. Chor et al., Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, IEEE 0272-5428/85/0000/0383, 1985. (Extended Abstract).
B. Chor et al., Achieving Independence in Logarithmic Number of Rounds, ACM 0-89791-239-X/87/0008/0260, pp. 260-264, 1987.
Y. Desmedt et al., Special Uses and Abuses of the Fiat-Shamir Passport Protocol, (Extended Abstract) Crypto pp. 21-39, 1987.
U. Feige et al., Witness Indistinguishable and Witness Hiding Protocols, AMC 089791-361-2/90/0005/0416, pp. 416-426, 1990.
U. Feige et al., Zero-Knowledge Proofs of Identity, J. Cryptology, pp. 77-94, 1988.
U. Feige et al., Multiple Non-Interactive Zero Knowledge Proofs Based on a single Random String, IEEE CH2925-6/90/0000/0308, FOCS 1990.
O. Goldreich et al., A Hard-Cord Predicate for all One-Way Functions, ACM 0-89791-307-8/39/0005/0025, STOC 1989.
S. Goldwasser et al., Probabilistic Encryption, J. of Computer & System Sciences 28, pp. 270-299, 1984.
S. Goldwasser et al., A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, Siam J. Comput, vol. 17, No. 2, pp. 281-308, Apr. 1988.
L. A. Levin, One way Functions and Pseudorandom Generators, Combinatorica 7 (4) pp. 357-363, 1987.
S. Micali et al., The Notion of Security for Probabilistic Cryptosystems, SIAM J. Comput. vol. 17., No. 2 pp. 412-426, 1988.
M. Naor et al., Universal One-Way Hash Functions and Their Cryptographic applications, ACM 0-89791-307-8/89/0005/0033, pp. 33-43, STOC 1989.
M. Noar et al., Public-key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks, (Extended Abstract) ACM 089791-361-2/90/0005/0427, pp. 427-437, STOC 1990.
J. Rompel, et al., One-Way Functions are Necessary and Sufficient for Secure Signatures, ACM 089791-361-2/90/0005/0387, pp. 387-394.
M. N. Wegman et al., New Hash Functions and Their Use in Authentication and Set Equality, J. of Computer & Sys. Sciences 22, pp. 265-279, 1981.
Diffie et al., New Directions in Cryptography, IEEE Transactions on Info. Theory, vol. IT-22, No. 6, pp. 644-654, Nov. 1976.
Dwork Cynthia
Naor Simeon
Gregory Bernarr E.
International Business Machines - Corporation
Pintner James C.
LandOfFree
Method for message authentication from non-malleable crypto syst does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for message authentication from non-malleable crypto syst, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for message authentication from non-malleable crypto syst will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-720243