主动秘密共享在点对点系统中执行吗?

N. Liebau, A. Mauthe, V. Darlagiannis, R. Steinmetz
{"title":"主动秘密共享在点对点系统中执行吗?","authors":"N. Liebau, A. Mauthe, V. Darlagiannis, R. Steinmetz","doi":"10.4230/OASIcs.KiVS.2011.239","DOIUrl":null,"url":null,"abstract":"Trustworthy applications in fully decentralized systems require a trust anchor. This paper describes how such an anchor can be implemented efficiently in p2p systems. The basic concept is to use threshold cryptography in order to sign messages by a quorum of peers. The focus is put on advanced mechanisms to secure the shares of the secret key over time, using proactive secret sharing. This mechanism was researched in context of the token-based accounting scheme.","PeriodicalId":175998,"journal":{"name":"Kommunikation in Verteilten Systemen","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?\",\"authors\":\"N. Liebau, A. Mauthe, V. Darlagiannis, R. Steinmetz\",\"doi\":\"10.4230/OASIcs.KiVS.2011.239\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Trustworthy applications in fully decentralized systems require a trust anchor. This paper describes how such an anchor can be implemented efficiently in p2p systems. The basic concept is to use threshold cryptography in order to sign messages by a quorum of peers. The focus is put on advanced mechanisms to secure the shares of the secret key over time, using proactive secret sharing. This mechanism was researched in context of the token-based accounting scheme.\",\"PeriodicalId\":175998,\"journal\":{\"name\":\"Kommunikation in Verteilten Systemen\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Kommunikation in Verteilten Systemen\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/OASIcs.KiVS.2011.239\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kommunikation in Verteilten Systemen","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/OASIcs.KiVS.2011.239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在完全去中心化的系统中,值得信赖的应用程序需要一个信任锚。本文描述了如何在p2p系统中有效地实现这种锚。其基本概念是使用阈值密码学,以便通过对等体的quorum对消息进行签名。重点放在高级机制上,使用主动的秘密共享,随着时间的推移确保秘密密钥的共享。该机制是在基于令牌的会计方案的背景下研究的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Does Proactive Secret Sharing Perform in Peer-to-Peer Systems?
Trustworthy applications in fully decentralized systems require a trust anchor. This paper describes how such an anchor can be implemented efficiently in p2p systems. The basic concept is to use threshold cryptography in order to sign messages by a quorum of peers. The focus is put on advanced mechanisms to secure the shares of the secret key over time, using proactive secret sharing. This mechanism was researched in context of the token-based accounting scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信