Mosaics of combinatorial designs for information-theoretic security
DOI10.1007/s10623-021-00994-1zbMath1485.05021arXiv2102.00983OpenAlexW3126620907WikidataQ114849814 ScholiaQ114849814MaRDI QIDQ2115738
Publication date: 21 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.00983
group divisible designbalanced incomplete block designwiretap channelsemantic securityprivacy amplificationmosaic of designs
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tiling groups with difference sets
- On coloured constant composition designs
- \(t{1\over 2}\)-designs
- Combinatorial techniques for universal hashing
- Universal hashing and authentication codes
- Almost independence of random variables and capacity of a secrecy channel
- Mosaics of combinatorial designs
- Semantic Security for the Wiretap Channel
- 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
- Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages
- Rényi Divergence and Kullback-Leibler Divergence
- Privacy Amplification by Public Discussion
- Generalized privacy amplification
- Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs
- Invertible Extractors and Wiretap Protocols
- Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
- Computational Complexity
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Some maximal arcs in finite projective planes
- Combinatorial Properties of Group Divisible Incomplete Block Designs
This page was built for publication: Mosaics of combinatorial designs for information-theoretic security
