Multipartite secret sharing schemes are those having a multipartite access structure, in
which the set of participants is divided into several parts and all participants in the same part …

A secret-sharing scheme realizes a graph if every two vertices connected by an edge can
reconstruct the secret while every independent set in the graph does not get any information …

One of the main open problems in secret sharing is the characterization of the access
structures of ideal secret sharing schemes. As a consequence of the results by Brickell and …

A secret sharing scheme is a protocol by which a dealer distributes a secret among a set of
participants in such a way that only qualified sets of them can reconstruct the value of the …

В теории разделения секрета рассматривается задача, которую неформально можно
поставить следующим образом. Требуется разделить значение секрета из некоторого …

A secret-sharing scheme realizes a given graph if every two vertices connected by an edge
can reconstruct the secret and every independent set in the graph does not get any …

One of the main open problems in secret sharing is the characterization of the access
structures of ideal secret sharing schemes. Brickell and Davenport proved that every one of …

A secret sharing scheme is ideal if the size of each share is equal to the size of the secret.
Brickell and Davenport showed that the access structure of an ideal secret sharing scheme …

‎ The characterization of the ideal access structures is one of the main open problems in
secret sharing and is important from both practical and theoretical points of views‎.‎ A graph …

Работа посвящена вопросам, связанным с разграничением доступа посредством
идеальных совершенных схем разделения секрета и матроидов. Рассматриваются …