An anonymous signcryption scheme based on one-off public key

Author(s):  
Longjun Zhang ◽  
Lulin Zhang ◽  
Zhonghua Xv ◽  
Cheng Guo
2013 ◽  
Vol 475-476 ◽  
pp. 1144-1149
Author(s):  
Xian Yong Meng ◽  
Zhong Chen ◽  
Xiang Yu Meng

In this paper, a novel decentralized key-policy attribute-based signcryption (ABS) scheme is proposed, where each authority can generate secret-public key pair for the user independently without any cooperation and a centralized authority. In the proposed scheme, each authority can join or leave the system randomly without reinitializing the system,and issue secret-public keys to user respectively. Therefore, it is clear that the multi-authority attribute-based access control scheme can reduce the communication cost and the collaborative computing cost. Additionally, the attribute-based signcryption scheme is efficient in terms of both the identification authentication and the confidential communication, and can realize security secret sharing in cloud computing environments.


2019 ◽  
Vol 17 (2) ◽  
pp. 196-206
Author(s):  
Li Huixian ◽  
Gao Jin ◽  
Wang Lingyun ◽  
Pang Liaojun2

The threshold proxy signcryption can implement signature and encryption simultaneously in one logical step, and can be used to realize the decentralized protection of the group signature key, so it is an efficient technology for network security. Currently, most of the existing threshold proxy signcryption schemes are designed based on the traditional public key cryptosystems, and their security mainly depends on the difficulty of the large integer decomposition and the discrete logarithm. However, the traditional public key cryptosystems cannot resist the quantum computer attack, which makes the existing threshold proxy signcryption schemes based on traditional public key cryptosystems insecure against quantum attacks. Motivated by these concerns, we proposed a threshold proxy signcryption scheme based on Multivariate Public Key Cryptosystem (MPKC) which is one of the quantum attack-resistent public key algorithms. Under the premise of satisfying the threshold signcryption requirements of the threshold proxy, our scheme can not only realize the flexible participation of the proxy signcrypters but also resist the quantum computing attack. Finally, based on the assumption of Multivariate Quadratic (MQ) problem and Isomorphism Polynomial (IP) problem, the proof of the confidentiality and the unforgeability of the proposed scheme under the random oracle model is given.


2014 ◽  
Vol 599-601 ◽  
pp. 1435-1438 ◽  
Author(s):  
Yi Ding

Certificateless public key cryptography is a new paradigm that simplifies the traditional PKC and solves the inherent key escrow problem suffered by ID-PKC. As realizing both encryption and signature security goals, certificateless signcryption is one of the most important security primitives in CL-PKC. To adapt multi-user settings, we present a certificateless multi-signcryption scheme without pairing. The performace analysis shows that the scheme is very efficient.


2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Yang Lu ◽  
Jiguo Li

Signcryption is a useful cryptographic primitive that achieves confidentiality and authentication in an efficient manner. As an extension of signcryption in certificate-based cryptography, certificate-based signcryption preserves the merits of certificate-based cryptography and signcryption simultaneously. In this paper, we present an improved security model of certificate-based signcryption that covers both public key replacement attack and insider security. We show that an existing certificate-based signcryption scheme is insecure in our model. We also propose a new certificate-based signcryption scheme that achieves security against both public key replacement attacks and insider attacks. We prove in the random oracle model that the proposed scheme is chosen-ciphertext secure and existentially unforgeable. Performance analysis shows that the proposed scheme outperforms all the previous certificate-based signcryption schemes in the literature.


2014 ◽  
Vol 685 ◽  
pp. 663-666 ◽  
Author(s):  
Yan Hong Wang ◽  
Jun Yao Ye

The ID of the user is the public key, key generator center (KGC) generates the prime key, and the private key of the user is generated by the user's ID through KGC. This paper constructs a new ID-based proxy re-signcryption scheme, in this scheme, uses a semi-trusted agent to achieve the transparent conversion between identiy decryption and identity verification, the verification of signcryption doesn't need the plaintext, in the random oracle model, based on the GBDH problem, we prove that this scheme is secure..


Sign in / Sign up

Export Citation Format

Share Document