Mostra el registre d'ítem simple

dc.contributorMorillo Bosch, M. Paz
dc.contributor.authorMartínez Pinilla, Ramiro
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2018-01-31T12:26:31Z
dc.date.available2018-01-31T12:26:31Z
dc.date.issued2018-01
dc.identifier.urihttp://hdl.handle.net/2117/113449
dc.description.abstractIn an electronic election several cryptographic proofs are implemented to guarantee that all the process has been fair. Many cryptographic primitives are based on the hardness of the discrete logarithm, factorization and other related problems. However, these problems are efficiently computable with a quantum computer, and new proofs are needed based on different assumptions not broken by quantum computers. Lattice based cryptography seems one of the most promising post-quantum alternatives. 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). With the first we prove to the voter that his vote correctly encodes his voting option, without allowing him to prove to a third party that he has chosen a specific option, to avoid the possibility of vote selling. Shuffles are permutations and re-encryptions of casted votes performed by mixing network nodes (mix- net nodes), so that the output can not be related with the input and nobody can link a decrypted vote with the voter who casted it. Given that the goal is to make the output not linkable to the input it is essential to provide a proof of it being a correct shuffle that has preserved the integrity of the votes, without deleting, adding of modifying any of them. To prove both things we have constructed non interactive zero-knowledge proofs, from which anyone can be convinced that a statement is true (with overwhelming probability over a security parameter) with- out revealing any information about the elements that witness it being true.
dc.language.isoeng
dc.publisherUniversitat Politècnica de Catalunya
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Seguretat informàtica
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshAlgorithms
dc.subject.otherCryptographic protocols
dc.subject.otherE-voting
dc.subject.otherPost-quantum cryptographic protocol
dc.subject.otherRLWE encryption
dc.subject.otherCoercion resis- tant cast as intended
dc.subject.otherProof of a shuffle
dc.subject.otherMix-nets
dc.titleFully post-quantum protocols for e-voting, coercion resistant cast as intended and mixing networks
dc.typeMaster thesis
dc.subject.lemacAlgorismes
dc.subject.amsClassificació AMS::68 Computer science::68W Algorithms
dc.identifier.slugFME-1581
dc.rights.accessOpen Access
dc.date.updated2018-01-27T08:48:10Z
dc.audience.educationlevelMàster
dc.audience.mediatorUniversitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple

Llevat que s'hi indiqui el contrari, els continguts d'aquesta obra estan subjectes a la llicència de Creative Commons: Reconeixement-NoComercial-CompartirIgual 3.0 Espanya