Abstract
The growth of the Internet of Things (IoT) is raising significant impact in several contexts, e.g., in cities, at home, and even attached to the human body. This digital transformation is happening at a high pace and causing a great impact in our daily lives, namely in our attempt to make cities smarter in an attempt to increase their efficiency while reducing costs and increasing safety. However, this effort is being supported by the massive deployment of sensors throughout cities worldwide, leading to increase concerns regarding security and privacy. While some of these issues have already been tackled, device authentication remains without a viable solution, specially when considering a resilient decentralized approach that is the most suitable for this scenario, as it avoids some issues related to centralization, e.g., censorship and data leakage or profit from corporations. The provisioning is usually an arduous task that encompasses device configuration, including identity and key provisioning. Given the potential large number of devices, this process must be scalable and semi-autonomous, at least. This work presents a novel approach for provisioning IoT devices that adopts an architecture where other device acts as a manager that represents a CA, allowing it to be switched on/off during the provisioning phase to reduce single point of failure (SPOF) problems. Our solution combines One Time Password (OTP) on a secure token and cryptographic algorithms on a hybrid authentication system.

Abstract
Security and privacy concerns are challenging the way users interact with devices. The number of devices connected to a home or enterprise network increases every day. Nowadays, the security of information systems is relevant as user information is constantly being shared and moving in the cloud; however, there are still many problems such as, unsecured web interfaces, weak authentication, insecure networks, lack of encryption, among others, that make services insecure. The software implementations that are currently deployed in companies should have updates and control, as cybersecurity threats increasingly appearing over time. There is already some research towards solutions and methods to predict new attacks or classify variants of previous known attacks, such as (algorithmic) information theory. This survey combines all relevant applications of this topic (also known as Kolmogorov Complexity) in the security and privacy domains. The use of Kolmogorov-based approaches is resource-focused without the need for specific knowledge of the topic under analysis. We have defined a taxonomy with already existing work to classify their different application areas and open up new research questions.

Abstract
In this work, we consider the pros and cons of using various layers of keyless coding to achieve secure and reliable communication over the Gaussian wiretap channel. We define a new approach to information theoretic security, called practical secrecy and the secrecy benefit, to be used over real-world channels and finite blocklength instantiations of coding layers, and use this new approach to show the fundamental reliability and security implications of several coding mechanisms that have traditionally been used for physical-layer security. We perform a systematic/structured analysis of the effect of error-control coding, scrambling, interleaving, and coset coding, as coding layers of a secrecy system. Using this new approach, scrambling and interleaving are shown to be of no effect in increasing information theoretic security, even when measuring the effect at the output of the eavesdropper's decoder. Error control coding is shown to present a trade-off between secrecy and reliability that is dictated by the chosen code and the signal-to-noise ratios at the legitimate and eavesdropping receivers. Finally, the benefits of secrecy coding are highlighted, and it is shown how one can shape the secrecy benefit according to system specifications using combinations of different layers of coding to achieve both reliable and secure throughput.

Abstract
In this paper, we fill a void between information theoretic security and practical coding over the Gaussian wiretap channel using a three-stage encoder/decoder technique. Security is measured using Kullback-Leibler divergence and resolvability techniques along with a limited number of practical assumptions regarding the eavesdropper's decoder. The results specify a general coding recipe for obtaining both secure and reliable communications over the Gaussian wiretap channel, and one specific set of concatenated codes is presented as a test case for the sake of providing simulation-based evaluation of security and reliability over the network. It is shown that there exists a threshold in signal-to-noise ratio (SNR) over a Gaussian channel, such that receivers experiencing SNR below the threshold have no practical hope of receiving information about the message when the three-stage coding technique is applied. Results further indicate that the two innermost encoding stages successfully approximate a binary symmetric channel, allowing the outermost encoding stage (e.g., a wiretap code) to focus solely on secrecy coding over this approximated channel.

Abstract
Index Modulation (IM) is a technique that activate k out of n subcarriers of an OFDM symbol to transmit p(1) = right perpendicularlog(2) (n k)left perpendicular bits in symbol's indexes. Since both the symbol's spectrum width and transmission air-time duration remain the same, OFDM-IM outperforms OFDM's Spectral Efficiency (SE) for larger values of (n k). However, OFDM-IM requires an extra step called Index Selector (IxS) which takes T-alpha time units to map a given p(1)-bit input to its corresponding pattern of active subcarriers. This extra overhead virtually enlarges the symbol duration, which is not captured by the classic SE definition. To fulfill this gap, in this work we present the Spectro-Computational Efficiency (SCE) metric. SCE parameterizes either the absolute runtime of T-alpha on a reference hardware or its computational complexity T-alpha(n; k) as function of n and k. Based on SCE, we present theoretical case studies to identify the asymptotic bounds for T-alpha(n, k) across different choices of k. if T-alpha(n, n=2) is at most linear on n the resulting overhead is asymptotically negligible and IxS can handle an arbitrarily large OFDM symbol. Otherwise, OFDM-IM's SCE tends to zero regardless of the hardware processor speed. Also, we situate the inflection-point values for OFDM-IM's SCE between (6 3) and (14 7) in some practical case studies.

Abstract
We propose an adaptive secrecy scheme using polar codes with random frozen bits for a general wiretap channel, in which to protect the data from a potential eavesdropper, part or all of the frozen bits are randomly generated per message. To assess the secrecy level of the proposed scheme, three types of decoding strategies are evaluated: a matching decoder which knows the positions of all inserted bits inside the blocklength and tries to estimate them using the same decoding techniques, a blind decoder which treats all the frozen bits as the same value, and a random decoder which considers those dynamic bits as random at the receiver. Results are presented in terms of the system security gap, assuming an adaptive decoding strategy. It is shown that the system achieves combined secrecy and reliability. The proposed scheme does not assume knowledge of the eavesdropper's channel when defining the indices of information and frozen bits. © 2019 IEEE.