Information-theoretic bounds for authentication codes and block designs

1995 ◽  
Vol 8 (4) ◽  
pp. 177-188 ◽  
Author(s):  
Dingyi Pei
Keyword(s):  
Block Designs ◽  
Authentication Codes ◽  
Information Theoretic

Information-theoretic approach to authentication codes for power system communications

2010 ◽  
Author(s):  
T. Matsumoto ◽  
T. Kobayashi ◽  
S. Katayama ◽  
K. Fukushima ◽  
K. Sekiguchi
Keyword(s):  
Power System ◽  
Theoretic Approach ◽  
Authentication Codes ◽  
Information Theoretic ◽  
Information Theoretic Approach

scholarly journals On the Classification of Splitting (v, u×c, λ) BIBDs

2018 ◽  
Vol 18 (5) ◽  
pp. 87-94
Author(s):  
Stela Zhelezova
Keyword(s):  
Block Designs ◽  
Incomplete Block ◽  
Authentication Codes ◽  
Balanced Incomplete Block Designs ◽  
Splitting Authentication Codes ◽  
Balanced Incomplete Block

Abstract The (v, u×c, λ)-splitting balanced incomplete block designs correspond to c-splitting authentication codes. We classify splitting balanced incomplete block designs with definite parameters.

ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION

2011 ◽  
Vol 03 (03) ◽  
pp. 287-303
Author(s):  
DONGVU TONIEN ◽  
REIHANEH SAFAVI-NAINI ◽  
PETER WILD
Keyword(s):  
Optimal Strategies ◽  
Impersonation Attack ◽  
Message Authentication ◽  
Authentication Codes ◽  
Information Theoretic ◽  
Secure Systems ◽  
Value Of The Game ◽  
The One ◽  
Two Stages ◽  
The Relationship

In this paper, we consider authentication codes where the adversary has access to a verification oracle. We formally study two attack games: offline attack and online attack. In an offline impersonation attack with verification query of order i, the adversary launches its attack through two stages. In the first stage — the query stage — the adversary can adaptively choose i distinct messages to query the verification oracle. The verification oracle will answer whether these queried messages are valid or invalid under the secret encoding rule agreed by the transmitter and the receiver. In the later stage — the spoofing stage — the adversary creates a fraudulent message which is different from all its queried messages and sends this message to the receiver. The adversary wins if the receiver accepts the fraudulent message as a valid message. In an online impersonation attack with verification query of order i, the adversary has i + 1 chances to query the verification oracle and wins as soon as one of the queries is a valid message. We make use of strategy trees, which allow optimal strategies in both attack games to be identified, to establish a number of relationships between the value of the two games. This allows us to formally prove a relationship between the value of the game when the adversary has i queries, and the one in which he does not have any. The relationship, though widely believed to be true, was only recently proved for computationally secure systems. Our result complements this latter work for the information theoretic setting.

scholarly journals Mosaics of combinatorial designs for information-theoretic security

2022 ◽  
Author(s):  
Moritz Wiese ◽  
Holger Boche
Keyword(s):  
Combinatorial Designs ◽  
Block Designs ◽  
Secret Key ◽  
Wiretap Channel ◽  
Secret Key Generation ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Versus Color ◽  
Functional Forms ◽  
Balanced Incomplete Block

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.

Graph Theory, Coding Theory and Block Designs

1975 ◽  
Author(s):  
P. J. Cameron ◽  
J. H. van Lint
Keyword(s):  
Graph Theory ◽  
Coding Theory ◽  
Block Designs
Sign in / Sign up

Export Citation Format

Share Document