Safeguarding cryptographic keys

  title={Safeguarding cryptographic keys},
  author={G. R. Blakley},
  journal={1979 International Workshop on Managing Requirements Knowledge (MARK)},
  • G. Blakley
  • Published 30 December 1899
  • Computer Science, Mathematics
  • 1979 International Workshop on Managing Requirements Knowledge (MARK)
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 cryptosystem,3 are so important that they present a dilemma. [] Key Result The answer is that there are at least three types of incidents:
Protecting Shared Cryptographic Keys
A scheme for distributing a key to n users in such a way as to require at least k of them to be present to construct the original key has the property that up to k - 1 defections can be tolerated.
Threshold Cryptosystems
Practical non-interactive public key systems are proposed which allow the reuse of the shared secret key since the key is not revealed either to insiders or to outsiders.
Shamir Threshold Based Encryption
This paper Shamir threshold scheme based on the protection of private keys, by constructing a Lagrange interpolating polynomial to achieve in the real environment using the key shared information
Simulatability and Security of Certificateless Threshold Signatures without Random Oracles
  • H. Xiong, Z. Qin, Fagen Li
  • Computer Science, Mathematics
    2008 International Conference on Computational Intelligence and Security
  • 2008
This is the first construction of certificateless threshold signature scheme that does not rely on random oracle or ideal ciphers and is proven secure against the malicious-but-passive KGC attack.
A Forward-Secure Digital Signature Scheme
We describe a digital signature scheme in which the public key is fixed but the secret signing key is updated at regular intervals so as to provide a forward security property: compromise of the
Threshold Key-Recovery Systems for RSA
  • T. Okamoto
  • Computer Science
    Security Protocols Workshop
  • 1997
Although threshold key-recovery systems for the discrete log based cryptosystems such as the ElGamal scheme have been proposed by Feldman and Pedersen [6, 11, 12], no (practical) threshold
How Exhausting is Exhaustive Search
It is unknown whether any such machine has been built, and DES is still very widely used, in part because of its continued resistance to sophisticated cryptanalytic attacks.
A Proactive Secret Sharing Scheme Based on Elliptic Curve Cryptography
  • Hua Sun, Xue-feng Zheng, Yike Yu
  • Computer Science, Mathematics
    2009 First International Workshop on Education Technology and Computer Science
  • 2009
This article presents a proactive verifiable secret sharing scheme based on Elliptic Curve Cryptosystem, which is secure and effective.
Probabilistic secret sharing scheme for binary images
A probabilistic (2, n) SS scheme based on XOR operation is proposed for binary images and shows that the scheme has satisfactory contrast, less prone to security attacks along with reasonable computation time.
Veri able Secret SharingMarkus Stadler ? Institute for Theoretical Computer ScienceETH
Publicly veriiable secret sharing schemes are called, new applications to escrow cryptosystems and to payment systems with revocable anonymity are discussed, and two new realizations based on ElGamal's cryptos system are presented.