Efficient signcryption in the standard model

Li, Fagen; Zhang, Mingwu; Takagi, Tsuyoshi

doi:10.1002/cpe.1823

Cited by 3 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We outline the security strength of our proposed scheme with related signcryption schemes in terms of computational cost in Table 1. The current existing schemes on keyinsulated signcryptions such as [10,11] are compared with and other ID-based signcryption cryptosystem schemes [31][32][33] are also compared with in terms of their security strength. Thus, the security parameters for our comparison includes IND-ID-CCA2 with key exposure (IND-ID-SC-KI-CCA2), EUF-CMA with key exposure (EUF-CMA-KI-SC-CMA), support for key insulation, cloud delegation and token generation.…”

Section: Comparisonmentioning

confidence: 99%

ID-based key-insulated signcryption with equality test in cloud computing

et al. 2021

View full text Add to dashboard Cite

Key-insulated encryption reduces the problem of secret key exposure in hostile setting while signcryption cryptosystem attains the benefits of digitally signing a ciphertext and public key cryptosystem. In this study, we merge the primitives of parallel key-insulation cryptosystem and signcryption with equality test to construct ID-based parallel key-insulated signcryption with a test for equality (ID-PKSET) in cloud computing. The construction prevent data forgery, data re-play attacks and reduces the leakage of secret keys in harsh environments. Our scheme attains the security property of existential unforgeable chosen message attack (EUF-CMA) and indistinquishable identity chosen ciphertext attack (IND-ID-CCA2) using random oracle model.

show abstract

Section: Comparisonmentioning

confidence: 99%

ID-based key-insulated signcryption with equality test in cloud computing

et al. 2021

View full text Add to dashboard Cite

show abstract

“…In 2012, Li et al . proposed a new signcryption scheme; their scheme is more efficient and is provably secure in the standard model. Moreover, Li et al .…”

Section: Introductionmentioning

confidence: 99%

“…Shao [11] pointed out a weakness in Lv et al's basic scheme and presented a new scheme. In 2012, Li et al [12] proposed a new signcryption scheme; their scheme is more efficient and is provably secure in the standard model. Moreover, Li et al [13] proposed a first lattice-based signcryption scheme and is provably secure in the random oracle model.…”

Section: Introductionmentioning

confidence: 99%

Self‐certified proxy convertible authenticated encryption: formal definitions and a provably secure scheme

Xie

Wang

Xia

et al. 2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYIn 2009, Wu and Lin introduced the concept of self‐certified proxy convertible authenticated encryption (SP‐CAE) by integrating self‐certified public‐key system and designated verifier proxy signature with message recovery. They also presented the first SP‐CAE scheme which is based the discrete logarithm problem. However, Wu‐Lin scheme is not secure as Xie et al. recently showed that this scheme is existentially forgeable under adaptive chosen warrants, unconfidentiable and verifiable under adaptive chosen messages and designated verifiers. In this paper, we first discuss the security requirements of SP‐CAE and then formally define unforgeability, message confidentiality, and unverifiability. Consequently, the first complete formal model of SP‐CAE is proposed. After that, we propose a provably secure SP‐CAE scheme by using two‐party Schnorr signature introduced by Nicolosi et al. in 2003. Finally, we prove the formal security of the proposed scheme in the random oracle model under the discrete logarithm assumption. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

“…Efficient signcryption in the standard model : An efficient signcryption scheme is proposed. Compared with Tan's scheme, it has |G| + |p| (320) bits shorter ciphertext, 2|p| − |G|(160) bits shorter private key, and |G| + |p| (1184) bits shorter public key.…”

mentioning

confidence: 99%

Special issue of trust, security, and privacy for emerging applications in computer and information systems

Wang

Al‐Dubai

2012

Concurrency and Computation

View full text Add to dashboard Cite

Satisfying the requirements of users on trust, security, and privacy in an efficient way is one of the key elements to almost all emerging applications in computer and information systems. However, traditional security technologies and measures may not satisfy these user requirements in open, dynamic, heterogeneous, and distributed computing environments. This necessitates adopting some emerging technologies, such as pervasive computing, peer-to-peer computing, grid computing, cloud computing, virtualization, and mobile and wireless technologies, to preserve trust, security, and privacy while users enjoy more scalable and comprehensive services.The main objectives of this special issue (SI) are to make available the state-of-the-art research results in design, development, and applications of trust, security, privacy, and related issues, such as technical, social, and cultural implications for emerging applications; to facilitate the recognition of leading contributions in the field; and to provide the best communication medium for the international research community.Following the Call for Papers, this special issue (SI) attracted 28 submissions. The final decision for the inclusion in this SI was strictly based on the outcome of the rigorous peer-review process to ensure that the papers published in the Journal are of top quality. Following the peer-review process, only seven papers have been accepted for inclusion in this SI. The authors of the selected papers presented at the CIT 2010 conference included at least 30% new and significant material for this SI.The selected seven papers span a range of important topics including efficient signcryption, finegrained reputation systems in the grid environment, fuzzy trust mechanisms for distributed networks, many-core graphics processing units, cryptography authentication protocols, trusted peer-to-peer mobile social networks, and efficient radio frequency identification authentication protocol. The contributions of these papers are outlined as follows.Efficient signcryption in the standard model [1]: An efficient signcryption scheme is proposed. Compared with Tan's scheme, it has |G| + |p| (320) bits shorter ciphertext, 2|p| À |G|(160) bits shorter private key, and |G| + |p| (1184) bits shorter public key. The scheme only needs a public key/private key pair, whereas in Tan's scheme, a user must hold two public key/private key pairs at a time if it acts as both sender and receiver at the same time.A QoS-based fine-grained reputation system in the grid environment [2]: The authors present an efficient reputation system, where economic elements are considered to make the reputation system more sensitive in the commercial grid environments. Moreover, the weighted combination of interorganizational trust, direct trust, and recommended trust makes the reputation system more robust against collusion attacks.LFTM, linguistic fuzzy trust mechanism for distributed networks [3]: An adaptation of a bio-inspired trust model to deal with linguistic fuzzy labels is proposed. The...

show abstract

Efficient signcryption in the standard model

Cited by 3 publications

References 25 publications

ID-based key-insulated signcryption with equality test in cloud computing

ID-based key-insulated signcryption with equality test in cloud computing

Self‐certified proxy convertible authenticated encryption: formal definitions and a provably secure scheme

Special issue of trust, security, and privacy for emerging applications in computer and information systems

Contact Info

Product

Resources

About