Distributed Password for Quorum and Veto

• Autorzy: Dobrzański W. , Srebrny M.
• Języki publikacji: EN

Abstrakty

EN

A simple algorithm for sharing a secret with some nonmonotone access structures will be presented. This is achieved by splitting a secret password, represented by a large prime number, between n participants in such a way that only by pooling a qualified set of shares one can recover the original password. Executing the power of veto in addition to a qualified set provides a nonqualified (forbidden) superset. The cryptographic power of our algorithm is based on computational hardness of the integer factorization.

Słowa kluczowe

EN

cryptographic key; computer system; combinatorial algorithm

PL

klucz szyfrujący; system komputerowy; algorytm kombinatoryczny

• Wydawca: Wydawnictwo Uniwersytetu Humanistyczno-Przyrodniczego im. Jana Długosza w Częstochowie
• Czasopismo: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
• Rocznik: 2000/2001
• Tom: Vol. 8
• Strony: 25--31
• Opis fizyczny: Bibliogr. 6 poz., rys., tab.

Twórcy

autor

Dobrzański W.

• Institute of Mathematics and Computer Science Technical University of Częstochowa

autor

Srebrny M.

• Institute of Computer Science Polish Academy of Sciences, Warsaw

Bibliografia

• [1] Benaloh J. and Leichter J.: Generalized secret sharing and monotone functions, CRYPTO'88, Lecture Notes in Computer Science 403(1990), pp. 27-35.
• [2] Blakley G.R.: Safeguarding cryptographic keys, AFIPS Conference Proceedings 48(1979), pp. 313-317.
• [3] Dobrzański W., Soroczuk A., Srebrny M.A.Jr and Srebrny M.: Distributed password, Technical Report, Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland, December 1999.
• [4] Lonc Z., Marek V.W. and Srebrny M.: A Combinatorial Algorithm for Sharing a Key, in preparation.
• [5] Shamir A.: How to share a secret, Communications of the ACM 22(1979), pp.612-613.
• [6] Stinson D.: http:// cacr.math.uwaterloo.ca /dstinson/