Reputable List Curation from Decentralized Voting

Author:

Crites Elizabeth C.1,Maller Mary2,Meiklejohn Sarah3,Mercer Rebekah4

Affiliation:

1. University College London

2. Ethereum Foundation

3. University College London and IC3

4. O(1) Labs

Abstract

Abstract Token-curated registries (TCRs) are a mechanism by which a set of users are able to jointly curate a reputable list about real-world information. Entries in the registry may have any form, so this primitive has been proposed for use—and deployed—in a variety of decentralized applications, ranging from the simple joint creation of lists to helping to prevent the spread of misinformation online. Despite this interest, the security of this primitive is not well understood, and indeed existing constructions do not achieve strong or provable notions of security or privacy. In this paper, we provide a formal cryptographic treatment of TCRs as well as a construction that provably hides the votes cast by individual curators. Along the way, we provide a model and proof of security for an underlying voting scheme, which may be of independent interest. We also demonstrate, via an implementation and evaluation, that our construction is practical enough to be deployed even on a constrained decentralized platform like Ethereum.

Publisher

Walter de Gruyter GmbH

Subject

General Medicine

Reference24 articles.

1. [1] B. Adida. Helios: Web-based open-audit voting. In P. C. van Oorschot, editor, USENIX Security 2008, pages 335–348, San Jose, CA, USA, July 28 – Aug. 1, 2008. USENIX Association.

2. [2] A. Asgaonkar and B. Krishnamachari. Token curated registries - a game theoretic approach, 2018. https://arxiv.org/pdf/1809.01756.pdf.

3. [3] F. Bao, R. H. Deng, and H. Zhu. Variations of Diffie-Hellman problem. In S. Qing, D. Gollmann, and J. Zhou, editors, ICICS 03, volume 2836 of LNCS, pages 301–312, Huhehaote, China, Oct. 10–13, 2003. Springer, Heidelberg, Germany.

4. [4] M. Bellare and P. Rogaway. The security of triple encryption and a framework for code-based game-playing proofs. In S. Vaudenay, editor, EUROCRYPT 2006, volume 4004 of LNCS, pages 409–426, St. Petersburg, Russia, May 28 – June 1, 2006. Springer, Heidelberg, Germany.

5. [5] J. D. C. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987.

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. vPass: Publicly Verifiable Fair Exchange Protocol for Vehicle Passports;2023 IEEE International Conference on Blockchain and Cryptocurrency (ICBC);2023-05-01

2. Enhancing Cryptocurrency Blocklisting: A Secure, Trustless, and Effective Realization;2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS);2022-07

3. Reputable List Curation from Decentralized Voting;Proceedings on Privacy Enhancing Technologies;2020-08-17

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3