{"title":"基于盲中介的同态加密分布式电子投票系统","authors":"L. Babenko, I. Pisarev","doi":"10.1145/3264437.3264473","DOIUrl":null,"url":null,"abstract":"The development of electronic voting systems is an important direction of work due to the ubiquitous transfer of all spheres of human activity to the information technology environment. Electronic voting in comparison with traditional methods of voting has a lower cost, more reliable and convenient in the context of the modern world. We present a distributed electronic voting system that uses an intermediary site to verify the correctness of components, which does not process any information about votes and user authentication data, as well as using the principle of blind intermediaries to ensure user authentication while maintaining their anonymity. In addition, we use the principle of homomorphic encryption and the threshold scheme for sharing the secret at the most important stage - the counting of votes. The groups of people participating in voting are characterized by a degree of confidence in them. The architecture of the service is described by the components that interact in it. We describe the process of voting, which consists of several stages. Cryptographic protocols are used to transfer data between components, which are based on establishing a secure connection using security certificates and generating session keys. We use symmetric encryption in CBC mode using random numbers and HMAC to ensure security in the form of party authentication, integrity control, and confidentiality during data transmission. The voting protocol supports the re-voting function. We describe the algorithms for counting votes based on the use of homomorphic encryption, distributed computations, and the threshold secret sharing scheme. We also describe the procedure for verifying votes after counting.","PeriodicalId":130946,"journal":{"name":"Proceedings of the 11th International Conference on Security of Information and Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Distributed E-Voting System Based On Blind Intermediaries Using Homomorphic Encryption\",\"authors\":\"L. Babenko, I. Pisarev\",\"doi\":\"10.1145/3264437.3264473\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The development of electronic voting systems is an important direction of work due to the ubiquitous transfer of all spheres of human activity to the information technology environment. Electronic voting in comparison with traditional methods of voting has a lower cost, more reliable and convenient in the context of the modern world. We present a distributed electronic voting system that uses an intermediary site to verify the correctness of components, which does not process any information about votes and user authentication data, as well as using the principle of blind intermediaries to ensure user authentication while maintaining their anonymity. In addition, we use the principle of homomorphic encryption and the threshold scheme for sharing the secret at the most important stage - the counting of votes. The groups of people participating in voting are characterized by a degree of confidence in them. The architecture of the service is described by the components that interact in it. We describe the process of voting, which consists of several stages. Cryptographic protocols are used to transfer data between components, which are based on establishing a secure connection using security certificates and generating session keys. We use symmetric encryption in CBC mode using random numbers and HMAC to ensure security in the form of party authentication, integrity control, and confidentiality during data transmission. The voting protocol supports the re-voting function. We describe the algorithms for counting votes based on the use of homomorphic encryption, distributed computations, and the threshold secret sharing scheme. We also describe the procedure for verifying votes after counting.\",\"PeriodicalId\":130946,\"journal\":{\"name\":\"Proceedings of the 11th International Conference on Security of Information and Networks\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th International Conference on Security of Information and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3264437.3264473\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th International Conference on Security of Information and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3264437.3264473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed E-Voting System Based On Blind Intermediaries Using Homomorphic Encryption
The development of electronic voting systems is an important direction of work due to the ubiquitous transfer of all spheres of human activity to the information technology environment. Electronic voting in comparison with traditional methods of voting has a lower cost, more reliable and convenient in the context of the modern world. We present a distributed electronic voting system that uses an intermediary site to verify the correctness of components, which does not process any information about votes and user authentication data, as well as using the principle of blind intermediaries to ensure user authentication while maintaining their anonymity. In addition, we use the principle of homomorphic encryption and the threshold scheme for sharing the secret at the most important stage - the counting of votes. The groups of people participating in voting are characterized by a degree of confidence in them. The architecture of the service is described by the components that interact in it. We describe the process of voting, which consists of several stages. Cryptographic protocols are used to transfer data between components, which are based on establishing a secure connection using security certificates and generating session keys. We use symmetric encryption in CBC mode using random numbers and HMAC to ensure security in the form of party authentication, integrity control, and confidentiality during data transmission. The voting protocol supports the re-voting function. We describe the algorithms for counting votes based on the use of homomorphic encryption, distributed computations, and the threshold secret sharing scheme. We also describe the procedure for verifying votes after counting.