U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Fair cryptosystems and methods of use

Patent 5315658 Issued on May 24, 1994. Estimated Expiration Date: Icon_subject April 19, 2013. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Database encryption and decryption circuit and method using subkeys
Patent #: 4375579
Issued on: 03/01/1983
Inventor: Davida ,   et al.

Cryptographic communications system and method
Patent #: 4405829
Issued on: 09/20/1983
Inventor: Rivest ,   et al.

Variants of the fiat-shamir identification and signature scheme
Patent #: 4933970
Issued on: 06/12/1990
Inventor: Shamir

Method of bonding copper and resin
Patent #: 5006200
Issued on: 04/09/1991
Inventor: Chen

Method for electronic transaction with digital signature
Patent #: 5018196
Issued on: 05/21/1991
Inventor: Takaragi, et al.

Public/key date-time notary facility
Patent #: 5136643
Issued on: 08/04/1992
Inventor: Fischer

Cryptographic system allowing encrypted communication between users with a secure mutual cipher key determined without user interaction
Patent #: 5150411
Issued on: 09/22/1992
Inventor: Maurer

Method for generating a public key
Patent #: 5199070
Issued on: 03/30/1993
Inventor: Matsuzaki, et al.

Method and apparatus for validating entry of cryptographic keys
Patent #: 5214698
Issued on: 05/25/1993
Inventor: Smith, Sr., et al.

Fair cryptosystems and methods of use Patent #: 5276737
Issued on: 01/04/1994
Inventor: Micali

Inventor

Application

No. 049929 filed on 04/19/1993

US Classes:

380/286, Key escrow or recovery380/28, PARTICULAR ALGORITHMIC FUNCTION ENCODING380/30, Public key713/176, Authentication by digital signature representation or digital watermark713/180Generating specific digital signature type (e.g., blind, shared, or undeniable)

Examiners

Primary: Swann, Tod R.

Attorney, Agent or Firm

International Class

H04K 001/00

Abstract

A method, using a public-key cryptosystem, for enabling a predetermined entity to monitor communications of users suspected of unlawful activities while protecting the privacy of law-abiding users, wherein each user is assigned a pair of matching secret and public keys. According to the method, each user's secret key is broken into shares. Then, each user provides a plurality of "trustees" pieces of information. The pieces of information provided to each trustee enable that trustee to verify that such information includes a "share" of a secret key of some given public key. Each trustee can verify that the pieces of information provided include a share of the secret key without interaction with any other trustee or by sending messages to the user. Upon a predetermined request or condition, e.g., a court order authorizing the entity to monitor the communications of a user suspected of unlawful activity, the trustees reveal to the entity the shares of the secret key of such user. This enables the entity to reconstruct the secret key and monitor the suspect user's communications.

Other References

  • Shamir, "How to Share A Secret", Communications of the ACM, vol. 22, No. 11, pp. 612-613, Nov., 1979
  • Blakley, "Safeguarding Cryptographic Keys", AFIPS-Conference Proceedings, vol. 48, pp. 313-317, 1979
  • Chor, et al, "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults", IEEE, pp. 383-395, 1985
  • Benaloh, "Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret", CRYPTO, pp. 1-2, Jul. 18, 1966
  • Goldreich, et al., "How to Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority", ACM, pp. 218-229, 1987
  • Ben-Or, "Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation", ACM, pp. 1-10, 1988
  • Chaum, et al, "Multiparty Unconditionally Secure Protocols", ACM, pp. 11-19, 1988
  • Rabin, et al, "Verifiable Secret Sharing and Multiparty Protocols with Honest Majority", ACM, pp. 73-83, 1989
  • Feldman, "A Practical Scheme For Non-Interactive Verifiable Secret Sharing", IEEE, pp. 427-437, 1987
  • Diffie, et al, "New Directions in Cryptography", IEEE Transactions on Information Theory, vol. 22, No. 6, pp. 644-654, Nov. 1976
  • Rivest, et al, "A Method for Obtaining Digital Signatures and Public Key Cryptosystems", ACM, vol. 21, No. 2, pp. 120-126, Feb., 1978
  • Brassard, et al, "Minimum Disclosure Proofs of Knowledge", Journal of Computer and System Sciences 37, pp. 156-189, 1988
  • Goldreich, et al, "Proofs That Yield Nothing But Their Validity and a Methodology of Cryptographic Protocol Design", IEEE, pp. 174-187, 198
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?