基于RSA累加器的群通信加密方法研究

Yasuo Hatano, K. Miyazaki, T. Kaneko
{"title":"基于RSA累加器的群通信加密方法研究","authors":"Yasuo Hatano, K. Miyazaki, T. Kaneko","doi":"10.1109/ISCIT.2007.4392244","DOIUrl":null,"url":null,"abstract":"This paper proposes an efficient encryption method for a group communication in which parts of a ciphertext are decrypted selectively by a recipient's private key. Sensitive information, e.g., personal information, in a message is browsed by several users should be disclosed only to authorized users even if any user can read the other parts of the message. The simplest way to do this is by encrypting a message for each recipient independently. This simple approach, however, is not efficient because the increase of the ciphertext size depends on the number of recipients. The proposed method uses an RSA accumulator to calculate shared keys and uses a randomness re-using encryption scheme (RR-MRES) to encrypt a message. Thanks to the quasi-commutativity of RSA accumulators, and the efficiency of RR-MRESs, the proposed method reduces the ciphertext size needed for selective disclosure.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A study on encryption method in group communication using RSA accumulator\",\"authors\":\"Yasuo Hatano, K. Miyazaki, T. Kaneko\",\"doi\":\"10.1109/ISCIT.2007.4392244\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an efficient encryption method for a group communication in which parts of a ciphertext are decrypted selectively by a recipient's private key. Sensitive information, e.g., personal information, in a message is browsed by several users should be disclosed only to authorized users even if any user can read the other parts of the message. The simplest way to do this is by encrypting a message for each recipient independently. This simple approach, however, is not efficient because the increase of the ciphertext size depends on the number of recipients. The proposed method uses an RSA accumulator to calculate shared keys and uses a randomness re-using encryption scheme (RR-MRES) to encrypt a message. Thanks to the quasi-commutativity of RSA accumulators, and the efficiency of RR-MRESs, the proposed method reduces the ciphertext size needed for selective disclosure.\",\"PeriodicalId\":331439,\"journal\":{\"name\":\"2007 International Symposium on Communications and Information Technologies\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Communications and Information Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2007.4392244\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Communications and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2007.4392244","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种有效的组通信加密方法,该方法使用接收方的私钥选择性地解密部分密文。如果消息中的敏感信息(例如个人信息)由多个用户浏览,则即使任何用户都可以阅读消息的其他部分,也应仅向授权用户披露。最简单的方法是为每个收件人单独加密消息。然而,这种简单的方法效率不高,因为密文大小的增加取决于接收方的数量。该方法使用RSA累加器计算共享密钥,并使用随机重用加密方案(RR-MRES)对消息进行加密。由于RSA累加器的准交换性和RR-MRESs的效率,该方法减少了选择性披露所需的密文大小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A study on encryption method in group communication using RSA accumulator
This paper proposes an efficient encryption method for a group communication in which parts of a ciphertext are decrypted selectively by a recipient's private key. Sensitive information, e.g., personal information, in a message is browsed by several users should be disclosed only to authorized users even if any user can read the other parts of the message. The simplest way to do this is by encrypting a message for each recipient independently. This simple approach, however, is not efficient because the increase of the ciphertext size depends on the number of recipients. The proposed method uses an RSA accumulator to calculate shared keys and uses a randomness re-using encryption scheme (RR-MRES) to encrypt a message. Thanks to the quasi-commutativity of RSA accumulators, and the efficiency of RR-MRESs, the proposed method reduces the ciphertext size needed for selective disclosure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信