Splitting and Aggregating Signatures in Cryptocurrency Protocols

S. S. D. Selvi, Arinjita Paul, C. Rangan, S. Dirisala, Saswata Basu
{"title":"Splitting and Aggregating Signatures in Cryptocurrency Protocols","authors":"S. S. D. Selvi, Arinjita Paul, C. Rangan, S. Dirisala, Saswata Basu","doi":"10.1109/DAPPCON.2019.00021","DOIUrl":null,"url":null,"abstract":"The blockchain technology and a vast amount of cryptocurrency related activities have generated an unprecedented level of interest among the public. However, even at the entry level, cryptocurrency users need to deal with the complex task of key management. In this paper, we propose a simple way to manage a user's private key, under a reasonable assumption that the user has two devices at his disposal (say a laptop and a mobile phone). We refer to our strategy as key splitting. Since these cryptographic keys are used for generating digital signatures, we should take a closer look at the signature schemes that would perform best under key splitting. At the operational level, scalability is one of the main challenges faced by the users and developers. While there are fundamental issues like consensus that challenge scalability, we focus on the computational efficiency in a block formation. Aggregation of signatures is one of the effective solutions to this problem. To this end, we observe that none of the existing signature schemes work well for BOTH key splitting and aggregation. The current popular schemes such as the ones used in Bitcoin or Schnorr's scheme implemented over Elliptic curves are neither suitable for aggregation nor can their keys be split in a convenient and meaningful way. A detailed theoretical and empirical analysis shows that the BLS short signature scheme is best suited for achieving both key splitting and aggregation.","PeriodicalId":434018,"journal":{"name":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAPPCON.2019.00021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The blockchain technology and a vast amount of cryptocurrency related activities have generated an unprecedented level of interest among the public. However, even at the entry level, cryptocurrency users need to deal with the complex task of key management. In this paper, we propose a simple way to manage a user's private key, under a reasonable assumption that the user has two devices at his disposal (say a laptop and a mobile phone). We refer to our strategy as key splitting. Since these cryptographic keys are used for generating digital signatures, we should take a closer look at the signature schemes that would perform best under key splitting. At the operational level, scalability is one of the main challenges faced by the users and developers. While there are fundamental issues like consensus that challenge scalability, we focus on the computational efficiency in a block formation. Aggregation of signatures is one of the effective solutions to this problem. To this end, we observe that none of the existing signature schemes work well for BOTH key splitting and aggregation. The current popular schemes such as the ones used in Bitcoin or Schnorr's scheme implemented over Elliptic curves are neither suitable for aggregation nor can their keys be split in a convenient and meaningful way. A detailed theoretical and empirical analysis shows that the BLS short signature scheme is best suited for achieving both key splitting and aggregation.
加密货币协议中签名的拆分和聚合
区块链技术和大量与加密货币相关的活动在公众中引起了前所未有的兴趣。然而,即使在入门级,加密货币用户也需要处理复杂的密钥管理任务。在本文中,我们提出了一种简单的方法来管理用户的私钥,在一个合理的假设下,用户有两个设备可供使用(例如笔记本电脑和移动电话)。我们把我们的策略称为键拆分。由于这些加密密钥用于生成数字签名,因此我们应该仔细研究在密钥分割下性能最好的签名方案。在操作层面,可伸缩性是用户和开发人员面临的主要挑战之一。虽然存在共识等挑战可扩展性的基本问题,但我们关注的是区块形成中的计算效率。签名聚合是解决这一问题的有效方法之一。为此,我们观察到没有一个现有的签名方案能够同时适用于密钥分割和聚合。目前流行的方案,如比特币中使用的方案或在椭圆曲线上实现的Schnorr方案,既不适合聚合,也不能以方便和有意义的方式分割密钥。详细的理论和实证分析表明,BLS短签名方案最适合实现密钥分割和聚合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信