Cryptography – Particular algorithmic function encoding – Public key
Patent
1996-11-18
1997-09-09
Cangialosi, Salvatore
Cryptography
Particular algorithmic function encoding
Public key
380 9, 380 25, H04L 930
Patent
active
056664206
ABSTRACT:
A communication method between a first and second party, in the presence of a trusted party, that enables a transaction in which the second party receives a first value produced by the first party and unpredictable to the second party if and only if the first party receives a second value produced by the second party and unpredictable to the first party. The method includes two basic steps: exchanging a first set of communications between the first and second parties without participation of the trusted party to attempt completion of the transaction, and if the transaction is not completed using the first set of communications between the first and second parties, having the trusted party take action to complete the transaction.
REFERENCES:
patent: 4200770 (1980-04-01), Hellman et al.
patent: 4218582 (1980-08-01), Hellman et al.
patent: 4405829 (1983-09-01), Rivest et al.
patent: 4438824 (1984-03-01), Mueller-Schloer
patent: 4458109 (1984-07-01), Mueller-Schloer
patent: 4789928 (1988-12-01), Fujisaki
patent: 4885777 (1989-12-01), Takaragi et al.
patent: 4953209 (1990-08-01), Ryder, Sr. et al.
patent: 5117358 (1992-05-01), Winkler
patent: 5202977 (1993-04-01), Pasetes, Jr. et al.
patent: 5214700 (1993-05-01), Pinkas et al.
patent: 5220501 (1993-06-01), Lawlor et al.
patent: 5243515 (1993-09-01), Lee
patent: 5276737 (1994-01-01), Micali
patent: 5315658 (1994-05-01), Micali
patent: 5440634 (1995-08-01), Jones et al.
patent: 5453601 (1995-09-01), Rosen
patent: 5455407 (1995-10-01), Rosen
patent: 5497421 (1996-03-01), Kaufman et al.
patent: 5509071 (1996-04-01), Petrie, Jr. et al.
patent: 5553145 (1996-09-01), Micali
patent: 5610982 (1997-03-01), Micali
Chaum, D., "Security Without Identification: Transaction Systems To Make Big Brother Obsolete", Communications of the ACM, vol. 28, No. 10, Oct. 1985, pp. 1030-1044.
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.
Stein et al., "The Green Commerce Model", Oct. 1994, 18 pps.
Low et al., "Anonymous Credit Cards", 2nd ACM Conference on Computer and Communication Security, Nov. 2-4, 1994, 10 pps.
Neuman et al., "Requirements for Network Payment: The NetCheque.TM. Perspective", Proceedings of IEEE Compcon '95, Mar. 1995, 5 pps.
Janson et al., "Electronic Payment over Open Networks", Abstract, Apr. 18, 1995, 9 pps.
Cheng et al., "Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX", Abstract, Apr. 28, 1995, 14 pps.
Hickman et al., "The SSL Protocol", Netscape Communications Corp., Jun. 1995, 32 pps.
Bellare et al., "iKP--A Family of Secure Electronic Payment Protocols", Abstract, Jul. 12, 1995, 21 pps.
Rescorla et al., "The Secure HyperText Transfer Protocol", Internet Draft, Jul. 1995, 40 pps.
Pedersen, T., "Electronic Payments of Small Amounts", Abstract, 12 pps. (Apr. 1996).
Dukach, S., "SNPP: A Simple Network Payment Protocol", Abstract, 7 pps.
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 Prototype 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-416.
Rabin, M., "Transaction Protection by Beacons", Harvard University, Cambridge, MA, Nov. 1981, 21 pps.
Sirbu M. et al. "NetBill: An Internet Commerce System Optimized for Network Delivered Services", Carnegie Mellon University, Pittsburgh, PA, pp. 1-11.
Rivest, et al., "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, Feb. 1978, pp. 120-126.
U.S. application No. 08/700,270, Micali, filed Aug. 20, 1996.
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.
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.
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, Nov. 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, Vo.. 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 27th 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.
Ben-Or et al., "A Fair Protocol for Signing Contracts", IEEE Transactions On Information Theory, vol. 36, No. 1, Jan. 1990, pp. 40-46.
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.
Desmedt et al., "Threshold cryptosystems", EE & CS Department, University of Wisconsin-Milwaukee.
Yvo Desmedt et al., (Abstract) "Threshold Cryptosystems" EE&CS Department University of Wisconsin-Milwaukee Milwaukee, WI 53201.
Richard Batelann et al., "An Internet Billing Server: Internet Billing Service Design and Prototype Implementation" Carnegie Mellon University Information Networking Institute 1992 Final Project, Mar. 30, 1993.
Rabin, Michael O., "How to Exchange Secrets," May 20, 1981, pp. 1-21.
Micali, "Verifiable Secret Sharing and Achieving Similtaneity in the Presence of Faults," 1985, IEES, pp. 383-395.
Chaum, David L., "Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms", Communications of the ACM, Feb. 1981, vol. 24, No. 2, pp. 84-88.
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," POC, 26th FOCS, 1985, pp. 383-395.
Goldwasser, et al, "The Knowledge Complexity of Interactive Proof Systems," Siam Journal of Computing, vol. 18, No. 1, Feb. 1989, pp. 186-208.
Kolata, "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, Nov. 6, 1981, pp. 646-647.
Blum, "How to Exchange (Secret) Keys," ACM Transactions on Computer Systems, vol. 1, No. 2, May 1983, pp. 175-193.
Rabin, "How to Exchange (Secret) Keys," Harvard University Center for Research in Computer Technology, Nov. 1981.
Even, et al, "A Randomized Protocol for Signing Contracts," Communications of the ACM, Jun. 1985, vol. 28, No. 6, pp. 637-647.
Ben-Or, et al, "A Fair Protocol for Signing Contracts," IEEE Transactions on Information Theory, vol. 36, No. 1, Jan. 1990.
Luby, et al, "How to Simultaneously Exchange a Secret Bit by Flipping A Symmetrically-Baised Coin," 1983.
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
LandOfFree
Simultaneous electronic transactions does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Simultaneous electronic transactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simultaneous electronic transactions will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-74924