Multiplexing schemes for homomorphic cryptosystems

Simple item page
dc.contributor.authorJuan Camilo Corena
dc.contributor.authorJaime Andrés Posada
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T16:33:16Z
dc.date.available2026-03-22T16:33:16Z
dc.date.issued2013
dc.descriptionCitaciones: 1
dc.description.abstractWe 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.
dc.identifier.doi10.15765/e.v1i1.189
dc.identifier.urihttps://doi.org/10.15765/e.v1i1.189
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/58925
dc.language.isoen
dc.publisherInstitución Universitaria Politécnico Grancolombiano
dc.relation.ispartofELEMENTOS
dc.sourceUniversidad de Los Andes
dc.subjectElGamal encryption
dc.subjectHomomorphic encryption
dc.subjectPaillier cryptosystem
dc.subjectCryptosystem
dc.subjectComputer science
dc.subjectAnonymity
dc.subjectTheoretical computer science
dc.subjectDiscrete logarithm
dc.subjectPublic-key cryptography
dc.subjectScheme (mathematics)
dc.titleMultiplexing schemes for homomorphic cryptosystems
dc.typearticle

Files

Collections

Artículo Científico Publicado