scholarly journals CloudaSec: A Novel Public-key Based Framework to Handle Data Sharing Security in Clouds

2014 ◽  
Author(s):  
Nesrine Kaaniche ◽  
Maryline Laurent ◽  
Mohammed El Barbori
Keyword(s):  
Data Sharing ◽  
Public Key

scholarly journals Chebyshev chaotic map-based ID-based cryptographic model using subtree and fuzzy-entity data sharing for public key cryptography

2018 ◽  
Vol 1 (1) ◽  
pp. e12 ◽  
Author(s):  
Chandrashekhar Meshram ◽  
Mohammad S. Obaidat ◽  
Sarita G. Meshram
Keyword(s):  
Data Sharing ◽  
Chaotic Map ◽  
Public Key Cryptography ◽  
Public Key ◽  
Chebyshev Chaotic Map

scholarly journals Key Aggregate Cryptosystem in Data Sharing in Cloud Performance

2019 ◽  
Vol 8 (11) ◽  
pp. 3434-3437
Keyword(s):  
Data Sharing ◽  
Cloud Storage ◽  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Cloud Platform ◽  
Fixed Size ◽  
The People ◽  
Share Data

Sharing data using cloud storage has become a prominent part of a lives therefore, it is necessary to be able to share data to the people we choose and which data we choose. In this article, Key Aggregate Cryptosystem scheme, a public key encryption scheme which produces fixed-size cipher texts [1], is studied comprehensively along with its application in sharing data by users across cloud platform. KAC provides efficient and flexible delegation of keys for sharing selective data using single aggregated key without compromising on other data stored in cloud. The scheme is implemented using python file integrated in the backend of a website, which is in Django and the cloud storage used is Amazon S3. The data is stored in buckets and can be accessed using the website. Users can also upload and download their data from the website, or even share after uploading on the cloud.

Proxy-based public-key cryptosystem for secure and efficient IoT-based cloud data sharing in the smart city

2021 ◽  
Author(s):  
Negalign Wake Hundera ◽  
Chuanjie Jin ◽  
Dagmawit Mesfin Geressu ◽  
Muhammad Umar Aftab ◽  
Oluwasanmi Ariyo Olanrewaju ◽  
...  
Keyword(s):  
Data Sharing ◽  
Smart City ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Cloud Data

scholarly journals A Secure Data Sharing Scheme with Designated Server

2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Binrui Zhu ◽  
Jiameng Sun ◽  
Jing Qin ◽  
Jixin Ma
Keyword(s):  
Data Sharing ◽  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
Cloud Platform ◽  
Sharing Scheme ◽  
Outsourced Data ◽  
Secure Data ◽  
Encryption Decryption ◽  
Designated Server

The cloud-assisted Internet of Things (CIoT) is booming, which utilizes powerful data processing capabilities of the cloud platform to solve massive Internet of Things (IoT) data. However, the CIoT faces new security challenges, such as the confidentiality of the outsourced data. Data encryption is a fundamental technique that can guarantee the confidentiality of outsourced data, but it limits target encrypted data retrieval from cloud platform. Public key encryption with keyword search (PEKS) provides a promising solution to address this problem. In PEKS, a cloud server can be authorized to search the keyword in encrypted documents and retrieve associated encrypted documents for the receiver. However, most existing PEKS schemes merely focus on keyword search function while ignoring the associated documents encryption/decryption function. Thus, in practice, a PEKS scheme must cooperate with another separated public key encryption (PKE) scheme to fulfill a completely secure data sharing scheme. To address this problem, in this paper, we propose a secure data sharing scheme with designated server that combines PKE scheme with PEKS scheme, which provides both keyword search and documents encryption/decryption functions. Furthermore, only the designated server can search the keyword via encrypted documents for enhanced security in our work. Moreover, our scheme also satisfies the public verifiability of search results, which includes both keywords and documents ciphertexts’ correctness and integrity. As to the security, our scheme provides stronger indistinguishability security of document and keyword in the proposed security model.

scholarly journals Mutual query data sharing protocol for public key encryption through chosen-ciphertext attack in cloud environment

2022 ◽  
Vol 12 (1) ◽  
pp. 853
Author(s):  
Tarasvi Lakum ◽  
Barige Thirumala Rao
Keyword(s):  
Data Sharing ◽  
Public Key ◽  
Communication Overhead ◽  
Public Key Encryption ◽  
Cloud Environment ◽  
Diffie Hellman ◽  
User Data ◽  
Time Limitations ◽  
Chosen Ciphertext Attack ◽  
Existing Data

<p><span>In this paper, we are proposing a mutual query data sharing protocol (MQDS) to overcome the encryption or decryption time limitations of exiting protocols like Boneh, rivest shamir adleman (RSA), Multi-bit transposed ring learning parity with noise (TRLPN), ring learning parity with noise (Ring-LPN) cryptosystem, key-Ordered decisional learning parity with noise (kO-DLPN), and KD_CS protocol’s. Titled scheme is to provide the security for the authenticated user data among the distributed physical users and devices. The proposed data sharing protocol is designed to resist the chosen-ciphertext attack (CCA) under the hardness solution for the query shared-strong diffie-hellman (SDH) problem. The evaluation of proposed work with the existing data sharing protocols in computational and communication overhead through their response time is evaluated.</span></p>

scholarly journals A Parallel and Forward Private Searchable Public-Key Encryption for Cloud-Based Data Sharing

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 28009-28020 ◽  
Author(s):  
Biwen Chen ◽  
Libing Wu ◽  
Li Li ◽  
Kim-Kwang Raymond Choo ◽  
Debiao He
Keyword(s):  
Data Sharing ◽  
Public Key ◽  
Public Key Encryption ◽  
Searchable Public Key Encryption

scholarly journals Broadcast Proxy Reencryption Based on Certificateless Public Key Cryptography for Secure Data Sharing

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Won-Bin Kim ◽  
Su-Hyun Kim ◽  
Daehee Seo ◽  
Im-Yeong Lee
Keyword(s):  
Data Sharing ◽  
Computational Efficiency ◽  
Computation Time ◽  
Public Key Cryptography ◽  
Bilinear Pairing ◽  
Public Key ◽  
Broadcast Encryption ◽  
Key Escrow ◽  
Certificateless Public Key Cryptography ◽  
Verification Problem

Broadcast proxy reencryption (BPRE), which combines broadcast encryption (BE) and proxy reencryption (PRE), is a technology used for the redistribution of data uploaded on the cloud to multiple users. BPRE reencrypts data encrypted by the distributor and then uploads it to the cloud into a ciphertext that at a later stage targets multiple recipients. As a result of this, flexible data sharing is possible for multiple recipients. However, various inefficiencies and vulnerabilities of the BE, such as the recipient anonymity problem and the key escrow problem, also creep into BPRE. Our aim in this study was to address this problem of the existing BPRE technology. The partial key verification problem that appeared in the process of solving the key escrow problem was solved, and the computational efficiency was improved by not using bilinear pairing, which requires a lot of computation time.

scholarly journals Identity Based Data Sharing and Profile Matching using Probabilistic Key in Cloud

2020 ◽  
Vol 8 (6) ◽  
pp. 3076-3080
Keyword(s):  
Data Sharing ◽  
Information Access ◽  
Public Key ◽  
Public Key Encryption ◽  
Bilinear Mapping ◽  
Profile Matching ◽  
Security Problem ◽  
Identity Based ◽  
Control Right ◽  
Use Of Health Care

Cloud technology is popular since the utilizations and their information are expanding hugely step by step. It gives usefulness to overseeing data information in a conveyed and pervasive way supporting many platform. Data sharing and security problem are the principle issue to the increasing use of health care, since health information is delicate. However issues, for example, risks of privacy exposure ,versatility in key administration, adaptable access and effective uses denial always been the most significant difficulties for accomplishing goodgrained cryptographically upheld information access control. Right now structure a protected information move and profile coordinating plan with probabilistic open key encryption in correspondence test to diminish the size of open key which helps in decreasing the capacity and furthermore time productive. Our probabilistic open key encryption plot when executed in a bilinear gathering, it can check whether two figure writings are scrambled of a similar message. Strangely, in encryption or decoding system bilinear mapping isn't required in Public Key Encryption conspire except if when individuals need to do in fairness test between two figure messages that might be produced utilizing diverse open keys. Additionally the profile coordinating component dependent on Probabilistic Public Key Encryption with fairness test( PPKEET) causes patient to discover companions in a security saving way with age of trapdoors and structure social connections as indicated by the desire. The security examination and trial results demonstrated that our plan is ensuring the information and giving right medicine in cloud.

But what do participants want? Comment on the “Data Sharing in Psychology” special section (2018).

2019 ◽  
Vol 74 (2) ◽  
pp. 245-247 ◽  
Author(s):  
Jorden A. Cummings ◽  
T. Eugene Day
Keyword(s):  
Data Sharing ◽  
Special Section
Sign in / Sign up

Export Citation Format

Share Document