Return Codes from Lattice Assumptions

dc.contributor.authorHøgasen, Audhild
dc.contributor.authorSilde, Tjerand
dc.date.accessioned2022-09-29T07:29:14Z
dc.date.available2022-09-29T07:29:14Z
dc.date.issued2022
dc.description.abstractWe present an approach for creating return codes for latticebased electronic voting. For a voting system with four control components and two rounds of communication our scheme results in a total of 2.3MB of communication per voter, taking less than 1 s of computation. Together with the shuffle and the decryption protocols by Aranha et al. [1,2], the return codes presented can be used to build a post-quantum secure cryptographic voting scheme.et
dc.identifier.urihttp://hdl.handle.net/10062/84323
dc.identifier.urihttps://doi.org/10.15157/diss/025
dc.language.isoenget
dc.relationinfo:eu-repo/grantAgreement/EC/H2020/857622///ECePSet
dc.rightsinfo:eu-repo/semantics/openAccesset
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectLattice Cryptographyet
dc.subjectElectronic Votinget
dc.subjectReturn Codeset
dc.subjectkontrollkoodidet
dc.subjectelektrooniline hääletamineet
dc.titleReturn Codes from Lattice Assumptionset
dc.typeinfo:eu-repo/semantics/articleet

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
12.pdf
Size:
305.87 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: