Return Codes from Lattice Assumptions

dc.contributor.author	Høgasen, Audhild
dc.contributor.author	Silde, Tjerand
dc.date.accessioned	2022-09-29T07:29:14Z
dc.date.available	2022-09-29T07:29:14Z
dc.date.issued	2022
dc.identifier.uri	http://hdl.handle.net/10062/84323
dc.identifier.uri	https://doi.org/10.15157/diss/025
dc.description.abstract	We 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.language.iso	eng	et
dc.relation	info:eu-repo/grantAgreement/EC/H2020/857622///ECePS	et
dc.rights	info:eu-repo/semantics/openAccess	et
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 International	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.subject	Lattice Cryptography	et
dc.subject	Electronic Voting	et
dc.subject	Return Codes	et
dc.subject	kontrollkoodid	et
dc.subject	elektrooniline hääletamine	et
dc.title	Return Codes from Lattice Assumptions	et
dc.type	info:eu-repo/semantics/article	et

Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess