Open AccessMultiplexing schemes for homomorphic cryptosystems
Author(s) -
Juan Camilo Corena,
Jaime Andrés Posada
Publication year - 2013
Publication title -
elementos/elementosbogotâa
Language(s) - English
Resource type - Journals
eISSN - 2248-5252
pISSN - 2027-923X
DOI - 10.15765/e.v1i1.189
Subject(s) - elgamal encryption , homomorphic encryption , paillier cryptosystem , cryptosystem , computer science , anonymity , theoretical computer science , discrete logarithm , public key cryptography , scheme (mathematics) , cryptography , hybrid cryptosystem , computer security , mathematics , encryption , mathematical analysis
We present in this article two secure multiplexing and demul- tiplexing schemes that use homomorphic properties from known public key cryptosystems. One scheme is suitable for cryptosystems with addi- tive homomorphic properties such as Paillier and Benaloh cryptosystems. The proposed scheme employs a modication of Hadamard codes to generate a set of orthogonal codes over Z3. The other one is suitable for cryptosystems with multiplicative homomorphic properties such as RSA and ElGamal. Both schemes might be used in voting and auction systems where anonymity of the individuals is crucial.