Multiplexing schemes for homomorphic cryptosystems

dc.creator	Corena, Juan Camilo
dc.creator	Posada, Jaime Andrés
dc.date	2013-05-27
dc.date.accessioned	2022-03-24T17:51:53Z
dc.date.available	2022-03-24T17:51:53Z
dc.identifier	https://journal.poligran.edu.co/index.php/elementos/article/view/189
dc.identifier	10.15765/e.v1i1.189
dc.identifier.uri	http://hdl.handle.net/10823/6227
dc.description	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 modiﬁcation 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.	es-ES
dc.format	application/pdf
dc.language	spa
dc.publisher	Politécnico Grancolombiano	es-ES
dc.relation	https://journal.poligran.edu.co/index.php/elementos/article/view/189/170
dc.source	ELEMENTOS; Vol. 1 No. 1 (2011): Elementos	en-US
dc.source	Elementos; Vol. 1 Núm. 1 (2011): Elementos	es-ES
dc.source	2248-5252
dc.source	2027-923X
dc.source	10.15765/e.v1i1
dc.title	Multiplexing schemes for homomorphic cryptosystems	es-ES
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	Artículo revisado por pares	es-ES

Ficheros en el ítem

Ficheros	Tamaño	Formato	Ver
No hay ficheros asociados a este ítem.