메뉴 건너뛰기




Volumn 47, Issue 3, 2001, Pages 1042-1049

Combinatorial properties of frameproof and traceability codes

Author keywords

Frameproof (FP) codes; Identifiable parent property (IPP); Perfect hash families; Traceability (TA) codes

Indexed keywords

COMBINATORIAL MATHEMATICS; COPYRIGHTS; DECODING; INFORMATION THEORY; MATHEMATICAL MODELS; SECURITY OF DATA;

EID: 0035270516     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.915661     Document Type: Article
Times cited : (261)

References (24)
  • 2
    • 77955716821 scopus 로고    scopus 로고
    • A hypergraph approach to the identifying parent property: The case of multiple parents
    • A. Barg G. Cohen S. Encheva G. Kabatiansky G. Zémor (Zemor) A hypergraph approach to the identifying parent property: The case of multiple parents DIMACS Tech. Rep. 2000-20
    • Barg, A.1    Cohen, G.2    Encheva, S.3    Kabatiansky, G.4    5    mor (Zemor), G.6
  • 4
    • 51249175955 scopus 로고
    • P. Erdös (Erdos) P. Frankl Z. Füredi (Furedi) Families of finite sets in which no set is covered by the union of $r$ others Israel J. Math. 51 79 89 1985
    • (1985) , vol.51 , pp. 79-89
    • Erdö1    s (Erdos), P.2    Frankl, P.3    4    redi (Furedi), Z.5
  • 5
    • 84957076207 scopus 로고    scopus 로고
    • Dynamic traitor tracing, in: Advances in Cryptology̵Crypto '99 (Lecture Notes in Computer Science)
    • Springer-Verlag New York
    • A. Fiat T. Tassa Dynamic traitor tracing Advances in Cryptology̵Crypto '99 (Lecture Notes in Computer Science) 1666 354 371 1999 Springer-Verlag New York
    • (1999) , vol.1666 , pp. 354-371
    • Fiat, A.1    Tassa, T.2
  • 7
    • 84957057937 scopus 로고    scopus 로고
    • Coding constructions for blacklisting problems without computational assumptions, in: Advances in Cryptology̵Crypto '99 (Lecture Notes in Computer Science)
    • Sprimger-Verlag New York
    • R. Kumar S. Rajagopalan A. Sahai Coding constructions for blacklisting problems without computational assumptions Advances in Cryptology̵Crypto '99 (Lecture Notes in Computer Science) 1666 609 623 1999 Sprimger-Verlag New York
    • (1999) , vol.1666 , pp. 609-623
    • Kumar, R.1    Rajagopalan, S.2    Sahai, A.3
  • 8
    • 85177140411 scopus 로고    scopus 로고
    • Inherently large traceability and asymmetric schemes with arbiter
    • K. Kurosawa T. Yoshida Y. Desmedt Inherently large traceability and asymmetric schemes with arbiter Proc. IEEE Int. Symp. Information Theory (ISIT'2000) Proc. IEEE Int. Symp. Information Theory (ISIT'2000) Sorrento Italy 2000-June 6966 18755 866762
    • (2000)
    • Kurosawa, K.1    Yoshida, T.2    Desmedt, Y.3
  • 9
    • 0004047313 scopus 로고
    • Data Structures and Algorithms 1: Sorting and Searching
    • Springer-Verlag Germany, Berlin
    • K. Mehlhorn Data Structures and Algorithms 1: Sorting and Searching 1984 Springer-Verlag Germany, Berlin
    • (1984)
    • Mehlhorn, K.1
  • 10
    • 0000137420 scopus 로고    scopus 로고
    • D. R. Stinson T. van Trung R. Wei Secure frameproof codes, key distribution patterns, group testing algorithms and related structures J. Statist. Planning Inference 86 595 617 2000
    • (2000) , vol.86 , pp. 595-617
    • Stinson, D.R.1    van Trung, T.2    Wei, R.3
  • 11
    • 84890047469 scopus 로고    scopus 로고
    • Combinational properties and constructions of traceability schemes for broadcast encryption, in: Selected Areas in Cryptology̵SAC '98 (Lecture Notes in Computer Science)
    • Springer-Verlag New York
    • D. R. Stinson R. Wei Combinational properties and constructions of traceability schemes for broadcast encryption Selected Areas in Cryptology̵SAC '98 (Lecture Notes in Computer Science) 1556 144 156 1999 Springer-Verlag New York
    • (1999) , vol.1556 , pp. 144-156
    • Stinson, D.R.1    Wei, R.2
  • 12
    • 0345952600 scopus 로고    scopus 로고
    • Combinatorics and threshold cryptography, in: Combinatorial Designs and their Applications
    • Chapman and Hall U.K., London
    • S. R. Blackburn Combinatorics and threshold cryptography Combinatorial Designs and their Applications CRC Research Notes in Mathematics 403 49 70 1999 Chapman and Hall U.K., London
    • (1999) , vol.403 , pp. 49-70
    • Blackburn, S.R.1
  • 13
    • 0002874871 scopus 로고    scopus 로고
    • S. R. Blackburn P. R. Wild Optimal linear perfect hash families J. Comb. Theory A 83 233 250 1998
    • (1998) , vol.83 , pp. 233-250
    • Blackburn, S.R.1    Wild, P.R.2
  • 14
    • 84957085257 scopus 로고    scopus 로고
    • An efficient public key traitor tracing scheme, in: Advances in Cryptology̵Crypto '99 (Lecture Notes in Computer Science)
    • Springer-Verlag New York
    • D. Boneh M. Franklin An efficient public key traitor tracing scheme Advances in Cryptology̵Crypto '99 (Lecture Notes in Computer Science) 1666 338 353 1999 Springer-Verlag New York
    • (1999) , Issue.1666 , pp. 338-353
    • Boneh, D.1    Franklin, M.2
  • 15
    • 0001293053 scopus 로고
    • Tracing traitors, in: Advances in Cryptology̵Crypto '94 (Lecture Notes in Computer Science)
    • Springer-Verlag New York
    • B. Chor A. Fiat M. Naor Tracing traitors Advances in Cryptology̵Crypto '94 (Lecture Notes in Computer Science) 839 480 491 1994 Springer-Verlag New York
    • (1994) , vol.839 , pp. 480-491
    • Chor, B.1    Fiat, A.2    Naor, M.3
  • 16
    • 0003430191 scopus 로고
    • The Probabilistic Method
    • Wiley New York
    • N. Alon J. Spencer The Probabilistic Method 1992 Wiley New York
    • (1992)
    • Alon, N.1    Spencer, J.2
  • 17
    • 0034188648 scopus 로고    scopus 로고
    • B. Chor A. Fiat M. Naor B. Pinkas Tracing traitors IEEE Trans. Inform. Theory 46 893 910 May 2000 18 18178 841169
    • (2000) , vol.46 , pp. 893-910
    • Chor, B.1    Fiat, A.2    Naor, M.3    Pinkas, B.4
  • 19
    • 84957067564 scopus 로고    scopus 로고
    • Efficient methods for integrating traceability and broadcast encryption, in: Advances in Cryptology̵Crypto '99 (Lecture Notes in Computer Science)
    • Springer-Verlag New York
    • E. Gafni J. Staddon Y. L. Yin Efficient methods for integrating traceability and broadcast encryption Advances in Cryptology̵Crypto '99 (Lecture Notes in Computer Science) 1666 372 387 1999 Springer-Verlag New York
    • (1999) , vol.1666 , pp. 372-387
    • Gafni, E.1    Staddon, J.2    Yin, Y.L.3
  • 20
    • 35248866858 scopus 로고    scopus 로고
    • Optimal traitor tracing and asymmetric schemes, in: Advances in Cryptology̵Eurocrypt '98 (Lecture Notes in Computer Science)
    • Springer-Verlag Germany, Berlin
    • K. Kurosawa Y. Desmedt Optimal traitor tracing and asymmetric schemes Advances in Cryptology̵Eurocrypt '98 (Lecture Notes in Computer Science) 1438 145 157 1998 Springer-Verlag Germany, Berlin
    • (1998) , vol.1438 , pp. 145-157
    • Kurosawa, K.1    Desmedt, Y.2
  • 21
    • 84957715332 scopus 로고    scopus 로고
    • New results on multi-receiver authentication codes, in: Advances in Cryptology̵Eurocrypt '98 (Lecture Notes in Computer Science)
    • Springer-Verlag Germany, Berlin
    • R. Safavi-Naini H. Wang New results on multi-receiver authentication codes Advances in Cryptology̵Eurocrypt '98 (Lecture Notes in Computer Science) 1438 527 541 1998 Springer-Verlag Germany, Berlin
    • (1998) , vol.1438 , pp. 527-541
    • Safavi-Naini, R.1    Wang, H.2
  • 22
    • 0002016098 scopus 로고    scopus 로고
    • D. R. Stinson R. Wei Combinatorial properties and constructions of traceability schemes and frameproof codes SIAM J. Discr. Math. 11 41 53 1998
    • (1998) , vol.11 , pp. 41-53
    • Stinson, D.R.1    Wei, R.2
  • 23
    • 85177131519 scopus 로고    scopus 로고
    • S. R. Blackburn Perfect hash families: Probabilistic methods and explicit constructions J. Comb. Theory A
    • Blackburn, S.R.1
  • 24
    • 0032162672 scopus 로고    scopus 로고
    • D. Boneh J. Shaw Collusion-secure fingerprinting for digital data IEEE Trans. Inform. Theory 44 1897 1905 Sept. 1998 18 15247 705568
    • (1998) , vol.44 , pp. 1897-1905
    • Boneh, D.1    Shaw, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.