Can a Public Blockchain Keep a Secret?

块链 计算机科学 可扩展性 计算机安全 对手 秘密分享 混淆 数字加密货币 安全多方计算 服务(商务) 密码学 数据库 经济 经济
作者
Fabrice Benhamouda,Craig Gentry,S. Gorbunov,Shai Halevi,Hugo Krawczyk,Chenglong Fu,Tal Rabin,Leonid Reyzin
出处
期刊:Lecture Notes in Computer Science [Springer Science+Business Media]
卷期号:: 260-290 被引量:39
标识
DOI:10.1007/978-3-030-64375-1_10
摘要

Blockchains are gaining traction and acceptance, not just for cryptocurrencies, but increasingly as an architecture for distributed computing. In this work we seek solutions that allow a public blockchain to act as a trusted long-term repository of secret information: Our goal is to deposit a secret with the blockchain, specify how it is to be used (e.g., the conditions under which it is released), and have the blockchain keep the secret and use it only in the specified manner (e.g., release only it once the conditions are met). This simple functionality enables many powerful applications, including signing statements on behalf of the blockchain, using it as the control plane for a storage system, performing decentralized program-obfuscation-as-a-service, and many more. Using proactive secret sharing techniques, we present a scalable solution for implementing this functionality on a public blockchain, in the presence of a mobile adversary controlling a small minority of the participants. The main challenge is that, on the one hand, scalability requires that we use small committees to represent the entire system, but, on the other hand, a mobile adversary may be able to corrupt the entire committee if it is small. For this reason, existing proactive secret sharing solutions are either non-scalable or insecure in our setting. We approach this challenge via “player replaceability”, which ensures the committee is anonymous until after it performs its actions. Our main technical contribution is a system that allows sharing and re-sharing of secrets among the members of small dynamic committees, without knowing who they are until after they perform their actions and erase their secrets. Our solution handles a fully mobile adversary corrupting roughly 1/4 of the participants at any time, and is scalable in terms of both the number of parties and the number of time intervals.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
小懒完成签到,获得积分10
刚刚
蒲公英发布了新的文献求助10
2秒前
2秒前
大喜发布了新的文献求助10
2秒前
3秒前
欢呼墨镜完成签到,获得积分10
3秒前
4秒前
5秒前
张泽龄完成签到 ,获得积分10
7秒前
7秒前
7秒前
9秒前
9秒前
berg完成签到,获得积分10
9秒前
9秒前
领导范儿应助drsong采纳,获得30
11秒前
11秒前
Lucas应助linman采纳,获得10
11秒前
12秒前
科研通AI6.2应助zhan采纳,获得10
13秒前
13秒前
Peggy完成签到,获得积分10
13秒前
jiang发布了新的文献求助10
13秒前
橘猫123456完成签到,获得积分10
14秒前
pluto应助sirhai采纳,获得50
15秒前
稳重的灯泡完成签到,获得积分10
16秒前
jianning完成签到,获得积分10
16秒前
DAY1应助Juni采纳,获得10
16秒前
充电宝应助Juni采纳,获得10
16秒前
神山识发布了新的文献求助100
16秒前
ZangXy发布了新的文献求助10
16秒前
司月五发布了新的文献求助10
17秒前
Owen应助qwer采纳,获得10
19秒前
20秒前
FashionBoy应助linman采纳,获得10
21秒前
21秒前
神山识完成签到,获得积分10
23秒前
24秒前
25秒前
华仔应助橘猫123456采纳,获得10
25秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Matrix Methods in Data Mining and Pattern Recognition 510
Reading and Understanding Health Research 500
Social Skills Improvement System-Rating Scales--Chinese Version 500
Dynamische Polarisation von H-1 und B-11 in (CH-3)-3NBH-3 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7251181
求助须知:如何正确求助?哪些是违规求助? 8873848
关于积分的说明 18729391
捐赠科研通 6930937
什么是DOI,文献DOI怎么找? 3199294
关于科研通互助平台的介绍 2374305
邀请新用户注册赠送积分活动 2173983