Схема Порогового Розподілення Секрету «k,n»

Volodymyr Luzhetskyi; Mykyta Tsikhotskyi

Threshold Secret Sharing Scheme «k,n»

Authors

Volodymyr Luzhetskyi Doctor of Technical Science, Professor, Head of Information Security Department, Vinnytsia National Technical University
Mykyta Tsikhotskyi Information Security Department, Vinnytsia National Technical University

Keywords:

threshold scheme, secret distribution process, secret recovery process, dealer, coalition of participants, secret key, byte permutation

Abstract

A mathematical model of the secret distribution threshold scheme (k,n) is proposed. Using this model, we can perform secret distribution for any k and n (k<n) in such a way that only k participants together can recover the secret message.