CPK中具有任意长度消息恢复的签名方案

Che Yong-gang, Jia Chun-fu, Lv Shu-wang, Chen Hui-yan
{"title":"CPK中具有任意长度消息恢复的签名方案","authors":"Che Yong-gang, Jia Chun-fu, Lv Shu-wang, Chen Hui-yan","doi":"10.1109/MSN.2008.21","DOIUrl":null,"url":null,"abstract":"Digital signature with message recovery is regard as a useful method to shorten signature. This paper presents an identity-based signature scheme with message recovery, which applies to the Combined Public Key System. The scheme is provable secure against existential forgery against adaptively chosen message and ID attacks in the random oracle model under the elliptic curve discrete logarithm assumption. The proposed scheme can recover message with arbitrary length and shorten the total length of the original message and the appended signature compared with others. The proposed scheme is especially suitable for the computation and communication source constrained, such as Ad-hoc network.","PeriodicalId":135604,"journal":{"name":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Signature Scheme with Arbitrary Length Message Recovery in CPK\",\"authors\":\"Che Yong-gang, Jia Chun-fu, Lv Shu-wang, Chen Hui-yan\",\"doi\":\"10.1109/MSN.2008.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Digital signature with message recovery is regard as a useful method to shorten signature. This paper presents an identity-based signature scheme with message recovery, which applies to the Combined Public Key System. The scheme is provable secure against existential forgery against adaptively chosen message and ID attacks in the random oracle model under the elliptic curve discrete logarithm assumption. The proposed scheme can recover message with arbitrary length and shorten the total length of the original message and the appended signature compared with others. The proposed scheme is especially suitable for the computation and communication source constrained, such as Ad-hoc network.\",\"PeriodicalId\":135604,\"journal\":{\"name\":\"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MSN.2008.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The 4th International Conference on Mobile Ad-hoc and Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN.2008.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

带消息恢复的数字签名被认为是一种有效的缩短签名的方法。提出了一种基于身份的消息恢复签名方案,该方案适用于组合公钥系统。在椭圆曲线离散对数假设下,证明了该方案在随机oracle模型下对自适应选择消息和ID攻击的存在伪造安全性。该方案可以恢复任意长度的消息,并且与其他方案相比缩短了原始消息和附加签名的总长度。该方案特别适用于计算量和通信源受限的Ad-hoc网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Signature Scheme with Arbitrary Length Message Recovery in CPK
Digital signature with message recovery is regard as a useful method to shorten signature. This paper presents an identity-based signature scheme with message recovery, which applies to the Combined Public Key System. The scheme is provable secure against existential forgery against adaptively chosen message and ID attacks in the random oracle model under the elliptic curve discrete logarithm assumption. The proposed scheme can recover message with arbitrary length and shorten the total length of the original message and the appended signature compared with others. The proposed scheme is especially suitable for the computation and communication source constrained, such as Ad-hoc network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Topology Control for Throughput Optimization in Wireless Mesh Networks Routing Protocol Using Bloom Filters for Mobile Ad Hoc Networks A Distributed Lightweight Group Rekeying Scheme with Speedy Node Revocation for Wireless Sensor Networks LCO-MAC: A Low Latency, Low Control Overhead MAC Protocol for Wireless Sensor Networks An Indoor Sensor Network System for Pursuit-Evasion Games
×
引用
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