非交互不可否认签名加密的通用结构

Jia Fan, Lijun Zhang
{"title":"非交互不可否认签名加密的通用结构","authors":"Jia Fan, Lijun Zhang","doi":"10.1109/CSMA.2015.10","DOIUrl":null,"url":null,"abstract":"Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic \"Sign-then-Encrypt\" and \"Encrypt-then-Sign\" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.","PeriodicalId":205396,"journal":{"name":"2015 International Conference on Computer Science and Mechanical Automation (CSMA)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generic Constructions for Signcryption with Non-interactive Non-repudiation\",\"authors\":\"Jia Fan, Lijun Zhang\",\"doi\":\"10.1109/CSMA.2015.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic \\\"Sign-then-Encrypt\\\" and \\\"Encrypt-then-Sign\\\" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.\",\"PeriodicalId\":205396,\"journal\":{\"name\":\"2015 International Conference on Computer Science and Mechanical Automation (CSMA)\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Computer Science and Mechanical Automation (CSMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSMA.2015.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computer Science and Mechanical Automation (CSMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSMA.2015.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

非互动性不可否认性是签名加密的一个非常重要的特性,它使接收方可以在法官的帮助下解决不可否认争议,而无需与法官进行昂贵的多轮交互通信。本文利用普通的数字签名原语和非交互开放的公钥加密原语,构造了非交互不可否认签名加密的通用“先签名后加密”和“先加密后签名”组合。然后我们分析这两种组合的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Generic Constructions for Signcryption with Non-interactive Non-repudiation
Non-interactive non-repudiation is a very important property of signcryption which enables a receiver to settle a repudiation dispute with the help of a judge without the need to engage in costly multi-round interactive communications with the judge. In this paper, we construct the generic "Sign-then-Encrypt" and "Encrypt-then-Sign" compositions for signcryption with non-interactive non-repudiation by making use of a normal digital signature primitive as well as a primitive called public key encryption with non-interactive opening. We then analyze the security of both types of compositions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信