scholarly journals Generalized (identity-based) hash proof system and its applications

2013 ◽  
Vol 9 (12) ◽  
pp. 1698-1716 ◽  
Author(s):  
Yu Chen ◽  
Zongyang Zhang ◽  
Dongdai Lin ◽  
Zhenfu Cao
Keyword(s):  
Proof System ◽  
Identity Based ◽  
Hash Proof System

Novel updatable identity-based hash proof system and its applications

2020 ◽  
Vol 804 ◽  
pp. 1-28
Author(s):  
Yanwei Zhou ◽  
Bo Yang ◽  
Tao Wang ◽  
Yi Mu
Keyword(s):  
Proof System ◽  
Identity Based ◽  
Hash Proof System

scholarly journals CCA-Secure IB-KEM from Identity-Based Extractable Hash Proof System

2013 ◽  
Vol 57 (10) ◽  
pp. 1537-1556 ◽  
Author(s):  
Y. Chen ◽  
Z. Zhang ◽  
D. Lin ◽  
Z. Cao
Keyword(s):  
Proof System ◽  
Identity Based ◽  
Hash Proof System

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

2019 ◽  
Vol 30 (04) ◽  
pp. 589-606
Author(s):  
Qiqi Lai ◽  
Bo Yang ◽  
Zhe Xia ◽  
Yannan Li ◽  
Yuan Chen ◽  
...  
Keyword(s):  
Standard Model ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Proof System ◽  
Secret Key ◽  
Random Lattice ◽  
The Standard Model ◽  
Identity Based ◽  
Hash Proof System

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.

Anonymous and Updatable Identity-Based Hash Proof System

2019 ◽  
Vol 13 (3) ◽  
pp. 2818-2829 ◽  
Author(s):  
Yanwei Zhou ◽  
Bo Yang ◽  
Zhe Xia ◽  
Yi Mu ◽  
Tao Wang
Keyword(s):  
Proof System ◽  
Identity Based ◽  
Hash Proof System

scholarly journals Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

2001 ◽  
Vol 8 (37) ◽  
Author(s):  
Ronald Cramer ◽  
Victor Shoup
Keyword(s):  
Special Kind ◽  
Public Key ◽  
Proof System ◽  
Reasonable Assumption ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Proof Systems ◽  
Encryption Schemes ◽  
Hash Proof System ◽  
Chosen Ciphertext Attack

We present several new and fairly practical public-key encryption schemes and prove them secure against adaptive chosen ciphertext attack. One scheme is based on Paillier's Decision Composite Residuosity (DCR) assumption, while another is based in the classical Quadratic Residuosity (QR) assumption. The analysis is in the standard cryptographic model, i.e., the security of our schemes does not rely on the Random Oracle model.<br /> <br />We also introduce the notion of a universal hash proof system. Essentially, this is a special kind of non-interactive zero-knowledge proof system for an NP language. We do not show that universal hash proof systems exist for all NP languages, but we do show how to construct very efficient universal hash proof systems for a general class of group-theoretic language membership problems.<br /> <br />Given an efficient universal hash proof system for a language with certain natural cryptographic indistinguishability properties, we show how to construct an efficient public-key encryption schemes secure against adaptive chosen ciphertext attack in the standard model. Our construction only uses the universal hash proof system as a primitive: no other primitives are required, although even more efficient encryption schemes can be obtained by using hash functions with appropriate collision-resistance properties. We show how to construct efficient universal hash proof systems for languages related to the DCR and QR assumptions. From these we get corresponding public-key encryption schemes that are secure under these assumptions. We also show that the Cramer-Shoup encryption scheme (which up until now was the only practical encryption scheme that could be proved secure against adaptive chosen ciphertext attack under a reasonable assumption, namely, the Decision Diffie-Hellman assumption) is also a special case of our general theory.

Sign in / Sign up

Export Citation Format

Share Document