{"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}
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.