Abstract: Cloud computing provides an economical and efficient solution for sharing data among the cloud users in the group , users sharing data in a multi-attorney manner preserving data and identity privacy from an untrusted cloud, it is still a challenging issue, due to frequent change of the membership in the group. In this paper, we propose a multi-attorney data sharing scheme for the dynamic groups in the cloud. By combing group signature and Tripple DES encryption techniques, any cloud user anonymously share the data with others. In addition, we analyze the security of our scheme with rigorous proofs, and demonstrate the efficiency of our scheme in experiments.Keywords: cloud computing, data sharing, privacy-preserving, access control, and dynamic groups.
Title: Secure Data Sharing For Dynamic Groups in Multi-Attorney Manner Using Cloud
Author: Vijaya Kumar Patil C, Manjunath H
International Journal of Recent Research in Mathematics Computer Science and Information Technology
ISSN 2350-1022
Paper Publications
Iaetsd secure data sharing of multi-owner groups in cloudIaetsd Iaetsd
This document proposes a secure multi-owner data sharing scheme for dynamic groups in the cloud. It allows any user in a group to securely store and share data with others in the cloud. The key contributions are:
1) Any user can store and share data files with others through the cloud in a multi-owner manner.
2) The computation overhead and ciphertext size are constant and independent of the number of revoked users.
3) User revocation can be achieved without updating remaining users' private keys.
4) New users can directly decrypt files stored before their participation.
The proposed scheme uses group signatures for anonymous authentication and dynamic broadcast encryption for secure data sharing. It aims to address challenges like
A Secure Multi-Owner Data Sharing Scheme for Dynamic Group in Public Cloud. IJCERT JOURNAL
In cloud computing outsourcing group resource among cloud users is a major challenge, so cloud computing provides a low-cost and well-organized solution. Due to frequent change of membership, sharing data in a multi-owner manner to an untrusted cloud is still its challenging issue. In this paper we proposed a secure multi-owner data sharing scheme for dynamic group in public cloud. By providing AES encryption with convergent key while uploading the data, any cloud user can securely share data with others. Meanwhile, the storage overhead and encryption computation cost of the scheme are independent with the number of revoked users. In addition, I analyze the security of this scheme with rigorous proofs. One-Time Password is one of the easiest and most popular forms of authentication that can be used for securing access to accounts. One-Time Passwords are often referred to as secure and stronger forms of authentication in multi-owner manner. Extensive security and performance analysis shows that our proposed scheme is highly efficient and satisfies the security requirements for public cloud based secure group sharing.
Secure data sharing for dynamic groups in multi-owner using cloudSagar Dhanake
This document summarizes a seminar presentation on secure data sharing for dynamic groups in multi-owner cloud environments. The presentation covered cloud computing fundamentals and challenges with identity privacy. It proposed a system called MONA that allows any group member to securely store and share encrypted data files on an untrusted cloud. Key features of MONA include dynamic group management such that new users can access previous data, anonymous yet traceable access control, and efficient user revocation. The presentation discussed the system architecture, models, modules including registration, login and file sharing, relevant algorithms, applications, advantages, and future work concerning reliability.
SMONA: Secure Multi Owner Data Sharing for Dynamic Groups in the Cloudijsrd.com
The data is stored in the cloud. Storing data should be risky. Cloud provider should be trustful because the data is confidentential. The Group manager keeps the record of group members. The key distribution is done to the group of each department. The Group members can access the stored data from cloud. The encryption-decryption technique is used to store the data. Any cloud user can anonymously share data with others by providing group signature and dynamic broadcast encryption techniques. When new member joined in the group, new granted users can directly decrypt data files uploaded without contacting with data owners. Proposing a new model for Sharing Secure Data in the Cloud for the Multiuser Group.
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the CloudShruthi Suresh
The document discusses secure multi-owner data sharing for dynamic groups in clouds. It outlines Mona, a scheme that uses dynamic broadcast encryption for access control and group signatures for authentication. Mona allows efficient revocation without updating other users' keys and supports anonymity and traceability. The document compares Mona to other schemes and finds Mona addresses issues around identity privacy and revocation more effectively. Future work aims to make Mona more reliable and scalable by handling failures of the group manager.
1) The document proposes a system model for secure data sharing in cloud environments using cryptography.
2) It aims to provide data confidentiality, access control of shared data, remove the burden of key management and file encryption/decryption for users, and support dynamic changes to user membership without requiring the data owner to always be online.
3) The proposed system addresses common challenges with secure data sharing in cloud computing like data security, access control, key management, and user revocation and rejoining.
Mona secure multi owner data sharing for dynamic groups in the cloudKrushna Panda
Any user in a dynamic group can anonymously share data on the cloud using Mona, a secure multi-owner data sharing scheme. Mona leverages group signatures and dynamic broadcast encryption so that the storage overhead and encryption costs are independent of the number of revoked users. It allows efficient user revocation without updating others' secret keys and new users can access previously shared data. Mona provides anonymity, access control, and traces misbehavior. It achieves efficient and secure data sharing for dynamic groups on an untrusted cloud.
This document proposes a secure multi-owner attribute authorities based data sharing scheme for dynamic groups in the cloud. It aims to enable secure data sharing in dynamic groups where there is no fixed attribute authority, using a key policy attribute-based encryption method to select dynamic attribute authorities. The proposed scheme uses group signatures, signed receipts, and dynamic broadcast encryption to allow cloud users to anonymously share data. It reduces computation cost and storage overhead compared to existing works, as the encryption computation cost and storage overhead are independent of the number of revoked users.
Iaetsd secure data sharing of multi-owner groups in cloudIaetsd Iaetsd
This document proposes a secure multi-owner data sharing scheme for dynamic groups in the cloud. It allows any user in a group to securely store and share data with others in the cloud. The key contributions are:
1) Any user can store and share data files with others through the cloud in a multi-owner manner.
2) The computation overhead and ciphertext size are constant and independent of the number of revoked users.
3) User revocation can be achieved without updating remaining users' private keys.
4) New users can directly decrypt files stored before their participation.
The proposed scheme uses group signatures for anonymous authentication and dynamic broadcast encryption for secure data sharing. It aims to address challenges like
A Secure Multi-Owner Data Sharing Scheme for Dynamic Group in Public Cloud. IJCERT JOURNAL
In cloud computing outsourcing group resource among cloud users is a major challenge, so cloud computing provides a low-cost and well-organized solution. Due to frequent change of membership, sharing data in a multi-owner manner to an untrusted cloud is still its challenging issue. In this paper we proposed a secure multi-owner data sharing scheme for dynamic group in public cloud. By providing AES encryption with convergent key while uploading the data, any cloud user can securely share data with others. Meanwhile, the storage overhead and encryption computation cost of the scheme are independent with the number of revoked users. In addition, I analyze the security of this scheme with rigorous proofs. One-Time Password is one of the easiest and most popular forms of authentication that can be used for securing access to accounts. One-Time Passwords are often referred to as secure and stronger forms of authentication in multi-owner manner. Extensive security and performance analysis shows that our proposed scheme is highly efficient and satisfies the security requirements for public cloud based secure group sharing.
Secure data sharing for dynamic groups in multi-owner using cloudSagar Dhanake
This document summarizes a seminar presentation on secure data sharing for dynamic groups in multi-owner cloud environments. The presentation covered cloud computing fundamentals and challenges with identity privacy. It proposed a system called MONA that allows any group member to securely store and share encrypted data files on an untrusted cloud. Key features of MONA include dynamic group management such that new users can access previous data, anonymous yet traceable access control, and efficient user revocation. The presentation discussed the system architecture, models, modules including registration, login and file sharing, relevant algorithms, applications, advantages, and future work concerning reliability.
SMONA: Secure Multi Owner Data Sharing for Dynamic Groups in the Cloudijsrd.com
The data is stored in the cloud. Storing data should be risky. Cloud provider should be trustful because the data is confidentential. The Group manager keeps the record of group members. The key distribution is done to the group of each department. The Group members can access the stored data from cloud. The encryption-decryption technique is used to store the data. Any cloud user can anonymously share data with others by providing group signature and dynamic broadcast encryption techniques. When new member joined in the group, new granted users can directly decrypt data files uploaded without contacting with data owners. Proposing a new model for Sharing Secure Data in the Cloud for the Multiuser Group.
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the CloudShruthi Suresh
The document discusses secure multi-owner data sharing for dynamic groups in clouds. It outlines Mona, a scheme that uses dynamic broadcast encryption for access control and group signatures for authentication. Mona allows efficient revocation without updating other users' keys and supports anonymity and traceability. The document compares Mona to other schemes and finds Mona addresses issues around identity privacy and revocation more effectively. Future work aims to make Mona more reliable and scalable by handling failures of the group manager.
1) The document proposes a system model for secure data sharing in cloud environments using cryptography.
2) It aims to provide data confidentiality, access control of shared data, remove the burden of key management and file encryption/decryption for users, and support dynamic changes to user membership without requiring the data owner to always be online.
3) The proposed system addresses common challenges with secure data sharing in cloud computing like data security, access control, key management, and user revocation and rejoining.
Mona secure multi owner data sharing for dynamic groups in the cloudKrushna Panda
Any user in a dynamic group can anonymously share data on the cloud using Mona, a secure multi-owner data sharing scheme. Mona leverages group signatures and dynamic broadcast encryption so that the storage overhead and encryption costs are independent of the number of revoked users. It allows efficient user revocation without updating others' secret keys and new users can access previously shared data. Mona provides anonymity, access control, and traces misbehavior. It achieves efficient and secure data sharing for dynamic groups on an untrusted cloud.
This document proposes a secure multi-owner attribute authorities based data sharing scheme for dynamic groups in the cloud. It aims to enable secure data sharing in dynamic groups where there is no fixed attribute authority, using a key policy attribute-based encryption method to select dynamic attribute authorities. The proposed scheme uses group signatures, signed receipts, and dynamic broadcast encryption to allow cloud users to anonymously share data. It reduces computation cost and storage overhead compared to existing works, as the encryption computation cost and storage overhead are independent of the number of revoked users.
Mona secure multi owner data sharing for dynamic groups in the cloudAvinash K S
1) The document proposes a secure multi-owner data sharing scheme called Mona for dynamic groups in the cloud. Mona allows any user in a group to anonymously share data with others using techniques like group signatures and dynamic broadcast encryption.
2) Mona supports efficient membership changes without updating secret keys. New users can decrypt pre-existing files and revoking users does not require updating keys of remaining users.
3) Mona provides privacy-preserving access control where users can anonymously access cloud resources while allowing identity tracing by the group manager when needed. It aims to achieve secure and flexible data sharing for dynamic groups in the cloud.
A secure anti collusion data sharing scheme for dynamic groups in the cloudKamal Spring
Benefited from cloud computing, users can achieve an effective and economical approach for data sharing among group members in the cloud with the characters of low maintenance and little management cost. Meanwhile, we must provide security guarantees for the sharing data files since they are outsourced. Unfortunately, because of the frequent change of the membership, sharing data while providing privacy-preserving is still a challenging issue, especially for an untrusted cloud due to the collusion attack. Moreover, for existing schemes, the security of key distribution is based on the secure communication channel, however, to have such channel is a strong assumption and is difficult for practice. In this paper, we propose a secure data sharing scheme for dynamic members. Firstly, we propose a secure way for key distribution without any secure communication channels, and the users can securely obtain their private keys from group manager. Secondly, our scheme can achieve fine-grained access control, any user in the group can use the source in the cloud and revoked users cannot access the cloud again after they are revoked. Thirdly, we can protect the scheme from collusion attack, which means that revoked users cannot get the original data file even if they conspire with the untrusted cloud. In our approach, by leveraging polynomial function, we can achieve a secure user revocation scheme. Finally, our scheme can achieve fine efficiency, which means previous users need not to update their private keys for the situation either a new user joins in the group or a user is revoked from the group.
A secure anti collusion data sharing scheme for dynamic groups in the cloud1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Encryption based multi user manner secured data sharing and storing in cloudprjpublications
This summary provides the key details from the document in 3 sentences:
The document proposes a secure multi-owner data sharing scheme for dynamic groups in cloud computing. The scheme allows any user in a group to securely store and share data files with others through the untrusted cloud. It uses techniques like group signature and dynamic broadcast encryption to provide anonymous access control while enabling the group manager to trace real identities when needed, and allows efficient user revocation and participation of new users.
A cloud storage system for sharing data securely with privacy preservation an...eSAT Journals
Abstract Cloud computing provides much-known services for storing user data over cloud server and it provides attention towards a broad set of technologies, rules and controls deployed to provide security for applications and data. As the more and more firm uses the cloud, security in cloud environment is becoming very important issue. It is much needed that companies should work with partners doing best practices of cloud security and which facilitate transparency for their solutions. Number of security solutions today depends on the authentication for security but it did not provide solution for the privacy problems while sharing data in the cloud environment. Data access request from the user itself may expose users’ private data no matter his request approved or not. So this becomes very important in sharing data in the cloud environment. In this paper we proposed a system which provides attention towards the above mentioned problem. In proposed system we used the concept of data anonymity for sending data access request to data owner and also provide the data auditing facility to detect fraud in the integrity of users shared data. Keywords: Cloud computing, privacy preservation, data integrity, data sharing, authentication
Iaetsd an efficient secure scheme for multi user in cloudIaetsd Iaetsd
This document proposes a secure multi-owner data sharing scheme for dynamic groups in the cloud. The scheme allows any user within a group to securely share data with others through a trusted cloud. It supports efficient dynamic groups where new users can directly access and modify files uploaded before their participation without contacting owners. User revocation is achieved through a public revocation list without changing remaining user keys. The scheme provides anonymity and security while ensuring storage and computation overhead remain constant regardless of revoked users. It aims to address challenges with existing systems through increasing redundancy of group managers and distributing workload across managers.
The document proposes a secure multi-owner data sharing scheme called Mona for dynamic groups in the cloud. Mona leverages group signature and dynamic broadcast encryption techniques to allow any cloud user to anonymously share data with others. It supports efficient dynamic groups where new users can access previously shared data without contacting owners. Mona provides secure access control and privacy preservation for group members while storing data on untrusted cloud storage. It aims to address limitations of existing schemes regarding user participation, revocation, and single data owner restrictions.
Integrity Privacy to Public Auditing for Shared Data in Cloud ComputingIJERA Editor
In cloud computing, many mechanisms have been proposed to allow not only a data owner itself but also a public verifier to efficiently perform integrity checking without downloading the entire data from the cloud, which is referred to as public auditing . In these mechanisms, data is divided into many small blocks, where each block is independently signed by the owner; and a random combination of all the blocks instead of the whole data is retrieved during integrity checking .However, public auditing for such shared data— while preserving identity privacy — remains to be an open challenge. Here, we only consider how to audit the integrity of shared data in the cloud with static groups. It means the group is pre-defined before shared data is created in the cloud and the membership of users in the group is not changed during data sharing. The original user is responsible for deciding who is able to share her data before outsourcing data to the cloud. Another interesting problem is how to audit the integrity of shared data in the cloud with dynamic groups — a new user can be added into the group and an existing group member can be revoked during data sharing.
Review on Key Based Encryption Scheme for Secure Data Sharing on CloudIRJET Journal
This document reviews key-based encryption schemes for secure data sharing on cloud. It discusses how traditional encryption techniques are not suitable for large scale data sharing due to complex key management. A key-based encryption scheme is proposed that allows a data owner to generate an aggregate encryption key and submit a single aggregate trapdoor for keyword search. This reduces key management complexity and the number of trapdoors needed compared to traditional techniques. The proposed scheme uses seven polynomial algorithms for security including key generation, encryption, key extraction and trapdoor generation. It aims to provide an effective solution for secure and scalable data sharing using cloud storage.
A Review on Key-Aggregate Cryptosystem for Climbable Knowledge Sharing in Clo...Editor IJCATR
The Data sharing is an important functionality in cloud storage. In this article, we show how to securely, efficiently, and
flexibly share data with others in cloud storage. We describe new public-key cryptosystems which produce constant-size ciphertexts
such that efficient delegation of decryption rights for any set of ciphertexts are possible. The novelty is that one can aggregate any set
of secret keys and make them as compact as a single key, but encompassing the power of all the keys being aggregated. In other
words, the secret key holder can release a constant-size aggregate key for flexible choices of ciphertext set in cloud storage, but the
other encrypted files outside the set remain confidential. This compact aggregate key can be conveniently sent to others or be stored in
a smart card with very limited secure storage. We provide formal security analysis of our schemes in the standard model. We also
describe other application of our schemes. In particular, our schemes give the first public-key patient controlled encryption for flexible
hierarchy, which was yet to be known.
secure multi-owner data sharing for dynamic groupsSuchithra Balan
The document presents a secure data sharing scheme for dynamic groups in cloud computing. The scheme leverages group signature and dynamic broadcast encryption techniques to allow cloud users to anonymously share data with others in a group while preserving identity privacy from an untrusted cloud. It aims to securely support data sharing in dynamic groups where attributes are not fixed and multiple owners are possible. The scheme's storage overhead and encryption costs are independent of the number of revoked users.
IRJET-Using Downtoken Secure Group Data Sharing on CloudIRJET Journal
The document proposes a secure group data sharing scheme on cloud using key aggregate search encryption (KASE). In the proposed scheme, a data owner can generate a single download token (DT) to share a group of encrypted files with multiple users. The users only need to upload the DT to the cloud to search and download the shared files. This reduces the complexity of managing multiple encryption keys compared to traditional schemes. The scheme provides security, dynamic changes, low computation and communication costs for file access and key updates.
E FFICIENT D ATA R ETRIEVAL F ROM C LOUD S TORAGE U SING D ATA M ININ...IJCI JOURNAL
Cloud computing is an emanating technology allowing
users to perform data processing, use as storage
and data admission services from around the world t
hrough internet. The Cloud service providers charge
depending on the user’s usage. Imposing confidentia
lity and scalability on cloud data increases the
complexity of cloud computing. As sensitive informa
tion is centralized into the cloud, this informatio
n must
be encrypted and uploaded to cloud for the data pri
vacy and efficient data utilization. As the data be
comes
complex and number of users are increasing searchin
g of the files must be allowed through multiple
keyword of the end users interest. The traditional
searchable encryption schemes allows users to searc
h in
the encrypted cloud data through keywords, which su
pport only Boolean search, i.e., whether a keyword
exists in a file or not, without any relevance of d
ata files and the queried keyword. Searching of dat
a in the
cloud using Single keyword ranked search results to
o coarse output and the data privacy is opposed usi
ng
server side ranking based on order-preserving encry
ption (OPE)
A secure-anti-collusion-data-sharing-scheme-for-dynamic-groups-in-the-cloudPvrtechnologies Nellore
This document proposes a secure data sharing scheme for dynamic groups in the cloud. It allows group members to securely access and share data files stored in the cloud. The scheme provides secure key distribution without requiring secure communication channels. It also enables fine-grained access control and prevents collusion attacks between revoked users and the cloud. When users join or leave the group, other users do not need to update their private keys. The scheme aims to address limitations of existing approaches that require updating file-block keys for revocations and have overhead linearly increasing with member/revocation changes.
Secret keys and the packets transportation for privacy data forwarding method...eSAT Publishing House
This document proposes a method for improving data security and privacy in cloud data forwarding. The method involves splitting a data owner's encrypted file into multiple packets, encrypting each packet, and storing the packets and encryption keys across multiple cloud servers. If the data owner wants to forward the file, they send the encrypted packets and verify the recipient's identity. To further enhance security, the decryption key is sent as an SMS rather than over the cloud servers. This integrates concepts of encryption, encoding, and key distribution to improve data confidentiality when files are forwarded in the cloud.
This document provides a high-level blueprint for a spa and salon software system. It outlines 18 main sections including an admin site dashboard, setup options for companies and franchises, services/products listing, customer management, inventory tracking, digital and offline marketing campaigns, analytics, reports, and a public-facing mobile app. The goal is to create an integrated software solution to manage all business operations and customer interactions for spas and salons.
An Advanced IR System of Relational Keyword Search Techniquepaperpublications3
Abstract: Now these days keyword search to relational data set becomes an area of research within the data base and Information Retrieval. There is no standard process of information retrieval, which will clearly show the accurate result also it shows keyword search with ranking. Execution time is retrieving of data is more in existing system. We propose a system for increasing performance of relational keyword search systems. In the proposed system we combine schema-based and graph-based approaches and propose a Relational Keyword Search System to overcome the mentioned disadvantages of existing systems and manage the information and user access the information very efficiently. Keyword Search with the ranking requires very low execution time. Execution time of retrieving information and file length during Information retrieval can be display using chart.Keywords: Keyword Search, Datasets, Information Retrieval Query Workloads, Schema-based Systems, Graph-based Systems, ranking, relational databases.
Title: An Advanced IR System of Relational Keyword Search Technique
Author: Dhananjay A. Gholap, Gumaste S. V
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Object Classification is an important task within the field of computer vision. Image classification refers to the labelling of images into one of a number of predefined categories. Classification includes image sensors, image pre-processing, object detection, object segmentation, feature extraction and object classification. Many classification techniques have been developed for image classification. In this survey various classification techniques are considered; Artificial Neural Network (ANN), Decision Tree (DT), Support Vector Machine (SVM) and Fuzzy Classification.Keywords: Image Classification, Artificial Neural Network, Decision Tree, Support Vector Machine, Fuzzy Classifier.
Title: Analysis of Classification Approaches
Author: Robin Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Delay Constrained Energy Efficient Data Transmission over WSNpaperpublications3
Abstract: In wireless sensor network generally concentrate on minimization of energy Consumption, Also reducing energy saving and end to end delay. Reduced the end to end delay is one of the main challenges in the Wireless Sensor Networks. In TDMA providing reliable packet transmission and two transmission scheduling schemes are used to maximize the end-end reliability within a delay bound in packet transmission called dedicated scheduling and shared scheduling. In addition, they formulate solutions for implementing two algorithms into two basic routing algorithms, single-path routing and any-path routing algorithm. The proposed system presented energy efficient sleep scheduling algorithm for reducing the energy for delay constrained in WLAN. This algorithm to maximize the energy saving for packet delay constraints and it determines sleep period and wake up time to be minimized, the aim of this project is proposed to maximize the length of sleep time under packet deadline constraints using green call algorithm. Keywords: Delay-constrained applications, energy efficiency, Sleep scheduling, wireless sensor network.
Title: Delay Constrained Energy Efficient Data Transmission over WSN
Author: H. Hasina Begaum
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
This document summarizes and analyzes six major data mining algorithms: C4.5, k-Means, SVM, Apriori, EM, and PageRank. It provides an overview of each algorithm, discusses their impact and applications, and reviews current and future research areas. The six algorithms cover classification, clustering, statistical learning, association rule mining, and link mining, which are core topics in data mining research.
Mona secure multi owner data sharing for dynamic groups in the cloudAvinash K S
1) The document proposes a secure multi-owner data sharing scheme called Mona for dynamic groups in the cloud. Mona allows any user in a group to anonymously share data with others using techniques like group signatures and dynamic broadcast encryption.
2) Mona supports efficient membership changes without updating secret keys. New users can decrypt pre-existing files and revoking users does not require updating keys of remaining users.
3) Mona provides privacy-preserving access control where users can anonymously access cloud resources while allowing identity tracing by the group manager when needed. It aims to achieve secure and flexible data sharing for dynamic groups in the cloud.
A secure anti collusion data sharing scheme for dynamic groups in the cloudKamal Spring
Benefited from cloud computing, users can achieve an effective and economical approach for data sharing among group members in the cloud with the characters of low maintenance and little management cost. Meanwhile, we must provide security guarantees for the sharing data files since they are outsourced. Unfortunately, because of the frequent change of the membership, sharing data while providing privacy-preserving is still a challenging issue, especially for an untrusted cloud due to the collusion attack. Moreover, for existing schemes, the security of key distribution is based on the secure communication channel, however, to have such channel is a strong assumption and is difficult for practice. In this paper, we propose a secure data sharing scheme for dynamic members. Firstly, we propose a secure way for key distribution without any secure communication channels, and the users can securely obtain their private keys from group manager. Secondly, our scheme can achieve fine-grained access control, any user in the group can use the source in the cloud and revoked users cannot access the cloud again after they are revoked. Thirdly, we can protect the scheme from collusion attack, which means that revoked users cannot get the original data file even if they conspire with the untrusted cloud. In our approach, by leveraging polynomial function, we can achieve a secure user revocation scheme. Finally, our scheme can achieve fine efficiency, which means previous users need not to update their private keys for the situation either a new user joins in the group or a user is revoked from the group.
A secure anti collusion data sharing scheme for dynamic groups in the cloud1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Encryption based multi user manner secured data sharing and storing in cloudprjpublications
This summary provides the key details from the document in 3 sentences:
The document proposes a secure multi-owner data sharing scheme for dynamic groups in cloud computing. The scheme allows any user in a group to securely store and share data files with others through the untrusted cloud. It uses techniques like group signature and dynamic broadcast encryption to provide anonymous access control while enabling the group manager to trace real identities when needed, and allows efficient user revocation and participation of new users.
A cloud storage system for sharing data securely with privacy preservation an...eSAT Journals
Abstract Cloud computing provides much-known services for storing user data over cloud server and it provides attention towards a broad set of technologies, rules and controls deployed to provide security for applications and data. As the more and more firm uses the cloud, security in cloud environment is becoming very important issue. It is much needed that companies should work with partners doing best practices of cloud security and which facilitate transparency for their solutions. Number of security solutions today depends on the authentication for security but it did not provide solution for the privacy problems while sharing data in the cloud environment. Data access request from the user itself may expose users’ private data no matter his request approved or not. So this becomes very important in sharing data in the cloud environment. In this paper we proposed a system which provides attention towards the above mentioned problem. In proposed system we used the concept of data anonymity for sending data access request to data owner and also provide the data auditing facility to detect fraud in the integrity of users shared data. Keywords: Cloud computing, privacy preservation, data integrity, data sharing, authentication
Iaetsd an efficient secure scheme for multi user in cloudIaetsd Iaetsd
This document proposes a secure multi-owner data sharing scheme for dynamic groups in the cloud. The scheme allows any user within a group to securely share data with others through a trusted cloud. It supports efficient dynamic groups where new users can directly access and modify files uploaded before their participation without contacting owners. User revocation is achieved through a public revocation list without changing remaining user keys. The scheme provides anonymity and security while ensuring storage and computation overhead remain constant regardless of revoked users. It aims to address challenges with existing systems through increasing redundancy of group managers and distributing workload across managers.
The document proposes a secure multi-owner data sharing scheme called Mona for dynamic groups in the cloud. Mona leverages group signature and dynamic broadcast encryption techniques to allow any cloud user to anonymously share data with others. It supports efficient dynamic groups where new users can access previously shared data without contacting owners. Mona provides secure access control and privacy preservation for group members while storing data on untrusted cloud storage. It aims to address limitations of existing schemes regarding user participation, revocation, and single data owner restrictions.
Integrity Privacy to Public Auditing for Shared Data in Cloud ComputingIJERA Editor
In cloud computing, many mechanisms have been proposed to allow not only a data owner itself but also a public verifier to efficiently perform integrity checking without downloading the entire data from the cloud, which is referred to as public auditing . In these mechanisms, data is divided into many small blocks, where each block is independently signed by the owner; and a random combination of all the blocks instead of the whole data is retrieved during integrity checking .However, public auditing for such shared data— while preserving identity privacy — remains to be an open challenge. Here, we only consider how to audit the integrity of shared data in the cloud with static groups. It means the group is pre-defined before shared data is created in the cloud and the membership of users in the group is not changed during data sharing. The original user is responsible for deciding who is able to share her data before outsourcing data to the cloud. Another interesting problem is how to audit the integrity of shared data in the cloud with dynamic groups — a new user can be added into the group and an existing group member can be revoked during data sharing.
Review on Key Based Encryption Scheme for Secure Data Sharing on CloudIRJET Journal
This document reviews key-based encryption schemes for secure data sharing on cloud. It discusses how traditional encryption techniques are not suitable for large scale data sharing due to complex key management. A key-based encryption scheme is proposed that allows a data owner to generate an aggregate encryption key and submit a single aggregate trapdoor for keyword search. This reduces key management complexity and the number of trapdoors needed compared to traditional techniques. The proposed scheme uses seven polynomial algorithms for security including key generation, encryption, key extraction and trapdoor generation. It aims to provide an effective solution for secure and scalable data sharing using cloud storage.
A Review on Key-Aggregate Cryptosystem for Climbable Knowledge Sharing in Clo...Editor IJCATR
The Data sharing is an important functionality in cloud storage. In this article, we show how to securely, efficiently, and
flexibly share data with others in cloud storage. We describe new public-key cryptosystems which produce constant-size ciphertexts
such that efficient delegation of decryption rights for any set of ciphertexts are possible. The novelty is that one can aggregate any set
of secret keys and make them as compact as a single key, but encompassing the power of all the keys being aggregated. In other
words, the secret key holder can release a constant-size aggregate key for flexible choices of ciphertext set in cloud storage, but the
other encrypted files outside the set remain confidential. This compact aggregate key can be conveniently sent to others or be stored in
a smart card with very limited secure storage. We provide formal security analysis of our schemes in the standard model. We also
describe other application of our schemes. In particular, our schemes give the first public-key patient controlled encryption for flexible
hierarchy, which was yet to be known.
secure multi-owner data sharing for dynamic groupsSuchithra Balan
The document presents a secure data sharing scheme for dynamic groups in cloud computing. The scheme leverages group signature and dynamic broadcast encryption techniques to allow cloud users to anonymously share data with others in a group while preserving identity privacy from an untrusted cloud. It aims to securely support data sharing in dynamic groups where attributes are not fixed and multiple owners are possible. The scheme's storage overhead and encryption costs are independent of the number of revoked users.
IRJET-Using Downtoken Secure Group Data Sharing on CloudIRJET Journal
The document proposes a secure group data sharing scheme on cloud using key aggregate search encryption (KASE). In the proposed scheme, a data owner can generate a single download token (DT) to share a group of encrypted files with multiple users. The users only need to upload the DT to the cloud to search and download the shared files. This reduces the complexity of managing multiple encryption keys compared to traditional schemes. The scheme provides security, dynamic changes, low computation and communication costs for file access and key updates.
E FFICIENT D ATA R ETRIEVAL F ROM C LOUD S TORAGE U SING D ATA M ININ...IJCI JOURNAL
Cloud computing is an emanating technology allowing
users to perform data processing, use as storage
and data admission services from around the world t
hrough internet. The Cloud service providers charge
depending on the user’s usage. Imposing confidentia
lity and scalability on cloud data increases the
complexity of cloud computing. As sensitive informa
tion is centralized into the cloud, this informatio
n must
be encrypted and uploaded to cloud for the data pri
vacy and efficient data utilization. As the data be
comes
complex and number of users are increasing searchin
g of the files must be allowed through multiple
keyword of the end users interest. The traditional
searchable encryption schemes allows users to searc
h in
the encrypted cloud data through keywords, which su
pport only Boolean search, i.e., whether a keyword
exists in a file or not, without any relevance of d
ata files and the queried keyword. Searching of dat
a in the
cloud using Single keyword ranked search results to
o coarse output and the data privacy is opposed usi
ng
server side ranking based on order-preserving encry
ption (OPE)
A secure-anti-collusion-data-sharing-scheme-for-dynamic-groups-in-the-cloudPvrtechnologies Nellore
This document proposes a secure data sharing scheme for dynamic groups in the cloud. It allows group members to securely access and share data files stored in the cloud. The scheme provides secure key distribution without requiring secure communication channels. It also enables fine-grained access control and prevents collusion attacks between revoked users and the cloud. When users join or leave the group, other users do not need to update their private keys. The scheme aims to address limitations of existing approaches that require updating file-block keys for revocations and have overhead linearly increasing with member/revocation changes.
Secret keys and the packets transportation for privacy data forwarding method...eSAT Publishing House
This document proposes a method for improving data security and privacy in cloud data forwarding. The method involves splitting a data owner's encrypted file into multiple packets, encrypting each packet, and storing the packets and encryption keys across multiple cloud servers. If the data owner wants to forward the file, they send the encrypted packets and verify the recipient's identity. To further enhance security, the decryption key is sent as an SMS rather than over the cloud servers. This integrates concepts of encryption, encoding, and key distribution to improve data confidentiality when files are forwarded in the cloud.
This document provides a high-level blueprint for a spa and salon software system. It outlines 18 main sections including an admin site dashboard, setup options for companies and franchises, services/products listing, customer management, inventory tracking, digital and offline marketing campaigns, analytics, reports, and a public-facing mobile app. The goal is to create an integrated software solution to manage all business operations and customer interactions for spas and salons.
An Advanced IR System of Relational Keyword Search Techniquepaperpublications3
Abstract: Now these days keyword search to relational data set becomes an area of research within the data base and Information Retrieval. There is no standard process of information retrieval, which will clearly show the accurate result also it shows keyword search with ranking. Execution time is retrieving of data is more in existing system. We propose a system for increasing performance of relational keyword search systems. In the proposed system we combine schema-based and graph-based approaches and propose a Relational Keyword Search System to overcome the mentioned disadvantages of existing systems and manage the information and user access the information very efficiently. Keyword Search with the ranking requires very low execution time. Execution time of retrieving information and file length during Information retrieval can be display using chart.Keywords: Keyword Search, Datasets, Information Retrieval Query Workloads, Schema-based Systems, Graph-based Systems, ranking, relational databases.
Title: An Advanced IR System of Relational Keyword Search Technique
Author: Dhananjay A. Gholap, Gumaste S. V
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Object Classification is an important task within the field of computer vision. Image classification refers to the labelling of images into one of a number of predefined categories. Classification includes image sensors, image pre-processing, object detection, object segmentation, feature extraction and object classification. Many classification techniques have been developed for image classification. In this survey various classification techniques are considered; Artificial Neural Network (ANN), Decision Tree (DT), Support Vector Machine (SVM) and Fuzzy Classification.Keywords: Image Classification, Artificial Neural Network, Decision Tree, Support Vector Machine, Fuzzy Classifier.
Title: Analysis of Classification Approaches
Author: Robin Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Delay Constrained Energy Efficient Data Transmission over WSNpaperpublications3
Abstract: In wireless sensor network generally concentrate on minimization of energy Consumption, Also reducing energy saving and end to end delay. Reduced the end to end delay is one of the main challenges in the Wireless Sensor Networks. In TDMA providing reliable packet transmission and two transmission scheduling schemes are used to maximize the end-end reliability within a delay bound in packet transmission called dedicated scheduling and shared scheduling. In addition, they formulate solutions for implementing two algorithms into two basic routing algorithms, single-path routing and any-path routing algorithm. The proposed system presented energy efficient sleep scheduling algorithm for reducing the energy for delay constrained in WLAN. This algorithm to maximize the energy saving for packet delay constraints and it determines sleep period and wake up time to be minimized, the aim of this project is proposed to maximize the length of sleep time under packet deadline constraints using green call algorithm. Keywords: Delay-constrained applications, energy efficiency, Sleep scheduling, wireless sensor network.
Title: Delay Constrained Energy Efficient Data Transmission over WSN
Author: H. Hasina Begaum
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
This document summarizes and analyzes six major data mining algorithms: C4.5, k-Means, SVM, Apriori, EM, and PageRank. It provides an overview of each algorithm, discusses their impact and applications, and reviews current and future research areas. The six algorithms cover classification, clustering, statistical learning, association rule mining, and link mining, which are core topics in data mining research.
Comparative Performance Analysis & Complexity of Different Sorting Algorithmpaperpublications3
Abstract: An Algorithm is mix of guidelines without further order in offered request to take care of the predetermined issue. Sorting considered as the crucial operation for masterminding the rundown of components in a specific request either in rising or diving request in view of their key quality. Sorting system like: Insertion, Bubble, and Selection all have the quadratic time multifaceted ideal models O (N2) that breaking point their utilization as per the amount of parts. The objective of this paper audited different type of sorting algorithm like Insertion Sort, Selection, Bubble, Merge sort their execution investigation as for their time complexity nature.Keywords: Sorting Algorithm, Bubble, Selection, Insertion, Merge Sort, Complexity.
Title: Comparative Performance Analysis & Complexity of Different Sorting Algorithm
Author: Shiv Shankar Maurya, Arti Rana, Ajay Vikram Singh
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)paperpublications3
Abstract: This paper presents an evaluation of open source e-learning platforms with the aim of finding the most suitable platform for extending to an adaptive one. The extended platform will be utilized in an operational teaching environment. Therefore, the overall functionality of the platform is as important as the adaptation capabilities, and the evaluation treats both issues in this paper .in this paper we will explain the proper and best learning platform for Users . In this we will compare one of the best learning platforms (Moodle and Blackbox) both are all of them best virtual learning platform. We will compare both virtual system its functionality and using best tool. This paper is focused on the Moodle Architecture and comparative study of Moodle, thus we discusses comparisons it between different virtual learning platform at last conclusion we will describe which learning platform is best for users.Keywords: E-learning, Blackboard, Moodle, tools, function, methodology.
Title: A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
Author: Kanak Sachan, Dr. Rajiv Singh
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELETpaperpublications3
Abstract: The Security is the most important aspect of Database, for maintain the integrity and as well as security of the system image watermarking is technique proposed at the year of 1996, in this paper we also implement image watermarking using 2-D biorthogonal Wavelt. The importance of transmitting digital information in digital watermarking system and the dissymmetric digital watermarking framework lived on media content communication is also being discussed in this paper. Then we apply watermarking embedding algorithm to keep the balance between watermarks’ imperceptibility and its robustness while the data is being sent on the communication channel.Keywords: Discrete Wavelet Transform (DWT), Gray Scale, Peak Signal to Noise Ratio (PSNR).
Title: Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Author: Abhinav Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Efficient task scheduling method can meet users' requirements, and improve the resource utilization, then increase the overall performance of the cloud computing environment. Cloud computing has new features, such as flexibility, Virtualization and etc., in this paper we propose a two levels task scheduling method based on load balancing in cloud computing. This task scheduling method meet user's requirements and get high resource utilization that simulation results in Cloud Sim simulator prove this.Keywords: cloud computing; task scheduling; virtualization.
Title: A Task Scheduling Algorithm in Cloud Computing
Author: Ali Bagherinia
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: The rapid growth of wireless content access implies the need for content placement and scheduling at wireless base stations. Here study a system under which users are divided into clusters based on their channel conditions, and their requests are represented by different queues at logical front ends. Requests might be elastic (implying no hard delay constraint) or inelastic (requiring that a delay target be met). Correspondingly, we have request queues that indicate the number of elastic requests, and deficit queues that indicate the deficit in inelastic service. In this project, content caching and scheduling are monitored. The user will send request to the server when the base station doesn’t have that file. The user who receives the file will become the base station for that file. To reduce memory consumption, when other user request the same file the base station send s that file delete it. The receiving user will become the base station for that file.Keywords: rapid growth of wireless content access implies placement and scheduling at wireless base stations.
Title: Scheduling Mechanism in Wireless Networks
Author: Deepa .C. G
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: CHOKe is a simple and stateless active queue management (AQM) scheme. Highly attractive property of Choke is that it can protect responsive TCP flows from unresponsive UDP flows. Packets currently queued in buffer, to penalize the high bandwidth flows. It can be implemented by using RED algorithm. In RED algorithm when packets arrives at a congested router. CHOKe draws a packet at a random from the FIFO buffer and compares it with the arriving packet. If both belong to same flow, then they are both dropped; else randomly chosen packet is left intact and arriving packet is admitted into the buffer with a probability that depend on the level of congestion. These algorithms are typically implemented in the transport protocols (e.g., TCP) of end-hosts. To ensure global fairness, such schemes require all users to adopt them and respond to network congestion properly.Keywords: CHOKe, Random Early Detection (RED), Congestion.
Title: Ephemeral Performance of Choke
Author: Suhitha K.C
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Renata Gimenes is a Brazilian journalist seeking a communications or marketing/PR opportunity. She has 20 years of experience in journalism, public relations, and integrated communications. Her experience includes reporting, producing, editing, and event coverage for news agencies, TV, radio, PR agencies, and more. She has a bachelor's degree in journalism, an MBA in marketing, and additional qualifications in print journalism, communication, and international journalism.
O documento discute como as empresas locadoras de equipamentos de movimentação estão aplicando sistemas de gerenciamento de frota para melhorar a gestão e reduzir custos em meio à crise econômica. Duas locadoras, Still e Crown, oferecem soluções tecnológicas que coletam e analisam dados dos equipamentos para otimizar o uso e a manutenção. Apesar da receptividade dos clientes, menos de 20% das máquinas dessas empresas contam com esses sistemas até o momento.
Eugene Hanes has over 30 years of experience in various roles including general clerk, operations administrator, quality assurance specialist, package handler, producer, singer, songwriter, commercial music designer, barber, and assistant manager. He has strong skills in Microsoft Office, data entry, document management systems, and virtual desktop applications. His objective is to obtain further knowledge and new opportunities using his existing skills.
Este documento presenta un cuestionario para identificar los estilos de aprendizaje de una persona. El cuestionario contiene varias filas con cuatro opciones cada una relacionadas con la manera de aprender o resolver problemas. La persona debe asignar un valor de 1 a 4 a cada opción, indicando cuál se ajusta más a su estilo y cuál menos. Luego, el documento explica cómo analizar los resultados para determinar si la persona tiene un estilo de aprendizaje asimilador, convergente, divergente u acomodador.
This document summarizes a proposed scheme for secure data sharing in dynamic groups in the cloud. It addresses key challenges including how to securely share data with fine-grained access control when group membership changes frequently. The proposed scheme uses key policy attribute-based encryption (KP-ABE) and group signatures to allow any cloud user to anonymously share data. It leverages techniques like dynamic broadcast encryption and signed receipts to reduce computation and storage overhead, making the costs independent of the number of revoked users. The scheme aims to enable secure multi-owner data sharing where attribute authorities are also dynamic.
This summarizes a research paper about an encryption-based secure data sharing and storage scheme for multi-user dynamic groups in the cloud. The proposed scheme leverages group signatures and dynamic broadcast encryption to allow any cloud user to anonymously share data while preserving identity privacy. It ensures storage overhead and encryption costs are independent of the number of users. The scheme provides security analysis and experiments demonstrating efficiency.
A secure anti collusion data sharing scheme for dynamic groups in the cloudNinad Samel
This document proposes a secure data sharing scheme for dynamic groups in the cloud that achieves:
1) Secure key distribution without secure communication channels by verifying user public keys.
2) Fine-grained access control where legitimate users can access data in the cloud while revoked users cannot.
3) Protection against collusion attacks where revoked users cannot obtain data files even by conspiring with the cloud.
4) Efficient support for dynamic groups where adding/removing users does not require updating other users' keys.
Mona secure multi owner data sharing for dynamic groups in the cloudJPINFOTECH JAYAPRAKASH
This document summarizes the "Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud" paper. It proposes a scheme called Mona that allows any user in a dynamic group to anonymously share data on the cloud. Mona uses group signatures and dynamic broadcast encryption so encryption costs are independent of revoked users. It provides anonymous yet traceable access control and efficient user revocation without updating keys.
Mona secure multi owner data sharing for dynamic groups in the cloudJPINFOTECH JAYAPRAKASH
The document proposes a secure multi-owner data sharing scheme called Mona for dynamic groups in the cloud. Mona allows any user in a group to anonymously share data with others in the cloud using group signatures and dynamic broadcast encryption. It aims to address challenges with existing schemes that have complexities increasing linearly with the number of owners and revoked users. The proposed Mona scheme achieves independent storage overhead and encryption costs from the number of revoked users and supports dynamic groups where new users can access previous files without owners.
IRJET- Security Enhancement for Sharing Data within Group Members in CloudIRJET Journal
1) The document proposes a secure data sharing scheme for sharing data within group members in the cloud. It aims to prevent collusion attacks and allow for secure sharing of data even as group membership changes dynamically.
2) The scheme uses encryption with private keys so that if a user's key is leaked, it will be difficult for others to access the shared data. A trusted authority authenticates users and stores encryption keys to determine responsibility if issues arise.
3) The scheme achieves secure key distribution without requiring secure communication channels by using public key verification. It also allows for fine-grained access control and secure revocation such that revoked users cannot access shared data even by colluding with the cloud.
A self destruction system for dynamic group data sharing in cloudeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Multi Owner Data Sharing & Outsourced Revocation Using Identity Based Encrypt...Eswar Publications
Cloud computing is an economical and effective solution for sharing group resource among cloud users. Unfortunately, sharing data in a multi-owner manner while protect data and identity privacy from an un trusted cloud is still a challenging issue, due to the recurrent change of the membership.The major aims of this method a secure multi-owner data sharing scheme.That is any user in the group can securely share data with others by un trusted cloud. Moreover, the real identities of data owners can be exposed by the group manager when disputes occur. User revocation can be achieved by a novel revocation list and no need to update the secret Keys of the
remaining users.The drawback of IBE is computation over head. To overcome the drawback introduces outsourcing computation.
Anonymous Key Based Secure File Encryption in CloudIRJET Journal
This document proposes a new system for secure file encryption and sharing in the cloud. It aims to address security issues with sharing data in social media. The key aspects of the proposed system are:
1. It creates separate databases for individual users and a local server to securely store user keys for encryption/decryption.
2. Files are encrypted using triple DES before being stored in the cloud to prevent unauthorized access.
3. A user can share files with others by providing encryption keys through the local server.
4. When a file is shared, a temporary server decrypts and re-encrypts the file with the recipient's key for added security.
The system aims to improve data security when
Secure Data Sharing In an Untrusted CloudIJERA Editor
Cloud computing is a huge area which basically provides many services on the basis of pay as you go. One of the fundamental services provided by cloud is data storage. Cloud provides cost efficiency and an efficient solution for sharing resource among cloud users. A secure and efficient data sharing scheme for groups in cloud is not an easy task. On one hand customers are not ready to share their identity but on other hand want to enjoy the cost efficiency provided by the cloud. It needs to provide identity privacy, multiple owner and dynamic data sharing without getting effected by the number of cloud users revoked. In this paper, any member of a group can completely enjoy the data storing and sharing services by the cloud. A secure data sharing scheme for dynamic cloud users is proposed in this paper. For which it uses group signature and dynamic broadcast encryption techniques such that any user in a group can share the information in a secured manner. Additionally the permission option is proposed for the security reasons. This means the file access permissions are generated by the admin and given to the user using Role Based Access Control (RBA) algorithm. The file access permissions are read, write and delete. In this, owner can provide files with options and accepts the users using that option. The revocation of cloud user is a function generated by the Admin for security purpose. The encryption computational cost and storage overhead is not dependent on the number of users revoked. We analyze the security by proofs and produce the cloud efficiency report using cloudsim.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
1. The document proposes a privacy-preserving public auditing mechanism called Oruta for shared data stored in the cloud.
2. Oruta allows a third party auditor (TPA) to efficiently verify the integrity of shared data for a group of users while preserving their identity privacy.
3. It exploits ring signatures to generate verification information for shared data blocks while keeping the identity of the signer private from the TPA.
1. The document proposes a system for secure user authentication and access control for encrypted data stored in the cloud. It aims to address issues with centralized access control and storing data in plaintext.
2. The proposed system uses a key distribution center to generate public, private, and access keys for authentication at different levels. Data is encrypted before being fragmented and distributed across multiple servers.
3. Only authorized users with proper keys can decrypt the data. Access policies set by data creators restrict which users can access files. Storing encrypted and distributed data along with key-based authentication aims to improve security over existing cloud storage systems.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
The capability of involving the selection sharing encrypted data with different users via public
cloud storage may greatly ease security concerns over not intended data leaks in the cloud. A key
challenge to designing such encryption schemes to be sustainable in the efficient management of
encryption keys. The desired flexibility of sharing any group of selected documents with any group of
users need for something different encryption keys to be used for different documents. However, this
also implies the urgent need of securely distributing to users a large number of keys for both encryption
and search, and those users will have to protected from danger store the received keys, and submit an
equally large number of keyword trapdoors to the cloud in order to perform search over the shared data
implied need for secure communication, storage, and complexity clearly to give to someone the
approach impractical. In this work a data owner only needs to distribute a single key to a user for
sharing a very large number of documents, and the user only needs to submit a single trapdoor to the
cloud for querying the shared documents. User Revocation is used for Key Updation. Forward Secrecy
and Backward Secrecy is used.
Towards Achieving Efficient and Secure Way to Share the DataIRJET Journal
This document discusses security and efficiency challenges with sharing data in the cloud. It notes that while cloud computing allows easy storage and sharing of data, this exposes user data to security attacks. When data is shared in the cloud, cryptographic and authentication techniques are needed to protect user data. Mechanisms for sharing data must also be efficient so they do not reduce cloud service performance or waste resources. The document reviews several existing approaches for secure and efficient data sharing in cloud computing and their limitations, noting the need for improved techniques that can handle multiple users and owners dynamically sharing data.
Fragmentation of Data in Large-Scale System For Ideal Performance and SecurityEditor IJCATR
Cloud computing is becoming prominent trend which offers the number of significant advantages. One of the ground laying
advantage of the cloud computing is the pay-as-per-use, where according to the use of the services, the customer has to pay. At present,
user’s storage availability improves the data generation. There is requiring farming out such large amount of data. There is indefinite
large number of Cloud Service Providers (CSP). The Cloud Service Providers is increasing trend for many number of organizations and
as well as for the customers that decreases the burden of the maintenance and local data storage. In cloud computing transferring data to
the third party administrator control will give rise to security concerns. Within the cloud, compromisation of data may occur due to
attacks by the unauthorized users and nodes. So, in order to protect the data in cloud the higher security measures are required and also
to provide security for the optimization of the data retrieval time. The proposed system will approach the issues of security and
performance. Initially in the DROPS methodology, the division of the files into fragments is done and replication of those fragmented
data over the cloud node is performed. Single fragment of particular file can be stored on each of the nodes which ensure that no
meaningful information is shown to an attacker on a successful attack. The separation of the nodes is done by T-Coloring in order to
prohibit an attacker to guess the fragment’s location. The complete data security is ensured by DROPS methodology
Similar to Secure Data Sharing For Dynamic Groups in Multi-Attorney Manner Using Cloud (19)
Main news related to the CCS TSI 2023 (2023/1695)Jakub Marek
An English 🇬🇧 translation of a presentation to the speech I gave about the main changes brought by CCS TSI 2023 at the biggest Czech conference on Communications and signalling systems on Railways, which was held in Clarion Hotel Olomouc from 7th to 9th November 2023 (konferenceszt.cz). Attended by around 500 participants and 200 on-line followers.
The original Czech 🇨🇿 version of the presentation can be found here: https://www.slideshare.net/slideshow/hlavni-novinky-souvisejici-s-ccs-tsi-2023-2023-1695/269688092 .
The videorecording (in Czech) from the presentation is available here: https://youtu.be/WzjJWm4IyPk?si=SImb06tuXGb30BEH .
"$10 thousand per minute of downtime: architecture, queues, streaming and fin...Fwdays
Direct losses from downtime in 1 minute = $5-$10 thousand dollars. Reputation is priceless.
As part of the talk, we will consider the architectural strategies necessary for the development of highly loaded fintech solutions. We will focus on using queues and streaming to efficiently work and manage large amounts of data in real-time and to minimize latency.
We will focus special attention on the architectural patterns used in the design of the fintech system, microservices and event-driven architecture, which ensure scalability, fault tolerance, and consistency of the entire system.
Northern Engraving | Modern Metal Trim, Nameplates and Appliance PanelsNorthern Engraving
What began over 115 years ago as a supplier of precision gauges to the automotive industry has evolved into being an industry leader in the manufacture of product branding, automotive cockpit trim and decorative appliance trim. Value-added services include in-house Design, Engineering, Program Management, Test Lab and Tool Shops.
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
This talk will cover ScyllaDB Architecture from the cluster-level view and zoom in on data distribution and internal node architecture. In the process, we will learn the secret sauce used to get ScyllaDB's high availability and superior performance. We will also touch on the upcoming changes to ScyllaDB architecture, moving to strongly consistent metadata and tablets.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
Your One-Stop Shop for Python Success: Top 10 US Python Development Providersakankshawande
Simplify your search for a reliable Python development partner! This list presents the top 10 trusted US providers offering comprehensive Python development services, ensuring your project's success from conception to completion.
In the realm of cybersecurity, offensive security practices act as a critical shield. By simulating real-world attacks in a controlled environment, these techniques expose vulnerabilities before malicious actors can exploit them. This proactive approach allows manufacturers to identify and fix weaknesses, significantly enhancing system security.
This presentation delves into the development of a system designed to mimic Galileo's Open Service signal using software-defined radio (SDR) technology. We'll begin with a foundational overview of both Global Navigation Satellite Systems (GNSS) and the intricacies of digital signal processing.
The presentation culminates in a live demonstration. We'll showcase the manipulation of Galileo's Open Service pilot signal, simulating an attack on various software and hardware systems. This practical demonstration serves to highlight the potential consequences of unaddressed vulnerabilities, emphasizing the importance of offensive security practices in safeguarding critical infrastructure.
How information systems are built or acquired puts information, which is what they should be about, in a secondary place. Our language adapted accordingly, and we no longer talk about information systems but applications. Applications evolved in a way to break data into diverse fragments, tightly coupled with applications and expensive to integrate. The result is technical debt, which is re-paid by taking even bigger "loans", resulting in an ever-increasing technical debt. Software engineering and procurement practices work in sync with market forces to maintain this trend. This talk demonstrates how natural this situation is. The question is: can something be done to reverse the trend?
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/temporal-event-neural-networks-a-more-efficient-alternative-to-the-transformer-a-presentation-from-brainchip/
Chris Jones, Director of Product Management at BrainChip , presents the “Temporal Event Neural Networks: A More Efficient Alternative to the Transformer” tutorial at the May 2024 Embedded Vision Summit.
The expansion of AI services necessitates enhanced computational capabilities on edge devices. Temporal Event Neural Networks (TENNs), developed by BrainChip, represent a novel and highly efficient state-space network. TENNs demonstrate exceptional proficiency in handling multi-dimensional streaming data, facilitating advancements in object detection, action recognition, speech enhancement and language model/sequence generation. Through the utilization of polynomial-based continuous convolutions, TENNs streamline models, expedite training processes and significantly diminish memory requirements, achieving notable reductions of up to 50x in parameters and 5,000x in energy consumption compared to prevailing methodologies like transformers.
Integration with BrainChip’s Akida neuromorphic hardware IP further enhances TENNs’ capabilities, enabling the realization of highly capable, portable and passively cooled edge devices. This presentation delves into the technical innovations underlying TENNs, presents real-world benchmarks, and elucidates how this cutting-edge approach is positioned to revolutionize edge AI across diverse applications.
"Choosing proper type of scaling", Olena SyrotaFwdays
Imagine an IoT processing system that is already quite mature and production-ready and for which client coverage is growing and scaling and performance aspects are life and death questions. The system has Redis, MongoDB, and stream processing based on ksqldb. In this talk, firstly, we will analyze scaling approaches and then select the proper ones for our system.
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Session 1 - Intro to Robotic Process Automation.pdfUiPathCommunity
👉 Check out our full 'Africa Series - Automation Student Developers (EN)' page to register for the full program:
https://bit.ly/Automation_Student_Kickstart
In this session, we shall introduce you to the world of automation, the UiPath Platform, and guide you on how to install and setup UiPath Studio on your Windows PC.
📕 Detailed agenda:
What is RPA? Benefits of RPA?
RPA Applications
The UiPath End-to-End Automation Platform
UiPath Studio CE Installation and Setup
💻 Extra training through UiPath Academy:
Introduction to Automation
UiPath Business Automation Platform
Explore automation development with UiPath Studio
👉 Register here for our upcoming Session 2 on June 20: Introduction to UiPath Studio Fundamentals: https://community.uipath.com/events/details/uipath-lagos-presents-session-2-introduction-to-uipath-studio-fundamentals/
"Frontline Battles with DDoS: Best practices and Lessons Learned", Igor IvaniukFwdays
At this talk we will discuss DDoS protection tools and best practices, discuss network architectures and what AWS has to offer. Also, we will look into one of the largest DDoS attacks on Ukrainian infrastructure that happened in February 2022. We'll see, what techniques helped to keep the web resources available for Ukrainians and how AWS improved DDoS protection for all customers based on Ukraine experience
[OReilly Superstream] Occupy the Space: A grassroots guide to engineering (an...Jason Yip
The typical problem in product engineering is not bad strategy, so much as “no strategy”. This leads to confusion, lack of motivation, and incoherent action. The next time you look for a strategy and find an empty space, instead of waiting for it to be filled, I will show you how to fill it in yourself. If you’re wrong, it forces a correction. If you’re right, it helps create focus. I’ll share how I’ve approached this in the past, both what works and lessons for what didn’t work so well.
Conversational agents, or chatbots, are increasingly used to access all sorts of services using natural language. While open-domain chatbots - like ChatGPT - can converse on any topic, task-oriented chatbots - the focus of this paper - are designed for specific tasks, like booking a flight, obtaining customer support, or setting an appointment. Like any other software, task-oriented chatbots need to be properly tested, usually by defining and executing test scenarios (i.e., sequences of user-chatbot interactions). However, there is currently a lack of methods to quantify the completeness and strength of such test scenarios, which can lead to low-quality tests, and hence to buggy chatbots.
To fill this gap, we propose adapting mutation testing (MuT) for task-oriented chatbots. To this end, we introduce a set of mutation operators that emulate faults in chatbot designs, an architecture that enables MuT on chatbots built using heterogeneous technologies, and a practical realisation as an Eclipse plugin. Moreover, we evaluate the applicability, effectiveness and efficiency of our approach on open-source chatbots, with promising results.
Secure Data Sharing For Dynamic Groups in Multi-Attorney Manner Using Cloud
1. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 133
Paper Publications
Secure Data Sharing For Dynamic Groups in
Multi-Attorney Manner Using Cloud
1
Vijaya Kumar Patil C, 2
Manjunath H
1
Dept. Of Computer Science & Engg. Mangalore Institute of Technology and Engineering Mangalore, Karnataka, India.
2
HOD, Dept.Of Information Science & Engg. Mangalore Institute of Technology and Engineering, Mangalore,
Karnataka, India.
Abstract: Cloud computing provides an economical and efficient solution for sharing data among the cloud users in
the group , users sharing data in a multi-attorney manner preserving data and identity privacy from an untrusted
cloud, it is still a challenging issue, due to frequent change of the membership in the group. In this paper, we
propose a multi-attorney data sharing scheme for the dynamic groups in the cloud. By combing group signature
and Tripple DES encryption techniques, any cloud user anonymously share the data with others. In addition, we
analyze the security of our scheme with rigorous proofs, and demonstrate the efficiency of our scheme in
experiments.
Keywords: cloud computing, data sharing, privacy-preserving, access control, and dynamic groups.
1. INTRODUCTION
Cloud computing is recognized as an alternative to traditional information technology [1] due to its intrinsic resource-
sharing and low-maintenance characteristics. In cloud computing, the cloud service providers (CSPs), such as Amazon,
are able to deliver various services to cloud users with the help of powerful datacenters. By migrating the local data
management systems into cloud servers, users can enjoy high-quality services and save significant investments on their
local infrastructures. One of the most important services offered by cloud providers is data storage. Let us consider a
practical data application. A company allows its staffs in the same group or department to store and share files in the
cloud. By utilizing the cloud, the staffs can be completely released from the troublesome local data storage and
maintenance. However, it also poses a significant risk to the confidentiality of those stored files. Specifically, the cloud
servers managed by cloud providers are not fully trusted by users while the data files stored in the cloud may be sensitive
and confidential, such as business plans. To preserve data privacy, a basic solution is to encrypt data files, and then upload
the encrypted data into the cloud. Unfortunately, designing an efficient and secure data sharing scheme for groups in the
cloud is not an easy task due to the following Challenging issues:
First, identity privacy is one of the most significant obstacles for the wide deployment of cloud computing. Without the
guarantee of identity privacy, users may be unwilling to join in cloud computing systems because their real identities
could be easily disclosed to cloud service providers and attackers. On the Other hand, unconditional identity privacy may
acquire the abuse of privacy. For example, a misbehaved staff can deceive others in the company by sharing false files
without being traceable. Therefore, traceability, which enables the group manager (e.g., a company manager) to reveal the
real identity of a user, is also highly desirable.
Second, it is highly recommended that any member in a group should be able to share data and storing data in the
dynamic group provided by the cloud service providers, which is defined as the multi-attorney manner. Compared with
the single-attorney manner [3], where only the admin of the group can share the data, store and modify data in the cloud,
so data sharing in the multiple-attorney manner in dynamic group is more flexible. More concretely, group member can
access the data and also modify his / her part of data in the group. Last but not least, groups are dynamic in nature, i.e new
member entry into the group and current member revocation from the group. So the changes in group membership make
secure data sharing is very difficult in the dynamic group. On one hand, the anonymous system challenges new granted
users can access the data files stored in the cloud before their participation into the group, because it is not possible for
2. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 134
Paper Publications
new registered member to contact with anonymous data owners in the cloud, and obtain the corresponding decryption
keys. On the other hand, an efficient user revocation mechanism from the group without updating the secret keys of the
remaining users is also desired to minimize the complexity of key management. Several security schemes to share data on
untrusted servers have been proposed [4], [5], [6]. In these approaches, data owners store the encrypted data files in
untrusted storage and distribute the corresponding decryption keys only to authorized members in the cloud. Thus,
unauthorized users as well as storage servers cannot access the file data content because they don’t knowledge of the
decryption keys However; the complexities of user entry and revocation in these schemes are directly increasing with the
number of data owners and the number of revoked users, respectively. By setting a group with a single attribute, Lu et al.
[7] proposed a secure provenance scheme based on the cipher text-policy attribute-based encryption technique [8], which
allows any users in a group to share data with other members in group. However, the issue of user revocation is not
specified in this scheme. Yu et al. [3] proposed a scalable and fine-grained data access control scheme in cloud computing
based on the key policy attribute-based encryption (KP-ABE) technique [9]. unluckily, the single-attorney manner hinders
the adoption of their scheme into the case, where any granted user to store and share data. To solve the challenges
presented above, we propose a secure data sharing scheme for dynamic groups in multi-attorney manner using the cloud.
The main contributions of this proposed system include:
1. We propose a secure multi-attorney data sharing scheme. It allows that any user in the group can securely share data
with others members in the untrusted cloud.
2. Proposed scheme supports dynamic groups more efficiently. Specifically, new registered users can directly access data
files uploaded before their participation without contacting with data owners. User revocation can be easily done through
a novel revocation list without updating the secret keys of the remaining users. The size and computation overhead of
encryption are constant and independent with the number of revoked users.
3. This technique provides secure and privacy-preserving access control to users, which guarantees any member in a
group to anonymously store and share data in the cloud. Moreover, the real identity of file data owners can be traceable by
the group admin when any malicious activity done group member.
4. This technique provide exact security analysis, and perform Extensive simulations to demonstrate the efficiency of our
scheme in terms of storage and computation overhead.
2. LITERATURE SURVEY
In [4], Kallahalla et al. proposed a cryptographic storage system that enables secure file sharing on untrusted servers,
named Plutus. By dividing files into file groups and encrypting each file group with a unique file-block key, the data
owner can share the file groups with others through delivering the corresponding lockbox key, where the lockbox key is
used to encrypt the file-block keys. However, it brings about a heavy key distribution overhead for large-scale file
sharing. Additionally, the file-block key needs to be updated and distributed again for a user revocation. Undesired effort,
restoration of blur image is very important in many of the cases [3].
In [5], files stored on the untrusted server include two parts: file metadata and file data. The file metadata implies the
access control information including a series of encrypted key blocks, each of which is encrypted under the public key of
authorized users. Thus, the size of the file metadata is proportional to the number of authorized users. The user revocation
in the scheme is an intractable issue especially for large-scale sharing, since the file metadata needs to be updated. In their
extension version, the NNL construction [10] is used for efficient key revocation. However, when a new user joins the
group, the private key of each user in an NNL system needs to be recomputed, which may limit the application for
dynamic groups. Another concern is that the computation overhead of encryption linearly increases with the sharing scale.
Ateniese et al. [6] leveraged proxy reencryptions to secure distributed storage. Specifically, the data owner encrypts
blocks of content with unique and symmetric content keys, which are further encrypted under a master public key. For
access control, the server uses proxy cryptography to directly reencrypt the appropriate content key(s) from the master
public key to a granted user’s public key. Unfortunately, a collusion attack between the untrusted server and any revoked
malicious user can be launched, which enables them to learn the decryption keys of all the encrypted blocks.
3. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 135
Paper Publications
In [3], Yu et al. presented a scalable and fine-grained data access control scheme in cloud computing based on the
KPABE technique. The data owner uses a random key to encrypt a file, where the random key is further encrypted with a
set of attributes using KP-ABE. Then, the group manager assigns an access structure and the corresponding secret key to
authorized users, such that a user can only decrypt a ciphertext if and only if the data file attributes satisfy the access
structure. To achieve user revocation, the manager delegates tasks of data file reencryption and user secret key update to
cloud servers. However, the single-attorney manner may hinder the implementation of applications with the scenario,
where any member in a group should be allowed to store and share data files with others.
Lu et al. [7] proposed a secure provenance scheme, which is built upon group signatures and ciphertext-policy attribute-
based encryption techniques. Particularly, the system in their scheme is set with a single attribute. Each user obtains two
keys after the registration: a group signature key and an attribute key. Thus, any user is able to encrypt a data file using
attribute-based encryption and others in the group can decrypt the encrypted data using their attribute keys. Meanwhile,
the user signs encrypted data with her group signature key for privacy preserving and traceability. However, user
revocation is not supported in their scheme.
From the above analysis, we can observe that how to securely share data files in a multiple-owner manner for dynamic
groups while preserving identity privacy from an untrusted cloud remains to be a challenging issue. In this paper, we
propose a novel Mona protocol for secure data sharing in cloud computing. Compared with the existing works, Mona
offers unique features as follows:
1. Any user in the group can store and share data files with others by the cloud.
2. The encryption complexity and size of ciphertexts are independent with the number of revoked users in the system.
3. User revocation can be achieved without updating the private keys of the remaining users.
4. A new user can directly decrypt the files stored in the cloud before his participation.
3. PRELIMINARIES
3.1 Bilinear Maps
Let G1 and G2 be an additive cyclic group and a multiplicative cyclic group of the same prime order q, respectively [11].
Let e : G1 G1 G2 denote a bilinear map constructed with the following properties:
1. Bilinear: for all a,bЄZq* and P,QЄ G1,e(aP,bQ)=e(P,Q)ab
2. Nondegenerate: There exists a point P such that E(P,P)≠1.
3. Computable: There is an efficient algorithm to compute e(P,Q) for any P,QЄG1
3.2 Complexity Assumptions
Definition 1 (q-strong Diffie-Hellman (q-SDH) Assumption [12]). Given (P1,P2, P2, ,…. qP2),it is infeasible to
compute 1
Definition 2 (Decision linear (DL) Assumption [12]). Given P1,P2, P3,aP1, bP2, cP3, it is infeasible to decide whether
a+b=c mod q.
Definition 3 (Weak Bilinear Diffie-Hellman Exponent (WBDHE) Assumption [13]). For unknown a Zq* , given
Y,aY,a2
Y ; ::; a1
Y ,PЄ G1, it is infeasible to compute e(Y,P)1a
.
Definition 4 ((t,n)-general Diffie-Hellman Exponent
(GDHE) Assumption [14]). Let f(X)= r
i=1 (X + xi) and g(X)= n-r
i=1 (X+xi) be two random univariate polynomials. For
unknown k, Zq*,given G0, G0,… , G0, ( ),G0,P0,kg( )H0ЄG1 and e(G0, H0)f2( )g(
)ЄG2.It is infeasible to
compute e(G0, H0)f2( )g(
)ЄG2.
4. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 136
Paper Publications
3.3 Group Signature
Group signature scheme allows group members to sign messages while keeping the identity secret from verifiers. Besides,
the designated group admin can reveal the identity of the signature’s creator when a malicious activates occurs, which is
defined as traceability.
3.4 Tripple DES Encryption Techniques
Triple DES (3DES) is stands for the Triple Data Encryption Algorithm is symmetric-key block cipher, which applies the
Data Encryption Standard (DES) cipher algorithm three times to each data block.
The original DES cipher's key size of 56 bits was generally sufficient when that algorithm was designed, but the
availability of increasing computational power made brute-force attacks feasible. Triple DES provides a relatively simple
method of increasing the key size of DES to protect against such attacks, without the need to design a completely new
block cipher algorithm
The standards define three keying options:
Keying option 1: All three keys are independent.
Keying option 2: K1 and K2 are independent, and K3 = K1.
Keying option 3: All three keys are identical, i.e. K1 = K2 = K3.
Keying option 1 is the strongest, with 3 × 56 = 168 independent key bits.
Keying option 2 provides less security, with 2 × 56 = 112 key bits. This option is stronger than simply DES encrypting
twice, e.g. with K1 and K2, because it protects against meet-in-the-middle attacks.
Keying option 3 is equivalent to DES, with only 56 key bits. This option provides backward compatibility with DES,
because the first and second DES operations cancel out.
Each DES key is nominally stored or transmitted as 8 bytes, each of odd parity,[11]
so a key bundle requires 24, 16 or 8
bytes, for keying or 3 respectively.
.
Figure 1: Proposed System Model
4. SYSTEM MODEL AND DESIGN GOALS
4.1 System Model
The system model shown in figure 1 consists three main components of group manager, group member and cloud.
Model Description
1. Cloud
Service is provided by CSPs and provides priced abundant storage services. However, the cloud is not fully trusted by
Option 1,2
5. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 137
Paper Publications
cloud end users since the CSPs are very likely to be outside of the cloud users’ trusted domain. Similar to [3], [7], we
assume that the cloud server is sincere but curious. That is, the cloud server will not maliciously delete or modify user
data due to the protection of data auditing schemes [17], [18], but will try to learn the content data stored in cloud and the
identities of cloud users.
2. Group Manager
Performs following operations
1. Group signature generation
2. User registration
3. Traceability
4. User revocation
In the given example, the group manager is an administrator of the company. Therefore, we assume that the group
manager is trusted by the all other employers in the company.
3. Group Member
Group members are registered users can share and store the data in the cloud server also member can modify his/her part
of data in cloud. Group members can upload the file and download the file within the group.
4. Group Signature
A group signature scheme allows any member of the group to sign messages while keeping the identity secret from
verifiers. Besides, the designated group manager can reveal the identity of the signature’s originator when a dispute
occurs, which is denoted as traceability.
5. Tripple DES Encryption
Triple Data Encryption Algorithm (TDEA or Triple DEA) symmetric-key block cipher, which applies the Data
Encryption Standard (DES) cipher algorithm three times to each data block
Triple DES uses a "key bundle" that consists three DES keys, K1, K2 and K3, each of 56 bits (excluding parity bits). The
encryption algorithm is:
ciphertext = EK3(DK2(EK1(plaintext)))
I.e., DES encrypt with K1, DES decrypt with K2, then DES encrypt with K3.Decryption is the reverse:
plaintext = DK1(EK2(DK3(ciphertext)))
I.e., decrypt with K3, encrypt with K2, then decrypt with K1.Each triple encryption encrypts one block of 64 bits of data.
6. User Revocation
User revocation is performed by the group manager via public available revocation list based on which group members
can encrypt their data files and confidentiality against the revoked users.
4.2 Design Goals
Access Control: The requirement of access control is twofold. First, group members are able to use the cloud resource
for data operations. Second, unauthorized users cannot access the cloud resource at any time, and revoked users will
be incapable of using the cloud again once they are revoked.
Data Confidentiality: Data confidentiality requires that unauthorized users including the cloud are incapable of
learning the content of the stored data. An important and challenging issue for data confidentiality is to maintain its
availability for dynamic groups. Specifically, new users should decrypt the data stored in the cloud before their
participation, and revoked users are unable to decrypt the data moved into the cloud after the revocation.
Anonymity and Traceability: Anonymity guarantees that group members can access the cloud without revealing
thereal identity. Although anonymity represents an effective protection for user identity, it also poses a potential
6. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 138
Paper Publications
insideattack risk to the system. For example, an inside attacker may store and share a mendacious information to
derive substantial benefit. Thus, to tackle the inside attack, the group manager should have the ability to reveal the real
identities of data owners.
Efficiency: The efficiency is defined as follows: Any group member can store and share data files with others in the
group by the cloud. User revocation can be achieved without involving the remaining users. That is, the remaining
users do not need to update their private keys or reencryption operations. New granted users can learn all the content
data files stored before his participation without contacting with the data owner.
5. PROPOSED SCHEMA
5.1 Overview
To achieve secure data sharing for dynamic groups in the cloud, we expect to combine the group signature and Tripple
DES encryption techniques. Specially, the group signature scheme enables users to anonymously use the cloud resources,
and the Tripple DES encryption technique allows data owners to securely share their data files with others including new
joining users. Unfortunately, each user has to compute revocation parameters to protect the confidentiality from the
revoked users in the Tripple DES encryption scheme, which results in that both the computation overhead of the
encryption and the size of the ciphertext increase with the number of revoked users. Thus, the heavy overhead and large
ciphertext size may hinder the adoption of the broadcast encryption scheme to capacity-limited users. To tackle this
challenging issue, we let the group manager compute the revocation parameters and make the result public available by
migrating them into the cloud. Such a design can significantly reduce the computation overhead of users to encrypt files
and the ciphertext size. Specially, the computation overhead of users for encryption operations and the ciphertext size is
constant and independent of the revocation users.
5.2 Scheme Description
This section describes the details of Mona including system initializations, user registration, user revocation, file
generation, file deletion, file access and traceability.
5.2.1 System Initialization
The group manager takes charge of system initialization
as follows: Generating a bilinear map group system S=(q,G1,G2,e(.,.)).the system parameters include(S,P,H,H0,H
1,H2,U,V,W,Y,Z,f,f1,Enc()), where f is a one way hash function:{0,1}*->Z*q;f1 is hash function:{0,1}*->G1;and Enck()
is a secure symmetric encryption algorithm with the secret key k.
5.2.2 User registration
For the registration of user I with identity IDi, the group manager randomly selects a number xi belong to Z*q and
computes Ai, Bi as the following equation:
Then, the group manager adds (Ai, xi, IDi) into the group user list, which will be used in the traceability phase.
After the registration, user i obtains a private key (xi, Ai, Bi) which will be used for group signature generation and file
decryption.
5.2.3 Revocation list
User revocation is performed by the group manager via a public available revocation list (RL), based on which group
members can encrypt their data files and ensure the confidentiality against the revoked users.
7. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 139
Paper Publications
Table 1. Revocation list
The revocation list is characterized by a series of time stamps t1,t2,…tr. In the proposed system once the user time stamp
over does not wait for the group manager to update the time stamp or revocation list here once the time over the user
immediately send request for extra time for access the data to the cloud. Then the cloud will send that request to the group
manager once the see it and give permission then the cloud will time to access the data but if the group manager did not
give permission then the cloud will not give permission for access if the data
5.2.4 File Generation
To store and share a data file in the cloud, a group member performs the following operations: Getting the revocation list
from the cloud . In this step, the member sends the group identity IDgroup as a request to the cloud. Then, the cloud
responds the revocation list RL to the member. Verifying the validity of the received revocation list. First, checking
whether the marked date is fresh. Second, verifying the contained signature sig(RL) by the equation e(W, f1 (RL)) = e(P,
sig(RL)). If the revocation list is invalid, the data owner stops this scheme. Encrypting the data file M. Selecting a random
number T and computing fT. The hash value will be used for data file deletion operation. In addition, the data owner
adds (IDdata, T) into his local storage. Constructing the uploaded data file as shown in Table 2, where tdata denotes the
current time on the member, and a group signature on (IDdata, C1, C2, C, f(T); tdata) computed by the data owner through
private key (A, x).
Table 2: Message Format
Uploading the data shown in Table 2 into the cloud server and adding the IDdata into the local shared data list
maintained by the manager. On receiving the data, the cloud first check its validity. If the algorithm returns true, the
group signature is valid; otherwise, the cloud abandons the data. In addition, if several users have been revoked by the
group manager, the cloud also performs revocation verification. Finally, the data file will be stored in the cloud after
successful group signature and revocation verifications.
5.2.5 File Deletion
The file stored in the cloud can be deleted by either the group manager or the data owner .To delete a file ID data, the
group manager computes a signature and sends the signature along with ID data to the cloud.
6. PERFORMANCE EVALUTAION
6.1 Storage
Without loss of generality, we set q=160 and the elements in G1 and G2 to be 161 and 1,024 bit, respectively. In addition,
we assume the size of the data identity is 16 bits, which yield a group capacity of 216 data files. Similarly, the size of user
and group identity are also set as 16 bits.
Group Manager: In Mona, the master private key of the group manager is (G, ) G1×Zq
3. Additionally, the user
list and the shared data list should be stored at the group manager. Considering an actual system with 200 users and
assuming that each user share 50 files in average, the total storage of the group manager is (80.125+42.125*200+
2*10,000)*10-3
28.5 kbytes,which is very acceptable.
8. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 140
Paper Publications
Group Members: Essentially, each user in our scheme only needs to store its private key (Ai , Bi,xi) is about 60 bytes. It
is worth noting that there is a tradeoff between the storage and the computation overhead. For example, the four pairing
operations including (e(H,W),e(H,P),e(P,P),e(Ai,P))ЄG4
2 can be precomputed once and stored for the group signature
generation and verification. Therefore, the total storage of each users is about 572 bytes.
The extra storage overhead in the cloud: In Mona, the format of files stored in the cloud is shown in Table 2. Since C3
is the ciphertext of the file under the symmetrical encryption, the extra storage overhead to store the file is about 248
bytes, which includes (IDgroup, IDdata, C1, C2, C3, f (τ),data, ).
Figure 3: comparison on computation cost for file generation between Mona and ODBE [14]
Figure 4: comparison on computation cost for the file access between Mona and ODBE [14]
6.2 Simulation
The simulation consists of three components: clientside, manager side as well as cloud side. Both client side and manager
side process are conducted on laptop with core 2T7250 2.0Ghz processor,DDR2 800 2G,ubuntu 10.04X86.The cloud side
process is implemented on machine that equipped with core 2 i3-2350 2.3 GHz,DDR3 1066 2G,Ubuntu 12.04X64.In the
simulation ,we choose an elliptic curve with 160 bit group order ,which provides a competitive security level with 1024bit
RSA.
6.2.1 Client Computation Cost
In Fig. 3, we list the comparison on computation cost of clients for data generation operations between Mona and the way
that directly using the original Tripple DES encryption (ODBE) [14]. It is easily observed that the computation cost in
Mona is irrelevant to the number of revoked users. On the contrary, the computation cost increases with the number of
revoked users in ODBE. The reason is that the parameters (PrZr) can be obtained from the revocation list without
9. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 141
Paper Publications
sacrificing the security in Mona, while several time-consuming operations including point multiplications in G1 and
exponentiations in G2 have to be performed by clients to compute the parameters in ODBE. From Figs. 3a and 3b, we can
find out that sharing a 10 Mbyte file and a 100-Mbyte one, cost a client about 0.2 and 1.4 seconds in our scheme,
respectively, this implies that the symmetrical encryption operation domains the computation cost when the file is large.
The computation cost of clients for file access operation with the size of 10 and 100 Mbytes are illustrated in Fig. 4. The
computation cost in Mona increases with the number of revoked users, as clients require to perform Algorithms 3and 4 to
compute the parameter Ar,r and check whether the data owner is a revoked user. Besides the above operations, P1, P2, Pr
needs to be computed by clients in ODBE. Therefore, Mona is still superior to ODBE in terms of computation cost.
Similar to the data generation operation, the total computation cost is mainly determined by the symmetrical decryption
operation if the accessed file is large, which can be verified from Figs. 4a and 4b. In addition, the file deletion for clients
is about 0.075 seconds, because it only costs a group signature on a message (IDdata, )where _ is a 160-bit number in Zq
*
.
6.2.2 Cloud Computation Cost
To evaluate the performance of the cloud in Mona, we test its computation cost to respond various client operation
requests including file generation, file access, and file deletion. Assuming the sizes of requested files are 100 and 10 MB,
the test results are given in Table 3. It can be seen that the computation cost of the cloud is deemed acceptable, even when
the number of revoked users is large. This is because the cloud only involves group signature and revocation verifications
to ensure the validity of the requestor for all operations. In addition, it is worth noting that the computation cost is
independent with the size of the requested file for access and deletion operations, since the size of signed message is
constant.
Table 3 computation cost of the cloud (s)
7. CONCLUSION
In this paper we design a secure data sharing scheme for dynamic groups, Where users can share data anonymously
without showing the real identity, so privacy is preserved, And using group signature and Tripple DES encryption it
provides access control and security for the data in dynamic group Additionally, this technique supports efficient user
revocation and new user joining. More specially, efficient user revocation can be achieved through a public revocation list
without updating the private keys of the remaining users, and new users can directly decrypt files stored in the cloud
before their participation. Moreover, the storage overhead and the encryption computation cost are constant. Extensive
analyses show that our proposed scheme satisfies the desired security requirements and guarantees efficiency as well.
REFERENCES
[1] Xuefeng Liu, Yuqing Zhang, Boyang Wang, and Jingbo Yan, “Mona: Secure Multi-attorney Data Sharing for Dynamic
Groups in the Cloud”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 24, NO. 6,
JUNE 2013.
[2] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, I. Stoica, and
M. Zaharia, “A View of Cloud Computing,” Comm. ACM, vol. 53, no. 4, pp. 50-58, Apr. 2010.
[3] S. Kamara and K. Lauter, “Cryptographic Cloud Storage,” Proc. Int’l Conf. Financial Cryptography and Data Security
(FC), pp. 136- 149, Jan. 2010.
10. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (133-142), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 142
Paper Publications
[4] E. Goh, H. Shacham, N. Modadugu, and D. Boneh, “Sirius: Securing Remote Untrusted Storage,” Proc. Network and
Distributed Systems Security Symp. (NDSS), pp. 131- 145, 2003.
[5] B. Wang, B. Li, and H. Li, “Knox: Privacy-Preserving Auditing for Shared Data with Large Groups in the Cloud,” Proc.
10th Int’l Conf. Applied Cryptography and Network Security, pp. 507-525, 2012.
[6] A. Fiat and M. Naor, “Broadcast Encryption,” Proc. Int’l Cryptology Conf. Advances in Cryptology (CRYPTO), pp. 480-
491, 1993.
[7] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute- Based Encryption for Fine-Grained Access Control of
Encrypted Data,” Proc. ACM Conf. Computer and Comm. Security (CCS), pp. 89-98, 2006.
[8] D. Pointcheval and J. Stern, “Security Arguments for Digital Signatures and Blind Signatures,” J. Cryptology, vol. 13, no.
3, pp. 361-396, 2000.
[9] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of Data Forensics in Cloud
Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010.
[10] D. Naor, M. Naor, and J.B. Lotspiech, “Revocation and Tracing Schemes for Stateless Receivers,” Proc. Ann. Int’l
Cryptology Conf. Advances in Cryptology (CRYPTO), pp. 41-62, 2001.
[11] D. Boneh and M. Franklin, “Identity-Based Encryption from the Weil Pairing,” Proc. Int’l Cryptology Conf. Advances in
Cryptology (CRYPTO), pp. 213-229, 2001. [12] D. Boneh, X. Boyen, and H. Shacham, “Short Group Signature,” Proc.
Int’l Cryptology Conf. Advances in Cryptology (CRYPTO), pp. 41-55, 2004.
[12] D. Boneh, X. Boyen, and E. Goh, “Hierarchical Identity Based Encryption with Constant Size Ciphertext,” Proc. Ann. Int’l
Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 440-456, 2005.
[13] C. Delerablee, P. Paillier, and D. Pointcheval, “Fully Collusion Secure Tripple DES encryption with Constant-Size
Ciphertexts or Decryption Keys,” Proc. First Int’l Conf. Pairing-Based Cryptography, pp. 39-59, 2007.
[14] D. Chaum and E. van Heyst, “Group Signatures,” Proc. Int’l Conf. Theory and Applications of Cryptographic Techniques
(EUROCRYPT), pp. 257-265, 1991.
[15] Fiat and M. Naor, “Broadcast Encryption,” Proc. Int’l Cryptology Conf. Advances in Cryptology (CRYPTO), pp. 480-491,
1993.
[16] Wang, B. Li, and H. Li, “Knox: Privacy-Preserving Auditing for Shared Data with Large Groups in the Cloud,” Proc. 10th
Intl Conf. Applied Cryptography and Network Security, pp. 507-525, 2012.
[17] Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-Preserving Public Auditing for Data Storage Security in Cloud
Computing,” Proc. IEEE INFOCOM, pp. 525-533, 2010.
[18] B. Sheng and Q. Li, “Verifiable Privacy-Preserving Range Query in Two-Tiered Sensor Networks,” Proc. IEEE
INFOCOM, pp. 46- 50, 2008.
[19] D. Boneh, B. Lynn, and H. Shacham, “Short Signature from the Weil Pairing,” Proc. Int’l Conf. Theory and Application of
Cryptology and Information Security: Advances in Cryptology, pp. 514-532, 2001
Author’s Profile:
VIJAYA KUMAR PATIL C completed the bachelor’s degree in Computer Science &Engineering from
visvesvaraya technological University (VTU). Currently pursuing Masters in Engineering in Computer
Network & Engineering at Mangalore Institute of Technology, Mangalore.
MANJNATH H completed bachelors and masters degree in Computer Science and Engineering. Currently
working as Associate Professor-I and Head of Information Science and Engg in Mangalore Institute of
Technology, Mangalore. Currently he is pursuing his PhD in the area of Cloud Computing. He is also
member of BOE of CSE Department of NMAMIT and 20years of experience in Teaching and Industrial
experience.