Practical Quantum Oblivious Transfer View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1992

AUTHORS

Charles H. Bennett , Gilles Brassard , Claude Crépeau , Marie-Hélène Skubiszewska

ABSTRACT

We describe a protocol for quantum oblivious transfer, utilizing faint pulses of polarized light, by which one of two mutually distrustful parties (“Alice”) transmits two one-bit messages in such a way that the other party (“Bob”) can choose which message he gets but cannot obtain information about both messages (he will learn his chosen bit’s value with exponentially small error probability and may gain at most exponentially little information about the value of the other bit), and Alice will be entirely ignorant of which bit he received. Neither party can cheat (ie deviate from the protocol while appearing to follow it) in such a way as to obtain more information than what is given by the description of the protocol. Our protocol is easy to modify in order to implement the All-or-Nothing Disclosure of one out of two string messages, and it can be used to implement bit commitment and oblivious circuit evaluation without complexity-theoretic assumptions, in a way that remains secure even against cheaters that have unlimited computing power. Moreover, this protocol is practical in that it can be realized with available optoelectronic apparatus while being immune to any technologically feasible attack for the foreseeable future. More... »

PAGES

351-366

References to SciGraph publications

  • 2001-05-18. Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions in ADVANCES IN CRYPTOLOGY — CRYPTO’ 92
  • 2001-05-18. One-Way Group Actions in ADVANCES IN CRYPTOLOGY-CRYPT0’ 90
  • 1988. Equivalence Between Two Flavours of Oblivious Transfers in ADVANCES IN CRYPTOLOGY — CRYPTO ’87
  • 2001-05-18. Quantum Bit Commitment and Coin Tossing Protocols in ADVANCES IN CRYPTOLOGY-CRYPT0’ 90
  • 1983. Quantum Cryptography, or Unforgeable Subway Tokens in ADVANCES IN CRYPTOLOGY
  • 1983. A Randomized Protocol for Signing Contracts in ADVANCES IN CRYPTOLOGY
  • 2001-05-18. Experimental Quantum Cryptography in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’90
  • 1989-05. Quantum Cryptography in SCIENTIFIC AMERICAN
  • 1991-10. Schrödinger's catflap in NATURE
  • Book

    TITLE

    Advances in Cryptology — CRYPTO ’91

    ISBN

    978-3-540-55188-1

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/3-540-46766-1_29

    DOI

    http://dx.doi.org/10.1007/3-540-46766-1_29

    DIMENSIONS

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


    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": [
                "IBM T. J. Watson Research Laboratory, Yorktown Heights, New York, NY\u00a010598, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Bennett", 
            "givenName": "Charles H.", 
            "id": "sg:person.011230322172.45", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011230322172.45"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Montreal", 
              "id": "https://www.grid.ac/institutes/grid.14848.31", 
              "name": [
                "D\u00e9partement IRO, Universit\u00e9 de Montr\u00e9al, C.P. 6128, succursale \u201cA\u201d, Montr\u00e9al, Qu\u00e9bec, Canada, H3C 3J7"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Brassard", 
            "givenName": "Gilles", 
            "id": "sg:person.01364311576.95", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01364311576.95"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "name": [
                "D\u00e9partement de Math\u00e9matiques et d\u2019Informatique, \u00c9cole Normale Sup\u00e9rieure, 45 rue d\u2019Ulm, 75230\u00a0Paris Cedex 05, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Cr\u00e9peau", 
            "givenName": "Claude", 
            "id": "sg:person.01127736412.71", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01127736412.71"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Paris-Sud", 
              "id": "https://www.grid.ac/institutes/grid.5842.b", 
              "name": [
                "Laboratoire de Recherche en Informatique, Universit\u00e9 Paris-Sud, B\u00e2timent 490, 91405\u00a0Orsay, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Skubiszewska", 
            "givenName": "Marie-H\u00e9l\u00e8ne", 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1145/62212.62215", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1004301530"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48071-4_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006175712", 
              "https://doi.org/10.1007/3-540-48071-4_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48071-4_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006175712", 
              "https://doi.org/10.1007/3-540-48071-4_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/100216.100270", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011956916"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1038/353384a0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014766447", 
              "https://doi.org/10.1038/353384a0"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4757-0602-4_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1015721808", 
              "https://doi.org/10.1007/978-1-4757-0602-4_19"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48184-2_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020097248", 
              "https://doi.org/10.1007/3-540-48184-2_30"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/73007.73012", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1023076003"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1008908.1008920", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027988881"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-38424-3_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1034565969", 
              "https://doi.org/10.1007/3-540-38424-3_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-38424-3_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1034565969", 
              "https://doi.org/10.1007/3-540-38424-3_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4757-0602-4_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041140814", 
              "https://doi.org/10.1007/978-1-4757-0602-4_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46877-3_23", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042694252", 
              "https://doi.org/10.1007/3-540-46877-3_23"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-46877-3_23", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042694252", 
              "https://doi.org/10.1007/3-540-46877-3_23"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-38424-3_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046914662", 
              "https://doi.org/10.1007/3-540-38424-3_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-38424-3_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046914662", 
              "https://doi.org/10.1007/3-540-38424-3_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/73007.73009", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1050091896"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1038/scientificamerican0589-28b", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1056542272", 
              "https://doi.org/10.1038/scientificamerican0589-28b"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/0217014", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062842033"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.2307/3974219", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1070485920"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1988.21920", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086162079"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/sfcs.1986.26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1086233797"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "1992", 
        "datePublishedReg": "1992-01-01", 
        "description": "We describe a protocol for quantum oblivious transfer, utilizing faint pulses of polarized light, by which one of two mutually distrustful parties (\u201cAlice\u201d) transmits two one-bit messages in such a way that the other party (\u201cBob\u201d) can choose which message he gets but cannot obtain information about both messages (he will learn his chosen bit\u2019s value with exponentially small error probability and may gain at most exponentially little information about the value of the other bit), and Alice will be entirely ignorant of which bit he received. Neither party can cheat (ie deviate from the protocol while appearing to follow it) in such a way as to obtain more information than what is given by the description of the protocol. Our protocol is easy to modify in order to implement the All-or-Nothing Disclosure of one out of two string messages, and it can be used to implement bit commitment and oblivious circuit evaluation without complexity-theoretic assumptions, in a way that remains secure even against cheaters that have unlimited computing power. Moreover, this protocol is practical in that it can be realized with available optoelectronic apparatus while being immune to any technologically feasible attack for the foreseeable future.", 
        "editor": [
          {
            "familyName": "Feigenbaum", 
            "givenName": "Joan", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/3-540-46766-1_29", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-540-55188-1"
          ], 
          "name": "Advances in Cryptology \u2014 CRYPTO \u201991", 
          "type": "Book"
        }, 
        "name": "Practical Quantum Oblivious Transfer", 
        "pagination": "351-366", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/3-540-46766-1_29"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "83a5346dfc0363ece431ae0839845fa40898680b034e116a8193c9c6f7551b70"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1027634682"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/3-540-46766-1_29", 
          "https://app.dimensions.ai/details/publication/pub.1027634682"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-15T21:02", 
        "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/0000000001_0000000264/records_8690_00000260.jsonl", 
        "type": "Chapter", 
        "url": "http://link.springer.com/10.1007/3-540-46766-1_29"
      }
    ]
     

    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-46766-1_29'

    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-46766-1_29'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-46766-1_29'

    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-46766-1_29'


     

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

    154 TRIPLES      23 PREDICATES      45 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/3-540-46766-1_29 schema:about anzsrc-for:08
    2 anzsrc-for:0804
    3 schema:author N4cdf028202ba4c33afc9de1f79cbba28
    4 schema:citation sg:pub.10.1007/3-540-38424-3_4
    5 sg:pub.10.1007/3-540-38424-3_7
    6 sg:pub.10.1007/3-540-46877-3_23
    7 sg:pub.10.1007/3-540-48071-4_14
    8 sg:pub.10.1007/3-540-48184-2_30
    9 sg:pub.10.1007/978-1-4757-0602-4_19
    10 sg:pub.10.1007/978-1-4757-0602-4_26
    11 sg:pub.10.1038/353384a0
    12 sg:pub.10.1038/scientificamerican0589-28b
    13 https://doi.org/10.1109/sfcs.1986.26
    14 https://doi.org/10.1109/sfcs.1988.21920
    15 https://doi.org/10.1137/0217014
    16 https://doi.org/10.1145/100216.100270
    17 https://doi.org/10.1145/1008908.1008920
    18 https://doi.org/10.1145/62212.62215
    19 https://doi.org/10.1145/73007.73009
    20 https://doi.org/10.1145/73007.73012
    21 https://doi.org/10.2307/3974219
    22 schema:datePublished 1992
    23 schema:datePublishedReg 1992-01-01
    24 schema:description We describe a protocol for quantum oblivious transfer, utilizing faint pulses of polarized light, by which one of two mutually distrustful parties (“Alice”) transmits two one-bit messages in such a way that the other party (“Bob”) can choose which message he gets but cannot obtain information about both messages (he will learn his chosen bit’s value with exponentially small error probability and may gain at most exponentially little information about the value of the other bit), and Alice will be entirely ignorant of which bit he received. Neither party can cheat (ie deviate from the protocol while appearing to follow it) in such a way as to obtain more information than what is given by the description of the protocol. Our protocol is easy to modify in order to implement the All-or-Nothing Disclosure of one out of two string messages, and it can be used to implement bit commitment and oblivious circuit evaluation without complexity-theoretic assumptions, in a way that remains secure even against cheaters that have unlimited computing power. Moreover, this protocol is practical in that it can be realized with available optoelectronic apparatus while being immune to any technologically feasible attack for the foreseeable future.
    25 schema:editor N22afb177dff44b5ab0c64f83ffca8618
    26 schema:genre chapter
    27 schema:inLanguage en
    28 schema:isAccessibleForFree true
    29 schema:isPartOf N5cac45a52c6140648e1187ff886c886b
    30 schema:name Practical Quantum Oblivious Transfer
    31 schema:pagination 351-366
    32 schema:productId N6f69c63a38594f0da064f2fca72a30fc
    33 Nec88af18340e48f095a0d0567477d3bc
    34 Nfc67fe5d424c4d7493d55e290e72c39f
    35 schema:publisher Nddfd4fe18e2948c6a9d2a92cb07dff79
    36 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027634682
    37 https://doi.org/10.1007/3-540-46766-1_29
    38 schema:sdDatePublished 2019-04-15T21:02
    39 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    40 schema:sdPublisher N34b3b4dcd6024d83b70aa33ba2a75263
    41 schema:url http://link.springer.com/10.1007/3-540-46766-1_29
    42 sgo:license sg:explorer/license/
    43 sgo:sdDataset chapters
    44 rdf:type schema:Chapter
    45 N10565b008dc242289c1a7811b7f679d5 rdf:first N34f8b4b1f9da4d548fd0e3d5ea57c08f
    46 rdf:rest rdf:nil
    47 N22afb177dff44b5ab0c64f83ffca8618 rdf:first N44935fbe672346629c3d322a1946ff38
    48 rdf:rest rdf:nil
    49 N236b0f49078e4f8a89655f7e88528293 rdf:first sg:person.01127736412.71
    50 rdf:rest N10565b008dc242289c1a7811b7f679d5
    51 N23c3a9f014724accbf72305ae7964541 schema:name IBM T. J. Watson Research Laboratory, Yorktown Heights, New York, NY 10598, USA
    52 rdf:type schema:Organization
    53 N34b3b4dcd6024d83b70aa33ba2a75263 schema:name Springer Nature - SN SciGraph project
    54 rdf:type schema:Organization
    55 N34f8b4b1f9da4d548fd0e3d5ea57c08f schema:affiliation https://www.grid.ac/institutes/grid.5842.b
    56 schema:familyName Skubiszewska
    57 schema:givenName Marie-Hélène
    58 rdf:type schema:Person
    59 N44935fbe672346629c3d322a1946ff38 schema:familyName Feigenbaum
    60 schema:givenName Joan
    61 rdf:type schema:Person
    62 N4cdf028202ba4c33afc9de1f79cbba28 rdf:first sg:person.011230322172.45
    63 rdf:rest N4f0c285d93bb4ce8a9bb2141a5bd9d61
    64 N4f0c285d93bb4ce8a9bb2141a5bd9d61 rdf:first sg:person.01364311576.95
    65 rdf:rest N236b0f49078e4f8a89655f7e88528293
    66 N5cac45a52c6140648e1187ff886c886b schema:isbn 978-3-540-55188-1
    67 schema:name Advances in Cryptology — CRYPTO ’91
    68 rdf:type schema:Book
    69 N6f69c63a38594f0da064f2fca72a30fc schema:name dimensions_id
    70 schema:value pub.1027634682
    71 rdf:type schema:PropertyValue
    72 Nd7d24be86cb9451cbd28e7ee1678fdde schema:name Département de Mathématiques et d’Informatique, École Normale Supérieure, 45 rue d’Ulm, 75230 Paris Cedex 05, France
    73 rdf:type schema:Organization
    74 Nddfd4fe18e2948c6a9d2a92cb07dff79 schema:location Berlin, Heidelberg
    75 schema:name Springer Berlin Heidelberg
    76 rdf:type schema:Organisation
    77 Nec88af18340e48f095a0d0567477d3bc schema:name readcube_id
    78 schema:value 83a5346dfc0363ece431ae0839845fa40898680b034e116a8193c9c6f7551b70
    79 rdf:type schema:PropertyValue
    80 Nfc67fe5d424c4d7493d55e290e72c39f schema:name doi
    81 schema:value 10.1007/3-540-46766-1_29
    82 rdf:type schema:PropertyValue
    83 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    84 schema:name Information and Computing Sciences
    85 rdf:type schema:DefinedTerm
    86 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
    87 schema:name Data Format
    88 rdf:type schema:DefinedTerm
    89 sg:person.011230322172.45 schema:affiliation N23c3a9f014724accbf72305ae7964541
    90 schema:familyName Bennett
    91 schema:givenName Charles H.
    92 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011230322172.45
    93 rdf:type schema:Person
    94 sg:person.01127736412.71 schema:affiliation Nd7d24be86cb9451cbd28e7ee1678fdde
    95 schema:familyName Crépeau
    96 schema:givenName Claude
    97 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01127736412.71
    98 rdf:type schema:Person
    99 sg:person.01364311576.95 schema:affiliation https://www.grid.ac/institutes/grid.14848.31
    100 schema:familyName Brassard
    101 schema:givenName Gilles
    102 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01364311576.95
    103 rdf:type schema:Person
    104 sg:pub.10.1007/3-540-38424-3_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046914662
    105 https://doi.org/10.1007/3-540-38424-3_4
    106 rdf:type schema:CreativeWork
    107 sg:pub.10.1007/3-540-38424-3_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034565969
    108 https://doi.org/10.1007/3-540-38424-3_7
    109 rdf:type schema:CreativeWork
    110 sg:pub.10.1007/3-540-46877-3_23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042694252
    111 https://doi.org/10.1007/3-540-46877-3_23
    112 rdf:type schema:CreativeWork
    113 sg:pub.10.1007/3-540-48071-4_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006175712
    114 https://doi.org/10.1007/3-540-48071-4_14
    115 rdf:type schema:CreativeWork
    116 sg:pub.10.1007/3-540-48184-2_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020097248
    117 https://doi.org/10.1007/3-540-48184-2_30
    118 rdf:type schema:CreativeWork
    119 sg:pub.10.1007/978-1-4757-0602-4_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015721808
    120 https://doi.org/10.1007/978-1-4757-0602-4_19
    121 rdf:type schema:CreativeWork
    122 sg:pub.10.1007/978-1-4757-0602-4_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041140814
    123 https://doi.org/10.1007/978-1-4757-0602-4_26
    124 rdf:type schema:CreativeWork
    125 sg:pub.10.1038/353384a0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014766447
    126 https://doi.org/10.1038/353384a0
    127 rdf:type schema:CreativeWork
    128 sg:pub.10.1038/scientificamerican0589-28b schema:sameAs https://app.dimensions.ai/details/publication/pub.1056542272
    129 https://doi.org/10.1038/scientificamerican0589-28b
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1109/sfcs.1986.26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086233797
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1109/sfcs.1988.21920 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086162079
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1137/0217014 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062842033
    136 rdf:type schema:CreativeWork
    137 https://doi.org/10.1145/100216.100270 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011956916
    138 rdf:type schema:CreativeWork
    139 https://doi.org/10.1145/1008908.1008920 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027988881
    140 rdf:type schema:CreativeWork
    141 https://doi.org/10.1145/62212.62215 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004301530
    142 rdf:type schema:CreativeWork
    143 https://doi.org/10.1145/73007.73009 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050091896
    144 rdf:type schema:CreativeWork
    145 https://doi.org/10.1145/73007.73012 schema:sameAs https://app.dimensions.ai/details/publication/pub.1023076003
    146 rdf:type schema:CreativeWork
    147 https://doi.org/10.2307/3974219 schema:sameAs https://app.dimensions.ai/details/publication/pub.1070485920
    148 rdf:type schema:CreativeWork
    149 https://www.grid.ac/institutes/grid.14848.31 schema:alternateName University of Montreal
    150 schema:name Département IRO, Université de Montréal, C.P. 6128, succursale “A”, Montréal, Québec, Canada, H3C 3J7
    151 rdf:type schema:Organization
    152 https://www.grid.ac/institutes/grid.5842.b schema:alternateName University of Paris-Sud
    153 schema:name Laboratoire de Recherche en Informatique, Université Paris-Sud, Bâtiment 490, 91405 Orsay, France
    154 rdf:type schema:Organization
     




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


    ...