Results 21 to 30 of about 21,469 (254)

On the Design of Lightweight and Secure Mutual Authentication System for Global Roaming in Resource-Limited Mobility Networks

open access: yesIEEE Access, 2021
A secure authentication protocol plays a crucial role in securing communications over wireless and mobile networks. Due to resource-limitations and the nature of the wireless channel, the global mobile networks are highly susceptible to various attacks ...
R. Shashidhara   +3 more
doaj   +1 more source

Regression and Algorithmic Information Theory

open access: yesCoRR, 2023
In this paper we prove a theorem about regression, in that the shortest description of a function consistent with a finite sample of data is less than the combined conditional Kolmogorov complexities over the data in the sample.
openaire   +2 more sources

Multisource Algorithmic Information Theory [PDF]

open access: yes, 2006
Multisource information theory is well known in Shannon setting. It studies the possibilities of information transfer through a network with limited capacities. Similar questions could be studied for algorithmic information theory and provide a framework for several known results and interesting questions.
openaire   +6 more sources

Provably Secure ECC-Based Device Access Control and Key Agreement Protocol for IoT Environment

open access: yesIEEE Access, 2019
For secure communication between any two neighboring sensing devices on the Internet of Things (IoT) environment, it is essential to design a secure device access control and key agreement protocol, in which the two phases, namely, “node ...
Ashok Kumar Das   +4 more
doaj   +1 more source

An Operational Characterization of Mutual Information in Algorithmic Information Theory [PDF]

open access: yesJournal of the ACM, 2019
We show that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings x and y is equal, up to logarithmic precision, to the length of the longest shared secret key that two parties—one having x and the complexity profile of the pair and the
Andrei Romashchenko, Marius Zimand
openaire   +5 more sources

Design of an Anonymity-Preserving Group Formation Based Authentication Protocol in Global Mobility Networks

open access: yesIEEE Access, 2018
Remote user authentication without compromising user anonymity is an emerging area in the last few years. In this paper, we propose a new anonymity preserving mobile user authentication scheme for the global mobility networks (GLOMONETs). We also propose
Soumya Banerjee   +6 more
doaj   +1 more source

Correlations in Quantum Network Topologies Created with Cloning

open access: yesMathematics, 2023
With progress in quantum technologies, the field of quantum networks has emerged as an important area of research. In the last few years, there has been substantial progress in understanding the correlations present in quantum networks.
Manish Kumar Shukla   +3 more
doaj   +1 more source

A robust anonymous biometric-based remote user authentication scheme using smart cards

open access: yesJournal of King Saud University: Computer and Information Sciences, 2015
Several biometric-based remote user authentication schemes using smart cards have been proposed in the literature in order to improve the security weaknesses in user authentication system.
Ashok Kumar Das, Adrijit Goswami
doaj   +1 more source

Algorithmic Information Theory for Obfuscation Security [PDF]

open access: yesProceedings of the 12th International Conference on Security and Cryptography, 2015
The main problem in designing effective code obfuscation is to guarantee security. State of the art obfuscation techniques rely on an unproven concept of security, and therefore are not regarded as provably secure. In this paper, we undertake a theoretical investigation of code obfuscation security based on Kolmogorov complexity and algorithmic mutual ...
Rabih Mohsen, Alexandre Miranda Pinto
openaire   +2 more sources

A circuit complexity formulation of algorithmic information theory

open access: yesPhysica D: Nonlinear Phenomena, 2023
Inspired by Solomonoffs theory of inductive inference, we propose a prior based on circuit complexity. There are several advantages to this approach. First, it relies on a complexity measure that does not depend on the choice of UTM. There is one universal definition for Boolean circuits involving an universal operation such as nand with simple ...
Cole Wyeth, Carl Sturtivant
openaire   +3 more sources

Home - About - Disclaimer - Privacy