Results 1 
9 of
9
ZeroKnowledge Proofs for Mixnets of Secret Shares and a Version of ElGamal with Modular Homomorphism
, 2005
"... Mixnets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving combinatorial problems where constraints depend on secrets of different participants. A main contribution of this paper is to show how participants in the mixnet can provide Ze ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
Mixnets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving combinatorial problems where constraints depend on secrets of different participants. A main contribution of this paper is to show how participants in the mixnet can provide ZeroKnowledge proofs to convince each other that they do not tamper with the shuffled secrets, and that inverse permutations are correctly applied at unshu#ing. The approach is related to the proof of knowing an isomorphism between large graphs. We also make a detailed review and comparison with rationales and analysis of Chaum's and Merritt's mixnets. Another
A simple generalization of ElGamal cryptosystem to nonabelian groups.
 Communication in Algebra
, 2008
"... This is a study of the MOR cryptosystem using the special linear group over finite fields. The automorphism group of the special linear group is analyzed for this purpose. At our current state of knowledge, I show that this MOR cryptosystem has better security than the ElGamal cryptosystem over fin ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
This is a study of the MOR cryptosystem using the special linear group over finite fields. The automorphism group of the special linear group is analyzed for this purpose. At our current state of knowledge, I show that this MOR cryptosystem has better security than the ElGamal cryptosystem over finite fields.
On finite pgroups with abelian automorphism group
 International Journal of Algebra and Computation
"... ar ..."
(Show Context)
A Zeroknowledge Undeniable Signature Scheme in Nonabelian Group Setting
, 2008
"... Recently nonabelian groups have attracted the attention of cryptographers for constructing publickey cryptographic protocols. In this paper we use the conjugacy problem in nonabelian groups to construct a zeroknowledge undeniable signature scheme. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Recently nonabelian groups have attracted the attention of cryptographers for constructing publickey cryptographic protocols. In this paper we use the conjugacy problem in nonabelian groups to construct a zeroknowledge undeniable signature scheme.
DiffieHellman Protocol Based on Elgamal and AES Cryptosystems
"... Abstract : This paper presents a communication scheme design for securing messages through local area networks (LAN). This scheme implements a hybrid cryptosystem which is formed by AES256 in its symmetric part and ElGamal for encryption of keys where the prime has 400 digits and 200 digits for t ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract : This paper presents a communication scheme design for securing messages through local area networks (LAN). This scheme implements a hybrid cryptosystem which is formed by AES256 in its symmetric part and ElGamal for encryption of keys where the prime has 400 digits and 200 digits for the alpha primitive. It also applies the DiffieHellman protocol for key secure distribution. This implementation is targeted at senior management members or groups of any corporate trust where the number of users is small. Key distribution requires a number equal to the number of rounds for at least one user.
A note on using finite nonabelian pgroups in the MOR cryptosystem
, 2007
"... Abstract. The MOR cryptosystem [9] is a natural generalization of the ElGamal cryptosystem to nonabelian groups. Using a pgroup, a cryptosystem was built in [4]. It seems resoanable to assume the cryptosystem is as secure as the ElGamal cryptosystem over finite fields. A natural question arises ..."
Abstract
 Add to MetaCart
Abstract. The MOR cryptosystem [9] is a natural generalization of the ElGamal cryptosystem to nonabelian groups. Using a pgroup, a cryptosystem was built in [4]. It seems resoanable to assume the cryptosystem is as secure as the ElGamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using pgroups? In this paper we show that the answer is no. 1
Abelian groups, homomorphisms and central automorphisms of nilpotent groups
 JP Journal of Algebra, Number Theory and Applications
"... It is natural to try to find a necessary and sufficient condition for a group to have an abelian central automorphism group. We found a necessary and sufficient condition in case the group is nilpotent. Since a nilpotent group is the direct product of its sylow subgroups, hence ..."
Abstract
 Add to MetaCart
(Show Context)
It is natural to try to find a necessary and sufficient condition for a group to have an abelian central automorphism group. We found a necessary and sufficient condition in case the group is nilpotent. Since a nilpotent group is the direct product of its sylow subgroups, hence