Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting

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, the authors present an efficient deterministic public key encryption scheme in the auxiliary-input setting from lattices. The public key size, ciphertext size and ciphertext expansion factor are improved compared with the scheme proposed by Brakerski and Segev. Their scheme is also secure even in the multi-user setting where related messages may be encrypted under multiple public keys.

Provided by: Chinese Academy of Sciences Topic: Security Date Added: Aug 2012 Format: PDF

Find By Topic