{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:01:33Z","timestamp":1774022493303,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T00:00:00Z","timestamp":1641340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T00:00:00Z","timestamp":1641340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"deutsche forschungsgemeinschaft","doi-asserted-by":"crossref","award":["EXC 2092 CASA - 390781972"],"award-info":[{"award-number":["EXC 2092 CASA - 390781972"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["16KISK002"],"award-info":[{"award-number":["16KISK002"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s10623-021-00994-1","type":"journal-article","created":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T14:03:37Z","timestamp":1641391417000},"page":"593-632","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Mosaics of combinatorial designs for information-theoretic security"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4561-9766","authenticated-orcid":false,"given":"Moritz","family":"Wiese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Boche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,5]]},"reference":[{"key":"994_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora S., Barak B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009)."},{"key":"994_CR2","volume-title":"Algorithmic Number Theory. Efficient Algorithms","author":"E Bach","year":"1996","unstructured":"Bach E., Shallit J.: Algorithmic Number Theory. Efficient Algorithms, vol. 1. MIT Press, Cambridge (1996)."},{"key":"994_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013311. Lecture Notes in Computer Science. Springer, Berlin Heidelberg (2012).","DOI":"10.1007\/978-3-642-32009-5_18"},{"key":"994_CR4","unstructured":"Bellare, M., Tessaro, S., Vardy, A.: A cryptographic treatment of the wiretap channel (2012). arxiv:1201.2205v2"},{"key":"994_CR5","unstructured":"Bellare, M., Tessaro, S.: Polynomial-time, semantically-secure encryption achieving the secrecy capacity (2012). arxiv:1201.3160v2"},{"issue":"2","key":"994_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"CH Bennett","year":"1988","unstructured":"Bennett C.H., Brassard G., Robert J.M.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210\u2013229 (1988).","journal-title":"SIAM J. Comput."},{"issue":"6","key":"994_CR7","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"CH Bennett","year":"1995","unstructured":"Bennett C.H., Brassard G., Cr\u00e9peau C., Maurer U.M.: Generalized privacy amplification. IEEE Trans. Inform. Theory 41(6), 1915\u20131923 (1995).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"994_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999)."},{"key":"994_CR9","volume-title":"Physical-Layer Security","author":"M Bloch","year":"2009","unstructured":"Bloch M., Barros J.: Physical-Layer Security. Cambridge University Press, Cambridge (2009)."},{"issue":"3","key":"994_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1214\/aoms\/1177729382","volume":"23","author":"RC Bose","year":"1952","unstructured":"Bose R.C., Connor W.S.: Combinatorial properties of group divisible incomplete block designs. Ann. Math. Stat. 23(3), 367\u2013383 (1952).","journal-title":"Ann. Math. Stat."},{"issue":"2","key":"994_CR11","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1109\/TIT.2011.2170660","volume":"58","author":"M Cheraghchi","year":"2012","unstructured":"Cheraghchi M., Didier F., Shokrollahi A.: Invertible extractors and wiretap protocols. IEEE Trans. Inform. Theory 58(2), 1254\u20131274 (2012).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"994_CR12","unstructured":"Clatworthy W.H.: Tables of Two-Associate-Class Partially Balanced Designs. U.S. Department of Commerce, National Bureau of Standards, Washington, D.C. (1973)."},{"issue":"1","key":"994_CR13","first-page":"40","volume":"32","author":"I Csisz\u00e1r","year":"1996","unstructured":"Csisz\u00e1r I.: Almost independence and secrecy capacity. Probl. Inform. Transm. 32(1), 40\u201347 (1996).","journal-title":"Probl. Inform. Transm."},{"key":"994_CR14","doi-asserted-by":"crossref","unstructured":"\u0106usti\u0107, A., Kr\u010dadinac, V., Zhou, Y.: Tiling groups with difference sets. Electron. J. Combin. 22(2) (2015)","DOI":"10.37236\/5157"},{"issue":"3","key":"994_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0021-9800(69)80095-5","volume":"6","author":"R Denniston","year":"1969","unstructured":"Denniston R.: Some maximal arcs in finite projective planes. J. Comb. Theory 6(3), 317\u2013319 (1969).","journal-title":"J. Comb. Theory"},{"key":"994_CR16","doi-asserted-by":"crossref","unstructured":"Fettweis, G.P., Boche, H.: 6G: the personal tactile internet-and open questions for information theory. IEEE BITS the Information Theory Magazine (2021)","DOI":"10.1109\/MBITS.2021.3118662"},{"issue":"1","key":"994_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10623-017-0328-6","volume":"86","author":"OW Gnilke","year":"2017","unstructured":"Gnilke O.W., Greferath M., Pav\u010devi\u0107 M.O.: Mosaics of combinatorial designs. Des. Codes Cryptogr. 86(1), 85\u201395 (2017).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"994_CR18","doi-asserted-by":"publisher","first-page":"2410","DOI":"10.1016\/j.disc.2008.06.022","volume":"309","author":"M Greferath","year":"2009","unstructured":"Greferath M., Therkelsen R.K.: On coloured constant composition designs. Discret. Math. 309(8), 2410\u20132416 (2009).","journal-title":"Discret. Math."},{"key":"994_CR19","doi-asserted-by":"crossref","unstructured":"Hanani, H.: On transversal designs. In: Combinatorics, Part 1, Mathematical Centre tracts, vol. 55, pp. 43\u201353. Mathematisch Centrum, Amsterdam (1975)","DOI":"10.1007\/978-94-010-1826-5_3"},{"issue":"1","key":"994_CR20","doi-asserted-by":"publisher","first-page":"012329","DOI":"10.1103\/PhysRevA.76.012329","volume":"76","author":"M Hayashi","year":"2007","unstructured":"Hayashi M.: Upper bounds of eavesdropper\u2019s performances in finite-length code with the decoy method. Phys. Rev. A 76(1), 012329 (2007).","journal-title":"Phys. Rev. A"},{"issue":"6","key":"994_CR21","doi-asserted-by":"publisher","first-page":"3989","DOI":"10.1109\/TIT.2011.2110950","volume":"57","author":"M Hayashi","year":"2011","unstructured":"Hayashi M.: Exponential decreasing rate of leaked information in universal random privacy amplification. IEEE Trans. Inform. Theory 57(6), 3989\u20134001 (2011).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"994_CR22","doi-asserted-by":"publisher","first-page":"3451","DOI":"10.1109\/TIT.2016.2535174","volume":"62","author":"M Hayashi","year":"2016","unstructured":"Hayashi M.: Security analysis of $$\\varepsilon $$-almost dual universal$$_{2}$$ hash functions: smoothing of min entropy versus smoothing of R\u00e9nyi entropy of order 2. IEEE Trans. Inform. Theory 62(6), 3451\u20133476 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"994_CR23","doi-asserted-by":"publisher","first-page":"2355","DOI":"10.1109\/TIT.2016.2530088","volume":"62","author":"M Hayashi","year":"2016","unstructured":"Hayashi M., Matsumoto R.: Secure multiplex coding with dependent and non-uniform multiple messages. IEEE Trans. Inform. Theory 62(5), 2355\u20132409 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"994_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525926","volume-title":"Finite Fields","author":"R Lidl","year":"1996","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1996)."},{"key":"994_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45539-6_24","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2000","author":"U Maurer","year":"2000","unstructured":"Maurer U., Wolf S.: Information-theoretic key agreement: from weak to strong secrecy for free. In: Preneel B. (ed.) Advances in Cryptology\u2014EUROCRYPT 2000, vol. 1807, pp. 351\u2013368. Lecture Notes in Computer Science. Springer, Berlin (2000)."},{"key":"994_CR26","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1997","unstructured":"Menezes A.J., van Oorschot P.C., Vanstone S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)."},{"issue":"3","key":"994_CR27","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(80)90067-9","volume":"28","author":"A Neumaier","year":"1980","unstructured":"Neumaier A.: $$t\\frac{1}{2}$$-designs. J. Combin. Theory Ser. A 28(3), 226\u2013248 (1980).","journal-title":"J. Combin. Theory Ser. A"},{"key":"994_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11593447_11","volume-title":"ASIACRYPT 2005","author":"R Renner","year":"2005","unstructured":"Renner R., Wolf S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy B. (ed.) ASIACRYPT 2005, vol. 3788, pp. 199\u2013216. Lecture Notes in Computer Science. Springer, Berlin (2005)."},{"issue":"2","key":"994_CR29","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0022-0000(05)80007-8","volume":"48","author":"DR Stinson","year":"1994","unstructured":"Stinson D.R.: Combinatorial techniques for universal hashing. J. Comput. Syst. Sci. 48(2), 337\u2013346 (1994).","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"994_CR30","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"DR Stinson","year":"1994","unstructured":"Stinson D.R.: Universal hashing and authentication codes. Des. Codes Cryptogr. 4(3), 369\u2013380 (1994).","journal-title":"Des. Codes Cryptogr."},{"key":"994_CR31","doi-asserted-by":"crossref","unstructured":"Torres-Figueroa L., M\u00f6nich U.J., Voichtleitner J., Frank A., Andrei V.C., Wiese M., Boche H.: Experimental evaluation of a modular coding scheme for physical layer security. In: Proc. IEEE Global Communications Conference (GLOBECOM) (2021).","DOI":"10.1109\/GLOBECOM46510.2021.9685785"},{"issue":"10","key":"994_CR32","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1109\/JPROC.2015.2462774","volume":"103","author":"H Tyagi","year":"2015","unstructured":"Tyagi H., Vardy A.: Universal hashing for information-theoretic security. Proc. IEEE 103(10), 1781\u20131795 (2015).","journal-title":"Proc. IEEE"},{"issue":"7","key":"994_CR33","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T van Erven","year":"2014","unstructured":"van Erven T., Harremo\u00ebs P.: R\u00e9nyi divergence and Kullback-Leibler divergence. IEEE Trans. Inform. Theory 60(7), 3797\u20133820 (2014).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"994_CR34","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/TIT.2020.3039231","volume":"67","author":"M Wiese","year":"2021","unstructured":"Wiese M., Boche H.: Semantic security via seeded modular coding schemes and Ramanujan graphs. IEEE Trans. Inform. Theory 67(1), 52\u201380 (2021).","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00994-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00994-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00994-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T10:08:19Z","timestamp":1646647699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00994-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,5]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["994"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00994-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,5]]},"assertion":[{"value":"25 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}