Show simple item record

dc.contributor.authorCosta, Nuria
dc.contributor.authorMartínez Pinilla, Ramiro
dc.contributor.authorMorillo Bosch, M. Paz
dc.contributor.otherUniversitat Politècnica de Catalunya. Doctorat en Matemàtica Aplicada
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2020-03-17T11:23:45Z
dc.date.available2020-03-17T11:23:45Z
dc.date.issued2019
dc.identifier.citationCosta, 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.isbn978-3-030-43724-4
dc.identifier.otherhttps://eprint.iacr.org/2019/357.pdf
dc.identifier.urihttp://hdl.handle.net/2117/180187
dc.description.abstractIn 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.extent17 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://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.lcshCryptography
dc.subject.lcshAlgorithms
dc.subject.otherMix-nets
dc.subject.otherE-voting
dc.subject.otherPost-quantum
dc.subject.otherRLWE encryption
dc.subject.otherRLWE commitment
dc.subject.otherProof of a shuffle
dc.titleLattice-Based proof of a shuffle
dc.typeConference report
dc.subject.lemacCriptografia
dc.subject.lemacAlgorismes
dc.contributor.groupUniversitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
dc.identifier.doi10.1007/978-3-030-43725-1_23
dc.identifier.dlInternational Financial Cryptography Association 2020
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
local.identifier.drac27576293
dc.description.versionPostprint (author's final draft)
local.citation.authorCosta, N.; Martinez, R.; Morillo, M.
local.citation.contributorFinancial Cryptography and Data Security
local.citation.publicationNameFC 2019 International Workshops, VOTING and WTSC, St. Kitts, St. Kitts and Nevis, February 18–22, 2019, Revised Selected Papers
local.citation.startingPage330
local.citation.endingPage346


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain