Secure deduplication storage systems supporting keyword search

Li, Jin; Chen, Xiaofeng; Xhafa, Fatos; Barolli, Leonard

doi:10.1016/j.jcss.2014.12.026

Cited by 62 publications

(14 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Topology control technology is an important and commonly used optimization technique in networks fields [34][35][36][37]. Topology control technology has considerable studies in WSNs [38,39].…”

Section: Related Workmentioning

confidence: 99%

Adaptive Transmission Range Based Topology Control Scheme for Fast and Reliable Data Collection

Teng

Dong

Ota

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

An Adaptive Transmission Range Based Topology Control (ATRTC) scheme is proposed to reduce delay and improve reliability for data collection in delay and loss sensitive wireless sensor network. The core idea of the ATRTC scheme is to extend the transmission range to speed up data collection and improve the reliability of data collection. The main innovations of our work are as follows:(1) an adaptive transmission range adjustment method is proposed to improve data collection reliability and reduce data collection delay. The expansion of the transmission range will allow the data packet to be received by more receivers, thus improving the reliability of data transmission. On the other hand, by extending the transmission range, data packets can be transmitted to the sink with fewer hops. Thereby the delay of data collection is reduced and the reliability of data transmission is improved. Extending the transmission range will consume more energy. Fortunately, we found the imbalanced energy consumption of the network. There is a large amount of energy remains when the network died. ATRTC scheme proposed in this paper can make full use of the residual energy to extend the transmission range of nodes. Because of the expansion of transmission range, nodes in the network form multiple paths for data collection to the sink node. Therefore, the volume of data received and sent by the near-sink nodes is reduced, the energy consumption of the near-sink nodes is reduced, and the network lifetime is increased as well. (2) According to the analysis in this paper, compared with the CTPR scheme, the ATRTC scheme reduces the maximum energy consumption by 9%, increases the network lifetime by 10%, increases the data collection reliability by 7.3%, and reduces the network data collection time by 23%.

show abstract

Section: Related Workmentioning

confidence: 99%

Adaptive Transmission Range Based Topology Control Scheme for Fast and Reliable Data Collection

Teng

Dong

Ota

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Therefore, the diffusion of codes is an important processing technology for big data networks (big data technology). However, due to the limited energy of sensor nodes in the network, when nodes communicate with other nodes, an important question is how to ensure that big data codes are transmitted to destinations quickly at lower complexity [27][28][29][30].…”

Section: Introductionmentioning

confidence: 99%

“…However, designing a method for WSNs with higher network lifetime and lower complexity and communication delay is a challenging issue [25,[30][31][32][33][34][35][36][37][38][39]. In WSNs, data codes are transmitted for device-to-device communication (D2D) by multihop transmission way.…”

Section: Introductionmentioning

confidence: 99%

Construction Low Complexity and Low Delay CDS for Big Data Code Dissemination

et al. 2018

View full text Add to dashboard Cite

The diffusion of codes is an important processing technology for big data networks. In previous scheme, data analysis was conducted for small samples of big data and complex problems that cannot be processed by big data technology. Due to the limited capacity of intelligence device, a better method is to select a set of nodes (intelligence device) to form a connected dominating set (CDS) to save energy, and constructing CDS is proved to be a complete NP problem. However, it is a challenge to reduce the communication delay and complexity for urgent data transmission in big data. In this paper, an appropriate duty cycle control (ADCC) scheme is proposed to reduce communication delay and complexity while improving energy efficient in CDS-based WSNs. In ADCC scheme, the method for constructing CDS is proposed at lower complexity. Nodes in CDS are selected according to the degree of nodes. Then, duty cycle of dominator nodes in CDS is higher than that of dominated nodes, so the communication delay in the proposed scheme is far less than that of previous scheme. The duty cycle of dominated nodes is small to save energy. This is because the number of dominator nodes in CDS is far less than the number of dominated nodes whose duty cycle is small; thus, the total energy consumption of the network is less than that of the previous scheme. As a result, the performance of energy consumption and communication delay and complex have been improved. Its complexity O ∑ v i=0 m − i + 2m − 2v − s is reduced a lot for big data. The theoretical analysis shows that compared to the previous scheme, the transmission delay can be reduced 25-92% and the energy efficiency is improved by about 80% while retaining network lifetime.

show abstract

“…Two-party protocols can be widely used in various fields such as cloud computing (Gao et al 2018;Tian et Ibtihal et al 2017;Zheng and Wang 2018), file encryption , verifiable computation , keyword searching (Li et al 2015) and trust evaluation (Jiang et al 2016(Jiang et al , 2018Jhaveri et al 2018). Normally, the security of two-party protocols is discussed with a single external attacker, who is assumed to arbitrarily sabotage the protocols by corrupting at most one party.…”

Section: Introductionmentioning

confidence: 99%

Incentive-driven attacker for corrupting two-party protocols

et al. 2018

View full text Add to dashboard Cite

Adversaries in two-party computation may sabotage a protocol, leading to possible collapse of the information security management. In practice, attackers often breach security protocols with specific incentives. For example, attackers manage to reap additional rewards by sabotaging computing tasks between two clouds. Unfortunately, most of the existing research works neglect this aspect when discussing the security of protocols. Furthermore, the construction of corrupting two parties is also missing in two-party computation. In this paper, we propose an incentive-driven attacking model where the attacker leverages corruption costs, benefits and possible consequences. We here formalize the utilities used for two-party protocols and the attacker(s), taking into account both corruption costs and attack benefits. Our proposed model can be considered as the extension of the seminal work presented by Groce and Katz (Annual international conference on the theory and applications of cryptographic techniques, Springer, Berlin, pp [81][82][83][84][85][86][87][88][89][90][91][92][93][94][95][96][97][98] 2012), while making significant contribution in addressing the corruption of two parties in two-party protocols. To the best of our knowledge, this is the first time to model the corruption of both parties in two-party protocols.

show abstract

Secure deduplication storage systems supporting keyword search

Cited by 62 publications

References 22 publications

Adaptive Transmission Range Based Topology Control Scheme for Fast and Reliable Data Collection

Adaptive Transmission Range Based Topology Control Scheme for Fast and Reliable Data Collection

Construction Low Complexity and Low Delay CDS for Big Data Code Dissemination

Incentive-driven attacker for corrupting two-party protocols

Contact Info

Product

Resources

About