Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
1991; Association for Computing Machinery; Volume: 38; Issue: 3 Linguagem: Inglês
10.1145/116825.116852
ISSN1557-735X
AutoresOded Goldreich, Silvio Micali, Avi Wigderson,
Tópico(s)Logic, programming, and type systems
Resumoarticle Free Access Share on Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems Authors: Oded Goldreich Technion, Haifa, Israel Technion, Haifa, IsraelView Profile , Silvio Micali Massachusetts Institute of Technology, Cambridge Massachusetts Institute of Technology, CambridgeView Profile , Avi Wigderson Hebrew Univ., Jerusalem, Israel Hebrew Univ., Jerusalem, IsraelView Profile Authors Info & Claims Journal of the ACMVolume 38Issue 3July 1991 pp 690–728https://doi.org/10.1145/116825.116852Published:01 July 1991Publication History 808citation5,136DownloadsMetricsTotal Citations808Total Downloads5,136Last 12 Months700Last 6 weeks75 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Referência(s)