33 research outputs found
Lightweight and Practical Anonymous Authentication Protocol for RFID systems using physically unclonable functions
No full textRadio frequency identification (RFID) has been considered one of the imperative requirements for implementation of Internet-of-Things applications. It helps to solve the identification issues of the things in a cost-effective manner, but RFID systems often suffer from various security and privacy issues. To solve those issues for RFID systems, many schemes have been recently proposed by using the cryptographic primitive, called physically uncloneable functions (PUFs), which can ensure a tamper-evident feature. However, to the best of our knowledge, none of them has succeeded to address the problem of privacy preservation with the resistance of DoS attacks in a practical way. For instance, existing schemes need to rely on exhaustive search operations to identify a tag, and also suffer from several security and privacy related issues. Furthermore, a tag needs to store some security credentials (e.g., secret shared keys), which may cause several issues such as loss of forward and backward secrecy and large storage costs. Therefore, in this paper, we first propose a lightweight privacy-preserving authentication protocol for the RFID system by considering the ideal PUF environment. Subsequently, we introduce an enhanced protocol which can support the noisy PUF environment. It is argued that both of our protocols can overcome the limitations of existing schemes, and further ensure more security properties. By analyzing the performance, we have shown that the proposed solutions are secure, efficient, practical, and effective for the resource-constraint RFID tag
Secure Communications for the Two-user Broadcast Channel with Random Traffic
No full textIn this work, we study the stability region of the two-user broadcast channel (BC) with bursty data arrivals and security constraints. It is assumed that one of the receivers has a secrecy constraint, i.e., its packets need to be kept secret from the other receiver, which is defined based on SINR. The receiver with secrecy constraint has full-duplex capability to send a jamming signal for improving its service rate. The stability region of the two-user BC with secrecy constraint is characterized for the general decoding case. Then, assuming two different decoding schemes the respective stability regions are derived. The fullduplex operation of receiver results in self-interference, and the effect of imperfect self-interference cancelation on the stability region is also investigated. The stability region of the BC with a secrecy constraint, where the receivers do not have full duplex capability can be obtained as a special case of the results derived in this paper. In addition, the paper considers the problem of maximizing the saturated throughput of the queue for which there is no secrecy constraint under minimum service guarantees for the other queue. The results provide new insights on the effect of the secrecy constraint on the stability region of the BC. It is found that the stability region with secrecy constraint is sensitive to the degree of self-interference cancelation.Funding agencies: National Research Foundation of Korea, Korea Government (MSIP) [2017R1C1B2009280]; DGIST Research and Development Program of the Ministry of Science and ICT [17-ST-02]; DGIST Research and Development Program of the Ministry of Science and ICT under ELLIIT</p
IEEE/ACM Transactions On Networking : Vol. 21, No. 3, June 2013
No full text1. Randomized information dissemination in dynamic environments.
2. Towards MIMO-Aware 802.11n rate adaptation.
3. Fast algorithms and performance bounds for sum rate maximization in wireless networks.
4. Privacy vulnerability of published anonymous mobility traces.
5. Rigorous statistical analysis of internet loss measurenments.
6. Distributed CSMA Algorithms for link scheduling in multihop MIMO networks under SINR model.
7. An Efficient and fair MAC protocol robust to reactive interface.
8. Fine-grained channel access in wireless LAN.
9. A formal data-centric approach for passive testing of communnication protocols.
10. QFQ Efficient packet scheduling with tight guarantees
Control of Diffusion Processes in Multi-agent Networks
No full textDiffusion processes are instrumental in describing the movement of a continuous quantity in a generic network of interacting agents. Here, we present a probabilistic framework for diffusion in networks and propose to classify agent interactions according to two protocols where the total network quantity is conserved or variable. For both protocols, our focus is on asymmetric interactions between agents involving directed graphs. Specifically, we define how the dynamics of conservative and non-conservative networks relate to the weighted in-degree Laplacian and the weighted out-degree Laplacian. We show how network diffusion can be externally manipulated by applying time-varying input functions at individual nodes. The network control and design schemes enable flow modifications that allow the alteration of the dynamic and stationary behavior of the network in conservative and non-conservative networks. The proposed framework is relevant in the context of group coordination, herding behavior, distributed algorithms, and network control
Diffusion control in multi-agent networks
No full textDiffusion processes are a fundamental way to describe the transfer of a continuous quantity in a generic network of interacting agents. In this work, we establish a probabilistic framework for diffusion in networks. In addition, we classify agent interactions according to two protocols where the total network quantity is conserved or variable. For both protocols, we use directed graphs to model asymmetric interactions between agents. Specifically, we define how the dynamics of conservative and non-conservative networks relate to the weighted in-degree and out-degree Laplacians respectively. Our framework enables the addition and subtraction of the considered quantity to and from a set of agents. This allows the framework to accommodate external network control and targeted network design. We show how network diffusion can be externally manipulated by injecting time-varying input functions at individual nodes. Desirable network structures can also be constructed by modifying the dominant diffusion modes. To this purpose, we propose a Markov decision process that learns these network adjustments through a reinforcement learning algorithm, suitable for large networks. The proposed network control and design schemes enable flow modifications that promote the alteration of the dynamic and stationary behavior of the network in conservative and non-conservative networks
