Combinatorial bounds and characterizations of splitting authentication codes

被引：0
|
作者：
Michael Huber
机构：
[1] University of Tübingen,Wilhelm
来源：
Cryptography and Communications | 2010年 / 2卷
关键词：
Information authenticity; Unconditional security; Authentication code; Splitting; Non-deterministic encoding; Splitting design; 94A60; 94C30;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, we prove a combinatorial lower bound on the number of encoding rules and a combinatorial characterization of optimal splitting authentication codes that are multi-fold secure against spoofing attacks. The characterization is based on a new type of combinatorial designs, which we introduce and for which basic necessary conditions are given regarding their existence.
引用
收藏
页码：173 / 185
页数：12
相关论文
共 50 条
  • [21] Combinatorial Classification of Optimal Authentication Codes with Arbitration
    Satoshi Obana
    Kaoru Kurosawa
    Designs, Codes and Cryptography, 2000, 20 : 281 - 305
  • [22] Problem of combinatorial designs related to authentication codes
    Pei, Dingyi
    Journal of Combinatorial Designs, 6 (06): : 417 - 429
  • [23] Combinatorial classification of optimal authentication codes with arbitration
    Obana, S
    Kurosawa, K
    DESIGNS CODES AND CRYPTOGRAPHY, 2000, 20 (03) : 281 - 305
  • [24] SOME CONSTRUCTIONS AND BOUNDS FOR AUTHENTICATION CODES.
    Stinson, D.R.
    Journal of Cryptology, 1988, 1 (01) : 37 - 51
  • [25] Efficient Message Authentication Codes with Combinatorial Group Testing
    Minematsu, Kazuhiko
    COMPUTER SECURITY - ESORICS 2015, PT I, 2015, 9326 : 185 - 202
  • [26] Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures
    Dalai, Marco
    Della Fiore, Stefano
    Rescigno, Adele A.
    Vaccaro, Ugo
    2023 IEEE INFORMATION THEORY WORKSHOP, ITW, 2023, : 544 - 549
  • [27] Multireceiver authentication codes: Models, bounds, constructions, and extensions
    Safavi-Naini, R
    Wang, H
    INFORMATION AND COMPUTATION, 1999, 151 (1-2) : 148 - 172
  • [28] Tighter Bounds on Entropy of Secret Keys in Authentication Codes
    Shikata, Junji
    2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 259 - 263
  • [29] Combinational constructions of splitting authentication codes with perfect secrecy
    Ji, Lijun
    Liang, Miao
    Wang, Yanting
    DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (10) : 2491 - 2515
  • [30] Combinational constructions of splitting authentication codes with perfect secrecy
    Lijun Ji
    Miao Liang
    Yanting Wang
    Designs, Codes and Cryptography, 2022, 90 : 2491 - 2515
12345