{"title":"RAMA:物联网中具有多个授权的健壮拍卖方案","authors":"Qian Meng, Zhuoyang Liang, Zhonghua Shen, Yong Liu, Yuying Liu, Jiamin Hu","doi":"10.1109/ISCIT55906.2022.9931197","DOIUrl":null,"url":null,"abstract":"With the vigorous development of the Internet of Things (IoT), technologies based on IoT have been widely used in various fields. Among them, the electronic auction technology based on the IoT has been applied. The traditional electronic auction scheme cannot be flexibly applied in IoT scenario and most auction schemes often have only one authority, which has a great burden on operation and low efficiency, resulting in a single-point performance bottleneck. In order to solve above problems, we use a hierarchical multiple authorities system to propose a Robust Auction scheme with Multiple Authorities in IoT (RAMA). Besides, a lightweight range query protocol which can get the highest bidder in electronic auction is adopted to avoid deploying expensive sensors and aggregators in the IoT configuration. Moreover, security of the hierarchical multiple authorities system have been proved through rigorous security analysis, which indicate that the adopted range query protocol not only ensures the security of encrypted bidding but also prevents it from being stolen by malicious adversaries. Finally, we conduct simulation experiments and analyze experimental results to verify the feasibility of the scheme. Specifically, when the number of bidders is 1000, the time-consuming to generate the secret key and the time-consuming to obtain the maximum bidding price are not exceed 0.5s in the simulation experiment.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RAMA: Robust Auction Scheme with Multiple Authorities in IoT\",\"authors\":\"Qian Meng, Zhuoyang Liang, Zhonghua Shen, Yong Liu, Yuying Liu, Jiamin Hu\",\"doi\":\"10.1109/ISCIT55906.2022.9931197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the vigorous development of the Internet of Things (IoT), technologies based on IoT have been widely used in various fields. Among them, the electronic auction technology based on the IoT has been applied. The traditional electronic auction scheme cannot be flexibly applied in IoT scenario and most auction schemes often have only one authority, which has a great burden on operation and low efficiency, resulting in a single-point performance bottleneck. In order to solve above problems, we use a hierarchical multiple authorities system to propose a Robust Auction scheme with Multiple Authorities in IoT (RAMA). Besides, a lightweight range query protocol which can get the highest bidder in electronic auction is adopted to avoid deploying expensive sensors and aggregators in the IoT configuration. Moreover, security of the hierarchical multiple authorities system have been proved through rigorous security analysis, which indicate that the adopted range query protocol not only ensures the security of encrypted bidding but also prevents it from being stolen by malicious adversaries. Finally, we conduct simulation experiments and analyze experimental results to verify the feasibility of the scheme. Specifically, when the number of bidders is 1000, the time-consuming to generate the secret key and the time-consuming to obtain the maximum bidding price are not exceed 0.5s in the simulation experiment.\",\"PeriodicalId\":325919,\"journal\":{\"name\":\"2022 21st International Symposium on Communications and Information Technologies (ISCIT)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 21st International Symposium on Communications and Information Technologies (ISCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT55906.2022.9931197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT55906.2022.9931197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
RAMA: Robust Auction Scheme with Multiple Authorities in IoT
With the vigorous development of the Internet of Things (IoT), technologies based on IoT have been widely used in various fields. Among them, the electronic auction technology based on the IoT has been applied. The traditional electronic auction scheme cannot be flexibly applied in IoT scenario and most auction schemes often have only one authority, which has a great burden on operation and low efficiency, resulting in a single-point performance bottleneck. In order to solve above problems, we use a hierarchical multiple authorities system to propose a Robust Auction scheme with Multiple Authorities in IoT (RAMA). Besides, a lightweight range query protocol which can get the highest bidder in electronic auction is adopted to avoid deploying expensive sensors and aggregators in the IoT configuration. Moreover, security of the hierarchical multiple authorities system have been proved through rigorous security analysis, which indicate that the adopted range query protocol not only ensures the security of encrypted bidding but also prevents it from being stolen by malicious adversaries. Finally, we conduct simulation experiments and analyze experimental results to verify the feasibility of the scheme. Specifically, when the number of bidders is 1000, the time-consuming to generate the secret key and the time-consuming to obtain the maximum bidding price are not exceed 0.5s in the simulation experiment.