Building Group Key Establishment on Group Theory: A Modular Approach
نویسندگان
چکیده
منابع مشابه
Towards Provably Secure Group Key Agreement Building on Group Theory
Known proposals for key establishment schemes based on combinatorial group theory are often formulated in a rather informal manner. Typically, issues like the choice of a session identifier and parallel protocol executions are not addressed, and no security proof in an established model is provided. Successful attacks against proposed parameter sets for braid groups further decreased the attrac...
متن کاملAttribute-based group key establishment
Motivated by the problem of establishing a session key among parties based on the possession of certain credentials only, we discuss a notion of attribute-based key establishment. A number of new issues arise in this setting that are not present in the usual settings of group key establishment where unique user identities are assumed to be publicly available. After detailing the security model,...
متن کاملScalable Deniable Group Key Establishment
The popular Katz-Yung compiler from CRYPTO 2003 can be used to transform unauthenticated group key establishment protocols into authenticated ones. In this paper we present a modification of Katz and Yung’s construction which maintains the round complexity of their compiler, but for ‘typical’ unauthenticated group key establishments adds authentication in such a way that deniability is achieved...
متن کاملModular Theory of Group - Matrices
1. The importance of the concept group-matrix in the theory of finite groups was recognized by Dedekind as early as 1880. The development of a general theory of group-matrices is due, however, to Frobenius, (Berliner Sitzungsberichte, from 1896 to the present). In particular, Frobenius has applied the theory to the representation of a finite group as a (non-modular) linear group. Since linear c...
متن کاملA Modular Formalisation of Finite Group Theory
In this paper, we present a formalisation of elementary group theory done in Coq. This work is the first milestone of a long-term effort to formalise Feit-Thompson theorem. As our further developments will heavily rely on this initial base, we took special care to articulate it in the most compositional way. Key-words: finite groups, proof assistants, formalisation of mathematics ∗ Microsoft Re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12020197