Methods of encrypting monotonic access structures

• Autorzy: Derbisz J.
• Języki publikacji: EN

Abstrakty

EN

We will present some ideas about sharing a secret in a monotonic access structure. We show the relations which occur between the method of encrypting a monotonic access structure with the use of basis sets or maximal unprivileged sets, and that based on a logical formula (used by Benaloh and Leichter in [1]). We will also give some facts connected with the problem of security, including the aspects of a hierarchy security in the structure. The method of encrypting a monotonic access structure using a family of basis sets or a family of maximal sets that cannot reconstruct the secret will be described in a general way. Some aspects of using the latter based on a logical formula will be also given. Any (general) access structure can be encrypted by each of them but the way of sharing a secret is quite different and usually a specified method has to be chosen to achieve a desirable level of security and time complexity.

Słowa kluczowe

EN

access structures; hierarchy security; levels of security

• Wydawca: Wydawnictwo UMCS
• Czasopismo: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
• Rocznik: 2011
• Tom: Vol. 11, no. 2
• Strony: 49--60
• Opis fizyczny: Bibliogr. 9 poz.

Twórcy

autor

Derbisz J.

• Faculty of Mathematics, Computer Science and Mechanics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland

Bibliografia

• [1] Benaloh J., Leichter J., Generalized secret sharing and monotone functions, ”Advances in Cryptology - CRYPTO ’88”.
• [2] Blakley, G. R., Safeguarding cryptographic keys, Proceedings of the National Computer Conference 48 (1979): 313.
• [3] Shamir A., How to Share a Secret, Communications of the ACM 22(11): 612.
• [4] Ito M., Saito A. and Nishizeki T., Secret Sharing Scheme Realizing General Access Structure, Proc. Glob. Com. (1987).
• [5] Derbisz J., Pomykała J., Uogólnione rozdzielanie sekretu w systemach rozproszonych, submitted.
• [6] Cramer R., Damgard I. and Maurer U., General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme, B. Preneel (Ed.), Advances in Cryptology, EuroCrypt 2000, Lecture Notes in Computer Science 1807 (2000): 316.
• [7] Goldreich O., Micali S. and Wigderson A., How to play any mental game or a completeness theorem for protocols with honest majority, Proc. ACM STOC ’87, 218.
• [8] Ben-Or M., Goldwasser S. and Wigderson A., Completeness theorems for noncryptographic fault-tolerant distributed computation, Proc. ACM STOC ’88, 1.
• [9] Chaum D., Crepeau C. and Damgard I., Multi-party unconditionally secure protocols, Proc. ACM STOC ’88, 11.