On Robust Combiners for Oblivious Transfer and Other Primitives View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2005

AUTHORS

Danny Harnik , Joe Kilian , Moni Naor , Omer Reingold , Alon Rosen

ABSTRACT

A (1,2)-robust combiner for a cryptographic primitive \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document} is a construction that takes two candidate schemes for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document}and combines them into one scheme that securely implement \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document}even if one of the candidates fails. Robust combiners are a useful tool for ensuring better security in applied cryptography, and also a handy tool for constructing cryptographic protocols. For example, we discuss using robust combiners for obtaining universal schemes for cryptographic primitives (a universal scheme is an explicit construction that implements \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document}under the sole assumption that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document}exists).In this paper we study what primitives admit robust combiners. In addition to known and very simple combiners for one-way functions and equivalent primitives, we show robust combiners for protocols in the world of public key cryptography, namely for Key Agreement(KA).The main point we make is that things are not as nice for Oblivious Transfer (OT) and in general for secure computation. We prove that there are no ”transparent black-box” robust combiners for OT, giving an indication to the difficulty of finding combiners for OT. On the positive side we show a black box construction of a (2,3)-robust combiner for OT, as well as a generic construction of (1,n)-robust OT-combiners from any (1,2)-robust OT-combiner. More... »

PAGES

96-113

Book

TITLE

Advances in Cryptology – EUROCRYPT 2005

ISBN

978-3-540-25910-7
978-3-540-32055-5

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/11426639_6

DOI

http://dx.doi.org/10.1007/11426639_6

DIMENSIONS

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


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": "Dept. of Computer Science and Applied Math., Weizmann Institute of Science", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Dept. of Computer Science and Applied Math., Weizmann Institute of Science"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Harnik", 
        "givenName": "Danny", 
        "id": "sg:person.011037626541.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011037626541.00"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Yianilos Labs", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Yianilos Labs"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kilian", 
        "givenName": "Joe", 
        "id": "sg:person.012752671263.54", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012752671263.54"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science and Applied Math., Weizmann Institute of Science", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Dept. of Computer Science and Applied Math., Weizmann Institute of Science"
          ], 
          "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": "Dept. of Computer Science and Applied Math., Weizmann Institute of Science", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Dept. of Computer Science and Applied Math., Weizmann Institute of Science"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Reingold", 
        "givenName": "Omer", 
        "id": "sg:person.012547246003.78", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012547246003.78"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "CSAIL, MIT", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "CSAIL, MIT"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rosen", 
        "givenName": "Alon", 
        "id": "sg:person.016463202715.80", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016463202715.80"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2005", 
    "datePublishedReg": "2005-01-01", 
    "description": "A (1,2)-robust combiner for a cryptographic primitive \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}${\\mathcal P}$\\end{document} is a construction that takes two candidate schemes for \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}${\\mathcal P}$\\end{document}and combines them into one scheme that securely implement \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}${\\mathcal P}$\\end{document}even if one of the candidates fails. Robust combiners are a useful tool for ensuring better security in applied cryptography, and also a handy tool for constructing cryptographic protocols. For example, we discuss using robust combiners for obtaining universal schemes for cryptographic primitives (a universal scheme is an explicit construction that implements \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}${\\mathcal P}$\\end{document}under the sole assumption that \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}${\\mathcal P}$\\end{document}exists).In this paper we study what primitives admit robust combiners. In addition to known and very simple combiners for one-way functions and equivalent primitives, we show robust combiners for protocols in the world of public key cryptography, namely for Key Agreement(KA).The main point we make is that things are not as nice for Oblivious Transfer (OT) and in general for secure computation. We prove that there are no \u201dtransparent black-box\u201d robust combiners for OT, giving an indication to the difficulty of finding combiners for OT. On the positive side we show a black box construction of a (2,3)-robust combiner for OT, as well as a generic construction of (1,n)-robust OT-combiners from any (1,2)-robust OT-combiner.", 
    "editor": [
      {
        "familyName": "Cramer", 
        "givenName": "Ronald", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/11426639_6", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-25910-7", 
        "978-3-540-32055-5"
      ], 
      "name": "Advances in Cryptology \u2013 EUROCRYPT 2005", 
      "type": "Book"
    }, 
    "keywords": [
      "oblivious transfer", 
      "cryptographic primitives", 
      "robust combiners", 
      "public key cryptography", 
      "one-way functions", 
      "secure computation", 
      "better security", 
      "cryptographic protocols", 
      "key cryptography", 
      "generic construction", 
      "primitives", 
      "OT-combiner", 
      "candidate schemes", 
      "cryptography", 
      "black box construction", 
      "universal scheme", 
      "handy tool", 
      "scheme", 
      "simple combiners", 
      "security", 
      "protocol", 
      "box construction", 
      "tool", 
      "computation", 
      "positive side", 
      "combiner", 
      "things", 
      "construction", 
      "key", 
      "main points", 
      "example", 
      "useful tool", 
      "world", 
      "point", 
      "difficulties", 
      "candidates", 
      "function", 
      "transfer", 
      "addition", 
      "side", 
      "indications", 
      "paper", 
      "equivalent primitives"
    ], 
    "name": "On Robust Combiners for Oblivious Transfer and Other Primitives", 
    "pagination": "96-113", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1027571548"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/11426639_6"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/11426639_6", 
      "https://app.dimensions.ai/details/publication/pub.1027571548"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:19", 
    "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/chapter/chapter_340.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/11426639_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/11426639_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/11426639_6'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/11426639_6'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/11426639_6'


 

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

135 TRIPLES      23 PREDICATES      69 URIs      62 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/11426639_6 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N318584f145c04b1db8a3ff516239543e
4 schema:datePublished 2005
5 schema:datePublishedReg 2005-01-01
6 schema:description A (1,2)-robust combiner for a cryptographic primitive \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document} is a construction that takes two candidate schemes for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document}and combines them into one scheme that securely implement \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document}even if one of the candidates fails. Robust combiners are a useful tool for ensuring better security in applied cryptography, and also a handy tool for constructing cryptographic protocols. For example, we discuss using robust combiners for obtaining universal schemes for cryptographic primitives (a universal scheme is an explicit construction that implements \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document}under the sole assumption that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal P}$\end{document}exists).In this paper we study what primitives admit robust combiners. In addition to known and very simple combiners for one-way functions and equivalent primitives, we show robust combiners for protocols in the world of public key cryptography, namely for Key Agreement(KA).The main point we make is that things are not as nice for Oblivious Transfer (OT) and in general for secure computation. We prove that there are no ”transparent black-box” robust combiners for OT, giving an indication to the difficulty of finding combiners for OT. On the positive side we show a black box construction of a (2,3)-robust combiner for OT, as well as a generic construction of (1,n)-robust OT-combiners from any (1,2)-robust OT-combiner.
7 schema:editor N7c9dd7b659f64ab599f7df631eb441a0
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N1ba7baf1d29a43ba969e699a835865f8
12 schema:keywords OT-combiner
13 addition
14 better security
15 black box construction
16 box construction
17 candidate schemes
18 candidates
19 combiner
20 computation
21 construction
22 cryptographic primitives
23 cryptographic protocols
24 cryptography
25 difficulties
26 equivalent primitives
27 example
28 function
29 generic construction
30 handy tool
31 indications
32 key
33 key cryptography
34 main points
35 oblivious transfer
36 one-way functions
37 paper
38 point
39 positive side
40 primitives
41 protocol
42 public key cryptography
43 robust combiners
44 scheme
45 secure computation
46 security
47 side
48 simple combiners
49 things
50 tool
51 transfer
52 universal scheme
53 useful tool
54 world
55 schema:name On Robust Combiners for Oblivious Transfer and Other Primitives
56 schema:pagination 96-113
57 schema:productId N92757c90c4054901a30fdb8039f31439
58 N96be630476aa43b3a1a73f1f9127566e
59 schema:publisher N8e75ba82af45448aa636da01e31607c3
60 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027571548
61 https://doi.org/10.1007/11426639_6
62 schema:sdDatePublished 2022-01-01T19:19
63 schema:sdLicense https://scigraph.springernature.com/explorer/license/
64 schema:sdPublisher N3f73533a3ae04255be2cde3e31e2079f
65 schema:url https://doi.org/10.1007/11426639_6
66 sgo:license sg:explorer/license/
67 sgo:sdDataset chapters
68 rdf:type schema:Chapter
69 N1ba7baf1d29a43ba969e699a835865f8 schema:isbn 978-3-540-25910-7
70 978-3-540-32055-5
71 schema:name Advances in Cryptology – EUROCRYPT 2005
72 rdf:type schema:Book
73 N2329e680940f4c1099b7bc4818058ac8 rdf:first sg:person.016463202715.80
74 rdf:rest rdf:nil
75 N318584f145c04b1db8a3ff516239543e rdf:first sg:person.011037626541.00
76 rdf:rest N93d1d32f5e83451a897bc4e1e25c9606
77 N3f73533a3ae04255be2cde3e31e2079f schema:name Springer Nature - SN SciGraph project
78 rdf:type schema:Organization
79 N5b127b10b6aa4a6eb461e6889b7f8244 rdf:first sg:person.07776170271.83
80 rdf:rest Nd380763bfbab41459df54108172d3262
81 N69327e990e3346eab7ee4b790a97400f schema:familyName Cramer
82 schema:givenName Ronald
83 rdf:type schema:Person
84 N7c9dd7b659f64ab599f7df631eb441a0 rdf:first N69327e990e3346eab7ee4b790a97400f
85 rdf:rest rdf:nil
86 N8e75ba82af45448aa636da01e31607c3 schema:name Springer Nature
87 rdf:type schema:Organisation
88 N92757c90c4054901a30fdb8039f31439 schema:name doi
89 schema:value 10.1007/11426639_6
90 rdf:type schema:PropertyValue
91 N93d1d32f5e83451a897bc4e1e25c9606 rdf:first sg:person.012752671263.54
92 rdf:rest N5b127b10b6aa4a6eb461e6889b7f8244
93 N96be630476aa43b3a1a73f1f9127566e schema:name dimensions_id
94 schema:value pub.1027571548
95 rdf:type schema:PropertyValue
96 Nd380763bfbab41459df54108172d3262 rdf:first sg:person.012547246003.78
97 rdf:rest N2329e680940f4c1099b7bc4818058ac8
98 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
99 schema:name Information and Computing Sciences
100 rdf:type schema:DefinedTerm
101 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
102 schema:name Data Format
103 rdf:type schema:DefinedTerm
104 sg:person.011037626541.00 schema:affiliation grid-institutes:None
105 schema:familyName Harnik
106 schema:givenName Danny
107 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011037626541.00
108 rdf:type schema:Person
109 sg:person.012547246003.78 schema:affiliation grid-institutes:None
110 schema:familyName Reingold
111 schema:givenName Omer
112 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012547246003.78
113 rdf:type schema:Person
114 sg:person.012752671263.54 schema:affiliation grid-institutes:None
115 schema:familyName Kilian
116 schema:givenName Joe
117 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012752671263.54
118 rdf:type schema:Person
119 sg:person.016463202715.80 schema:affiliation grid-institutes:None
120 schema:familyName Rosen
121 schema:givenName Alon
122 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016463202715.80
123 rdf:type schema:Person
124 sg:person.07776170271.83 schema:affiliation grid-institutes:None
125 schema:familyName Naor
126 schema:givenName Moni
127 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83
128 rdf:type schema:Person
129 grid-institutes:None schema:alternateName CSAIL, MIT
130 Dept. of Computer Science and Applied Math., Weizmann Institute of Science
131 Yianilos Labs
132 schema:name CSAIL, MIT
133 Dept. of Computer Science and Applied Math., Weizmann Institute of Science
134 Yianilos Labs
135 rdf:type schema:Organization
 




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


...