Verifiable secret sharing and achieving simultaneity in the presence of faults

B. Chor, S. Goldwasser, S. Micali, B. Awerbuch
{"title":"Verifiable secret sharing and achieving simultaneity in the presence of faults","authors":"B. Chor, S. Goldwasser, S. Micali, B. Awerbuch","doi":"10.1109/SFCS.1985.64","DOIUrl":null,"url":null,"abstract":"Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only sufficiently many pieces. 'rhe novelty is that everyone can verify that all received a \"valid\" piece of the secret without having any idea of what the secret is. One application of this tool is the simulation of simultaneous-broadcast networks on semi-synchronous broadcast networks.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"907","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1985.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 907

Abstract

Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only sufficiently many pieces. 'rhe novelty is that everyone can verify that all received a "valid" piece of the secret without having any idea of what the secret is. One application of this tool is the simulation of simultaneous-broadcast networks on semi-synchronous broadcast networks.
可验证的秘密共享和在存在错误的情况下实现同时性
可验证的秘密共享是一种加密协议,它允许一个人将一个秘密分成11个片段,并将它们公开分发给11个人,这样这个秘密就可以在足够多的片段的情况下重建。新颖之处在于,每个人都可以在不知道秘密是什么的情况下验证自己收到了“有效”的秘密。该工具的一个应用是在半同步广播网络上模拟同步广播网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信