Powiadomienia systemowe
- Sesja wygasła!
- Sesja wygasła!
- Sesja wygasła!
- Sesja wygasła!
- Sesja wygasła!
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Rocznik
Tom
Strony
25--31
Opis fizyczny
Bibliogr. 6 poz., rys., tab.
Twórcy
autor
- Institute of Mathematics and Computer Science Technical University of Częstochowa
autor
- 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/
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-6465aebc-0d16-462e-8c41-185357e60c13