302 research outputs found
Privacy-preserving communication and power injection over vehicle networks and 5G smart grid slice
tru
Efficient Dynamic Proof of Retrievability for Cold Storage
Storage-as-a-service (STaaS) permits the client to outsource her data to the cloud thereby, reducing data management and maintenance costs. However, STaaS also brings significant data integrity and soundness concerns since the storage provider might not keep the client data intact and retrievable all the time (e.g., cost saving via deletions). Proof of Retrievability (PoR) can validate the integrity and retrievability of remote data effectively. This technique can be useful for regular audits to monitor data compromises, as well as to comply with standard data regulations. In particular, cold storage applications (e.g., MS Azure, Amazon Glacier) require regular and frequent audits but with less frequent data modification. Yet, despite their merits, existing PoR techniques generally focus on other metrics (e.g., low storage, fast update, metadata privacy) but not audit efficiency (e.g., low audit time, small proof size). Hence, there is a need to develop new PoR techniques that achieve efficient data audit while preserving update and retrieval performance.
In this paper, we propose Porla, a new PoR framework that permits efficient data audit, update, and retrieval functionalities simultaneously. Porla permits data audit in both private and public settings, each of which features asymptotically (and concretely) smaller audit-proof size and lower audit time than all the prior works while retaining the same asymptotic data update overhead. Porla achieves all these properties by composing erasure codes with verifiable computation techniques which, to our knowledge, is a new approach to PoR design. We address several challenges that arise in such a composition by creating a new homomorphic authenticated commitment scheme, which can be of independent interest. We fully implemented Porla and evaluated its performance on commodity cloud (i.e., Amazon EC2) under various settings. Experimental results demonstrated that Porla achieves two to four orders of magnitude smaller audit proof size with 4× – 1,800× lower audit time than all prior schemes in both private and public audit settings at the cost of only 2× – 3× slower update
Esquemas de segurança contra ataques de poluição em codificação de rede sobre redes sem fios
Doutoramento em TelecomunicaçõesResumo em português não disponivelThe topic of this thesis is how to achieve e cient security against pollution
attacks by exploiting the structure of network coding.
There has recently been growing interest in using network coding
techniques to increase the robustness and throughput of data networks, and
reduce the delay in wireless networks, where a network coding-based scheme
takes advantage of the additive nature of wireless signals by allowing two
nodes to transmit simultaneously to the relay node. However, Network
Coding (NC)-enabled wireless networks are susceptible to a severe security
threat, known as data pollution attack, where a malicious node injects into
the network polluted (i.e., corrupted) packets that prevent the destination
nodes from decoding correctly. Due to recoding at the intermediate nodes,
according to the core principle of NC, the polluted packets propagate
quickly into other packets and corrupt bunches of legitimate packets
leading to network resource waste. Hence, a lot of research e ort has been
devoted to schemes against data pollution attacks. Homomorphic Message
Authentication Code (MAC)-based schemes are a promising solution against
data pollution attacks. However, most of them are susceptible to a new
type of pollution attack, called tag pollution attack, where an adversary
node randomly modi es tags appended to the end of the transmitted packets.
Therefore, in this thesis, we rst propose a homomorphic message
authentication code-based scheme, providing resistance against data
pollution attacks and tag pollution attacks in XOR NC-enabled wireless
networks. Moreover, we propose four homomorphic message authentication
code-based schemes which provide resistance against data and tag pollution
attacks in Random Linear Network Coding (RLNC). Our results show that
our proposed schemes are more e cient compared to other competitive tag
pollution immune schemes in terms of complexity, communication overhead
and key storage overhead
Security and Privacy Issues in Wireless Mesh Networks: A Survey
This book chapter identifies various security threats in wireless mesh
network (WMN). Keeping in mind the critical requirement of security and user
privacy in WMNs, this chapter provides a comprehensive overview of various
possible attacks on different layers of the communication protocol stack for
WMNs and their corresponding defense mechanisms. First, it identifies the
security vulnerabilities in the physical, link, network, transport, application
layers. Furthermore, various possible attacks on the key management protocols,
user authentication and access control protocols, and user privacy preservation
protocols are presented. After enumerating various possible attacks, the
chapter provides a detailed discussion on various existing security mechanisms
and protocols to defend against and wherever possible prevent the possible
attacks. Comparative analyses are also presented on the security schemes with
regards to the cryptographic schemes used, key management strategies deployed,
use of any trusted third party, computation and communication overhead involved
etc. The chapter then presents a brief discussion on various trust management
approaches for WMNs since trust and reputation-based schemes are increasingly
becoming popular for enforcing security in wireless networks. A number of open
problems in security and privacy issues for WMNs are subsequently discussed
before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the
author's previous submission in arXiv submission: arXiv:1102.1226. There are
some text overlaps with the previous submissio
- …