{"title":"安全云计算的加密方案","authors":"Alejandro Llamas, Raul Ernesto Gonzalez","doi":"10.1109/ICEEE.2013.6676080","DOIUrl":null,"url":null,"abstract":"We present a new symmetric scheme for fully homomorphic encryption, which starts as a symmetric encryption scheme based on finite automata. This scheme is extended to a partial homomorphic encryption by serial composition of automata. So far we can apply to a ciphertext any operation that can be represented by a finite automata, but using the help of a remote host we can extend our scheme to a fully homomorphic encryption. The scheme is shown attack resistant, since it does not require key distribution and serial composition of finite automata is a one-way-function.","PeriodicalId":226547,"journal":{"name":"2013 10th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A cryptographic scheme for secure cloud computing\",\"authors\":\"Alejandro Llamas, Raul Ernesto Gonzalez\",\"doi\":\"10.1109/ICEEE.2013.6676080\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new symmetric scheme for fully homomorphic encryption, which starts as a symmetric encryption scheme based on finite automata. This scheme is extended to a partial homomorphic encryption by serial composition of automata. So far we can apply to a ciphertext any operation that can be represented by a finite automata, but using the help of a remote host we can extend our scheme to a fully homomorphic encryption. The scheme is shown attack resistant, since it does not require key distribution and serial composition of finite automata is a one-way-function.\",\"PeriodicalId\":226547,\"journal\":{\"name\":\"2013 10th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEEE.2013.6676080\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEEE.2013.6676080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present a new symmetric scheme for fully homomorphic encryption, which starts as a symmetric encryption scheme based on finite automata. This scheme is extended to a partial homomorphic encryption by serial composition of automata. So far we can apply to a ciphertext any operation that can be represented by a finite automata, but using the help of a remote host we can extend our scheme to a fully homomorphic encryption. The scheme is shown attack resistant, since it does not require key distribution and serial composition of finite automata is a one-way-function.