Self-Generated-Certificate Public Key Encryption Without Pairing

Abstract

Abstract. Certificateless Public Key Cryptography (CL-PKC) has very appealing features, namely it does not require any public key certification (cf. traditional Public Key Cryptography) nor having key escrow problem (cf. Identity-Based Cryptography). However, it does suffer to the Denialof-Decryption (DoD) Attack called by Liu and Au [1], as its nature is similar to the well known Denial-of-Service (DoS) Attack. Based on CL-PKC, they introduced a new paradigm called Self-Generated-Certificate Public Key Cryptography (SGC-PKC) that captured the DoD Attack and proposed a first scheme derived from a novel application of Water's Identity-Based Encryption scheme. In this paper, we propose a new SGC-PKE scheme that does not depend on the bilinear pairings, which make it be more efficient and more short public keys than Liu and Au's scheme. More importantly, our scheme reaches Girault's trusted level 3 (cf. Girault's trusted level 2 of Liu and Au's scheme), the same level as is enjoyed in a traditional PKI.

General Certificateless Encryption and Timed-Release Encryption

“…A subtle change is that our user key generation algorithm KGen only takes the system parameter as input but not the identifier. In some CLE schemes [2,25,28, 31] the inclusion of the identifier, or the trapdoor for an identifier, is essential for the generation of the user public key. For these schemes, KGen can be executed only after Extract, so straightforward adaption results in inefficient TREs in which the size of the user public key grows linearly with the number of supported time periods.…”

“…[18]), the user secret key cannot be recovered from the trapdoor and the full private key. Moreover, some CLE formulations [2,25,31] do not have user secret keys at all. In TRE, user secret keys are held by each user, which makes it impossible to reduce the security of TRE to that of CLE.…”

“…It was believed [25,26,28] that [26] gave the first CLE in the standard model. However, it is possible to instantiate a prior generic construction in [14] with a PKE and an IBE in the standard model to obtain a secure CLE without random oracles.…”

“…The CLE proposal [25] uses similar ideas, but their security proof ignores the public key replacement of the target user being attacked. This limitation is removed in Sun, Zhang and Baek's work [31].…”

Optimal Placement and Power Allocation for Jammers in Wireless Mesh Networks

“…The cryptographic techniques involve the application of traditional algorithms such as Diffie-Hellman, RSA and elliptic curve cryptography [33]. Other cryptographic methods that have been adapted especially for wireless ad hoc networks include the use of threshold cryptography in ad hoc networks to develop a key management service [34], extensible authentication protocol-transport layer based security authentication with the use of asymmetric cryptography [35], public-key cryptosystems based on chaotic dynamics [36] as well as self-generated-certificate public key encryption for wireless ad hoc networks [37]. There are, however, several shortcomings related to public key cryptography such as increased complexity in protocol design, vulnerability to denial of service (DoS) attacks during the four-step handshake as well as the lack of effective user identity protection mechanisms [38].…”