scholarly journals Efficient Certificate-Based Signcryption Secure against Public Key Replacement Attacks and Insider Attacks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Yang Lu ◽  
Jiguo Li
Keyword(s):  
Performance Analysis ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Security Model ◽  
Efficient Manner ◽  
Cryptographic Primitive ◽  
Replacement Attack ◽  
Signcryption Scheme

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.

Certificate-Based Generalized Ring Signcryption Scheme

2018 ◽  
Vol 29 (06) ◽  
pp. 1063-1088 ◽  
Author(s):  
Caixue Zhou ◽  
Guangyong Gao ◽  
Zongmin Cui ◽  
Zhiqiang Zhao
Keyword(s):  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Formal Definition ◽  
Security Model ◽  
Storage Space ◽  
Ring Signature ◽  
Highly Efficient ◽  
Signcryption Scheme

Generalized ring signcryption (GRSC) can realize ring signature and ring signcryption functions with only one key pair and one algorithm. It is very useful for a system with a large number of users, or whose function may be changed, or with limited storage space. We give a formal definition and security model of GRSC in the certificate-based cryptosystem setting and propose a concrete scheme by using bilinear pairings. The confidentiality of our scheme can be proved under the GBDH and CDH assumptions and the unforgeability of our scheme can be proved under [Formula: see text] and CDH assumptions in the random oracle model, and what is more, our scheme has unconditional anonymity. Compared with other certificateless ring signcryption schemes that use bilinear pairings, it is a highly efficient one.

scholarly journals MPKC-based Threshold Proxy Signcryption Scheme

2019 ◽  
Vol 17 (2) ◽  
pp. 196-206
Author(s):  
Li Huixian ◽  
Gao Jin ◽  
Wang Lingyun ◽  
Pang Liaojun2
Keyword(s):  
Quantum Computer ◽  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Group Signature ◽  
Large Integer ◽  
Efficient Technology ◽  
Public Key Cryptosystems ◽  
Signcryption Scheme

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.

scholarly journals An Efficient and Provably-Secure Certificateless Proxy-Signcryption Scheme for Electronic Prescription System

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Li Li ◽  
Siqin Zhou ◽  
Kim-Kwang Raymond Choo ◽  
Xiaohong Li ◽  
Debiao He
Keyword(s):  
Random Oracle Model ◽  
Research Area ◽  
Random Oracle ◽  
Performance Evaluations ◽  
Electronic Prescription ◽  
Limited Bandwidth ◽  
Cryptographic Primitive ◽  
And Performance ◽  
Signcryption Scheme ◽  
Provably Secure

Electronic prescription is increasingly popular in our society, particularly in technologically advanced countries. Due to strict legal requirements and privacy regulations, authorization and data confidentiality are two important features in electronic prescription system. By combining signature and encryption functions, signcryption is an efficient cryptographic primitive that can be used to provide these two features. While signcryption is a fairly established research area, most signcryption schemes proposed recently have several limitations (e.g., high communication costs, limited bandwidth, and insecurity), and designing secure and practical signcryption schemes remains challenging. In this paper, we propose an improved certificateless proxy signcryption (CLPSC) scheme, based on elliptic curve cryptography (ECC). We also demonstrate that the proposed CLPSC scheme is secure in the random oracle model and evaluate its performance with related schemes. The security and performance evaluations show that the proposed CLPSC scheme can potentially be implemented on resource-constrained low-computing mobile devices in an electronic prescription system.

Research on ID-Based Proxy Re-Signcryption Scheme

2014 ◽  
Vol 685 ◽  
pp. 663-666 ◽  
Author(s):  
Yan Hong Wang ◽  
Jun Yao Ye
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Identity Verification ◽  
The Public ◽  
Private Key ◽  
Model Based ◽  
Signcryption Scheme

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..

scholarly journals Public key encryption with equality test from generic assumptions in the random oracle model

2019 ◽  
Vol 500 ◽  
pp. 15-33 ◽  
Author(s):  
Hyung Tae Lee ◽  
San Ling ◽  
Jae Hong Seo ◽  
Huaxiong Wang
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Encryption ◽  
Equality Test

scholarly journals Pairing-Free Certificateless Signature with Security Proof

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Wenhao Liu ◽  
Qi Xie ◽  
Shengbao Wang ◽  
Lidong Han ◽  
Bin Hu
Keyword(s):  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Management Problem ◽  
Security Proof ◽  
Certificateless Public Key Cryptosystem ◽  
Certificateless Signature

Since certificateless public key cryptosystem can solve the complex certificate management problem in the traditional public key cryptosystem and the key escrow problem in identity-based cryptosystem and the pairing computation is slower than scalar multiplication over the elliptic curve, how to design certificateless signature (CLS) scheme without bilinear pairings is a challenge. In this paper, we first propose a new pairing-free CLS scheme, and then the security proof is presented in the random oracle model (ROM) under the discrete logarithm assumption. The proposed scheme is more efficient than the previous CLS schemes in terms of computation and communication costs and is more suitable for the applications of low-bandwidth environments.

scholarly journals Quantum Random Oracle Model for Quantum Public-Key Encryption

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 130024-130031 ◽  
Author(s):  
Tao Shang ◽  
Ranyiliu Chen ◽  
Qi Lei
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Encryption ◽  
Quantum Public Key

Another Attack on Tso's Short Signature Scheme Based on Bilinear Pairings

2011 ◽  
Vol 63-64 ◽  
pp. 785-788
Author(s):  
Fan Yu Kong ◽  
Lei Wu ◽  
Jia Yu
Keyword(s):  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Public Key ◽  
Signature Scheme ◽  
Short Signature ◽  
Provably Secure

In 2009, R. Tso et al. proposed an efficient pairing-based short signature scheme which is provably secure in the Random Oracle Model. In this paper, we propose a new key substitution attack on Raylin Tso et al.’s short signature scheme. For a given message and the corresponding valid signature, the malicious attacker can generate a substituted public key. Everyone verifies the signature successfully with the malicious attacker’s substituted public key. Therefore, Raylin Tso et al.’s short signature scheme has a security flaw in the multi-user setting.

scholarly journals Public Key Encryption with Keyword Search from Lattices in Multiuser Environments

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Daini Wu ◽  
Xiaoming Wang ◽  
Qingqing Gan
Keyword(s):  
Data Privacy ◽  
Keyword Search ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Encryption ◽  
Encrypted Data ◽  
Cloud Server ◽  
Learning With Errors ◽  
Multiuser Environments

A public key encryption scheme with keyword search capabilities is proposed using lattices for applications in multiuser environments. The proposed scheme enables a cloud server to check if any given encrypted data contains certain keywords specified by multiple users, but the server would not have knowledge of the keywords specified by the users or the contents of the encrypted data, which provides data privacy as well as privacy for user queries in multiuser environments. It can be proven secure under the standard learning with errors assumption in the random oracle model.

Efficient Convertible User Designating Confirmer Partially Blind Signature with Provable Security

2011 ◽  
Vol 282-283 ◽  
pp. 307-311
Author(s):  
Li Zhen Ma
Keyword(s):  
Provable Security ◽  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Schemes ◽  
Partially Blind Signature ◽  
Provably Secure

Any one who knows the signer’s public key can verify the validity of a given signature in partially blind signature schemes. This verifying universality may be used by cheats if the signed message is sensitive or personal. To solve this problem, a new convertible user designating confirmer partially blind signature, in which only the designated confirmer (designated by the user) and the user can verify and confirm the validity of given signatures and convert given signatures into publicly verifiable ones, is proposed. Compared with Huang et al.’s scheme, the signature size is shortened about 25% and the computation quantity is reduced about 36% in the proposed scheme. Under random oracle model and intractability of Discrete Logarithm Problem the proposed scheme is provably secure.

Sign in / Sign up

Export Citation Format

Share Document