Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

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

Xiang Xie, Rui Xue, Rui Zhang

Published Jan 1, 2012• 33 citations
Publisher
DOI
10.1007/978-3-642-32928-9_1

Related papers

Public-Key Encryption Schemes with Auxiliary Inputs

Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai +2 more

Lecture notes in computer science•Jan 1, 2010•197 citations

Deterministic Identity-Based Encryption from Lattices with More Compact Public Parameters

Daode Zhang, Fuyang Fang, Bao Li +1 more

Lecture notes in computer science•Jan 1, 2017•1 citation

Updatable Identity-Based Hash Proof System Based on Lattices and Its Application to Leakage-Resilient Public-Key Encryption Schemes

Qi-Qi Lai, Bo Yang, Yong Hong Yu +3 more

Journal of Computer Science and Technology•Nov 1, 2018•3 citations

Towards Tightly Secure Deterministic Public Key Encryption

Daode Zhang, Bao Li, Yamin Liu +3 more

Lecture notes in computer science•Jan 1, 2018•1 citation

Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions

Ananth Raghunathan, Gil Segev, Salil Vadhan

Journal of Cryptology•Mar 21, 2018•6 citations

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

Xiang Xie, Rui Xue, Rui Zhang

Abstract. 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 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. Our scheme is also secure even in the multi-user setting where related messages may be encrypted under multiple public keys. In addition, the security of our scheme is based on the hardness of the learning with errors (LWE) problem which remains hard even for quantum algorithms. Furthermore, we consider deterministic identity-based public key encryption (D-IBE) in the auxiliaryinput setting. The only known D-IBE scheme (without considering auxiliary inputs) in the standard model was proposed by Bellare et al. in EUROCRYPT’12. However, this scheme is only secure in the selective security setting, and Bellare et al. identified it as an open problem to construct adaptively secure D-IBE schemes. The second contribution of this work is to propose a D-IBE scheme from lattices that is adaptively secure.

•Jan 1, 2012•0 citations
Abstract. 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 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. Our scheme is also secure even in the multi-user setting where related messages may be encrypted under multiple public keys. In addition, the security of our scheme is based on the hardness of the learning with errors (LWE) problem which remains hard even for quantum algorithms. Furthermore, we consider deterministic identity-based public key encryption (D-IBE) in the auxiliaryinput setting. The only known D-IBE scheme (without considering auxiliary inputs) in the standard model was proposed by Bellare et al. in EUROCRYPT’12. However, this scheme is only secure in the selective security setting, and Bellare et al. identified it as an open problem to construct adaptively secure D-IBE schemes. The second contribution of this work is to propose a D-IBE scheme from lattices that is adaptively secure.