Cryptographic Tree and Its Key Management for Securing Outsourced Data in the Cloud

Author(s):  
Vairaprakash Gurusamy ◽  
◽  
S. Kannan ◽  
T. Maria Mahajan ◽  
◽  
...  
2018 ◽  
Vol 8 (1) ◽  
pp. 30-36
Author(s):  
Роман Котельников ◽  
Roman Kotelnikov ◽  
Алескандр Мартынюк ◽  
Aleskandr Martynyuk

Timely availability of accurate burned out area data is a key management aspect in forest protection arrange-ments. Special operation multilevel net-work including field surveys of burned out areas has been established now to verify appropriate data accuracy. In the mean time extensive levels of information from various sources accumulated in wildfire databases enable statistical assessment of the data accuracy drastically reducing time and financial costs of verification operations. Mathematically proven that amount of numbers that specify real natural facilities may grow exponentially due to the Benford law. The paper proves applicability of the Benford law provisions in assessment of wildfire area data accuracy through analysis of first figure occurrence in numbers specifying forest covered burned out area in the Russian Federation territory in 2016 and assessed a minimum set of values needed for an adequate result. In addition the paper highlights an opportunity of variously outsourced data accuracy comparative analysis. Taking into consideration that variation of individual figure occurrence frequency in analyzed value packages may have a different sign for various figures it is offered to apply an indicator representing a mean value of appropriate figure occurrence probability variation modules. The offered procedure based on the Benford law application may be a part of a risk-targeted approach to plan control supervisory operations in forest relations.


2014 ◽  
Vol 19 (5) ◽  
pp. 449-454
Author(s):  
Bei Pei ◽  
Changsong Chen ◽  
Changsheng Wan

2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Ying Zou ◽  
Zhen Zhao ◽  
Sha Shi ◽  
Lei Wang ◽  
Yunfeng Peng ◽  
...  

Data clustering is the unsupervised classification of data records into groups. As one of the steps in data analysis, it has been widely researched and applied in practical life, such as pattern recognition, image processing, information retrieval, geography, and marketing. In addition, the rapid increase of data volume in recent years poses a huge challenge for resource-constrained data owners to perform computation on their data. This leads to a trend that users authorize the cloud to perform computation on stored data, such as keyword search, equality test, and outsourced data clustering. In outsourced data clustering, the cloud classifies users’ data into groups according to their similarities. Considering the sensitive information in outsourced data and multiple data owners in practical application, it is necessary to develop a privacy-preserving outsourced clustering scheme under multiple keys. Recently, Rong et al. proposed a privacy-preserving outsourced k-means clustering scheme under multiple keys. However, in their scheme, the assistant server (AS) is able to extract the ratio of two underlying data records, and key management server (KMS) can decrypt the ciphertexts of owners’ data records, which break the privacy security. AS can even reduce all data records if it knows one of the data records. To solve the aforementioned problem, we propose a highly secure privacy-preserving outsourced k-means clustering scheme under multiple keys in cloud computing. In this paper, noncolluded cloud computing service (CCS) and KMS jointly perform clustering over the encrypted data records without exposing data privacy. Specifically, we use BCP encryption which has additive homomorphic property and AES encryption to double encrypt data records, where the former cryptosystem prevents CCS from obtaining any useful information from received ciphertexts and the latter one protects data records from being decrypted by KMS. We first define five protocols to realize different functions and then present our scheme based on these protocols. Finally, we give the security and performance analyses which show that our scheme is comparable with the existing schemes on functionality and security.


2018 ◽  
Vol 30 (15) ◽  
pp. e4498 ◽  
Author(s):  
Naveen Kumar  ◽  
Shailesh Tiwari ◽  
Zhigao Zheng ◽  
Krishn K. Mishra ◽  
Arun Kumar Sangaiah

Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.


Sign in / Sign up

Export Citation Format

Share Document