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

Anonymous Identity-Based Hash Proof System from Lattices in the Standard Model

Qiqi Lai, Bo Yang, Yong Hong Yu, Yuan Chen, Liju Dong

Published Jan 1, 2018• 0 citations
Publisher
DOI
10.1007/978-3-319-93638-3_31

Related papers

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

Anonymous Lattice Identity-Based Encryption with Traceable Identities

Xavier Boyen, Ernest Foo, Qinyi Li

Lecture notes in computer science•Jan 1, 2021•4 citations

Hash Proof Systems over Lattices Revisited

Fabrice Benhamouda, Olivier Blazy, Léo Ducas +1 more

Lecture notes in computer science•Jan 1, 2018•44 citations

Identity-Based Blind Signature from Lattices in Standard Model

Wen Gao, Yupu Hu, Baocang Wang +1 more

Lecture notes in computer science•Jan 1, 2017•11 citations

Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model

Qiqi Lai, Bo Yang, Zhe Xia +3 more

As the progress of quantum computers, it is desired to propose many more efficient cryptographic constructions with post-quantum security. In the literatures, almost all cryptographic schemes and protocols can be explained and constructed modularly from certain cryptographic primitives, among which an Identity-Based Hash Proof System (IB-HPS) is one of the most basic and important primitives. Therefore, we can utilize IB-HPSs with post-quantum security to present several types of post-quantum secure schemes and protocols. Up until now, all known IB-HPSs with post-quantum security are instantiated based on latticed-based assumptions. However, all these lattice-based IB-HPSs are either in the random oracle model or not efficient enough in the standard model. Hence, it should be of great significance to construct more efficient IB-HPSs from lattices in the standard model. In this paper, we propose a new smooth IB-HPS with anonymity based on the Learning with Errors (LWE) assumption in the standard model. This new construction is mainly inspired by a classical identity-based encryption scheme based on LWE due to Agreawal et al. in Eurocrypt 2010. And our innovation is to employ the algorithm SampleGaussian introduced by Gentry et al. and the property of random lattice to simulate the identity secret key with respect to the challenge identity. Compared with other existing IB-HPSs in the standard model, our master public key is quite compact. As a result, our construction has much lower overheads on computation and storage.

International Journal of Foundations of Computer Science•Jun 1, 2019•1 citation

Leakage-resilient IBE from lattices in the standard model

Xizhao Luo, Peide Qian, Yanqin Zhu

We present an identity-based encryption in the relative-leakage model. In our construction, we firstly make use of a notion of new cryptographic primitive, identity-based hash proof system (IB-HPS), to construct a leakage-resilient IB-HPS from lattices in the standard model, which has the same amount of relative leakage as that in [11]. Then, based on our IB-HPS scheme, we construct directly an efficient leakage-resilient identity-based encryption scheme in the model.

International Conference on Information Science and Engineering•Dec 1, 2010•1 citation
As the progress of quantum computers, it is desired to propose many more efficient cryptographic constructions with post-quantum security. In the literatures, almost all cryptographic schemes and protocols can be explained and constructed modularly from certain cryptographic primitives, among which an Identity-Based Hash Proof System (IB-HPS) is one of the most basic and important primitives. Therefore, we can utilize IB-HPSs with post-quantum security to present several types of post-quantum secure schemes and protocols. Up until now, all known IB-HPSs with post-quantum security are instantiated based on latticed-based assumptions. However, all these lattice-based IB-HPSs are either in the random oracle model or not efficient enough in the standard model. Hence, it should be of great significance to construct more efficient IB-HPSs from lattices in the standard model. In this paper, we propose a new smooth IB-HPS with anonymity based on the Learning with Errors (LWE) assumption in the standard model. This new construction is mainly inspired by a classical identity-based encryption scheme based on LWE due to Agreawal et al. in Eurocrypt 2010. And our innovation is to employ the algorithm SampleGaussian introduced by Gentry et al. and the property of random lattice to simulate the identity secret key with respect to the challenge identity. Compared with other existing IB-HPSs in the standard model, our master public key is quite compact. As a result, our construction has much lower overheads on computation and storage.