An Efficient Divisible Electronic Cash Scheme View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2001-07-13

AUTHORS

Tatsuaki Okamoto

ABSTRACT

Recently, several “divisible” untraceable off-line electronic cash schemes have been presented [8, 11, 19, 20]. This paper presents the first practical “divisible” untraceable1 off-line cash scheme that is “single-term”2 in which every procedure can be executed in the order of log N, where N is the precision of divisibility, i.e., N = (the total coin value)/(minimum divisible unit value). Therefore, our “divisible” off-line cash scheme is more efficient and practical than the previous schemes. For example, when N = 217 (e.g., the total value is about $ 1000, and the minimum divisible unit is 1 cent), our scheme requires only about 1 Kbyte of data be transfered from a customer to a shop for one payment and about 20 modular exponentiations for one payment, while all previous divisible cash schemes require more than several Kbytes of transfered data and more than 200 modular exponentiations for one payment. In addition, we prove the security of the proposed cash scheme under some cryptographic assumptions. Our scheme is the first “practical divisible” untraceable off-line cash scheme whose cryptographic security assumptions are theoretically clarified. More... »

PAGES

438-451

References to SciGraph publications

  • 1992. How to Break and Repair a “Provably Secure” Untraceable Payment System in ADVANCES IN CRYPTOLOGY — CRYPTO ’91
  • 1992. Communication efficient Zero-knowledge Proofs of knowledge in STACS 92
  • 2001-05-18. Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer in ADVANCES IN CRYPTOLOGY — CRYPTO ’91
  • 1990. Anonymous one-time signatures and flexible untraceable electronic cash in ADVANCES IN CRYPTOLOGY — AUSCRYPT '90
  • 1993. New protocols for electronic money in ADVANCES IN CRYPTOLOGY — AUSCRYPT '92
  • 1993. One-Time Identification with Low Memory in EUROCODE ’92
  • 2001-07-13. Untraceable Off-line Cash in Wallet with Observers in ADVANCES IN CRYPTOLOGY — CRYPTO’ 93
  • 1984. Electronic Wallet in ADVANCES IN CRYPTOLOGY
  • 1992. Universal Electronic Cash in ADVANCES IN CRYPTOLOGY — CRYPTO ’91
  • 1994. Single Term Off-Line Coins in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’93
  • 1994. Practical and Provably Secure Release of a Secret and Exchange of Signatures in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’93
  • 2001-07-06. Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash in ADVANCES IN CRYPTOLOGY — CRYPTO’ 89 PROCEEDINGS
  • 2001-05-18. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing in ADVANCES IN CRYPTOLOGY — CRYPTO ’91
  • 1995. Efficient electronic money in ADVANCES IN CRYPTOLOGY — ASIACRYPT'94
  • 2000-12-01. Untraceable Electronic Cash in ADVANCES IN CRYPTOLOGY — CRYPTO’ 88
  • 2001-05-18. A Remark on a Signature Scheme Where Forgery can be Proved in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’90
  • Book

    TITLE

    Advances in Cryptology — CRYPT0’ 95

    ISBN

    978-3-540-60221-7
    978-3-540-44750-4

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/3-540-44750-4_35

    DOI

    http://dx.doi.org/10.1007/3-540-44750-4_35

    DIMENSIONS

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


    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/0804", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Data Format", 
            "type": "DefinedTerm"
          }, 
          {
            "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"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "name": [
                "NTT Laboratories, 1-2356 Take, Yokosuka-shi, 238-03, Japan"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Okamoto", 
            "givenName": "Tatsuaki", 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-48285-7_28", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000877658", 
              "https://doi.org/10.1007/3-540-48285-7_28"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-55210-3_204", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002378392", 
              "https://doi.org/10.1007/3-540-55210-3_204"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46877-3_39", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002791361", 
              "https://doi.org/10.1007/3-540-46877-3_39"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46877-3_39", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002791361", 
              "https://doi.org/10.1007/3-540-46877-3_39"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0030369", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006801111", 
              "https://doi.org/10.1007/bfb0030369"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46766-1_38", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010490762", 
              "https://doi.org/10.1007/3-540-46766-1_38"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46766-1_38", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010490762", 
              "https://doi.org/10.1007/3-540-46766-1_38"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-387-34805-0_43", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014379245", 
              "https://doi.org/10.1007/0-387-34805-0_43"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-387-34805-0_43", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014379245", 
              "https://doi.org/10.1007/0-387-34805-0_43"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48285-7_17", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019544740", 
              "https://doi.org/10.1007/3-540-48285-7_17"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46766-1_9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021532235", 
              "https://doi.org/10.1007/3-540-46766-1_9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46766-1_9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021532235", 
              "https://doi.org/10.1007/3-540-46766-1_9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46766-1_27", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023664992", 
              "https://doi.org/10.1007/3-540-46766-1_27"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46766-1_28", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023799216", 
              "https://doi.org/10.1007/3-540-46766-1_28"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-387-34799-2_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031722786", 
              "https://doi.org/10.1007/0-387-34799-2_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-387-34799-2_25", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031722786", 
              "https://doi.org/10.1007/0-387-34799-2_25"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48329-2_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033006577", 
              "https://doi.org/10.1007/3-540-48329-2_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48329-2_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033006577", 
              "https://doi.org/10.1007/3-540-48329-2_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/4372.4373", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1039666569"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-57220-1_68", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041033967", 
              "https://doi.org/10.1007/3-540-57220-1_68"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4684-4730-9_28", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045266492", 
              "https://doi.org/10.1007/978-1-4684-4730-9_28"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0000431", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050906583", 
              "https://doi.org/10.1007/bfb0000431"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-7091-2786-5_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052552320", 
              "https://doi.org/10.1007/978-3-7091-2786-5_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/6490.6503", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052897096"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/0217017", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062842036"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2001-07-13", 
        "datePublishedReg": "2001-07-13", 
        "description": "Recently, several \u201cdivisible\u201d untraceable off-line electronic cash schemes have been presented [8, 11, 19, 20]. This paper presents the first practical \u201cdivisible\u201d untraceable1 off-line cash scheme that is \u201csingle-term\u201d2 in which every procedure can be executed in the order of log N, where N is the precision of divisibility, i.e., N = (the total coin value)/(minimum divisible unit value). Therefore, our \u201cdivisible\u201d off-line cash scheme is more efficient and practical than the previous schemes. For example, when N = 217 (e.g., the total value is about $ 1000, and the minimum divisible unit is 1 cent), our scheme requires only about 1 Kbyte of data be transfered from a customer to a shop for one payment and about 20 modular exponentiations for one payment, while all previous divisible cash schemes require more than several Kbytes of transfered data and more than 200 modular exponentiations for one payment. In addition, we prove the security of the proposed cash scheme under some cryptographic assumptions. Our scheme is the first \u201cpractical divisible\u201d untraceable off-line cash scheme whose cryptographic security assumptions are theoretically clarified.", 
        "editor": [
          {
            "familyName": "Coppersmith", 
            "givenName": "Don", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/3-540-44750-4_35", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-540-60221-7", 
            "978-3-540-44750-4"
          ], 
          "name": "Advances in Cryptology \u2014 CRYPT0\u2019 95", 
          "type": "Book"
        }, 
        "name": "An Efficient Divisible Electronic Cash Scheme", 
        "pagination": "438-451", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/3-540-44750-4_35"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "fb2b203f205a6d8c262914ab6f15439890cdb7984965e355c922fbcb57b7d911"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1052729941"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/3-540-44750-4_35", 
          "https://app.dimensions.ai/details/publication/pub.1052729941"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T05:28", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000345_0000000345/records_64119_00000002.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F3-540-44750-4_35"
      }
    ]
     

    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/3-540-44750-4_35'

    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/3-540-44750-4_35'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-44750-4_35'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-44750-4_35'


     

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

    136 TRIPLES      23 PREDICATES      45 URIs      19 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/3-540-44750-4_35 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author Ne26ac545e07a4e2a97cbcb14a50759dd
    4 schema:citation sg:pub.10.1007/0-387-34799-2_25
    5 sg:pub.10.1007/0-387-34805-0_43
    6 sg:pub.10.1007/3-540-46766-1_27
    7 sg:pub.10.1007/3-540-46766-1_28
    8 sg:pub.10.1007/3-540-46766-1_38
    9 sg:pub.10.1007/3-540-46766-1_9
    10 sg:pub.10.1007/3-540-46877-3_39
    11 sg:pub.10.1007/3-540-48285-7_17
    12 sg:pub.10.1007/3-540-48285-7_28
    13 sg:pub.10.1007/3-540-48329-2_26
    14 sg:pub.10.1007/3-540-55210-3_204
    15 sg:pub.10.1007/3-540-57220-1_68
    16 sg:pub.10.1007/978-1-4684-4730-9_28
    17 sg:pub.10.1007/978-3-7091-2786-5_19
    18 sg:pub.10.1007/bfb0000431
    19 sg:pub.10.1007/bfb0030369
    20 https://doi.org/10.1137/0217017
    21 https://doi.org/10.1145/4372.4373
    22 https://doi.org/10.1145/6490.6503
    23 schema:datePublished 2001-07-13
    24 schema:datePublishedReg 2001-07-13
    25 schema:description Recently, several “divisible” untraceable off-line electronic cash schemes have been presented [8, 11, 19, 20]. This paper presents the first practical “divisible” untraceable1 off-line cash scheme that is “single-term”2 in which every procedure can be executed in the order of log N, where N is the precision of divisibility, i.e., N = (the total coin value)/(minimum divisible unit value). Therefore, our “divisible” off-line cash scheme is more efficient and practical than the previous schemes. For example, when N = 217 (e.g., the total value is about $ 1000, and the minimum divisible unit is 1 cent), our scheme requires only about 1 Kbyte of data be transfered from a customer to a shop for one payment and about 20 modular exponentiations for one payment, while all previous divisible cash schemes require more than several Kbytes of transfered data and more than 200 modular exponentiations for one payment. In addition, we prove the security of the proposed cash scheme under some cryptographic assumptions. Our scheme is the first “practical divisible” untraceable off-line cash scheme whose cryptographic security assumptions are theoretically clarified.
    26 schema:editor N354b0c644642431281ee5c3157981777
    27 schema:genre chapter
    28 schema:inLanguage en
    29 schema:isAccessibleForFree true
    30 schema:isPartOf N5df569ea55924746b96aa778c930bd23
    31 schema:name An Efficient Divisible Electronic Cash Scheme
    32 schema:pagination 438-451
    33 schema:productId N1ddbc5a9f7c5498e9a0beaa44f134aa9
    34 N302cf9f2d869424bb8fc351f1078a5cf
    35 Nd3dfce3914784f4d99683d137a382205
    36 schema:publisher Nb8c96f41949444d79209e95b5d4722ab
    37 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052729941
    38 https://doi.org/10.1007/3-540-44750-4_35
    39 schema:sdDatePublished 2019-04-16T05:28
    40 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    41 schema:sdPublisher N219a6456acce4b50bea5c47cac883478
    42 schema:url https://link.springer.com/10.1007%2F3-540-44750-4_35
    43 sgo:license sg:explorer/license/
    44 sgo:sdDataset chapters
    45 rdf:type schema:Chapter
    46 N1ddbc5a9f7c5498e9a0beaa44f134aa9 schema:name doi
    47 schema:value 10.1007/3-540-44750-4_35
    48 rdf:type schema:PropertyValue
    49 N1f65797991aa4007b0ad5bd6bef8f849 schema:name NTT Laboratories, 1-2356 Take, Yokosuka-shi, 238-03, Japan
    50 rdf:type schema:Organization
    51 N219a6456acce4b50bea5c47cac883478 schema:name Springer Nature - SN SciGraph project
    52 rdf:type schema:Organization
    53 N302cf9f2d869424bb8fc351f1078a5cf schema:name dimensions_id
    54 schema:value pub.1052729941
    55 rdf:type schema:PropertyValue
    56 N354b0c644642431281ee5c3157981777 rdf:first N6dfe67ef120b468599c6045ad3d414a5
    57 rdf:rest rdf:nil
    58 N5ab573d6662240b0a3916317ed6b5458 schema:affiliation N1f65797991aa4007b0ad5bd6bef8f849
    59 schema:familyName Okamoto
    60 schema:givenName Tatsuaki
    61 rdf:type schema:Person
    62 N5df569ea55924746b96aa778c930bd23 schema:isbn 978-3-540-44750-4
    63 978-3-540-60221-7
    64 schema:name Advances in Cryptology — CRYPT0’ 95
    65 rdf:type schema:Book
    66 N6dfe67ef120b468599c6045ad3d414a5 schema:familyName Coppersmith
    67 schema:givenName Don
    68 rdf:type schema:Person
    69 Nb8c96f41949444d79209e95b5d4722ab schema:location Berlin, Heidelberg
    70 schema:name Springer Berlin Heidelberg
    71 rdf:type schema:Organisation
    72 Nd3dfce3914784f4d99683d137a382205 schema:name readcube_id
    73 schema:value fb2b203f205a6d8c262914ab6f15439890cdb7984965e355c922fbcb57b7d911
    74 rdf:type schema:PropertyValue
    75 Ne26ac545e07a4e2a97cbcb14a50759dd rdf:first N5ab573d6662240b0a3916317ed6b5458
    76 rdf:rest rdf:nil
    77 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    78 schema:name Information and Computing Sciences
    79 rdf:type schema:DefinedTerm
    80 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    81 schema:name Data Format
    82 rdf:type schema:DefinedTerm
    83 sg:pub.10.1007/0-387-34799-2_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031722786
    84 https://doi.org/10.1007/0-387-34799-2_25
    85 rdf:type schema:CreativeWork
    86 sg:pub.10.1007/0-387-34805-0_43 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014379245
    87 https://doi.org/10.1007/0-387-34805-0_43
    88 rdf:type schema:CreativeWork
    89 sg:pub.10.1007/3-540-46766-1_27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023664992
    90 https://doi.org/10.1007/3-540-46766-1_27
    91 rdf:type schema:CreativeWork
    92 sg:pub.10.1007/3-540-46766-1_28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023799216
    93 https://doi.org/10.1007/3-540-46766-1_28
    94 rdf:type schema:CreativeWork
    95 sg:pub.10.1007/3-540-46766-1_38 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010490762
    96 https://doi.org/10.1007/3-540-46766-1_38
    97 rdf:type schema:CreativeWork
    98 sg:pub.10.1007/3-540-46766-1_9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021532235
    99 https://doi.org/10.1007/3-540-46766-1_9
    100 rdf:type schema:CreativeWork
    101 sg:pub.10.1007/3-540-46877-3_39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002791361
    102 https://doi.org/10.1007/3-540-46877-3_39
    103 rdf:type schema:CreativeWork
    104 sg:pub.10.1007/3-540-48285-7_17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019544740
    105 https://doi.org/10.1007/3-540-48285-7_17
    106 rdf:type schema:CreativeWork
    107 sg:pub.10.1007/3-540-48285-7_28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000877658
    108 https://doi.org/10.1007/3-540-48285-7_28
    109 rdf:type schema:CreativeWork
    110 sg:pub.10.1007/3-540-48329-2_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033006577
    111 https://doi.org/10.1007/3-540-48329-2_26
    112 rdf:type schema:CreativeWork
    113 sg:pub.10.1007/3-540-55210-3_204 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002378392
    114 https://doi.org/10.1007/3-540-55210-3_204
    115 rdf:type schema:CreativeWork
    116 sg:pub.10.1007/3-540-57220-1_68 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041033967
    117 https://doi.org/10.1007/3-540-57220-1_68
    118 rdf:type schema:CreativeWork
    119 sg:pub.10.1007/978-1-4684-4730-9_28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045266492
    120 https://doi.org/10.1007/978-1-4684-4730-9_28
    121 rdf:type schema:CreativeWork
    122 sg:pub.10.1007/978-3-7091-2786-5_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052552320
    123 https://doi.org/10.1007/978-3-7091-2786-5_19
    124 rdf:type schema:CreativeWork
    125 sg:pub.10.1007/bfb0000431 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050906583
    126 https://doi.org/10.1007/bfb0000431
    127 rdf:type schema:CreativeWork
    128 sg:pub.10.1007/bfb0030369 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006801111
    129 https://doi.org/10.1007/bfb0030369
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1137/0217017 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062842036
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1145/4372.4373 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039666569
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1145/6490.6503 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052897096
    136 rdf:type schema:CreativeWork
     




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


    ...