Applications of Polynomial Properties to Verifiable Delegation of Computation and Electronic Voting

Marc Obrador; Paz Morillo; Sandra Guasch

Paper 2012/726

Applications of Polynomial Properties to Verifiable Delegation of Computation and Electronic Voting

Marc Obrador, Paz Morillo, and Sandra Guasch

Abstract

This paper presents some proposals of protocols for two types of schemes such as verifiable delegation of computation and remote electronic voting, based on polynomial properties. Our protocols for verifiable delegation of computation are aimed to the efficient evaluation of polynomials, working on schemes where the polynomial and/or the input are kept secret to the server. Our proposal for remote electronic voting allows the verification of vote well-formation upon reception at the voting server, with little overhead of computations for the voter.

Note: Minor corrections for broken references.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Unknown where it was published
Keywords: delegation of computation verifiable electronic voting
Contact author(s): sandra guasch @ scytl com
History: 2012-12-30: revised; 2012-12-28: received; See all versions
Short URL: https://ia.cr/2012/726
License: CC BY

BibTeX

@misc{cryptoeprint:2012/726,
      author = {Marc Obrador and Paz Morillo and Sandra Guasch},
      title = {Applications of Polynomial Properties to Verifiable Delegation of Computation and Electronic Voting},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/726},
      year = {2012},
      url = {https://eprint.iacr.org/2012/726}
}