Publicaciones

Actas de congresos

Proof of a shuffle for lattice-based cryptography

Published in NordSec, 2017

In this paper we present the first proof of a shuffle for lattice-based cryptography which can be used to build a universally verifiable mix-net capable of mixing votes encrypted with a post-quantum algorithm, thus achieving long-term privacy.

Recommended citation: Costa N., Martínez R., Morillo P. (2017) Proof of a Shuffle for Lattice-Based Cryptography. In: Lipmaa H., Mitrokotsa A., Matulevičius R. (eds) Secure IT Systems. NordSec 2017. Lecture Notes in Computer Science, vol 10674. Springer, Cham http://doi.org/10.1007/978-3-319-70290-2_17


Bajo revisión

Lattice-based proof of a shuffle

Published in (en revisión), 0000

In this paper we present the first post-quantum proof of a shuffle based on the learning with errors over rings (RLWE) problem.


Trabajos de fin de grado y de máster

Protocolos para votaciones electrónicas

Published in UPCommons, 2017

Propuesta de protocolo para una prueba de conocimiento nulo para verificar el correcto funcionamiento de un nodo mixnet en un esquema de votación electrónica que utiliza un cifrado post-cuántico basado en retículos. Se describe las condiciones de seguridad que ha de tener la prueba y se desarrolla el protocolo.

Recommended citation: Martínez Pinilla, Ramiro (2017, enero). Protocolos para votaciones electrónicas. Directora: Morillo Bosch, Paz. TFM, UPC. http://hdl.handle.net/2117/100476

Fully post-quantum protocols for e-voting, coercion resistant cast as intended and mixing networks

Published in UPCommons, 2018

In this thesis we present a coercion resistant cast as intended proof and a proof of a shuffle, both completely based on lattice problems as Inhomogeneous Short Integer Solution (ISIS) and Ring Learning With Errors (RLWE)

Recommended citation: Martínez Pinilla, Ramiro (2018, enero). Fully post-quantum protocols for e-voting. Directora: Morillo Bosch, Paz. TFM, UPC. http://hdl.handle.net/2117/113449


Otros