Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism

Long, Yu; Chen, Kefei

doi:10.1016/j.ins.2009.12.008

Cited by 11 publications

(12 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After receiving the ciphertext sent to them, n players use the partial key and their secret key shares to recover the session key from the ciphertext. Compared to our previous work [6] , the adversary in the distributed certificateless key encapsulation mechanism can attack the system in two ways. The adversary can either replace the public key generated by n players or get the master key of the KGC.…”

Section: The Modelmentioning

confidence: 99%

“…During the attack, the adversary can choose to corrupt up to t − 1 players at any time, based on the gathered information. The formal definition of the adversaries is similar to the adversary of the threshold scheme [6] except for a few modifications.…”

Section: The Modelmentioning

confidence: 99%

“…In certificateless public key cryptosystem, the authenticity of user public keys is guaranteed without certificates. We proposed the first threshold certificateless pubic key encapsulation mechanism [6] , and proved its security in the static adversary model in the full version.…”

Section: Introductionmentioning

confidence: 99%

“…Security of the proposed scheme can be reduced to the discrete-log problem in ellipse curve and the security of the threshold scheme [6] .…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Distributed certificateless key encapsulation mechanism secure against the adaptive adversary

Long

Chen

et al. 2009

J. Shanghai Jiaotong Univ. (Sci.)

Self Cite

View full text Add to dashboard Cite

This paper proposes an adaptively secure solution to certificateless distributed key encapsulation mechanism from pairings by using Canetti's adaptive secure key generation scheme based on discrete logarithm. The proposed scheme can withstand adaptive attackers that can choose players for corruption at any time during the run of the protocol, and this kind of attack is powerful and realistic. In contrast, all previously presented threshold certificateless public key cryptosystems are proven secure against the more idealized static adversaries only. They choose and fix the subset of target players before running the protocol. We also prove security of this scheme in the random oracle model.

show abstract

Section: The Modelmentioning

confidence: 99%

Section: The Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Security of the proposed scheme can be reduced to the discrete-log problem in ellipse curve and the security of the threshold scheme [6] .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Distributed certificateless key encapsulation mechanism secure against the adaptive adversary

Long

Chen

et al. 2009

J. Shanghai Jiaotong Univ. (Sci.)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, the key escrow problem in ID-PKC is eliminated. Many certificateless cryptosystems have been proposed, including encryption schemes [1,10,24,25], signature schemes [1,11,28,29], key agreement protocols [1,31], threshold cryptosystems [8,14,23,26], and signcryption schemes [3,4,5,12,13,21,22]. As the adversary models in CLC are more complex, the security proofs in CLC are more challenging.…”

Section: Introductionmentioning

confidence: 99%

On security of a certificateless signcryption scheme

Miao

Zhang

et al. 2013

Information Sciences

View full text Add to dashboard Cite

It would be interesting if a signcryption scheme in the standard model could be made certificateless. One of the interesting attempts is due to Liu et al. [Z. Liu, Y. Hu, X. Zhang, H. Ma, Certificateless signcryption scheme in the standard model, Information Sciences 180 (3) (2010) [452][453][454][455][456][457][458][459][460][461][462][463][464]. In this paper, we provide a cryptanalysis on this scheme by depicting two kinds of subtle public key replacement attacks against it. Our analysis reveals that it does not meet the basic requirements of confidentiality and non-repudiation. AbstractIt would be interesting if a signcryption scheme in the standard model could be made certificateless. One of interesting attempts is due to Liu, Hu, Zhang and Ma, who published a certificateless signcryption scheme in the standard model in Volume 180 (3), Information Science, in 2010. In this paper, we provide a cryptanalysis on this scheme and show that it is insecure under two kinds of subtle public key replacement attacks. We show that it does not meet the basic requirements of confidentiality and non-repudoation.

show abstract

Key Encapsulation Mechanism from Multilinear Maps

Sun

Yang

et al. 2017

Advances in Internetworking, Data &Amp; Web Technologies

View full text Add to dashboard Cite

Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism

Cited by 11 publications

References 33 publications

Distributed certificateless key encapsulation mechanism secure against the adaptive adversary

Distributed certificateless key encapsulation mechanism secure against the adaptive adversary

On security of a certificateless signcryption scheme

Key Encapsulation Mechanism from Multilinear Maps

Contact Info

Product

Resources

About