A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting
[chapter]
2012
Lecture Notes in Computer Science
Deterministic public key encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios (e.g. search on encrypted data) where the latter exhibits inherent drawbacks. In CRYPTO'11, Brakerski and Segev formalized a framework for studying the security of deterministic public key encryption schemes with respect to auxiliary inputs. A trivial requirement is that the plaintext should not be efficiently recoverable from the auxiliary inputs. In this paper, we
doi:10.1007/978-3-642-32928-9_1
fatcat:ht3xsmgfqndbjixqqqgpsfsjry