最小知识公钥密码系统中布尔谓词的私有交互测试

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI:10.1109/SFCS.1985.1

Z. Galil, S. Haber, M. Yung

{"title":"最小知识公钥密码系统中布尔谓词的私有交互测试","authors":"Z. Galil, S. Haber, M. Yung","doi":"10.1109/SFCS.1985.1","DOIUrl":null,"url":null,"abstract":"These properties enable us to define a minimum-knowledge cryptosystem, in which each user receives exactly the knowledge he is supposed to receive and nothing more. In particular, the system is provably secure against both chosen-message and chosen-ciphertext attack. ~1oreover, extending the Diffie-Hellman mo<tel, it allows a user to encode messages to other users with his own public key. This enables a symmetrIc use of public-key encryption.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"66","resultStr":"{\"title\":\"A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems\",\"authors\":\"Z. Galil, S. Haber, M. Yung\",\"doi\":\"10.1109/SFCS.1985.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"These properties enable us to define a minimum-knowledge cryptosystem, in which each user receives exactly the knowledge he is supposed to receive and nothing more. In particular, the system is provably secure against both chosen-message and chosen-ciphertext attack. ~1oreover, extending the Diffie-Hellman mo<tel, it allows a user to encode messages to other users with his own public key. This enables a symmetrIc use of public-key encryption.\",\"PeriodicalId\":296739,\"journal\":{\"name\":\"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"66\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1985.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1985.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 66

摘要

这些属性使我们能够定义一个最小知识密码系统，在这个系统中，每个用户只接收到他应该接收的知识，而不是更多。特别地，该系统在被选消息攻击和被选密文攻击下都是安全的。此外，它扩展了Diffie-Hellman模型，允许用户使用自己的公钥对消息进行编码。这允许对称地使用公钥加密。

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

查看原文本刊更多论文

A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems

These properties enable us to define a minimum-knowledge cryptosystem, in which each user receives exactly the knowledge he is supposed to receive and nothing more. In particular, the system is provably secure against both chosen-message and chosen-ciphertext attack. ~1oreover, extending the Diffie-Hellman mo

求助全文

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

来源期刊

26th Annual Symposium on Foundations of Computer Science (sfcs 1985)

自引率

0.00%

发文量

京公网安备 11010802042870号

Book学术文献互助群
群号：604180095