Mostra el registre d'ítem simple
Lattice-Based proof of a shuffle
dc.contributor.author | Costa, Nuria |
dc.contributor.author | Martínez Pinilla, Ramiro |
dc.contributor.author | Morillo Bosch, M. Paz |
dc.contributor.other | Universitat Politècnica de Catalunya. Doctorat en Matemàtica Aplicada |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2020-03-17T11:23:45Z |
dc.date.available | 2020-03-17T11:23:45Z |
dc.date.issued | 2019 |
dc.identifier.citation | Costa, N.; Martinez, R.; Morillo, M. Lattice-Based proof of a shuffle. A: Financial Cryptography and Data Security. "FC 2019 International Workshops, VOTING and WTSC, St. Kitts, St. Kitts and Nevis, February 18–22, 2019, Revised Selected Papers". 2019, p. 330-346. |
dc.identifier.isbn | 978-3-030-43724-4 |
dc.identifier.other | https://eprint.iacr.org/2019/357.pdf |
dc.identifier.uri | http://hdl.handle.net/2117/180187 |
dc.description.abstract | In this paper we present the first fully post-quantum proof of a shuffle for RLWE encryption schemes. Shuffles are commonly used to construct mixing networks (mix-nets), a key element to ensure anonymity in many applications such as electronic voting systems. They should preserve anonymity even against an attack using quantum computers in order to guarantee long-term privacy. The proof presented in this paper is built over RLWE commitments which are perfectly binding and computationally hiding under the RLWE assumption, thus achieving security in a post-quantum scenario. Furthermore we provide a new definition for a secure mixing node (mix-node) and prove that our construction satisfies this definition. |
dc.format.extent | 17 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra |
dc.subject.lcsh | Cryptography |
dc.subject.lcsh | Algorithms |
dc.subject.other | Mix-nets |
dc.subject.other | E-voting |
dc.subject.other | Post-quantum |
dc.subject.other | RLWE encryption |
dc.subject.other | RLWE commitment |
dc.subject.other | Proof of a shuffle |
dc.title | Lattice-Based proof of a shuffle |
dc.type | Conference report |
dc.subject.lemac | Criptografia |
dc.subject.lemac | Algorismes |
dc.contributor.group | Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia |
dc.identifier.doi | 10.1007/978-3-030-43725-1_23 |
dc.identifier.dl | International Financial Cryptography Association 2020 |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Open Access |
local.identifier.drac | 27576293 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Costa, N.; Martinez, R.; Morillo, M. |
local.citation.contributor | Financial Cryptography and Data Security |
local.citation.publicationName | FC 2019 International Workshops, VOTING and WTSC, St. Kitts, St. Kitts and Nevis, February 18–22, 2019, Revised Selected Papers |
local.citation.startingPage | 330 |
local.citation.endingPage | 346 |