English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Vote-buying and voter-coercion are the impending threats when deployingremote online voting into large scale elections. With a policy of carrot andstick, it will encourage voters to deviate from honest voting strategy andspoil the democratic election. To deal with this problem, many voting protocolsproposed their solutions with the notion of receipt-freeness. However, existingreceipt-free voting protocols either rely on some impractical assumptions asuntappable communication channel, or are burden with heavy voter-sidecomputation and quadratic tallying complexity. In this paper, we present$Laoco\ddot{o}n$, a brand new cryptographic voting protocol which is practicaland light-weight to be deployed in large scale online elections. By takingadvantage of proxy re-encryption, our protocol can defend vote-buying attacks.Furthermore, we introduce a new property, candidate-adaptiveness, in electronicvoting which refers to as every candidate knows the real-time vote numbertowards himself, while he knows nothing about others, nor he buys votes. Weprove the correctness of our protocol and evaluate the performance withexperimental results. Finally we advance some open problems which will be copedin our future work.

$Laoco\ddot{o}n$: Scalable and Portable Receipt-free E-voting Protocol without Untappable Channels