The Experts below are selected from a list of 5307 Experts worldwide ranked by ideXlab platform
Francesco Matucci - One of the best experts on this subject based on the ideXlab platform.
-
Cryptanalysis of the Shpilrain–Ushakov Protocol for Thompson’s Group
Journal of Cryptology, 2007Co-Authors: Francesco MatucciAbstract:This paper shows that an eavesdropper can always recover efficiently the private Key of one of the two parts of the public Key cryptography protocol introduced by Shpilrain and Ushakov (ACNS 2005, Lecture Notes in Comput. Sci., vol. 3531, pp. 151–163, 2005). Thus an eavesdropper can always recover the Shared Secret Key, making the protocol insecure.
-
Cryptanalysis of the Shpilrain-Ushakov Protocol in Thompson's Group
arXiv: Group Theory, 2006Co-Authors: Francesco MatucciAbstract:This paper shows that an eavesdropper can always recover efficiently the private Key of one of the two parts of the public Key cryptography protocol introduced by Shpilrain and Ushakov in [9]. Thus an eavesdropper can always recover the Shared Secret Key, making the protocol insecure.
Prakash Narayan - One of the best experts on this subject based on the ideXlab platform.
-
capacity of a Shared Secret Key
International Symposium on Information Theory, 2010Co-Authors: Imre Csiszar, Prakash NarayanAbstract:Shannon theoretic Shared Secret Key generation by multiple terminals is considered for a source model in which the components of a discrete memoryless multiple source and a noiseless public channel of unlimited capacity are available for accomplishing this goal. A Shared Secret Key is generated for distinct coalitions of terminals, with all the terminals cooperating in this task through their public communication. A communication from a terminal can be a function of its observed source component and of all previous communication. Member terminals of a coalition unite in recovering the Key. Secrecy is required from an eavesdropper that observes the public interterminal communication. A single-letter characterization of the Shared Secret Key capacity is obtained. When the Key must be concealed additionally from subsets of coalition members, we provide an upper bound for the strict Shared Secret Key capacity.
-
ISIT - Capacity of a Shared Secret Key
2010 IEEE International Symposium on Information Theory, 2010Co-Authors: Imre Csiszar, Prakash NarayanAbstract:Shannon theoretic Shared Secret Key generation by multiple terminals is considered for a source model in which the components of a discrete memoryless multiple source and a noiseless public channel of unlimited capacity are available for accomplishing this goal. A Shared Secret Key is generated for distinct coalitions of terminals, with all the terminals cooperating in this task through their public communication. A communication from a terminal can be a function of its observed source component and of all previous communication. Member terminals of a coalition unite in recovering the Key. Secrecy is required from an eavesdropper that observes the public interterminal communication. A single-letter characterization of the Shared Secret Key capacity is obtained. When the Key must be concealed additionally from subsets of coalition members, we provide an upper bound for the strict Shared Secret Key capacity.
Diethelm Ostry - One of the best experts on this subject based on the ideXlab platform.
-
WoWMoM - An experimental study of Secret Key generation for passive Wi-Fi wearable devices
2017 IEEE 18th International Symposium on A World of Wireless Mobile and Multimedia Networks (WoWMoM), 2017Co-Authors: Mohammad Hossein Chinaei, Vijay Sivaraman, Diethelm OstryAbstract:Passive Wi-Fi is a technology to generate 802.11b transmissions using backscatter communication, with power consumption 10000× lower than existing Wi-Fi chipsets. Since wearable devices are typically limited in resources such as power and storage, classical cryptographic security schemes are problematic for them. We instead propose to use wireless channel characteristics to secure data transfer. It has been shown that communicating wireless transceivers are able to generate Shared Secret Keys by measuring channel characteristics at a single frequency. These methods are not applicable to passive Wi-Fi, which uses two different frequencies. In this paper, we describe a method to generate a Shared Secret Key based on wireless channel characteristics in the passive Wi-Fi scenario where the two parties are using dual frequencies.
Vijay Sivaraman - One of the best experts on this subject based on the ideXlab platform.
-
WoWMoM - An experimental study of Secret Key generation for passive Wi-Fi wearable devices
2017 IEEE 18th International Symposium on A World of Wireless Mobile and Multimedia Networks (WoWMoM), 2017Co-Authors: Mohammad Hossein Chinaei, Vijay Sivaraman, Diethelm OstryAbstract:Passive Wi-Fi is a technology to generate 802.11b transmissions using backscatter communication, with power consumption 10000× lower than existing Wi-Fi chipsets. Since wearable devices are typically limited in resources such as power and storage, classical cryptographic security schemes are problematic for them. We instead propose to use wireless channel characteristics to secure data transfer. It has been shown that communicating wireless transceivers are able to generate Shared Secret Keys by measuring channel characteristics at a single frequency. These methods are not applicable to passive Wi-Fi, which uses two different frequencies. In this paper, we describe a method to generate a Shared Secret Key based on wireless channel characteristics in the passive Wi-Fi scenario where the two parties are using dual frequencies.
-
Methodologies of Secret-Key Agreement Using Methodologies of Secret-Key Agreement Using Wireless Channel Characteristics Wireless Channel Characteristics
2013Co-Authors: Syed Taha Ali, Vijay SivaramanAbstract:In this article, we give an overview of current research on Shared Secret-Key agreement between two parties. This agree⁃ ment is based on radio wireless channel characteristics. We discuss the advantages of this approach over traditional cryp⁃ tographic mechanisms and present the theoretical background of this approach. We then give a detailed description of the Key-agreement process and the threat model, and we summarize the typical performance metrics for Shared se⁃ cret-Key agreement. There are four processes in Shared Secret-Key agreement: sampling, quantization, information recon⁃ ciliation, and privacy amplification. We classify prior and current research in this area according to innovation on these four processes. We conclude with a discussion of existing challenges and directions for future work.
Sneha Kumar Kasera - One of the best experts on this subject based on the ideXlab platform.
-
High-Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements
IEEE Transactions on Mobile Computing, 2010Co-Authors: Neal Patwari, Jessica Croft, Suman Jana, Sneha Kumar KaseraAbstract:Secret Keys can be generated and Shared between two wireless nodes by measuring and encoding radio channel characteristics without ever revealing the Secret Key to an eavesdropper at a third location. This paper addresses bit extraction, i.e., the extraction of Secret Key bits from noisy radio channel measurements at two nodes such that the two Secret Keys reliably agree. Problems include 1) nonsimultaneous directional measurements, 2) correlated bit streams, and 3) low bit rate of Secret Key generation. This paper introduces high-rate uncorrelated bit extraction (HRUBE), a framework for interpolating, transforming for decorrelation, and encoding channel measurements using a multibit adaptive quantization scheme which allows multiple bits per component. We present an analysis of the probability of bit disagreement in generated Secret Keys, and we use experimental data to demonstrate the HRUBE scheme and to quantify its experimental performance. As two examples, the implemented HRUBE system can achieve 22 bits per second at a bit disagreement rate of 2.2 percent, or 10 bits per second at a bit disagreement rate of 0.54 percent.
