{"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}
引用次数: 66
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