scholarly journals Providing a Secure Cloud Storage by Using Attribute Based Temporary Key Word Search Scheme

2019 ◽  
Vol 8 (S3) ◽  
pp. 117-121
Author(s):  
Likhita Meka ◽  
Srivyshnavi Pagadala
Keyword(s):  
Keyword Search ◽  
Information Leakage ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Time Interval ◽  
Diffie Hellman ◽  
Cryptographic Primitive ◽  
Key Policy ◽  
Secure Cloud Storage ◽  
Word Search

The cloud providers are not fully trusted in the accept of temporary keyword search on confidential data. Hence this is the main focus of this research, it is necessary to outsource data in the encrypted format. In the attribute-based keyword search scheme the authorized users generate some tokens which were in encrypted format and send them to cloud for the search operation. These tokens can be used to extract all the cipher texts which are generated at any time and contain the search token which were generated by authorized users. Since this may lead to some information leakage, a new cryptographic primitive is introduced which is more secure to propose a scheme in which the search tokens can only extract the cipher texts generated in a specified time interval and that cryptographic primitive is called key-policy attribute-based temporary keyword search (KPABTKS) which provide this property. To evaluate the security, we have to prove that the proposed scheme achieves the keyword secrecy property and is secure against selectively chosen keyword attack (SCKA) both in the random oracle model and Decisional Bilinear Diffie-Hellman (DBDH) assumption. And at last the research will show the complexity of the encryption algorithm is linear with respect to the number of the involved attributes.

scholarly journals A data-sharing scheme that supports multi-keyword search for electronic medical records

PLoS ONE ◽  
2021 ◽  
Vol 16 (1) ◽  
pp. e0244979
Author(s):  
Shufen Niu ◽  
Wenke Liu ◽  
Song Han ◽  
Lizhi Fang
Keyword(s):  
Data Sharing ◽  
Electronic Medical Records ◽  
Private Information ◽  
Medical Records ◽  
Keyword Search ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Sharing Scheme ◽  
Diffie Hellman ◽  
Secure Search

As cloud storage technology develops, data sharing of cloud-based electronic medical records (EMRs) has become a hot topic in the academia and healthcare sectors. To solve the problem of secure search and sharing of EMR in cloud platforms, an EMR data-sharing scheme supporting multi-keyword search is proposed. The proposed scheme combines searchable encryption and proxy re-encryption technologies to perform keyword search and achieve secure sharing of encrypted EMR. At the same time, the scheme uses a traceable pseudo identity to protect the patient’s private information. Our scheme is proven secure based on the modified Bilinear Diffie-Hellman assumption and Quotient Decisional Bilinear Diffie-Hellman assumption under the random oracle model. The performance of our scheme is evaluated through theoretical analysis and numerical simulation.

Short Online/Off-line Signature Scheme for Wireless Sensor Networks

2015 ◽  
Vol 9 (1) ◽  
pp. 47-61
Author(s):  
Anser Ghazzaal Ali Alquraishee ◽  
Jayaprakash Kar ◽  
Naomie Salim
Keyword(s):  
Computational Cost ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Signature Scheme ◽  
Diffie Hellman ◽  
Two Phases ◽  
Chosen Message Attack

This article proposes a novel construction of short Online/Off-line signature scheme with provable security in the random oracle model for wireless sensor network (WSN). Security of the proposed scheme relies on k-CAA Problem as well as Computational Diffie-Hellman problem and is resistant against chosen message attack. The scheme is suited for broadcast authentication and integrity of message exchanging between the sensor nodes. The process of generation of the signature is carried out in two phases online and off-line. The heavy computation is performed in off-line phase, i.e the base station. The actual signature will be generated in the sensor nodes. The authors assume that the online phase is more efficient. Here they have evaluated the size of the signature with respect to the size of the user's public key and compare with some current schemes. Also, the authors have evaluated the computational cost and time which shows the scheme is most suited to implement on sensor node.

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.

Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

2013 ◽  
Vol 457-458 ◽  
pp. 1262-1265
Author(s):  
Min Qin Chen ◽  
Qiao Yan Wen ◽  
Zheng Ping Jin ◽  
Hua Zhang
Keyword(s):  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Blind Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Diffie Hellman ◽  
Identity Based ◽  
Certificateless Signature

Based an identity-based signature scheme, we givea certificateless signature scheme. And then we propose a certificateless blind signature (CLBS) scheme in this paper. This schemeis more efficient than those of previous schemes by pre-computing the pairing e (P, P)=g. Based on CL-PKC, it eliminates theusing of certificates in the signature scheme with respect to thetraditional public key cryptography (PKC) and solves key escrowproblems in ID-based signature schemes. Meanwhile it retains themerits of BS schemes. The proposed CLBS scheme is existentialunforgeable in the random oracle model under the intractabilityof the q-Strong Diffie-Hellman problem.

On the General Construction of Tightly Secure Identity-Based Signature Schemes

2020 ◽  
Vol 63 (12) ◽  
pp. 1835-1848
Author(s):  
Ge Wu ◽  
Zhen Zhao ◽  
Fuchun Guo ◽  
Willy Susilo ◽  
Futai Zhang
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
General Construction ◽  
Security Level ◽  
Signature Schemes ◽  
Small Constant ◽  
Security Parameter ◽  
Cryptographic Primitive ◽  
Identity Based ◽  
Tight Security

Abstract A tightly secure scheme has a reduction, where the reduction loss is a small constant. Identity-based signature (IBS) is an important cryptographic primitive, and tightly secure IBS schemes enjoy the advantage that the security parameter can be optimal to achieve a certain security level. General constructions of IBS schemes (Bellare, M., Namprempre, C., and Neven, G. (2004) Security Proofs for Identity-Based Identification and Signature Schemes. In Proc. EUROCRYPT 2004, May 2–6, pp. 268–286. Springer, Berlin, Interlaken, Switzerland; Galindo, D., Herranz, J., and Kiltz, E. (2006) On the Generic Construction of Identity-Based Signatures With Additional Properties. In Proceedings of ASIACRYPT 2006, December 3–7, pp. 178–193. Springer, Berlin, Shanghai, China) and their security have been extensively studied. However, the security is not tight and how to generally construct a tightly secure IBS scheme remains unknown. In this paper, we concentrate on the general constructions of IBS schemes. We first take an insight into previous constructions and analyze the reason why it cannot achieve tight security. To further study possible tightly secure constructions, we propose another general construction, which could be seen as a different framework of IBS schemes. Our construction requires two traditional signature schemes, whereas the construction by Bellare et al. uses one scheme in a two-round iteration. There are no additional operations in our general construction. Its main advantage is providing the possibility of achieving tight security for IBS schemes in the random oracle model. Combining two known signature schemes, we present an efficient IBS scheme with tight security as an example.

scholarly journals A Certificateless Noninteractive Key Exchange Protocol with Provable Security

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Xuefei Cao ◽  
Lanjun Dang ◽  
Yingzi Luan ◽  
Wei You
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Key Exchange ◽  
Public Key ◽  
Communication Overhead ◽  
Key Exchange Protocol ◽  
The Public ◽  
Diffie Hellman ◽  
Message Exchange ◽  
Certificateless Public Key Cryptosystem

In this paper, we propose a certificateless noninteractive key exchange protocol. No message exchange is required in the protocol, and this feature will facilitate the applications where the communication overhead matters, for example, the communications between the satellites and the earth. The public key certificate is removed as well as the key escrow problem using the certificateless public key cryptosystem. The security of the protocol rests on the bilinear Diffie–Hellman problem, and it could be proved in the random oracle model. Compared with previous protocols, the new protocol reduces the running time by at least 33.0%.

A Key-Policy Attribute-Based Temporary Keyword Search scheme for Secure Cloud Storage

2020 ◽  
Vol 8 (3) ◽  
pp. 660-671 ◽  
Author(s):  
Mohammad Hassan Ameri ◽  
Mahshid Delavar ◽  
Javad Mohajeri ◽  
Mahmoud Salmasizadeh
Keyword(s):  
Cloud Storage ◽  
Keyword Search ◽  
Key Policy ◽  
Secure Cloud Storage

New Signature and Multi-Signature Schemes with Tight Security Reduction Based on D-DDH Problem

2012 ◽  
Vol 263-266 ◽  
pp. 3052-3059
Author(s):  
Ze Cheng Wang
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Main Method ◽  
Discrete Logarithms ◽  
Diffie Hellman ◽  
Intractable Problem ◽  
Tight Security

Based on the newly introduced d-decisional Diffie-Hellman (d-DDH) intractable problem, a signature scheme and a multi-signature scheme are proposed. The main method in the constructions is a transformation of a knowledge proof on the equality of two discrete logarithms. The two schemes are proved secure in the random oracle model and the security reductions to the d-DDH problem are tight. Moreover, one can select different d for different security demand of applications. Thus the schemes are secure, efficient and practical.

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.

scholarly journals NEW EXTENSIONS OF PAIRING-BASED SIGNATURES INTO UNIVERSAL (MULTI) DESIGNATED VERIFIER SIGNATURES

2009 ◽  
Vol 20 (01) ◽  
pp. 109-133 ◽  
Author(s):  
DAMIEN VERGNAUD
Keyword(s):  
Random Oracle Model ◽  
Digital Signatures ◽  
Random Oracle ◽  
Security Model ◽  
Diffie Hellman ◽  
Designated Verifier ◽  
Short Signatures

The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly verifiable digital signatures but have an additional functionality which allows any holder of a signature to designate the signature to any desired verifier. This designated verifier can check that the message was indeed signed, but is unable to convince anyone else of this fact. We propose new efficient constructions for pairing-based short signatures. Our first scheme is based on Boneh-Boyen signatures and its security can be analyzed in the standard security model. We prove its resistance to forgery assuming the hardness of the so-called strong Diffie-Hellman problem, under the knowledge-of-exponent assumption. The second scheme is compatible with the Boneh-Lynn-Shacham signatures and is proven unforgeable, in the random oracle model, under the assumption that the computational bilinear Diffie-Hellman problem is untractable. Both schemes are designed for devices with constrained computation capabilities since the signing and the designation procedure are pairing-free. Finally, we present extensions of these schemes in the multi-user setting proposed by Desmedt in 2003.

Sign in / Sign up

Export Citation Format

Share Document