环中实用的私钥全同态加密

IF 0.1 Q4 MATHEMATICS Groups Complexity Cryptology Pub Date : 2018-04-19 DOI:10.1515/gcc-2018-0006

A. Gribov, Delaram Kahrobaei, V. Shpilrain

{"title":"环中实用的私钥全同态加密","authors":"A. Gribov, Delaram Kahrobaei, V. Shpilrain","doi":"10.1515/gcc-2018-0006","DOIUrl":null,"url":null,"abstract":"Abstract We describe a practical fully homomorphic encryption (FHE) scheme based on homomorphisms between rings and show that it enables very efficient computation on encrypted data. Our encryption though is private-key; public information is only used to operate on encrypted data without decrypting it. Still, we show that our method allows for a third party search on encrypted data.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"36 1","pages":"17 - 27"},"PeriodicalIF":0.1000,"publicationDate":"2018-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Practical private-key fully homomorphic encryption in rings\",\"authors\":\"A. Gribov, Delaram Kahrobaei, V. Shpilrain\",\"doi\":\"10.1515/gcc-2018-0006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We describe a practical fully homomorphic encryption (FHE) scheme based on homomorphisms between rings and show that it enables very efficient computation on encrypted data. Our encryption though is private-key; public information is only used to operate on encrypted data without decrypting it. Still, we show that our method allows for a third party search on encrypted data.\",\"PeriodicalId\":41862,\"journal\":{\"name\":\"Groups Complexity Cryptology\",\"volume\":\"36 1\",\"pages\":\"17 - 27\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2018-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2018-0006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2018-0006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 7

摘要

摘要提出了一种实用的基于环间同态的全同态加密方案，并证明了该方案能够对加密数据进行高效的计算。我们的加密是私钥;公共信息仅用于对加密数据进行操作而不进行解密。尽管如此，我们证明了我们的方法允许第三方对加密数据进行搜索。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Practical private-key fully homomorphic encryption in rings

Abstract We describe a practical fully homomorphic encryption (FHE) scheme based on homomorphisms between rings and show that it enables very efficient computation on encrypted data. Our encryption though is private-key; public information is only used to operate on encrypted data without decrypting it. Still, we show that our method allows for a third party search on encrypted data.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊