Key-escrow free multi-signature scheme using bilinear pairings

IF 0.1 Q4 MATHEMATICS Groups Complexity Cryptology Pub Date : 2015-01-01 DOI:10.1515/gcc-2015-0002
M. Das
{"title":"Key-escrow free multi-signature scheme using bilinear pairings","authors":"M. Das","doi":"10.1515/gcc-2015-0002","DOIUrl":null,"url":null,"abstract":"Abstract We present a multi-signature scheme based on bilinear pairings. The scheme is key escrow-free and does not require any secure channel for private key issuance to users. We use a binding-blinding technique to avoid the key escrow problem and to eliminate a secure channel requirement for the key issuance stage. The basic scheme is extended to sequential and parallel multi-signature schemes. We show that the basic scheme and multi-signature schemes are secure against adaptive chosen message attacks under standard assumptions.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"16 1","pages":"47 - 57"},"PeriodicalIF":0.1000,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2015-0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 3

Abstract

Abstract We present a multi-signature scheme based on bilinear pairings. The scheme is key escrow-free and does not require any secure channel for private key issuance to users. We use a binding-blinding technique to avoid the key escrow problem and to eliminate a secure channel requirement for the key issuance stage. The basic scheme is extended to sequential and parallel multi-signature schemes. We show that the basic scheme and multi-signature schemes are secure against adaptive chosen message attacks under standard assumptions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用双线性对的免密钥托管多重签名方案
摘要提出了一种基于双线性对的多重签名方案。该方案不需要密钥托管,也不需要任何安全通道来向用户发放私钥。我们使用绑定-盲技术来避免密钥托管问题,并消除密钥发布阶段的安全通道要求。将基本方案扩展到顺序和并行多重签名方案。我们证明了在标准假设下,基本方案和多重签名方案对自适应选择消息攻击是安全的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.10
自引率
0.00%
发文量
0
期刊最新文献
Amenability problem for Thompson's group $F$: state of the art Bounding conjugacy depth functions for wreath products of finitely generated abelian groups An axiomatization for the universal theory of the Heisenberg group Geodesic Growth of Numbered Graph Products The Axiomatics of Free Group Rings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1