Related papers: Cryptographic multilinear maps using pro-p groups

Shamir or Blakley secret sharing schemes are used for the authentication process in the studies before, but still secure group authentication and hand-over process remain as challenges in group authentication approaches. In this study, a…

Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direc- tion, this paper presents a novel approach to share a secret among a hierarchy of users while…

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms. For any fixed prime divisor $p$ of $|G|$, we provide a complete characterization of the structure of a group $G$ in which every maximal $A$-invariant…

As the quantum computing era approaches, securing classical cryptographic protocols becomes imperative. Public key cryptography is widely used for signature and key exchange but it is the type of cryptography more threatened by quantum…

It is well known that n x n upper-triangular real matrices with 1's on the diagonal form a nilpotent Lie group with an interesting family of non-isotropic dilations and corresponding geometry, as in [9]. Here we look at p-adic versions of…

We introduce a special class of powerful $p$-groups that we call powerfully nilpotent groups that are finite $p$-groups that possess a central series of a special kind. To these we can attach the notion of a powerful nilpotence class that…

The article deals with profinite groups in which the centralizers are abelian (CA-groups), that is, with profinite commutativity-transitive groups. It is shown that such groups are virtually pronilpotent. More precisely, let G be a…

With rapid increase of mobile computing and wireless network linkage, the information exchange between connected systems and within groups increases heavily. Exchanging confidential information within groups via unsecured communication…

In this paper, algorithms for multivariate public key cryptography and digital signature are described. Plain messages and encrypted messages are arrays, consisting of elements from a fixed finite ring or field. The encryption and…

Let p be a prime number. We give the explicit structure of 2- nilpotent multiplier for each finite 2-generator p-group of class two. Moreover, 2-capable groups in that class are characterized.

Quantum key agreement enables remote participants to fairly establish a secure shared key based on their private inputs. In the circular-type multiparty quantum key agreement mode, two or more malicious participants can collude together to…

We prove that a finitely generated Lie algebra $L$ such that (i) every commutator in generators is ad-nilpotent, and (ii) $ L$ satisfies a polynomial identity, is nilpotent. As a corollary we get that a finitely generated residually-$p$…

In this thesis we explore the benefits of relativistic constraints for cryptography. We first revisit non-communicating models and its applications in the context of interactive proofs and cryptography. We propose bit commitment protocols…

We study the structure of nilpotent completely positive maps in terms of Choi-Kraus coefficients. We prove several inequalities, including certain majorization type inequalities for dimensions of kernels of powers of nilpotent completely…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

The discrete logarithm problem is one of the backbones in public key cryptography. In this paper we study the discrete logarithm problem in the group of circulant matrices over a finite field. This gives rise to secure and fast public key…

A multipartner secure direct communication protocol is presented, using quantum nonlocality. Security of this protocol is based on `High fidelity implies low entropy'. When the entanglement was successfully distributed, anyone of the…

Ensuring security is something that is not easily done as many of the demands of network security conflict with the demands of mobile networks, majorly because of the nature of the mobile devices (e.g. low power consumption, low processing…

We introduce the \emph{linear centralizer method}, and use it to devise a provable polynomial time solution of the Commutator Key Exchange Problem, the computational problem on which, in the passive adversary model, the security of the…

Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a…