Enhancing Security and Consistency for Cloud Databases
DOI:
https://doi.org/10.53555/nncse.v2i3.488Keywords:
Enhancing security, consistency, cloud databasesAbstract
Cloud computing is one of the most important research area. The cloud information don't seem to be safe and secured, because the third parties will access and acquire the knowledge from cloud at any time and will misuse the data or information of a particular user or organization and thus it is concerned, the information stored in cloud should come with the guarantee of security. The effectiveness of the planned design is evaluated through theoretical analysis and intensive experimental results supported a model implementation subject to the TPC-C (Transaction Processing Control) normal benchmark for various numbers of purchasers and network latencies. Information and table information area unit encrypted through constant encoding key before being saved. This encoding secret is known as a passkey. Only trusted clients that already know the key will rewrite the information and acquire data that is necessary to code and rewrite tenant knowledge. Each information is retrieved by purchasers through associated ID. The ID which is generated by the Message Authentication Code (MAC) function to the name of the object (database or table) described by the corresponding row. Deterministic MACfunction allows clients to retrieve the information of a given table by knowing its plaintext name. The advantage during this design is to boost smart Quality of Service (QoS) and Distributing knowledge among completely different suppliers and taking advantage of secret sharing.
References
M. Armbrust et al., “A View of Cloud Computing,” Comm. of theACM, vol. 53, no. 4, pp. 50-58, 2010.
W. Jansen and T. Grance, “Guidelines on Security and Privacy inPublic Cloud Computing,” Technical Report Special Publication800-144, NIST, 2011.
A.J. Feldman, W.P. Zeller, M.J. Freedman, and E.W. Felten,“SPORC: Group Collaboration Using Untrusted Cloud Resources,”Proc. Ninth USENIX Conf. Operating Systems Design andImplementation, Oct. 2010.
J. Li, M. Krohn, D. Mazie`res, and D. Shasha, “Secure UntrustedData Repository (SUNDR),” Proc. Sixth USENIX Conf. OpeartingSystems Design and Implementation, Oct. 2004.
P. Mahajan, S. Setty, S. Lee, A. Clement, L. Alvisi, M. Dahlin, andM. Walfish, “Depot: Cloud Storage with Minimal Trust,” ACMTrans. Computer Systems, vol. 29, no. 4, article 12, 2011.
H. Hacigu¨mu¨ s¸, B. Iyer, and S. Mehrotra, “Providing Database as aService,” Proc. 18th IEEE Int’l Conf. Data Eng., Feb. 2002.
C. Gentry, “Fully Homomorphic Encryption Using Ideal Lattices,”Proc. 41st Ann. ACM Symp. Theory of Computing, May 2009.
R.A. Popa, C.M.S. Redfield, N. Zeldovich, and H. Balakrishnan,“CryptDB: Protecting Confidentiality with Encrypted QueryProcessing,” Proc. 23rd ACM Symp. Operating Systems Principles,Oct. 2011.
H. Hacigu¨mu¨ s¸, B. Iyer, C. Li, and S. Mehrotra, “ExecutingSQL over Encrypted Data in the DatabaseService-ProviderModel,” Proc. ACM SIGMOD Int’l Conf. Management Data, June2002.
J. Li and E. Omiecinski, “Efficiency and Security Trade-Off inSupporting Range Queries on Encrypted Databases,” Proc. 19thAnn. IFIP WG 11.3 Working Conf. Data and Applications Security,Aug. 2005.
E. Mykletun and G. Tsudik, “Aggregation Queries in theDatabase-as-a-Service Model,” Proc. 20th Ann. IFIP WG 11.3Working Conf. Data and Applications Security, July/Aug. 2006.
D. Agrawal, A.E. Abbadi, F. Emekci, and A. Metwally, “DatabaseManagement as a Service: Challenges and Opportunities,” Proc.25th IEEE Int’l Conf. Data Eng., Mar.-Apr. 2009.
V. Ganapathy, D. Thomas, T. Feder, H. GarciaMolina, and R.Motwani, “Distributing Data for Secure Database Services,” Proc.Fourth ACM Int’l Workshop Privacy and Anonymity in the Information Soc., Mar. 2011.FERRETTI ET AL.: DISTRIBUTED, CONCURRENT, AND
INDEPENDENT ACCESS TO ENCRYPTED CLOUD DATABASES 445Fig. 9. TPC-C performance (latency equal to 40 ms). Fig. 10. TPC-C
performance (latency equal to 80 ms).
A. Shamir, “How to Share a Secret,” Comm. of the ACM,vol. 22, no. 11, pp. 612-613, 1979.
M. Hadavi, E. Damiani, R. Jalili, S. Cimato, and Z. Ganjei, “AS5: ASecure Searchable Secret Sharing Scheme for Privacy PreservingDatabase Outsourcing,” Proc. Fifth Int’l Workshop Autonomous andSpontaneous Security, Sept. 2013.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
