Mosaics of combinatorial designs for information-theoretic security
From MaRDI portal
Publication:2115738
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.
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
Cites work
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 3453625 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Almost independence of random variables and capacity of a secrecy channel
- Combinatorial Properties of Group Divisible Incomplete Block Designs
- Combinatorial techniques for universal hashing
- Computational Complexity
- Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
- Generalized privacy amplification
- Information-theoretic key agreement: from weak to strong secret for free
- Invertible Extractors and Wiretap Protocols
- Mosaics of combinatorial designs
- On coloured constant composition designs
- Physical-layer security. From information theory to security engineering
- Privacy Amplification by Public Discussion
- Rényi Divergence and Kullback-Leibler Divergence
- Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages
- Security Analysis of <inline-formula> <tex-math notation="LaTeX">$\varepsilon $ </tex-math> </inline-formula>-Almost Dual Universal2Hash Functions: Smoothing of Min Entropy Versus Smoothing of Rényi Entropy of Order 2
- Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs
- Semantic security for the wiretap channel
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Some maximal arcs in finite projective planes
- Tiling groups with difference sets
- Universal hashing and authentication codes
- \(t{1\over 2}\)-designs
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)
