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

Author(s):  
Qiqi Lai ◽  
Bo Yang ◽  
Yong Yu ◽  
Yuan Chen ◽  
Liju Dong
2019 ◽  
Vol 30 (04) ◽  
pp. 589-606
Author(s):  
Qiqi Lai ◽  
Bo Yang ◽  
Zhe Xia ◽  
Yannan Li ◽  
Yuan Chen ◽  
...  

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.


2016 ◽  
Vol 9 (14) ◽  
pp. 2422-2433 ◽  
Author(s):  
Zhenhua Liu ◽  
Xiangsong Zhang ◽  
Yupu Hu ◽  
Tsuyoshi Takagi

2014 ◽  
Vol 58 (10) ◽  
pp. 2507-2508 ◽  
Author(s):  
Debiao He ◽  
Mingwu Zhang ◽  
Baowen Xu

2018 ◽  
Vol 442-443 ◽  
pp. 158-172 ◽  
Author(s):  
Jia Yu ◽  
Rong Hao ◽  
Hui Xia ◽  
Hanlin Zhang ◽  
Xiangguo Cheng ◽  
...  

2020 ◽  
Vol 804 ◽  
pp. 1-28
Author(s):  
Yanwei Zhou ◽  
Bo Yang ◽  
Tao Wang ◽  
Yi Mu

2011 ◽  
Vol 48-49 ◽  
pp. 599-602 ◽  
Author(s):  
Xiao Qin Shen ◽  
Yang Ming

A convertible limited verifier signature (CLVS) can be used to solve conflicts between authenticity and privacy in the digital signatures. In a CLVS scheme, the signature can be verified by a limited verifier. When necessary, the limited verifier can provide a proof to convince a judge that the signer has indeed generated the signature. However, the judge cannot transfer this proof to convince any other party. Also, the limited verifier signature should be converted into an ordinary one for public verification if required. In this paper, we proposed firstly identity-based converible limited verifier signature scheme in the standard model. We give the security proofs of our scheme and show that Our scheme achieved the desired security notions in the standard model (without random oracle).


Sign in / Sign up

Export Citation Format

Share Document