A Generic Algebraic Model for the Analysis of Cryptographic-Key Assignment Schemes Khair Eddin Sabri (University of Jordan, Jordan) and Ridha Khedri (McMaster University, Canada) |
---|

One of the means to implement information flow policies is by using a
cryptographic approach commonly referred to as key assignment schemes.
In this approach, information is made publicly available to users but
in an encrypted form. Then, keys are assigned to users such that each
key reveals a specified part of the information. Usually the
distribution of keys follows a predefined scheme that specifies the
ability of users to reveal information. In this paper, we present an
algebraic approach based on idempotent commutative semirings to
define, specify, and analyse key assignment schemes. Then we
illustrate its usage on two key assignment schemes selected from the
literature. Also, we propose amendments to the studied schemes to
extend their scopes. The proposed generic algebraic approach enables
the assessment of the secrecy of key assignment schemes through
algebraic calculations, which can be automated using Prover9.
FPS 2012 Program |