Protecting secret keys with personal entropy

Future Generation Computer SystemsPublished 1 February 2000

Carl Ellison, Chris Hall, Randy Milbert, Bruce Schneier

DOI10.1016/s0167-739x(99)00055-2

Source URL

Citations105

SJR quartileQ1

SJR score1.55

SNIP2.23

TL;DR

A scheme whereby a user can protect a secret key using the "personal entropy" in his own life, by encrypting the passphrase using the answers to several personal questions, while an attacker must learn the answer to a large subset of the questions in order to recover the secret key.

Abstract

Conventional encryption technology often requires users to protect a secret key by selecting a password or passphrase. While a good passphrase will only be known to the user, it also has the flaw that it must be remembered exactly in order to recover the secret key. As time passes, the ability to remember the passphrase fades and the user may eventually lose access to the secret key. We propose a scheme whereby a user can protect a secret key using the "personal entropy" in his own life, by encrypting the passphrase using the answers to several personal questions. We designed the scheme so the user can forget answers to a subset of the questions and still recover the secret key, while an attacker must learn the answer to a large subset of the questions in order to recover the secret key.

Keywords

Computer ScienceBiochemistry, Genetics and Molecular Biology

Communications of the ACMHow to share a secret

13,453 Citations1979Adi Shamir

This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.

View PDF

1979 International Workshop on Managing Requirements Knowledge (MARK)Safeguarding cryptographic keys

3,379 Citations1979G. R. Blakley

Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.

Network Security: Private Communication in a Public World

730 Citations1995Charlie Kaufman, Radia Perlman +1 more

This chapter discusses Cryptographic Authentication Protocols, which are used in both the RSA and Diffie-Hellman Standard, and their applications in Privacy and Integrity, and Password-Based Authentication, which is used in X.509 and PKIX.

Electronics and Communications in Japan (Part III Fundamental Electronic Science)Secret sharing scheme realizing general access structure

678 Citations1989Mitsuru Ito, Akira Saito +1 more

This paper shows that by providing the trustees with several information data concerning the distributed information of the (k, n) threshold method, any access structure can be realized.

Lecture notes in computer scienceGeneralized Secret Sharing and Monotone Functions

665 Citations1990Josh Benaloh, Jerry Leichter

This paper will present general methods for constructing secret sharing schemes for any given secret sharing function using the set of monotone functions and tools developed for simplifying the latter set can be applied equally well to the former set.

Journal of CryptologyHow to share a secret with cheaters

391 Citations1989Martin Tompa, Heather Woll

This paper demonstrates that Shamir's scheme is not secure against certain forms of cheating, and a small modification to his scheme retains the security and efficiency of the original and preserves the property that its security does not depend on any unproven assumptions such as the intractability of computing number-theoretic functions.

View PDF

Cryptographic Solution to a Multilevel Security Problem

58 Citations1983Selim G. Akl, Peter Taylor

A time-versus-storage trade-off is described for addressing the key management problem of enforcing multilevel security in a system where hierarchy is represented by a partially ordered set.

Lecture notes in computer scienceThe Detection of Cheaters in Threshold Schemes

57 Citations1990Ernest F. Brickell, Douglas R. Stinson

Lecture notes in computer scienceA generalized secret sharing scheme with cheater detection

30 Citations1993Hung‐Yu Lin, Lein Harn

A new secret sharing scheme is presented in this paper to realize the generalized secret sharing policy and any honest participant can detect and identify who is cheating even when all of the other participants corrupt together.