On automatic secret generation and sharing for Karin-Greene-Hellman scheme

Authors:
Kamil Kulesza;Zbigniew Kotulski
Affiliations:
Institute of Fundamental Technological Research, Polish Academy of Sciences, ul. Swietokrzyska 21, 00-049, Warsaw Poland;Institute of Fundamental Technological Research, Polish Academy of Sciences, ul. Swietokrzyska 21, 00-049, Warsaw Poland
Venue:
Artificial intelligence and security in computing systems
Year:
2003

Citing 4
Cited 0

On the Dealer‘s Randomness Required in Secret Sharing Schemes

Designs, Codes and Cryptography
Anonymous secret sharing schemes

Discrete Applied Mathematics
How to share a secret

Communications of the ACM
Handbook of Applied Cryptography

Handbook of Applied Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The secret considered is a binary string of fixed length. In the paper we propose a method of automatic secret generation and sharing. We show how to simultaneously generate and share random secret. Such a secret remains unknown until it is reconstructed. Next, we propose a method of automatic sharing of a known secret. In this case the Dealer does not know the secret and the secret's Owner does not know the shares. We discuss how to use extended capabilities in the proposed method.