ResearchPDF Available

Blocked Hash-Tree Status and Entitlement System

Authors:
  • FW Sudia Consulting

Abstract and Figures

Paper based on the patent application US 2005/0114666 A1 Blocked Tree Authorization and Status Systems.
Content may be subject to copyright.
A preview of the PDF is not available
ResearchGate has not been able to resolve any citations for this publication.
Patent
Full-text available
A method of unwrapping wrapped digital data that is unusable while wrapped, includes obtaining an acceptance phrase from a user; deriving a cryptographic key from the acceptance phrase; and unwrapping the package of digital data using the derived cryptographic key. The acceptance phrase is a phrase entered by a user In response to information provided to the user. The information and the acceptance phrase can be in any appropriate language. The digital data includes, alone or in combination, any of: software, a cryptographic key, an identifying certificate, an authorizing certificate, a data element or field of an identifying or authorizing certificate, a data file representing an image, data representing text, numbers, audio, and video.
Conference Paper
Full-text available
) William Aiello 1 Sachin Lodha 2 Rafail Ostrovsky 3 1 Bell Communications Research, email: aiello@bellcore.com 2 Rutgers University Computer Science Department, e-mail: lodha@paul.rutgers.edu. Part of this work was done while this author visited Bellcore, also partially supported by DIMACS. 3 Bell Communications Research, email: rafail@bellcore.com Abstract. The availability of fast and reliable Digital Identities is an essential ingredient for the successful implementation of the public-key...
Conference Paper
Full-text available
A new digital signature based only on a conventional encryption function (such as DES) is described which is as secure as the underlying encryption function -- the security does not depend on the difficulty of factoring and the high computational costs of modular arithmetic are avoided. The signature system can sign an unlimited number of messages, and the signature size increases logarithmically as a function of the number of messages signed. Signature size in a ‘typical’ system might range from a few hundred bytes to a few kilobytes, and generation of a signature might require a few hundred to a few thousand computations of the underlying conventional encryption function.
Article
Full-text available
A new type of signature scheme is proposed. It consists of two phases. The first phase is performed off-line, before the message to be signed is even known. The second phase is performed on-line, once the message to be signed is known, and is supposed to be very fast. A method for constructing such on-line/off-line signature schemes is presented. The method uses one-time signature schemes, which are very fast, for the on-line signing. An ordinary signature scheme is used for the off-line stage. In a practical implementation of our scheme, we use a variant of Rabin's signature scheme (based on factoring) and DES. In the on-line phase all we use is a moderate amount of DES computation and a single modular multiplication. We stress that the costly modular exponentiation operation is performed off-line. This implementation is ideally suited for electronic wallets or smart cards.
Article
We apply off-line digital signatures to provide a novel approach to certificate revocation. Our approach dismisses with traditional CRLs and yields public-key infrastructures that are several-hundred times cheaper to run than traditional ones.
Public key/signature cryptosystem with enhanced digital signature certification
  • Fischer
Fischer, US 5,214,702, "Public key/signature cryptosystem with enhanced digital signature certification" (entitlements)
Apparatus and Method for Demonstrating and Confirming the Status of Digital Certificates and Other Data
  • Kocher
Kocher, US 5,903,651, "Apparatus and Method for Demonstrating and Confirming the Status of Digital Certificates and Other Data" (hash-tree)
On-Line/Off-Line Digital Signing " (Note: claims all forms of cryptographic pre-computation
  • Us Micali
Micali, US 5,016,274, " On-Line/Off-Line Digital Signing " (Note: claims all forms of cryptographic pre-computation.)