Abstract
AbstractWe 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.
Funder
deutsche forschungsgemeinschaft
Bundesministerium für Bildung und Forschung
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference34 articles.
1. Arora S., Barak B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009).
2. Bach E., Shallit J.: Algorithmic Number Theory. Efficient Algorithms, vol. 1. MIT Press, Cambridge (1996).
3. Bellare M., Tessaro S., Vardy A.: Semantic security for the wiretap channel. In: Safavi-Naini R., Canetti R. (eds.) CRYPTO 2012, vol. 7417, pp. 294–311. Lecture Notes in Computer Science. Springer, Berlin Heidelberg (2012).
4. Bellare, M., Tessaro, S., Vardy, A.: A cryptographic treatment of the wiretap channel (2012). arxiv:1201.2205v2
5. Bellare, M., Tessaro, S.: Polynomial-time, semantically-secure encryption achieving the secrecy capacity (2012). arxiv:1201.3160v2
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献