Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
Algebraic manipulation detection (AMD) codes, introduced at EUROCRYPT 2008, may, in some sense, be viewed as keyless combinatorial authentication codes that provide security in the presence of an oblivious, algebraic attacker. Its original applications included robust fuzzy extractors, secure message transmission and robust secret sharing. In recent years, however, a rather diverse array of additional applications in cryptography has emerged. In this paper we consider, for the first time, the regime of arbitrary positive constant error probability ε in combination with unbounded cardinality M of the message space. There are several applications where this model makes sense. Adapting a known bound to this regime, it follows that the binary length ρ of the tag satisfies ρ ≥ loglogM + Ω ε (1). In this paper, we shall call AMD codes meeting this lower bound optimal. Known constructions, notably a construction based on dedicated polynomial evaluation codes, are a multiplicative factor 2 off from being optimal. By a generic enhancement using error-correcting codes, these parameters can be further improved but remain suboptimal. Reaching optimality efficiently turns out to be surprisingly nontrivial. We propose a novel constructive method based on symmetries of codes. This leads to an explicit construction based on certain BCH codes that improves the parameters of the polynomial construction and to an efficient randomized construction of optimal AMD codes based on certain quasi-cyclic codes. In all our results, the error probability ε can be chosen as an arbitrarily small positive real number.
KeywordsError Probability Cyclic Code Message Space Secure Multiparty Computation Small Positive Real Number
Unable to display preview. Download preview PDF.
- 7.Dziembowski, S., Pietrzak, K., Wichs, D.: Non-Malleable Codes. In: Innovations in Computer Science, ICS 2010, pp. 434–452 (2010)Google Scholar
- 8.Fan, Y., Lin, L.: Thresholds of random quasi-abelian codes (2013), http://arxiv.org/pdf/1306.5377.pdf
- 10.Guruswami, V., Smith, A.: Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. In: FOCS 2010, pp. 723–732 (2010), Full version available at arXiv.org, arXiv:1004.4017 [cs.IT]Google Scholar
- 11.Karpovski, M., Wang, Z.: Algebraic Manipulation Detection Codes and Their Applications for Design of Secure Communication or Computation Channels (2011) (manuscript), http://mark.bu.edu/papers/226.pdf
- 12.Wang, Z., Karpovsky, M.: Algebraic manipulation detection codes and their applications for design of secure cryptographic devices. In: IEEE 17th International On-Line Testing Symposium, IOLTS 2011, pp. 234–239 (2011)Google Scholar