{"title":"一种具有集等式检验的有效公钥加密方法","authors":"Xu Zhang, Sha Ma, Chengyu Jiang, Pan Zhou","doi":"10.1109/CSP58884.2023.00034","DOIUrl":null,"url":null,"abstract":"Users can compare the equality of two encryption texts encrypted by different public keys in the public key encryption with equality test (PKEET) scheme. And the encryption texts do not have to be decrypted. Actually, users may need to verify the equality of two ciphertext sets. A trivial solution using typical PKEET scheme is testing two ciphertexts respectively from two sets and repeating multiple times until all ciphertexts are tested. Obviously, the above solution not only spends a lot of time, but also discloses the equality between any two ciphertexts in the two sets. For fear of the aforementioned issue, we propose an efficient public key encryption with set equality test (PKE-SET). PKE-SET does not use expensive bilinear pairings. Experimental results indicate that, compared to other PKEET schemes, our PKE-SET has higher computational efficiency and only our PKE-SET does not disclose the equality between any two ciphertexts.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Efficient Public Key Encryption With Set Equality Test\",\"authors\":\"Xu Zhang, Sha Ma, Chengyu Jiang, Pan Zhou\",\"doi\":\"10.1109/CSP58884.2023.00034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Users can compare the equality of two encryption texts encrypted by different public keys in the public key encryption with equality test (PKEET) scheme. And the encryption texts do not have to be decrypted. Actually, users may need to verify the equality of two ciphertext sets. A trivial solution using typical PKEET scheme is testing two ciphertexts respectively from two sets and repeating multiple times until all ciphertexts are tested. Obviously, the above solution not only spends a lot of time, but also discloses the equality between any two ciphertexts in the two sets. For fear of the aforementioned issue, we propose an efficient public key encryption with set equality test (PKE-SET). PKE-SET does not use expensive bilinear pairings. Experimental results indicate that, compared to other PKEET schemes, our PKE-SET has higher computational efficiency and only our PKE-SET does not disclose the equality between any two ciphertexts.\",\"PeriodicalId\":255083,\"journal\":{\"name\":\"2023 7th International Conference on Cryptography, Security and Privacy (CSP)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 7th International Conference on Cryptography, Security and Privacy (CSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSP58884.2023.00034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSP58884.2023.00034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
在PKEET (public key encryption with equality test)方案中,用户可以比较不同公钥加密的两个加密文本是否相等。加密文本不需要解密。实际上,用户可能需要验证两个密文集是否相等。使用典型PKEET方案的一个简单解决方案是分别从两个集合中测试两个密文,并重复多次,直到所有密文都被测试。显然,上述解决方案不仅花费了大量的时间,而且还揭示了两个集合中任意两个密文之间的等式。针对上述问题,我们提出了一种有效的集相等性测试公钥加密方法(PKE-SET)。PKE-SET不使用昂贵的双线性配对。实验结果表明,与其他PKEET方案相比,我们的pkeset方案具有更高的计算效率,并且我们的pkeset方案不泄露任意两个密文之间的相等性。
An Efficient Public Key Encryption With Set Equality Test
Users can compare the equality of two encryption texts encrypted by different public keys in the public key encryption with equality test (PKEET) scheme. And the encryption texts do not have to be decrypted. Actually, users may need to verify the equality of two ciphertext sets. A trivial solution using typical PKEET scheme is testing two ciphertexts respectively from two sets and repeating multiple times until all ciphertexts are tested. Obviously, the above solution not only spends a lot of time, but also discloses the equality between any two ciphertexts in the two sets. For fear of the aforementioned issue, we propose an efficient public key encryption with set equality test (PKE-SET). PKE-SET does not use expensive bilinear pairings. Experimental results indicate that, compared to other PKEET schemes, our PKE-SET has higher computational efficiency and only our PKE-SET does not disclose the equality between any two ciphertexts.