A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Since its inception, public-key encryption (PKE) has been one of the main cornerstones of cryptography. A central goal in cryptographic research is to understand the foundations of public-key encryption and in particular, base its existence on a natural and generic complexity-theoretic assumption. An intriguing candidate for such an assumption is the existence of a cryptographically hard language L ∈ NP ∩ SZK. In this work we prove that public-key encryption can be based on the foregoingdoi:10.1007/978-3-319-96878-0_23 fatcat:leuv3kr2ibf7pbjn2x4ck6iiei