Homomorphic authentication codes for network coding. (4th July 2013)

• Record Type: Journal Article
• Authors: Tang, Zhaohui; Orgun, Mehmet A.; Orgun, Atilla Elçi; Pieprzyk, Josef; Chefranov, Alexander; Shankaran, Rajan; Wang, Huaxiong; Zhuge, Hai
• Is Part Of: Concurrency and computation. Volume 27:Number 15(2015:Oct.)
• Page Start: 3892
• Page End: 3911
• Publication Date: 2013-07-04
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3079
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3079-abs-0001"> <title>Summary</title> <p id="cpe3079-para-0001">Authentication codes (A‐codes) are a well studied technique to provide unconditionally secure authentication. An A‐code is defined by a map that associates a pair formed by a message and a key to a tag. A‐codes linear in the keys have been studied for application to distributed authentication schemes. In this paper, we address the dual question, which is the study of A‐codes that are linear in the messages. This is usually an undesired property, except in the context of network coding. Regarding these A‐codes, we derive some lower bounds on security parameters when key space is known. We also show a lower bound on key size when security parameter values are given (with some special properties) and construct some codes meeting the bound. We finally present a variant of these codes that authenticate multiple messages with the same key while preserving unconditional security. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>