A Traceable Block Cipher View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2003

AUTHORS

Olivier Billet , Henri Gilbert

ABSTRACT

In this paper we propose a new symmetric block cipher with the following paradoxical traceability properties: it is computationally easy to derive many equivalent secret keys providing distinct descriptions of the same instance of the block cipher. But it is computationally difficult, given one or even up to k equivalent keys, to recover the so called meta-key from which they were derived, or to find any additional equivalent key, or more generally to forge any new untraceable description of the same instance of the block cipher. Therefore, if each legitimate user of a digital content distribution system based on encrypted information broadcast (e.g. scrambled pay TV, distribution over the Internet of multimedia content, etc.) is provided with one of the equivalent keys, he can use this personal key to decrypt the content. But it is conjectured infeasible for coalitions of up to k traitors to mix their legitimate personal keys into untraceable keys they might redistribute anonymously to pirate decoders. Thus, the proposed block cipher inherently provides an efficient traitor tracing scheme [4]. The new algorithm can be described as an iterative block cipher belonging to the class of multivariate schemes. It has advantages in terms of performance over existing traitor tracing schemes and furthermore, it allows to restrict overheads to one single block (i.e. typically 80 to 160 bits) per encrypted content payload. Its strength relies upon the difficulty of the “Isomorphism of Polynomials” problem [17], which has been extensively investigated over the past years. An initial security analysis is supplied. More... »

PAGES

331-346

Book

TITLE

Advances in Cryptology - ASIACRYPT 2003

ISBN

978-3-540-20592-0
978-3-540-40061-5

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-40061-5_21

DOI

http://dx.doi.org/10.1007/978-3-540-40061-5_21

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1012792249


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "France T\u00e9l\u00e9com R&D, 38-40, rue du G\u00e9n\u00e9ral Leclerc, 92794, Issy les Moulineaux Cedex 9, France", 
          "id": "http://www.grid.ac/institutes/grid.89485.38", 
          "name": [
            "France T\u00e9l\u00e9com R&D, 38-40, rue du G\u00e9n\u00e9ral Leclerc, 92794, Issy les Moulineaux Cedex 9, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Billet", 
        "givenName": "Olivier", 
        "id": "sg:person.011100216333.64", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011100216333.64"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "France T\u00e9l\u00e9com R&D, 38-40, rue du G\u00e9n\u00e9ral Leclerc, 92794, Issy les Moulineaux Cedex 9, France", 
          "id": "http://www.grid.ac/institutes/grid.89485.38", 
          "name": [
            "France T\u00e9l\u00e9com R&D, 38-40, rue du G\u00e9n\u00e9ral Leclerc, 92794, Issy les Moulineaux Cedex 9, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gilbert", 
        "givenName": "Henri", 
        "id": "sg:person.012771236207.08", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012771236207.08"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2003", 
    "datePublishedReg": "2003-01-01", 
    "description": "In this paper we propose a new symmetric block cipher with the following paradoxical traceability properties: it is computationally easy to derive many equivalent secret keys providing distinct descriptions of the same instance of the block cipher. But it is computationally difficult, given one or even up to k equivalent keys, to recover the so called meta-key from which they were derived, or to find any additional equivalent key, or more generally to forge any new untraceable description of the same instance of the block cipher. Therefore, if each legitimate user of a digital content distribution system based on encrypted information broadcast (e.g. scrambled pay TV, distribution over the Internet of multimedia content, etc.) is provided with one of the equivalent keys, he can use this personal key to decrypt the content. But it is conjectured infeasible for coalitions of up to k traitors to mix their legitimate personal keys into untraceable keys they might redistribute anonymously to pirate decoders. Thus, the proposed block cipher inherently provides an efficient traitor tracing scheme [4]. The new algorithm can be described as an iterative block cipher belonging to the class of multivariate schemes. It has advantages in terms of performance over existing traitor tracing schemes and furthermore, it allows to restrict overheads to one single block (i.e. typically 80 to 160 bits) per encrypted content payload. Its strength relies upon the difficulty of the \u201cIsomorphism of Polynomials\u201d problem [17], which has been extensively investigated over the past years. An initial security analysis is supplied.", 
    "editor": [
      {
        "familyName": "Laih", 
        "givenName": "Chi-Sung", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-40061-5_21", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-20592-0", 
        "978-3-540-40061-5"
      ], 
      "name": "Advances in Cryptology - ASIACRYPT 2003", 
      "type": "Book"
    }, 
    "keywords": [
      "block cipher", 
      "personal key", 
      "equivalent keys", 
      "same instance", 
      "digital content distribution system", 
      "content distribution system", 
      "symmetric block cipher", 
      "Isomorphism of Polynomials", 
      "new symmetric block cipher", 
      "equivalent secret key", 
      "k traitors", 
      "efficient traitor", 
      "terms of performance", 
      "security analysis", 
      "legitimate users", 
      "secret key", 
      "iterative block ciphers", 
      "traceability property", 
      "information broadcast", 
      "cipher", 
      "new algorithm", 
      "multivariate schemes", 
      "key", 
      "scheme", 
      "traitor", 
      "decrypt", 
      "single block", 
      "overhead", 
      "users", 
      "distribution system", 
      "decoder", 
      "instances", 
      "algorithm", 
      "broadcast", 
      "distinct descriptions", 
      "polynomials", 
      "payload", 
      "past year", 
      "isomorphism", 
      "description", 
      "performance", 
      "system", 
      "advantages", 
      "problem", 
      "class", 
      "block", 
      "difficulties", 
      "coalition", 
      "terms", 
      "properties", 
      "content", 
      "analysis", 
      "strength", 
      "years", 
      "paper"
    ], 
    "name": "A Traceable Block Cipher", 
    "pagination": "331-346", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1012792249"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-40061-5_21"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-40061-5_21", 
      "https://app.dimensions.ai/details/publication/pub.1012792249"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-11-24T21:13", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20221124/entities/gbq_results/chapter/chapter_194.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-40061-5_21"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-40061-5_21'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-40061-5_21'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-40061-5_21'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-40061-5_21'


 

This table displays all metadata directly associated to this object as RDF triples.

121 TRIPLES      22 PREDICATES      80 URIs      73 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-40061-5_21 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author Nbb639c31e1f74beb8d9bbbab28759ab9
4 schema:datePublished 2003
5 schema:datePublishedReg 2003-01-01
6 schema:description In this paper we propose a new symmetric block cipher with the following paradoxical traceability properties: it is computationally easy to derive many equivalent secret keys providing distinct descriptions of the same instance of the block cipher. But it is computationally difficult, given one or even up to k equivalent keys, to recover the so called meta-key from which they were derived, or to find any additional equivalent key, or more generally to forge any new untraceable description of the same instance of the block cipher. Therefore, if each legitimate user of a digital content distribution system based on encrypted information broadcast (e.g. scrambled pay TV, distribution over the Internet of multimedia content, etc.) is provided with one of the equivalent keys, he can use this personal key to decrypt the content. But it is conjectured infeasible for coalitions of up to k traitors to mix their legitimate personal keys into untraceable keys they might redistribute anonymously to pirate decoders. Thus, the proposed block cipher inherently provides an efficient traitor tracing scheme [4]. The new algorithm can be described as an iterative block cipher belonging to the class of multivariate schemes. It has advantages in terms of performance over existing traitor tracing schemes and furthermore, it allows to restrict overheads to one single block (i.e. typically 80 to 160 bits) per encrypted content payload. Its strength relies upon the difficulty of the “Isomorphism of Polynomials” problem [17], which has been extensively investigated over the past years. An initial security analysis is supplied.
7 schema:editor N1740c438f6ce4ca783474eda232cb248
8 schema:genre chapter
9 schema:isAccessibleForFree true
10 schema:isPartOf N0bfc4a3cbff24716b1004d4724aebf73
11 schema:keywords Isomorphism of Polynomials
12 advantages
13 algorithm
14 analysis
15 block
16 block cipher
17 broadcast
18 cipher
19 class
20 coalition
21 content
22 content distribution system
23 decoder
24 decrypt
25 description
26 difficulties
27 digital content distribution system
28 distinct descriptions
29 distribution system
30 efficient traitor
31 equivalent keys
32 equivalent secret key
33 information broadcast
34 instances
35 isomorphism
36 iterative block ciphers
37 k traitors
38 key
39 legitimate users
40 multivariate schemes
41 new algorithm
42 new symmetric block cipher
43 overhead
44 paper
45 past year
46 payload
47 performance
48 personal key
49 polynomials
50 problem
51 properties
52 same instance
53 scheme
54 secret key
55 security analysis
56 single block
57 strength
58 symmetric block cipher
59 system
60 terms
61 terms of performance
62 traceability property
63 traitor
64 users
65 years
66 schema:name A Traceable Block Cipher
67 schema:pagination 331-346
68 schema:productId N770f4f067f1b419c9a8878f282dc5b6c
69 Nc97a9c1d1d084cbbb2bae7fdd7549189
70 schema:publisher N78c87cc09e274d9e8d6069ee1e44904b
71 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012792249
72 https://doi.org/10.1007/978-3-540-40061-5_21
73 schema:sdDatePublished 2022-11-24T21:13
74 schema:sdLicense https://scigraph.springernature.com/explorer/license/
75 schema:sdPublisher N08a06cabd272441ebf910028b0db3f3d
76 schema:url https://doi.org/10.1007/978-3-540-40061-5_21
77 sgo:license sg:explorer/license/
78 sgo:sdDataset chapters
79 rdf:type schema:Chapter
80 N08a06cabd272441ebf910028b0db3f3d schema:name Springer Nature - SN SciGraph project
81 rdf:type schema:Organization
82 N0bfc4a3cbff24716b1004d4724aebf73 schema:isbn 978-3-540-20592-0
83 978-3-540-40061-5
84 schema:name Advances in Cryptology - ASIACRYPT 2003
85 rdf:type schema:Book
86 N1740c438f6ce4ca783474eda232cb248 rdf:first Ne1aca2f363bb4e4ab71ef515803bfd36
87 rdf:rest rdf:nil
88 N4a0b074bcbf34d45b83bbe67139b2964 rdf:first sg:person.012771236207.08
89 rdf:rest rdf:nil
90 N770f4f067f1b419c9a8878f282dc5b6c schema:name dimensions_id
91 schema:value pub.1012792249
92 rdf:type schema:PropertyValue
93 N78c87cc09e274d9e8d6069ee1e44904b schema:name Springer Nature
94 rdf:type schema:Organisation
95 Nbb639c31e1f74beb8d9bbbab28759ab9 rdf:first sg:person.011100216333.64
96 rdf:rest N4a0b074bcbf34d45b83bbe67139b2964
97 Nc97a9c1d1d084cbbb2bae7fdd7549189 schema:name doi
98 schema:value 10.1007/978-3-540-40061-5_21
99 rdf:type schema:PropertyValue
100 Ne1aca2f363bb4e4ab71ef515803bfd36 schema:familyName Laih
101 schema:givenName Chi-Sung
102 rdf:type schema:Person
103 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
104 schema:name Information and Computing Sciences
105 rdf:type schema:DefinedTerm
106 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
107 schema:name Data Format
108 rdf:type schema:DefinedTerm
109 sg:person.011100216333.64 schema:affiliation grid-institutes:grid.89485.38
110 schema:familyName Billet
111 schema:givenName Olivier
112 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011100216333.64
113 rdf:type schema:Person
114 sg:person.012771236207.08 schema:affiliation grid-institutes:grid.89485.38
115 schema:familyName Gilbert
116 schema:givenName Henri
117 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012771236207.08
118 rdf:type schema:Person
119 grid-institutes:grid.89485.38 schema:alternateName France Télécom R&D, 38-40, rue du Général Leclerc, 92794, Issy les Moulineaux Cedex 9, France
120 schema:name France Télécom R&D, 38-40, rue du Général Leclerc, 92794, Issy les Moulineaux Cedex 9, France
121 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...