Computationally Secure Oblivious Transfer View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2004-10-21

AUTHORS

Moni Naor, Benny Pinkas

ABSTRACT

We describe new computationally secure protocols of 1-out-of-N oblivious transfer, k-out-of-N oblivious transfer, and oblivious transfer with adaptive queries. The protocols are very efficient compared with solutions based on generic two-party computation or on information-theoretic security. The 1-out-of-N oblivious transfer protocol requires only log N executions of a 1-out-of-2 oblivious transfer protocol. The k-out-of-N protocol is considerably more efficient than k repetitions of 1-out-of-N oblivious transfer, as is the construction for oblivious transfer with adaptive queries. The efficiency of the new oblivious transfer protocols makes them useful for many applications. A direct corollary of the 1-out-of-N oblivious transfer protocol is an efficient transformation of any Private Information Retrieval protocol to a Symmetric PIR protocol. More... »

PAGES

1-35

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00145-004-0102-6

DOI

http://dx.doi.org/10.1007/s00145-004-0102-6

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "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": "Department of Computer Science and Applied Mathematics,\nWeizmann Institute of Science,\nRehovot 76100, Israel", 
          "id": "http://www.grid.ac/institutes/grid.13992.30", 
          "name": [
            "Department of Computer Science and Applied Mathematics,\nWeizmann Institute of Science,\nRehovot 76100, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Naor", 
        "givenName": "Moni", 
        "id": "sg:person.07776170271.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "HP Labs, 5 Vaughn Drive, Princeton, NJ 08540, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "HP Labs, 5 Vaughn Drive, Princeton, NJ 08540, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Pinkas", 
        "givenName": "Benny", 
        "id": "sg:person.07416054235.47", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07416054235.47"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2004-10-21", 
    "datePublishedReg": "2004-10-21", 
    "description": "Abstract\nWe describe new computationally secure  protocols of\n 1-out-of-N oblivious transfer, \n k-out-of-N oblivious transfer, and oblivious transfer with\n adaptive queries. \nThe protocols are very  efficient compared with solutions based on\n generic two-party  computation or on information-theoretic security.\nThe  1-out-of-N oblivious transfer protocol\nrequires only log N  executions of a 1-out-of-2\noblivious transfer  protocol. The\nk-out-of-N  protocol  is considerably more efficient than k\nrepetitions of 1-out-of-N oblivious transfer, as is the\n construction for \noblivious transfer with adaptive queries. The efficiency of the new\n oblivious transfer \nprotocols makes them useful for many applications. A direct corollary of\nthe 1-out-of-N oblivious transfer protocol is an efficient transformation\nof any Private Information Retrieval protocol to a Symmetric PIR protocol.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/s00145-004-0102-6", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1136278", 
        "issn": [
          "0933-2790", 
          "1432-1378"
        ], 
        "name": "Journal of Cryptology", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "18"
      }
    ], 
    "keywords": [
      "oblivious transfer", 
      "oblivious transfer protocol", 
      "adaptive queries", 
      "private information retrieval protocol", 
      "transfer protocol", 
      "information-theoretic security", 
      "information retrieval protocol", 
      "secure oblivious transfer", 
      "symmetric PIR protocol", 
      "two-party", 
      "PIR protocols", 
      "retrieval protocol", 
      "queries", 
      "protocol", 
      "execution", 
      "security", 
      "log n", 
      "computation", 
      "applications", 
      "efficient transformation", 
      "efficiency", 
      "solution", 
      "construction", 
      "transformation", 
      "direct corollary", 
      "transfer", 
      "repetition", 
      "corollary", 
      "Computationally Secure Oblivious Transfer"
    ], 
    "name": "Computationally Secure Oblivious Transfer", 
    "pagination": "1-35", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1011320130"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00145-004-0102-6"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00145-004-0102-6", 
      "https://app.dimensions.ai/details/publication/pub.1011320130"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-01-01T18:14", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/article/article_382.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/s00145-004-0102-6"
  }
]
 

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/s00145-004-0102-6'

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/s00145-004-0102-6'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00145-004-0102-6'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00145-004-0102-6'


 

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

101 TRIPLES      21 PREDICATES      54 URIs      45 LITERALS      6 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00145-004-0102-6 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 anzsrc-for:0804
4 schema:author N81abdf8a288a4571a9be8ed49acf7154
5 schema:datePublished 2004-10-21
6 schema:datePublishedReg 2004-10-21
7 schema:description Abstract We describe new computationally secure protocols of 1-out-of-N oblivious transfer, k-out-of-N oblivious transfer, and oblivious transfer with adaptive queries. The protocols are very efficient compared with solutions based on generic two-party computation or on information-theoretic security. The 1-out-of-N oblivious transfer protocol requires only log N executions of a 1-out-of-2 oblivious transfer protocol. The k-out-of-N protocol is considerably more efficient than k repetitions of 1-out-of-N oblivious transfer, as is the construction for oblivious transfer with adaptive queries. The efficiency of the new oblivious transfer protocols makes them useful for many applications. A direct corollary of the 1-out-of-N oblivious transfer protocol is an efficient transformation of any Private Information Retrieval protocol to a Symmetric PIR protocol.
8 schema:genre article
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N607d425bdd3e47b3a8bd478bf781981a
12 N7e8b7ae005124d0384dfc9c69f7ead81
13 sg:journal.1136278
14 schema:keywords Computationally Secure Oblivious Transfer
15 PIR protocols
16 adaptive queries
17 applications
18 computation
19 construction
20 corollary
21 direct corollary
22 efficiency
23 efficient transformation
24 execution
25 information retrieval protocol
26 information-theoretic security
27 log n
28 oblivious transfer
29 oblivious transfer protocol
30 private information retrieval protocol
31 protocol
32 queries
33 repetition
34 retrieval protocol
35 secure oblivious transfer
36 security
37 solution
38 symmetric PIR protocol
39 transfer
40 transfer protocol
41 transformation
42 two-party
43 schema:name Computationally Secure Oblivious Transfer
44 schema:pagination 1-35
45 schema:productId Na352cb31260f428abfa3b2132e55c651
46 Nd1901fb3d6ca4f65a9ed79ec77a6f948
47 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011320130
48 https://doi.org/10.1007/s00145-004-0102-6
49 schema:sdDatePublished 2022-01-01T18:14
50 schema:sdLicense https://scigraph.springernature.com/explorer/license/
51 schema:sdPublisher Nd10a671e621349f5bbc636d0480d44dc
52 schema:url https://doi.org/10.1007/s00145-004-0102-6
53 sgo:license sg:explorer/license/
54 sgo:sdDataset articles
55 rdf:type schema:ScholarlyArticle
56 N21c18707aa1d4a8b8edba5b408e5285d rdf:first sg:person.07416054235.47
57 rdf:rest rdf:nil
58 N607d425bdd3e47b3a8bd478bf781981a schema:issueNumber 1
59 rdf:type schema:PublicationIssue
60 N7e8b7ae005124d0384dfc9c69f7ead81 schema:volumeNumber 18
61 rdf:type schema:PublicationVolume
62 N81abdf8a288a4571a9be8ed49acf7154 rdf:first sg:person.07776170271.83
63 rdf:rest N21c18707aa1d4a8b8edba5b408e5285d
64 Na352cb31260f428abfa3b2132e55c651 schema:name dimensions_id
65 schema:value pub.1011320130
66 rdf:type schema:PropertyValue
67 Nd10a671e621349f5bbc636d0480d44dc schema:name Springer Nature - SN SciGraph project
68 rdf:type schema:Organization
69 Nd1901fb3d6ca4f65a9ed79ec77a6f948 schema:name doi
70 schema:value 10.1007/s00145-004-0102-6
71 rdf:type schema:PropertyValue
72 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
73 schema:name Information and Computing Sciences
74 rdf:type schema:DefinedTerm
75 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
76 schema:name Computation Theory and Mathematics
77 rdf:type schema:DefinedTerm
78 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
79 schema:name Data Format
80 rdf:type schema:DefinedTerm
81 sg:journal.1136278 schema:issn 0933-2790
82 1432-1378
83 schema:name Journal of Cryptology
84 schema:publisher Springer Nature
85 rdf:type schema:Periodical
86 sg:person.07416054235.47 schema:affiliation grid-institutes:None
87 schema:familyName Pinkas
88 schema:givenName Benny
89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07416054235.47
90 rdf:type schema:Person
91 sg:person.07776170271.83 schema:affiliation grid-institutes:grid.13992.30
92 schema:familyName Naor
93 schema:givenName Moni
94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83
95 rdf:type schema:Person
96 grid-institutes:None schema:alternateName HP Labs, 5 Vaughn Drive, Princeton, NJ 08540, USA
97 schema:name HP Labs, 5 Vaughn Drive, Princeton, NJ 08540, USA
98 rdf:type schema:Organization
99 grid-institutes:grid.13992.30 schema:alternateName Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel
100 schema:name Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel
101 rdf:type schema:Organization
 




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


...