scholarly journals Secure integer division with a private divisor

2021 ◽  
Vol 2021 (4) ◽  
pp. 339-349
Author(s):  
Thijs Veugen ◽  
Mark Abspoel
Keyword(s):  
Secret Sharing ◽  
Communication Complexity ◽  
Security Model ◽  
Cloud Environment ◽  
Active Model ◽  
Integer Division

Abstract We consider secure integer division within a secret-sharing based secure multi-party computation framework, where the dividend is secret-shared, but the divisor is privately known to a single party. We mention various applications where this situation arises. We give a solution within the passive security model, and extend this to the active model, achieving a complexity linear in the input bit length. We benchmark both solutions using the well-known MP-SPDZ framework in a cloud environment. Our integer division protocol with a private divisor clearly outperforms the secret divisor solution, both in runtime and communication complexity.

Achieving Cloud Security Using a Third Party Auditor and Preserving Privacy for Shared Data Over a Public Cloud

2021 ◽  
pp. 1371-1391
Author(s):  
Vitthal Sadashiv Gutte ◽  
Sita Devulapalli
Keyword(s):  
Cloud Security ◽  
Third Party ◽  
Security Model ◽  
Cloud Environment ◽  
Public Cloud ◽  
Shared Data ◽  
Metadata File ◽  
Efficient Mechanisms ◽  
Different Levels ◽  
Access Security

Correctness of data and efficient mechanisms for data security, while transferring the file to and from Cloud, are of paramount importance in today's cloud-centric processing. A mechanism for correctness and efficient transfer of data is proposed in this article. While processing users request data, a set of attributes are defined and checked. States with attributes at different levels are defined to prevent unauthorized access. Security is provided while storing the data using a chunk generation algorithm and verification of chunks using lightweight Third-Party Auditor (TPA). TPA uses digital signatures to verify user's data that are generated by RSA with MD5 algorithms. The metadata file of generated chunks is encrypted using a modified AES algorithm. The proposed method prevents unauthorized users from accessing the data in the cloud environment, in addition to maintaining data integrity. Results of the proposed cloud security model implementation are discussed.

Ramp secret sharing with cheater identification in presence of rushing cheaters

2019 ◽  
Vol 11 (2) ◽  
pp. 103-113
Author(s):  
Jyotirmoy Pramanik ◽  
Avishek Adhikari
Keyword(s):  
Secret Sharing ◽  
Private Information ◽  
Information Storage ◽  
Small Positive Number ◽  
Secret Sharing Schemes ◽  
Security Model ◽  
Image Sharing ◽  
Secure Information ◽  
Unlimited Time ◽  
Secret Reconstruction

Abstract Secret sharing allows one to share a piece of information among n participants in a way that only qualified subsets of participants can recover the secret whereas others cannot. Some of these participants involved may, however, want to forge their shares of the secret(s) in order to cheat other participants. Various cheater identifiable techniques have been devised in order to identify such cheaters in secret sharing schemes. On the other hand, Ramp secret sharing schemes are a practically efficient variant of usual secret sharing schemes with reduced share size and some loss in security. Ramp secret sharing schemes have many applications in secure information storage, information-theoretic private information retrieval and secret image sharing due to producing relatively smaller shares. However, to the best of our knowledge, there does not exist any cheater identifiable ramp secret sharing scheme. In this paper we define the security model for cheater identifiable ramp secret sharing schemes and provide two constructions for cheater identifiable ramp secret sharing schemes. In addition, the second construction is secure against rushing cheaters who are allowed to submit their shares during secret reconstruction after observing other participants’ responses in one round. Also, we do not make any computational assumptions for the cheaters, i.e., cheaters may be equipped with unlimited time and resources, yet, the cheating probability would be bounded above by a very small positive number.

scholarly journals A Novel Hadoop Security Model for Addressing Malicious Collusive Workers

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Amr M. Sauber ◽  
Ahmed Awad ◽  
Amr F. Shawish ◽  
Passent M. El-Kafrawy
Keyword(s):  
Security Model ◽  
Cloud Environment ◽  
Master Node ◽  
Computing Model ◽  
System A ◽  
Proposed Model ◽  
Data Production ◽  
Hadoop Cluster ◽  
High Level ◽  
Novel Model

With the daily increase of data production and collection, Hadoop is a platform for processing big data on a distributed system. A master node globally manages running jobs, whereas worker nodes process partitions of the data locally. Hadoop uses MapReduce as an effective computing model. However, Hadoop experiences a high level of security vulnerability over hybrid and public clouds. Specially, several workers can fake results without actually processing their portions of the data. Several redundancy-based approaches have been proposed to counteract this risk. A replication mechanism is used to duplicate all or some of the tasks over multiple workers (nodes). A drawback of such approaches is that they generate a high overhead over the cluster. Additionally, malicious workers can behave well for a long period of time and attack later. This paper presents a novel model to enhance the security of the cloud environment against untrusted workers. A new component called malicious workers’ trap (MWT) is developed to run on the master node to detect malicious (noncollusive and collusive) workers as they convert and attack the system. An implementation to test the proposed model and to analyze the performance of the system shows that the proposed model can accurately detect malicious workers with minor processing overhead compared to vanilla MapReduce and Verifiable MapReduce (V-MR) model [1]. In addition, MWT maintains a balance between the security and usability of the Hadoop cluster.

scholarly journals Secure Cloud Key Management based on Robust Secret Sharing

2021 ◽  
Author(s):  
Ahmed Bentajer ◽  
Mustapha Hedabou ◽  
Sara Ennaama ◽  
Abderrahim Tahiri
Keyword(s):  
Cloud Computing ◽  
Secret Sharing ◽  
Key Management ◽  
Third Party ◽  
Cloud Provider ◽  
Cloud Environment ◽  
Critical Issues ◽  
Security Module ◽  
Performance Results ◽  
Multi Cloud

The aim of this paper is to propose a model to strengthen the security of key management in cloud computing, where the model is shared or entirely controlled by a non-trusted third party provider. Key management is not a straightforward matter for IT-teams, in addition to critical issues related to properly managing and securing the keys on providers’ infrastructures, they have to deal with concerns specific to multi-cloud key management. Hardware Security Module (HSM) solution that offers a secure on-premise encryption key management turned out be impracticable for widespread cloud deployment. HSM as a Service seems to be the best approach for key management in multi-cloud, but the service is wholly owned and managed by another cloud provider. In This paper, we present an efficient and secure cloud key management that fulfills the requirements of multi-cloud deployment. The proposed design splits the key into a blinded version of n shares that will be stored in encrypted format at the cloud provider side. To demonstrate the efficiency of the proposed design, we implement a fully featured prototype and evaluate its performance. Results analysis shows that the proposed design is highly efficient and can serve as a groundwork for using secret share as a way to protect keys in a multi-cloud environment.

scholarly journals A Quantum-Based Database Query Scheme for Privacy Preservation in Cloud Environment

2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Wenjie Liu ◽  
Peipei Gao ◽  
Zhihao Liu ◽  
Hanwu Chen ◽  
Maojun Zhang
Keyword(s):  
Data Privacy ◽  
Privacy Preservation ◽  
Communication Complexity ◽  
Data Item ◽  
Data Service ◽  
Cloud Environment ◽  
Database Query ◽  
Encrypted Data ◽  
Cloud Data ◽  
Management Effort

Cloud computing is a powerful and popular information technology paradigm that enables data service outsourcing and provides higher-level services with minimal management effort. However, it is still a key challenge to protect data privacy when a user accesses the sensitive cloud data. Privacy-preserving database query allows the user to retrieve a data item from the cloud database without revealing the information of the queried data item, meanwhile limiting user’s ability to access other ones. In this study, in order to achieve the privacy preservation and reduce the communication complexity, a quantum-based database query scheme for privacy preservation in cloud environment is developed. Specifically, all the data items of the database are firstly encrypted by different keys for protecting server’s privacy, and in order to guarantee the clients’ privacy, the server is required to transmit all these encrypted data items to the client with the oblivious transfer strategy. Besides, two oracle operations, a modified Grover iteration, and a special offset encryption mechanism are combined together to ensure that the client can correctly query the desirable data item. Finally, performance evaluation is conducted to validate the correctness, privacy, and efficiency of our proposed scheme.

Sign in / Sign up

Export Citation Format

Share Document