{"title":"Multiplicative Partially Homomorphic CRT Secret Sharing : (Preliminary Version)","authors":"S. Dolev, Yaniv Kleinman","doi":"10.1109/NCA57778.2022.10013513","DOIUrl":null,"url":null,"abstract":"A new CRT-based positive (non-zero) secret-sharing scheme with perfect information-theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is designed to support the evaluation of multiplications of non-zero secrets of multiplicative groups.Our CRT-based scheme is partially homomorphic, supporting homomorphic multiplications. Nevertheless, it has the potential to be regarded as fully homomorphic for practical scenarios, such as bounded-sized multi-cloud databases.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA57778.2022.10013513","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A new CRT-based positive (non-zero) secret-sharing scheme with perfect information-theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is designed to support the evaluation of multiplications of non-zero secrets of multiplicative groups.Our CRT-based scheme is partially homomorphic, supporting homomorphic multiplications. Nevertheless, it has the potential to be regarded as fully homomorphic for practical scenarios, such as bounded-sized multi-cloud databases.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
