nach oben

Designs, Codes and Cryptography

Erschienen in:

01.07.2016

Almost separating and almost secure frameproof codes over \(q\)-ary alphabets

verfasst von: José Moreira, Marcel Fernández, Grigory Kabatiansky

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2016

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this paper we discuss some variations of the notion of separating code for alphabets of arbitrary size. We show how the original definition can be relaxed in two different ways, namely almost separating and almost secure frameproof codes, yielding two different concepts. The new definitions enable us to obtain codes of higher rate, at the expense of satisfying the separating property partially. These new definitions become useful when complete separation is only required with high probability, rather than unconditionally. We also show how the codes proposed can be used to improve the rate of existing constructions of families of fingerprinting codes.

Vorheriger Artikel New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds

Nächster Artikel Tightly secure signatures and public-key encryption

Barg A., Blakley G.R., Kabatiansky G.: Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4), 852–865 (2003).

Blakley G.R., Kabatiansky G.: Random coding technique for digital fingerprinting codes: fighting two pirates revisited. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), p. 203. IEEE, Chicago (2004).

Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. In: Proceedings of the International Cryptology Conference (CRYPTO), Santa Barbara. Lecture Notes in Computer Science, vol. 963, pp. 452–465. Springer, Berlin (1995).

Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44(5), 1897–1905 (1998).

Chor B., Fiat A., Naor M.: Tracing traitors. In: Proceedings International Cryptology Conference on Advances in Cryptology (CRYPTO), Santa Barbara. Lecture Notes Computer Science, vol. 839, pp. 480–491. Springer, Berlin (1994).

Chor B., Fiat A., Naor M., Pinkas B.: Tracing traitors. IEEE Trans. Inf. Theory 46(3), 893–910 (2000).

Cohen G.D., Schaathun H.G.: Asymptotic overview on separating codes. Technical Report 248, Deptartment of Informatics, University of Bergen, Norway (2003).

Cohen G.D., Schaathun H.G.: Upper bounds on separating codes. IEEE Trans. Inf. Theory 50(6), 1291–1294 (2004).

Csiszár I., Körner J.: Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. Cambridge University Press, Cambridge (2011).

10.

Fernández M., Kabatiansky G., Moreira J.: Almost separating and almost secure frameproof codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 2696–2700. IEEE, Saint Petersburg (2011).

11.

Forney G.D.: Concatenated codes. Technical Repot 440, Research Laboratory of Electronics, MIT, Cambridge, MA (1966).

12.

Friedman A.D., Graham R.L., Ullman J.D.: Universal single transition time asynchronous state assignments. IEEE Trans. Comput. 18(6), 541–547 (1969).

13.

Guruswami V., Sudan M.: Improved decoding of Reed–Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45(6), 1757–1767 (1999).

14.

Hoeffding W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13–30 (1963).

15.

Körner J., Simonyi G.: Separating partition systems and locally different sequences. SIAM J. Discret. Math. (SIDMA) 1(3), 355–359 (1988).

16.

Pinsker M.S., Sagalovich Y.L.: Lower bound on the cardinality of code of automata’s states. Probl. Inf. Transm. 8(3), 59–66 (1972).

17.

Sagalovich Y.L.: Completely separating systems. Probl. Inf. Transm. 18(2), 140–146 (1982).

18.

Sagalovich Y.L.: Separating systems. Probl. Inf. Transm. 30(2), 105–123 (1994).

19.

Staddon J.N., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47(3), 1042–1049 (2001).

20.

Stinson D.R., van Trung T., Wei R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Plan. Inference 86(2), 595–617 (2000).

Titel: Almost separating and almost secure frameproof codes over -ary alphabets
verfasst von: José Moreira
Marcel Fernández
Grigory Kabatiansky
Publikationsdatum: 01.07.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1/2016
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-015-0060-z

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 1/2016

Rank-metric codes and their duality theory

On constructions and parameters of symmetric configurations

On small gaps between the elements of multiplicative subgroups of finite fields

Constructions and analysis of some efficient --visual cryptographic schemes using linear algebraic techniques

A general check digit system based on finite groups

Constructions of complex equiangular lines from mutually unbiased bases