Attacks In Random Oracle Model Research Articles

Secure Data Delivery With Identity-Based Linearly Homomorphic Network Coding Signature Scheme in IoT

With the appearance and flourishing development of the Internet of Things (IoT), wireless sensor networks technology has been attracting increasing attention. Network coding is an indispensable technology in the wireless sensor networks, which can improve network transmission throughput. However, pollution attacks is a serious security problem that must be faced in the process of data coding. Although the homomorphic network coding signature schemes can solve this troublesome, the high signature generation and verification cost of these schemes will reduce the transmission efficiency. In this article, we propose an efficient identity-based linearly homomorphic network coding signature scheme for wireless sensor networks to guarantee data integrity and authenticity. In our scheme, the computation cost of signature generation and verification are both independent of the size of the data packet. The scheme is proved secure against existential forgery under adaptive chosen identity and adaptive chosen subspace attacks in random oracle model. Using Java pairing-based Cryptography Library (JPBC), the simulation results illustrate that our scheme is more efficient in practical application.

Provably Secure Heterogeneous Access Control Scheme for Wireless Body Area Network.

Wireless body area network (WBAN) provides a medium through which physiological information could be harvested and transmitted to application provider (AP) in real time. Integrating WBAN in a heterogeneous Internet of Things (IoT) ecosystem would enable an AP to monitor patients from anywhere and at anytime. However, the IoT roadmap of interconnected 'Things' is still faced with many challenges. One of the challenges in healthcare is security and privacy of streamed medical data from heterogeneously networked devices. In this paper, we first propose a heterogeneous signcryption scheme where a sender is in a certificateless cryptographic (CLC) environment while a receiver is in identity-based cryptographic (IBC) environment. We then use this scheme to design a heterogeneous access control protocol. Formal security proof for indistinguishability against adaptive chosen ciphertext attack and unforgeability against adaptive chosen message attack in random oracle model is presented. In comparison with some of the existing access control schemes, our scheme has lower computation and communication cost.

Certificateless searchable public key encryption scheme for mobile healthcare system

As mobile communication technology develops, mobile healthcare system (MHS) is becoming a hot topic in academia and healthcare industry. MHS refers to providing medical services through mobile communication equipments. However, it faces many challenges, such as the finite storage, computing power and communication capabilities of MHS devices. To address this problem, the concept of cloud-based MHS has been proposed recently. Meanwhile, healthcare data outsourcing to cloud raises privacy and confidentiality concerns. In order to protect data security, we present an efficient certificateless public key encryption with keyword search (CLPEKS). Security analysis indicates that our scheme is secure resist chosen keyword and keyword guessing attacks in random oracle model. The computation costs of KeyGen, CLPEKS, Trapdoor and Test phases decreased by 84.68%, 55.04%, 36.1% and 28.73%, respectively, compared with Peng et al.’s scheme.

Attribute-based fuzzy identity access control in multicloud computing environments

Firstly, we propose a multiauthority ciphertext policy attribute-based encryption scheme. It achieves fine-grained access control based upon fuzzy identity over encrypted data without any trusted center or extra interaction among multiple authorities. Moreover, it satisfies the collusion resistance requirement as long as at least one of the attribute authorities is honest. The security proof demonstrates that the proposed scheme is secure against chosen plaintext attacks in random oracle model under decisional multilinear Diffie–Hellman assumption. Secondly, we construct an attribute-based access control system for proxy-based multicloud environment to achieve distributed access control without any trusted center, manager, or additional secret keys. In our construction, the original secret keys are split into a control key, a decryption key and a set of transformation keys. It only takes the mobile device a lightweight decryption with a single decryption key. The overwhelming majority of decryption operations are outsourced to cloud via transformation keys. In addition, the attribute revocation can be realized by updating transformation keys using the control key, while ciphertexts and user’s decryption key still remain unchanged. Furthermore, proxies are helpful to promote the collaboration among multiple clouds in file access control system. Finally, the performance analysis shows that our construction is flexible and practical for mobile users in proxy-based multicloud environment.

A Provably-Secure Transmission Scheme for Wireless Body Area Networks.

Wireless body area network (WBANs) is composed of sensors that collect and transmit a person's physiological data to health-care providers in real-time. In order to guarantee security of this data over open networks, a secure data transmission mechanism between WBAN and application provider's servers is of necessity. Modified medical data does not provide a true reflection of an individuals state of health and its subsequent use for diagnosis could lead to an irreversible medical condition. In this paper, we propose a lightweight certificateless signcryption scheme for secure transmission of data between WBAN and servers. Our proposed scheme not only provides confidentiality of data and authentication in a single logical step, it is lightweight and resistant to key escrow attacks. We further provide security proof that our scheme provides indistinguishability against adaptive chosen ciphertext attack and unforgeability against adaptive chosen message attack in random oracle model. Compared with two other Diffie-Hellman based signcryption schemes proposed by Barbosa and Farshim (BF) and another by Yin and Liang (YL), our scheme consumes 46 % and 8 % less energy during signcryption than BF and YL scheme respectively.

Provably secure strong designated verifier signature scheme based on coding theory

SummaryStrong Designated Verifier Signature (SDVS) provides authentication for the signer and the verifier such that the signer is assured that what s/he has signed, is only verified by the designated verifier. Currently, the security of most of the SDVS schemes is based on hard problems in the number theory. As it is proved that all kinds of cryptosystems which are based on the number theory will not tolerate quantum attacks, here, an SDVS scheme based on hard problems in coding theory is presented. We have proved that the suggested scheme is unforgeable under a chosen message attack in Random Oracle Model. Copyright © 2016 John Wiley & Sons, Ltd.

An Improved RSA-based Certificateless Signature Scheme for Wireless Sensor Networks

The entire world is looking to fulfill the need of the hour in terms of security. Certificateless cryptography is an efficient approach studied widely due to two reasons: first, it eliminates the need of certificate authority in public key infrastructure and second, it can resolve key escrow problem of ID-based cryptography. Recently, Zhang et al. proposed a novel security scheme based on RSA, applicable to real life applications but could not cope up with the well defined attacks. This paper, presents an RSA-based CertificateLess Signature (RSA-CLS) scheme applicable to wireless sensor networks. The security of RSA-CLS is based on the hardness assumption of Strong RSA. The scheme is proven to be secure against Type I and Type II attack in random oracle model.

Robust ECC-based authenticated key agreement scheme with privacy protection for Telecare medicine information systems.

To protect the transmission of the sensitive medical data, a secure and efficient authenticated key agreement scheme should be deployed when the healthcare delivery session is established via Telecare Medicine Information Systems (TMIS) over the unsecure public network. Recently, Islam and Khan proposed an authenticated key agreement scheme using elliptic curve cryptography for TMIS. They claimed that their proposed scheme is provably secure against various attacks in random oracle model and enjoys some good properties such as user anonymity. In this paper, however, we point out that any legal but malicious patient can reveal other user's identity. Consequently, their scheme suffers from server spoofing attack and off-line password guessing attack. Moreover, if the malicious patient performs the same time of the registration as other users, she can further launch the impersonation attack, man-in-the-middle attack, modification attack, replay attack, and strong replay attack successfully. To eliminate these weaknesses, we propose an improved ECC-based authenticated key agreement scheme. Security analysis demonstrates that the proposed scheme can resist various attacks and enables the patient to enjoy the remote healthcare services with privacy protection. Through the performance evaluation, we show that the proposed scheme achieves a desired balance between security and performance in comparisons with other related schemes.

Cryptanalysis and improvement of a certificateless signature scheme

Security analysis of the certificateless signature scheme proposed by Guo L L,et al.(Guo L L,Lin C L,Zhang S Y.Attack and improvement for certificateless signature scheme.Computer Engineering,2012,38(16): 134-137,141) showed that the scheme was insecure against public key replacement attack.An improved scheme which can resist public key replacement attack was proposed.The scheme was proved to be existentially unforgeable against adaptive chosen message and identity attacks in random oracle model,and the security was reduced to computational Diffie-Hellman assumption.Compared with other certificateless signature schemes based on bilinear pairing,the improved scheme has better computational efficiency.

Secure and efficient ID-based partially blind signature scheme

Partially blind signature allows signer to add some public information negotiated by signer and user to signature,and better solves the conflict between anonymity and controllability of blind signature.Utilizing the Shim's(SHIM K A.An ID-based aggregate signature scheme with constant pairing computations.The Journal of Systems and Software,2010,83(10): 1873-1880)ID-based signature scheme,a new provable secure ID-based partially blind signature scheme was proposed.The scheme was proved to be existentially unforgeable against adaptive chosen message and identity attacks in random oracle model,and the security was reduced to computational Diffie-Hellman assumption.Compared with other ID-based partially blind signature schemes in random oracle model,the proposed scheme has better computational efficiency and less communication.

Efficient ID-based multiproxy multisignature without bilinear maps in ROM

Most of the previously proposed identity-based multiproxy multisignature (IBMPMS) schemes used pairings in their construction. But pairing is regarded as an expensive cryptographic primitive in terms of complexity. The relative computation cost of a pairing is approximately more than ten times of the scalar multiplication over elliptic curve group. So, to reduce running time, we first define a model of a secure MPMS scheme, then propose an IBMPMS scheme without using pairings. We also prove the security of our scheme against chosen message attack in random oracle model. Our scheme’s construction avoids bilinear pairing operations but still provides signature in the ID-based setting and reduces running time heavily. Therefore, proposed scheme is more applicable than previous schemes in terms of computational efficiency for practical applications.

Provable secure proxy signature scheme without bilinear pairings

SUMMARYProxy signature is an active research area in cryptography. A proxy signature scheme allows an entity to delegate his or her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Many proxy signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is more than 10 times of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, we propose a proxy signature scheme without bilinear pairings and prove its security against adaptive chosen‐message attack in random oracle model. The security of our scheme is based on the hardness of the elliptic curve discrete logarithm problem. With the running time being saved greatly, our scheme is more practical than the previous related scheme for practical applications. Copyright © 2011 John Wiley & Sons, Ltd.

Efficient identity-based GQ multisignatures

ISO/IEC 14888 specifies a variety of digital signature mechanisms to sign messages of arbitrary length. These schemes can be applied to provide entity authentication, data origin authentication, non-repudiation, and data integrity verification. ISO/IEC 14888 consists of three parts under the general title Information technology—Security techniques—Digital signatures. Part II, or ISO/IEC 14888-2 specifies the general structure and the fundamental procedures for the generation and verification of an identity-based signature (IBS) mechanism for messages of arbitrary length. Particularly, the IBS scheme of Guillou and Quisquater (GQ) is described in Clauses 6–8. In this paper, an efficient identity-based multisignature (IBMS) scheme is proposed for the GQ IBS scheme, which allows multiple users using the ISO/IEC 14888-2 standard GQ scheme to generate multisignatures. The scheme is efficient in the sense that both the length and the verification time of the multisignatures are fixed. The proposed ID-based multisignature scheme is also secure against forgeability under adaptive chosen-message attack and adaptive chosen-identity attack in random oracle model.

Identity Based Strong Designated Verifier Signature Scheme

We propose an Identity Based Strong Designated Verifier Signature (IBSDVS) scheme using bilinear pairings. Designated Verifier Signature finds application in e-voting, auctions and call for tenders. We prove that the scheme is secure against existential forgery under adaptively chosen message and identity attack in random oracle model. We also show that the problem of delegatability does not exist in our scheme. Part of work was carried out when the author was affiliated to Secure Technology Lab., IDRBT, Hyderabad, India.