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

IEEE International Symposium on Information Theory (ISIT)

Mosaics of combinatorial designs for privacy amplification

Moritz Wiese, Holger Boche

Published Jul 12, 2021• 1 citation
Publisher

Abstract

We study security functions which can serve to establish semantic security for privacy amplification in secret key generation. The security functions are functional forms of mosaics of combinatorial designs, more precisely, of group divisible designs and balanced incomplete block designs. Every member of a mosaic corresponds to a unique key value. We give explicit examples which have an optimal or nearly optimal tradeoff of seed size, given by the size of the block index set of the mosaics, versus key rate. We also derive bounds for the security performance in privacy amplification of security functions given by functional forms of mosaics of designs.

DOI
10.1109/isit45174.2021.9518227

Related papers

Mosaics of combinatorial designs for information-theoretic security

Moritz Wiese, Holger Boche

Abstract We study security functions which can serve to establish semantic security for the two central problems of information-theoretic security: the wiretap channel, and privacy amplification for secret key generation. The security functions are functional forms of mosaics of combinatorial designs, more precisely, of group divisible designs and balanced incomplete block designs. Every member of a mosaic is associated with a unique color, and each color corresponds to a unique message or key value. Every block index of the mosaic corresponds to a public seed shared between the two trusted communicating parties. The seed set should be as small as possible. We give explicit examples which have an optimal or nearly optimal trade-off of seed length versus color (i.e., message or key) rate. We also derive bounds for the security performance of security functions given by functional forms of mosaics of designs.

arXiv:2102.00983•Designs Codes and Cryptography•Jan 5, 2022•13 citations

Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels

Holger Boche, Minglai Cai, Moritz Wiese

We study semantic security for classical-quantum channels. Our security functions are functional forms of mosaics of combinatorial designs. We extend methods in [25] from classical channels to classical-quantum channels to demonstrate that mosaics of designs ensure semantic security for classical-quantum channels, and are also capacity achieving coding schemes. An advantage of these modular wiretap codes is that we provide explicit code constructions that can be implemented in practice for every channel, given an arbitrary public code.

arXiv:2202.05314•IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•4 citations

Security Issues Associated With Error Correction And Privacy Amplification In Quantum Key Distribution

Horace P. Yuen

Privacy amplification is a necessary step in all quantum key distribution protocols, and error correction is needed in each except when signals of many photons are used in the key communication in quantum noise approach. No security analysis of error correcting code information leak to the attacker has ever been provided, while an ad hoc formula is currently employed to account for such leak in the key generation rate. It is also commonly believed that privacy amplification allows the users to at least establish a short key of arbitrarily close to perfect security. In this paper we show how the lack of rigorous error correction analysis makes the otherwise valid privacy amplification results invalid, and that there exists a limit on how close to perfect a generated key can be obtained from privacy amplification. In addition, there is a necessary tradeoff between key rate and security, and the best theoretical values from current theories would not generate enough near-uniform key bits to cover the message authentication key cost in disturbance-information tradeoff protocols of the BB84 variety.

arXiv:1411.2310•Nov 10, 2014•1 citation

Secrecy by Design With Applications to Privacy and Compression

Yanina Y. Shkel, Rick S. Blum, H. Vincent Poor

Secrecy by design is examined as an approach to information-theoretic secrecy. The main idea behind this approach is to design an information processing system from the ground up to be perfectly secure with respect to an explicit secrecy constraint. The principal technical contributions are decomposition bounds that allow the representation of a random variable$X$as a deterministic function of$({S},{Z})$, where$S$is a given fixed random variable and$Z$is constructed to be independent of$S$. Using the problems of privacy and lossless compression as examples, the utility cost of applying secrecy by design is investigated. Privacy is studied in the setting of the privacy funnel function previously introduced in the literature and new bounds for the regime of zero information leakage are derived. For the problem of lossless compression, it is shown that strong information-theoretic guarantees can be achieved using a reduced secret key size and a quantifiable penalty on the compression rate. The fundamental limits for both problems are characterized with matching lower and upper bounds when the secret$S$is a deterministic function of the information source$X$.

IEEE Transactions on Information Theory•Nov 30, 2020•42 citations

Effective Privacy Amplification for Secure Classical Communications⋆

Horváth, T., Kish, L. B., Jacob Scheuer

We study the practical effectiveness of privacy amplification for classical key distribution schemes. We find that in contrast to quantum key distribution schemes, the high fidelity of the raw key generated in classical systems allow the users to always sift a secure shorter key if they have an upper bound on the eavesdropper probability to correctly guess the exchanged key bits. The number of privacy amplification iterations needed to achieve information leak of 10−8 in existing classical communicators is 2 or 3 resulting in a corresponding slowdown 4 to 8. We analyze the inherent tradeoff between the number of iterations and the security of the raw key. This property which is unique to classical key distribution systems render them highly useful for practical, especially for noisy channels where sufficiently low quantum bit error ratios are difficult to achieve.

•Jan 1, 2011•39 citations

Effective privacy amplification for secure classical communications

T. Horváth, L. B. Kish, J. Scheuer

We study the practical effectiveness of privacy amplification for classical key distribution schemes. We find that in contrast to quantum key distribution schemes, the high fidelity of the raw key generated in classical systems allow the users to always sift a secure shorter key if they have an upper bound on the eavesdropper probability to correctly guess the exchanged key bits. The number of privacy amplification iterations needed to achieve information leak of 10 −8 in existing classical communicators is 2 or 3 resulting in a corresponding slowdown 4 to 8. We analyze the inherent tradeoff between the number of iterations and the security of the raw key. This property which is unique to classical key distribution systems render them highly useful for practical, especially for noisy channels where sufficiently low quantum bit error ratios are difficult to achieve.

arXiv:1101.4264•Europhysics Letters (EPL)•Apr 1, 2011•40 citations
We study security functions which can serve to establish semantic security for privacy amplification in secret key generation. The security functions are functional forms of mosaics of combinatorial designs, more precisely, of group divisible designs and balanced incomplete block designs. Every member of a mosaic corresponds to a unique key value. We give explicit examples which have an optimal or nearly optimal tradeoff of seed size, given by the size of the block index set of the mosaics, versus key rate. We also derive bounds for the security performance in privacy amplification of security functions given by functional forms of mosaics of designs.
Abstract We study security functions which can serve to establish semantic security for the two central problems of information-theoretic security: the wiretap channel, and privacy amplification for secret key generation. The security functions are functional forms of mosaics of combinatorial designs, more precisely, of group divisible designs and balanced incomplete block designs. Every member of a mosaic is associated with a unique color, and each color corresponds to a unique message or key value. Every block index of the mosaic corresponds to a public seed shared between the two trusted communicating parties. The seed set should be as small as possible. We give explicit examples which have an optimal or nearly optimal trade-off of seed length versus color (i.e., message or key) rate. We also derive bounds for the security performance of security functions given by functional forms of mosaics of designs.
We study semantic security for classical-quantum channels. Our security functions are functional forms of mosaics of combinatorial designs. We extend methods in [25] from classical channels to classical-quantum channels to demonstrate that mosaics of designs ensure semantic security for classical-quantum channels, and are also capacity achieving coding schemes. An advantage of these modular wiretap codes is that we provide explicit code constructions that can be implemented in practice for every channel, given an arbitrary public code.
Privacy amplification is a necessary step in all quantum key distribution protocols, and error correction is needed in each except when signals of many photons are used in the key communication in quantum noise approach. No security analysis of error correcting code information leak to the attacker has ever been provided, while an ad hoc formula is currently employed to account for such leak in the key generation rate. It is also commonly believed that privacy amplification allows the users to at least establish a short key of arbitrarily close to perfect security. In this paper we show how the lack of rigorous error correction analysis makes the otherwise valid privacy amplification results invalid, and that there exists a limit on how close to perfect a generated key can be obtained from privacy amplification. In addition, there is a necessary tradeoff between key rate and security, and the best theoretical values from current theories would not generate enough near-uniform key bits to cover the message authentication key cost in disturbance-information tradeoff protocols of the BB84 variety.
Secrecy by design is examined as an approach to information-theoretic secrecy. The main idea behind this approach is to design an information processing system from the ground up to be perfectly secure with respect to an explicit secrecy constraint. The principal technical contributions are decomposition bounds that allow the representation of a random variableXXXas a deterministic function of(S,Z)({S},{Z})(S,Z), whereSSSis a given fixed random variable andZZZis constructed to be independent ofSSS. Using the problems of privacy and lossless compression as examples, the utility cost of applying secrecy by design is investigated. Privacy is studied in the setting of the privacy funnel function previously introduced in the literature and new bounds for the regime of zero information leakage are derived. For the problem of lossless compression, it is shown that strong information-theoretic guarantees can be achieved using a reduced secret key size and a quantifiable penalty on the compression rate. The fundamental limits for both problems are characterized with matching lower and upper bounds when the secretSSSis a deterministic function of the information sourceXXX.
We study the practical effectiveness of privacy amplification for classical key distribution schemes. We find that in contrast to quantum key distribution schemes, the high fidelity of the raw key generated in classical systems allow the users to always sift a secure shorter key if they have an upper bound on the eavesdropper probability to correctly guess the exchanged key bits. The number of privacy amplification iterations needed to achieve information leak of 10−8 in existing classical communicators is 2 or 3 resulting in a corresponding slowdown 4 to 8. We analyze the inherent tradeoff between the number of iterations and the security of the raw key. This property which is unique to classical key distribution systems render them highly useful for practical, especially for noisy channels where sufficiently low quantum bit error ratios are difficult to achieve.
We study the practical effectiveness of privacy amplification for classical key distribution schemes. We find that in contrast to quantum key distribution schemes, the high fidelity of the raw key generated in classical systems allow the users to always sift a secure shorter key if they have an upper bound on the eavesdropper probability to correctly guess the exchanged key bits. The number of privacy amplification iterations needed to achieve information leak of 10 −8 in existing classical communicators is 2 or 3 resulting in a corresponding slowdown 4 to 8. We analyze the inherent tradeoff between the number of iterations and the security of the raw key. This property which is unique to classical key distribution systems render them highly useful for practical, especially for noisy channels where sufficiently low quantum bit error ratios are difficult to achieve.