{"title":"Plaintext Recovery Attacks and Their Mitigation in an Application-Specific SHE Scheme","authors":"Tikaram Sanyashi, Anasuya Acharya, B. Menezes","doi":"10.1109/PDCAT46702.2019.00024","DOIUrl":null,"url":null,"abstract":"In addition to storage and computing power, cloud providers ensure confidentiality of user data through the use of various encryption technologies. The need to decrypt the data before it can be operated upon exposes a possible security hole which could be exploited by untrustworthy system administrators. Homomorphic encryption allows operations on encrypted data without the need to first decrypt it making it attractive for cloud computing. However, it incurs significant overhead of storage and computation and is therefore infeasible in practice. Somewhat homomorphic schemes have been proposed to handle specific applications - one such scheme, the Zhou Wornell Scheme, operates on vectors of integers. We demonstrate that this scheme is vulnerable to plaintext recovery attacks for a range of vector sizes. We explore the trade-offs between plaintext vector length, public key size and security. Increasing vector length increases security but at the cost of greatly increased public key size. We suggest a way of reducing the size of the public key by up to 90%. Finally, we propose a variant of this scheme which is secure against plaintext recovery attacks.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT46702.2019.00024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In addition to storage and computing power, cloud providers ensure confidentiality of user data through the use of various encryption technologies. The need to decrypt the data before it can be operated upon exposes a possible security hole which could be exploited by untrustworthy system administrators. Homomorphic encryption allows operations on encrypted data without the need to first decrypt it making it attractive for cloud computing. However, it incurs significant overhead of storage and computation and is therefore infeasible in practice. Somewhat homomorphic schemes have been proposed to handle specific applications - one such scheme, the Zhou Wornell Scheme, operates on vectors of integers. We demonstrate that this scheme is vulnerable to plaintext recovery attacks for a range of vector sizes. We explore the trade-offs between plaintext vector length, public key size and security. Increasing vector length increases security but at the cost of greatly increased public key size. We suggest a way of reducing the size of the public key by up to 90%. Finally, we propose a variant of this scheme which is secure against plaintext recovery attacks.