Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Information Leakage Due to Revealing Randomly Selected Bits

Arash Atashpendar, Andrew William Roscoe, Peter Y. A. Ryan

Published Jan 1, 2015• 6 citations
Publisher
DOI
10.1007/978-3-319-26096-9_33

Related papers

Information Leakage Due to Revealing Randomly Selected Bits (Transcript of Discussion)

Arash Atashpendar

Lecture notes in computer science•Jan 1, 2015•0 citations

Controlled Gradual Disclosure Schemes for Random Bits and Their Applications

Richard Cleve

Springer eBooks•Nov 9, 2007•89 citations

Let’s shake on it: Extracting secure shared keys from Wi-Fi CSI

Tomer Avrahami, Ofer Amrani, Avishai Wool

A shared secret key is necessary for encrypted communications. Since Wi-Fi relies on OFDM, we suggest a method for generating such key by utilizing Wi-Fi’s channel state information (CSI). The channel is typically reciprocal but very sensitive to location: while (legitimate) Alice and Bob should observe the same CSI, an eavesdropper Eve shall observe uncorrelated CSI when positioned over 0.5 wavelength away from either node.We show that if endpoint Bob is shaken, sufficient diversity is induced in the CSI, thus rendering it a true source for randomness. We then show that the CSI among neighboring sub-carriers is correlated, so we select a small set of judiciously-spaced sub-carriers, and decide on a value based on a majority rule about each. Consequently, Alice and Bob observe a 5-15% bit mismatch rate (BMR) in the extracted bitstream while Eve experiences a BMR of around 50% even when placed 10cm away from Alice.We employ the cryptography-oriented definition of min-entropy to estimate the number of secure bits in the received bitstream, and employ the so-called Cascade algorithm of quantum-key-distribution to reconcile Alice and Bob’s bitstreams while quantifying the number of bits leaked by the algorithm. Accounting for both the min-entropy and the Cascade-based leakage we quantify the Secured Bit Generation Rate realized by our method.Extensive set of experiments have been conducted in an indoor environment revealing secure bit generation rate of 1.2–1.6 bits per packet, for endpoint distances ranging from 0.5m–9m; a (128-bit) secured shared-key is generated in 20sec of device shaking.

arXiv:2307.05423•IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)•Sep 25, 2023•2 citations

RESEARCH IN SECURE RANDOM VALUE GENERATION

Hoang Minh Ngo, Etienne-Alexandre Scraire, Miguel Angel Mora

•Apr 6, 2016•0 citations

Weakly Secure Summation With Colluding Users

Zhou Li, Yizhou Zhao, Hua Sun

In secure summation,Kusers, each holds an input, wish to compute the sum of the inputs at a server without revealing any information aboutall the inputseven if the server may collude withan arbitrary subset of users. In this work, we relax the security and colluding constraints, where the set of inputs whose information is prohibited from leakage is from a predetermined collection of sets (e.g., any set of up toSinputs) and the set of colluding users is from another predetermined collection of sets (e.g., any set of up toTusers). For arbitrary collection of security input sets and colluding user sets, we characterize the optimal randomness assumption, i.e., the minimum number of key bits that need to be held by the users, per input bit, for weakly secure summation to be feasible, which generally involves solving a linear program.

IEEE Transactions on Information Theory•May 13, 2025•9 citations

A Class of Perfectly Secret Autonomous Low-Bit-Rate Voice Communication Systems

Jelica Radomirović, Milan Milosavljević, Sara Čubrilović +4 more

This paper presents an autonomous perfectly secure low-bit-rate voice communication system (APS-VCS) based on the mixed-excitation linear prediction voice coder (MELPe), Vernam cipher, and sequential key distillation (SKD) protocol by public discussion. An authenticated public channel can be selected in a wide range, from internet connections to specially leased radio channels. We found the source of common randomness between the locally synthesized speech signal at the transmitter and the reconstructed speech signal at the receiver side. To avoid information leakage about open input speech, the SKD protocol is not executed on the actual transmitted speech signal but on artificially synthesized speech obtained by random selection of the linear spectral pairs (LSP) parameters of the speech production model. Experimental verification of the proposed system was performed on the Vlatacom Personal Crypto Platform for Voice encryption (vPCP-V). Empirical measurements show that with an adequate selection of system parameters for voice transmission of 1.2 kb/s, a secret key rate (KR) of up to 8.8 kb/s can be achieved, with a negligible leakage rate (LR) and bit error rate (BER) of order 10−3 for various communications channels, including GSM 3G and GSM VoLTE networks. At the same time, by ensuring perfect secrecy within symmetric encryption systems, it further highlights the importance of the symmetry principle in the field of information-theoretic security. To our knowledge, this is the first autonomous, perfectly secret system for low-bit-rate voice communication that does not require explicit prior generation and distribution of secret keys.

Symmetry•Feb 27, 2025•1 citation
A shared secret key is necessary for encrypted communications. Since Wi-Fi relies on OFDM, we suggest a method for generating such key by utilizing Wi-Fi’s channel state information (CSI). The channel is typically reciprocal but very sensitive to location: while (legitimate) Alice and Bob should observe the same CSI, an eavesdropper Eve shall observe uncorrelated CSI when positioned over 0.5 wavelength away from either node.We show that if endpoint Bob is shaken, sufficient diversity is induced in the CSI, thus rendering it a true source for randomness. We then show that the CSI among neighboring sub-carriers is correlated, so we select a small set of judiciously-spaced sub-carriers, and decide on a value based on a majority rule about each. Consequently, Alice and Bob observe a 5-15% bit mismatch rate (BMR) in the extracted bitstream while Eve experiences a BMR of around 50% even when placed 10cm away from Alice.We employ the cryptography-oriented definition of min-entropy to estimate the number of secure bits in the received bitstream, and employ the so-called Cascade algorithm of quantum-key-distribution to reconcile Alice and Bob’s bitstreams while quantifying the number of bits leaked by the algorithm. Accounting for both the min-entropy and the Cascade-based leakage we quantify the Secured Bit Generation Rate realized by our method.Extensive set of experiments have been conducted in an indoor environment revealing secure bit generation rate of 1.2–1.6 bits per packet, for endpoint distances ranging from 0.5m–9m; a (128-bit) secured shared-key is generated in 20sec of device shaking.
In secure summation,Kusers, each holds an input, wish to compute the sum of the inputs at a server without revealing any information aboutall the inputseven if the server may collude withan arbitrary subset of users. In this work, we relax the security and colluding constraints, where the set of inputs whose information is prohibited from leakage is from a predetermined collection of sets (e.g., any set of up toSinputs) and the set of colluding users is from another predetermined collection of sets (e.g., any set of up toTusers). For arbitrary collection of security input sets and colluding user sets, we characterize the optimal randomness assumption, i.e., the minimum number of key bits that need to be held by the users, per input bit, for weakly secure summation to be feasible, which generally involves solving a linear program.
This paper presents an autonomous perfectly secure low-bit-rate voice communication system (APS-VCS) based on the mixed-excitation linear prediction voice coder (MELPe), Vernam cipher, and sequential key distillation (SKD) protocol by public discussion. An authenticated public channel can be selected in a wide range, from internet connections to specially leased radio channels. We found the source of common randomness between the locally synthesized speech signal at the transmitter and the reconstructed speech signal at the receiver side. To avoid information leakage about open input speech, the SKD protocol is not executed on the actual transmitted speech signal but on artificially synthesized speech obtained by random selection of the linear spectral pairs (LSP) parameters of the speech production model. Experimental verification of the proposed system was performed on the Vlatacom Personal Crypto Platform for Voice encryption (vPCP-V). Empirical measurements show that with an adequate selection of system parameters for voice transmission of 1.2 kb/s, a secret key rate (KR) of up to 8.8 kb/s can be achieved, with a negligible leakage rate (LR) and bit error rate (BER) of order 10−3 for various communications channels, including GSM 3G and GSM VoLTE networks. At the same time, by ensuring perfect secrecy within symmetric encryption systems, it further highlights the importance of the symmetry principle in the field of information-theoretic security. To our knowledge, this is the first autonomous, perfectly secret system for low-bit-rate voice communication that does not require explicit prior generation and distribution of secret keys.