Mosaics of combinatorial designs for information-theoretic security

DOI10.1007/S10623-021-00994-1zbMATH Open1485.05021arXiv2102.00983OpenAlexW3126620907WikidataQ114849814 ScholiaQ114849814MaRDI QIDQ2115738FDOQ2115738

Holger Boche, Moritz Wiese

Publication date: 21 March 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2102.00983

Recommendations

• Combinatorial designs for authentication and secrecy codes
• Combinatorial designs and cryptography, revisited
• scientific article; zbMATH DE number 446495
• Theory of combinatorial designs with applications to encryption and the design of experiments
• Jordan derivations on prime rings
• A construction for authentication/secrecy codes from certain combinatorial designs
• scientific article; zbMATH DE number 4057437
• The combinatorics of authentication and secrecy codes
• scientific article; zbMATH DE number 1342086
• Information-theoretically secure protocols and security under composition

zbMATH Keywords

balanced incomplete block designgroup divisible designwiretap channelsemantic securityprivacy amplificationmosaic of designs

Mathematics Subject Classification ID

Information theory (general) (94A15) Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Computational Complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized privacy amplification
• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• Privacy Amplification by Public Discussion
• Title not available (Why is that?)
• Rényi Divergence and Kullback-Leibler Divergence
• Universal hashing and authentication codes
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Almost independence of random variables and capacity of a secrecy channel
• Information-theoretic key agreement: from weak to strong secret for free
• Some maximal arcs in finite projective planes
• \(t{1\over 2}\)-designs
• Combinatorial techniques for universal hashing
• Mosaics of combinatorial designs
• Tiling groups with difference sets
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• Semantic Security for the Wiretap Channel
• Invertible Extractors and Wiretap Protocols
• On coloured constant composition designs
• Security Analysis of <inline-formula> <tex-math notation="LaTeX">$\varepsilon $ </tex-math> </inline-formula>-Almost Dual Universal₂Hash Functions: Smoothing of Min Entropy Versus Smoothing of Rényi Entropy of Order 2
• Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages
• Title not available (Why is that?)
• Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs

Cited In (1)

• Semantic security for quantum wiretap channels

This page was built for publication: Mosaics of combinatorial designs for information-theoretic security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115738)