Evolving Ramp Secret-Sharing Schemes

秘密分享 计算机科学 安全多方计算 集合(抽象数据类型) 计算机安全 理论计算机科学 密码学 程序设计语言
作者
Amos Beimel,Hussien Othman
出处
期刊:Lecture Notes in Computer Science 卷期号:: 313-332 被引量:13
标识
DOI:10.1007/978-3-319-98113-0_17
摘要

Evolving secret-sharing schemes, introduced by Komargodski, Naor, and Yogev (TCC 2016b), are secret-sharing schemes in which the dealer does not know the number of parties that will participate. The parties arrive one by one and when a party arrives the dealer gives it a share; the dealer cannot update this share when other parties arrive. Komargodski and Paskin-Cherniavsky (TCC 2017) constructed evolving $$a\cdot i$$ -threshold secret-sharing schemes (for every $$0< a <1$$ ), where any set of parties whose maximum party is the i-th party and contains at least ai parties can reconstruct the secret; any set such that all its prefixes are not an a-fraction of the parties should not get any information on the secret. The length of the share of the i-th party in their scheme is $$O(i^4 \log i)$$ . As the number of parties is unbounded, this share size can be quite large. In this work we suggest studying a relaxation of evolving threshold secret-sharing schemes; we consider evolving (a, b)-ramp secret-sharing schemes for $$0< b< a <1$$ . Again, we require that any set of parties whose maximum party is the i-th party and contains at least ai parties can reconstruct the secret; however, we only require that any set such that all its prefixes are not a b-fraction of the parties should not get any information on the secret. For all constants $$0< b< a <1$$ , we construct an evolving (a, b)-ramp secret-sharing scheme where the length of the share of the i-th party is O(1). Thus, we show that evolving ramp secret-sharing schemes offer a big improvement compared to the known constructions of evolving $$a\cdot i$$ -threshold secret-sharing schemes.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
超级的西装完成签到 ,获得积分20
刚刚
ycyang发布了新的文献求助30
刚刚
SYLH应助飞云采纳,获得10
刚刚
1秒前
面包发布了新的文献求助10
1秒前
haonanchen发布了新的文献求助10
2秒前
3秒前
3秒前
PSA发布了新的文献求助30
3秒前
脑洞疼应助小许采纳,获得10
4秒前
优美谷兰发布了新的文献求助20
5秒前
卡卡西应助seayoa采纳,获得20
5秒前
6秒前
纤维素完成签到,获得积分10
6秒前
大方不可完成签到 ,获得积分10
6秒前
ycyang完成签到,获得积分10
7秒前
SciGPT应助面包采纳,获得30
7秒前
7秒前
qingfeng完成签到,获得积分10
8秒前
哈伊呀完成签到,获得积分10
9秒前
9秒前
个性襄发布了新的文献求助10
10秒前
初染完成签到,获得积分10
10秒前
11秒前
11秒前
12秒前
Lucas应助动如脱兔采纳,获得10
13秒前
数学情缘发布了新的文献求助10
13秒前
Glorious完成签到,获得积分10
13秒前
13秒前
夏侯夏侯完成签到 ,获得积分10
13秒前
打打应助zz采纳,获得10
14秒前
拼搏亦松发布了新的文献求助10
14秒前
量子星尘发布了新的文献求助10
14秒前
如如要动完成签到,获得积分10
15秒前
卡卡西应助星宇采纳,获得50
16秒前
贪玩飞机发布了新的文献求助10
16秒前
太阳完成签到,获得积分10
16秒前
脑洞疼应助Li采纳,获得10
17秒前
hutian完成签到,获得积分10
17秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
Cognitive Neuroscience: The Biology of the Mind 1000
Technical Brochure TB 814: LPIT applications in HV gas insulated switchgear 1000
Toward a Combinatorial Approach for the Prediction of IgG Half-Life and Clearance 500
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Picture Books with Same-sex Parented Families: Unintentional Censorship 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3970120
求助须知:如何正确求助?哪些是违规求助? 3514810
关于积分的说明 11176124
捐赠科研通 3250136
什么是DOI,文献DOI怎么找? 1795198
邀请新用户注册赠送积分活动 875647
科研通“疑难数据库(出版商)”最低求助积分说明 804964