Multiplexing schemes for homomorphic cryptosystems

• Corena, Juan Camilo ^[2] ; Posada, Jaime Andrés ^[1]
  1. [1] Politécnico Grancolombiano

     Politécnico Grancolombiano

     Colombia

     
  2. [2] Universidad de los Andes.
• Localización: Elementos, ISSN-e 2248-5252, Vol. 1, Nº. 1, 2011 (Ejemplar dedicado a: Elementos), págs. 24-32
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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 modification 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.