Provably secure identity-based encryption resilient to post-challenge continuous auxiliary input leakage

2015 ◽  
Vol 9 (10) ◽  
pp. 1016-1024 ◽  
Author(s):  
Jiguo Li ◽  
Yuyan Guo ◽  
Qihong Yu ◽  
Yang Lu ◽  
Yichen Zhang
Keyword(s):  
Post Challenge ◽  
Identity Based Encryption ◽  
Identity Based ◽  
Auxiliary Input ◽  
Provably Secure

scholarly journals Provably Secure Identity-Based Encryption and Signature over Cyclotomic Fields

2019 ◽  
Vol 2019 ◽  
pp. 1-13
Author(s):  
Yang Wang ◽  
Mingqiang Wang ◽  
Jingdan Zou ◽  
Jin Xu ◽  
Jing Wang
Keyword(s):  
Key Management ◽  
Cyclotomic Field ◽  
Cyclotomic Fields ◽  
Secret Key ◽  
Worst Case ◽  
Identity Based Encryption ◽  
Management Procedures ◽  
Identity Based ◽  
Identity Based Cryptography ◽  
Provably Secure

Identity-based cryptography is a type of public key cryptography with simple key management procedures. To our knowledge, till now, the existing identity-based cryptography based on NTRU is all over power-of-2 cyclotomic rings. Whether there is provably secure identity-based cryptography over more general fields is still open. In this paper, with the help of the results of collision resistance preimage sampleable functions (CRPSF) over cyclotomic fields, we give concrete constructions of provably secure identity-based encryption schemes (IBE) and identity-based signature schemes (IBS) based on NTRU over any cyclotomic field. Our IBE schemes are provably secure under adaptive chosen-plaintext and adaptive chosen-identity attacks, meanwhile, our IBS schemes are existentially unforgeable against adaptively chosen message and adaptively chosen identity attacks for any probabilistic polynomial time (PPT) adversary in the random oracle model. The securities of both schemes are based on the worst-case approximate shortest independent vectors problem (SIVPγ) over corresponding ideal lattices. The secret key size of our IBE (IBS) scheme is short—only one (two) ring element(s). The ciphertext (signature) is also short—only two (three) ring elements. Meanwhile, as the case of NTRUEncrypt, our IBE scheme could encrypt n bits in each encryption process. These properties may make our schemes have more advantages for some IoT applications over postquantum world in theory.

scholarly journals Deterministic Identity-Based Encryption from Lattice-Based Programmable Hash Functions with High Min-Entropy

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Daode Zhang ◽  
Jie Li ◽  
Bao Li ◽  
Xianhui Lu ◽  
Haiyang Xue ◽  
...  
Keyword(s):  
Hash Functions ◽  
The Other ◽  
Public Key ◽  
Identity Based Encryption ◽  
Other Hand ◽  
Identity Based ◽  
Learning With Errors ◽  
The One ◽  
Auxiliary Input

There only exists one deterministic identity-based encryption (DIBE) scheme which is adaptively secure in the auxiliary-input setting, under the learning with errors (LWE) assumption. However, the master public key consists of O(λ) basic matrices. In this paper, we consider to construct adaptively secure DIBE schemes with more compact public parameters from the LWE problem. (i) On the one hand, we gave a generic DIBE construction from lattice-based programmable hash functions with high min-entropy. (ii) On the other hand, when instantiating our generic DIBE construction with four LPHFs with high min-entropy, we can get four adaptively secure DIBE schemes with more compact public parameters. In one of our DIBE schemes, the master public key only consists of ω(log⁡λ) basic matrices.

A NEW CONSTRUCTION OF IDENTITY-BASED SIGNCRYPTION WITHOUT RANDOM ORACLES

2014 ◽  
Vol 25 (01) ◽  
pp. 1-23 ◽  
Author(s):  
JIA FAN ◽  
YULIANG ZHENG ◽  
XIAOHU TANG
Keyword(s):  
Construction Of Identity ◽  
Random Oracles ◽  
Identity Based Encryption ◽  
New Construction ◽  
Identity Based ◽  
Signcryption Scheme ◽  
Provably Secure

Identity-based signcryption is a primitive that combines the functions of identity-based encryption and identity-based signature. In this paper, we first attack two of the existing identity-based signcryption schemes which are claimed to be provably secure without random oracles. Then we construct a new identity-based signcryption scheme and proves its security without random oracles.

Sign in / Sign up

Export Citation Format

Share Document