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 retrieval protocol", 
      "secure oblivious transfer", 
      "information-theoretic security", 
      "PIR protocols", 
      "retrieval protocol", 
      "two-party", 
      "queries", 
      "protocol", 
      "log n", 
      "execution", 
      "security", 
      "computation", 
      "applications", 
      "efficient transformation", 
      "efficiency", 
      "solution", 
      "construction", 
      "direct corollary", 
      "transformation", 
      "transfer", 
      "repetition", 
      "corollary"
    ], 
    "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-05-20T07:22", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_380.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.

99 TRIPLES      21 PREDICATES      53 URIs      44 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 N4ef5eda24ab64c9ca3045a2de0de7e94
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 N6f6b298a3d9b4b398780f897ca46db61
12 N99e285ab1d6b4ae086d446618329bf60
13 sg:journal.1136278
14 schema:keywords PIR protocols
15 adaptive queries
16 applications
17 computation
18 construction
19 corollary
20 direct corollary
21 efficiency
22 efficient transformation
23 execution
24 information retrieval protocol
25 information-theoretic security
26 log n
27 oblivious transfer
28 oblivious transfer protocol
29 private information retrieval protocol
30 protocol
31 queries
32 repetition
33 retrieval protocol
34 secure oblivious transfer
35 security
36 solution
37 transfer
38 transfer protocol
39 transformation
40 two-party
41 schema:name Computationally Secure Oblivious Transfer
42 schema:pagination 1-35
43 schema:productId N3dcdc35fb20042238a9251f588c58d4c
44 N856d1c77a9cd47128c7bba04707a75f1
45 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011320130
46 https://doi.org/10.1007/s00145-004-0102-6
47 schema:sdDatePublished 2022-05-20T07:22
48 schema:sdLicense https://scigraph.springernature.com/explorer/license/
49 schema:sdPublisher Nefceeb4b5878436291431bf2cc877a5b
50 schema:url https://doi.org/10.1007/s00145-004-0102-6
51 sgo:license sg:explorer/license/
52 sgo:sdDataset articles
53 rdf:type schema:ScholarlyArticle
54 N3dcdc35fb20042238a9251f588c58d4c schema:name dimensions_id
55 schema:value pub.1011320130
56 rdf:type schema:PropertyValue
57 N4ef5eda24ab64c9ca3045a2de0de7e94 rdf:first sg:person.07776170271.83
58 rdf:rest Ne8117abe07e74c47a075bdba0fff9d6f
59 N6f6b298a3d9b4b398780f897ca46db61 schema:volumeNumber 18
60 rdf:type schema:PublicationVolume
61 N856d1c77a9cd47128c7bba04707a75f1 schema:name doi
62 schema:value 10.1007/s00145-004-0102-6
63 rdf:type schema:PropertyValue
64 N99e285ab1d6b4ae086d446618329bf60 schema:issueNumber 1
65 rdf:type schema:PublicationIssue
66 Ne8117abe07e74c47a075bdba0fff9d6f rdf:first sg:person.07416054235.47
67 rdf:rest rdf:nil
68 Nefceeb4b5878436291431bf2cc877a5b schema:name Springer Nature - SN SciGraph project
69 rdf:type schema:Organization
70 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
71 schema:name Information and Computing Sciences
72 rdf:type schema:DefinedTerm
73 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
74 schema:name Computation Theory and Mathematics
75 rdf:type schema:DefinedTerm
76 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
77 schema:name Data Format
78 rdf:type schema:DefinedTerm
79 sg:journal.1136278 schema:issn 0933-2790
80 1432-1378
81 schema:name Journal of Cryptology
82 schema:publisher Springer Nature
83 rdf:type schema:Periodical
84 sg:person.07416054235.47 schema:affiliation grid-institutes:None
85 schema:familyName Pinkas
86 schema:givenName Benny
87 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07416054235.47
88 rdf:type schema:Person
89 sg:person.07776170271.83 schema:affiliation grid-institutes:grid.13992.30
90 schema:familyName Naor
91 schema:givenName Moni
92 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83
93 rdf:type schema:Person
94 grid-institutes:None schema:alternateName HP Labs, 5 Vaughn Drive, Princeton, NJ 08540, USA
95 schema:name HP Labs, 5 Vaughn Drive, Princeton, NJ 08540, USA
96 rdf:type schema:Organization
97 grid-institutes:grid.13992.30 schema:alternateName Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel
98 schema:name Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel
99 rdf:type schema:Organization
 




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


...