Ontology type: schema:Chapter
2018-03-31
AUTHORSIlan Komargodski , Moni Naor , Eylon Yogev
ABSTRACTA collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a x1≠x2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_1 \ne x_2$$\end{document} s.t. h(x1)=h(x2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h(x_1) = h(x_2)$$\end{document}. Collision resistant hash functions are one of the more useful cryptographic primitives both in theory and in practice and two prominent applications are in signature schemes and succinct zero-knowledge arguments.In this work we consider a relaxation of the above requirement that we call Multi-CRH: a function where it is hard to find x1,x2,…,xk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_1, x_2, \ldots , x_k$$\end{document} which are all distinct, yet h(x1)=h(x2)=⋯=h(xk)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ h(x_1) = h(x_2) = \cdots = h(x_k)$$\end{document}. We show that for some of the major applications of CRH functions it is possible to replace them by the weaker notion of a Multi-CRH, albeit at the price of adding interaction: we show a constant-round statistically-hiding commitment scheme with succinct interaction (committing to poly(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {poly}(n)$$\end{document} bits requires exchanging O~(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tilde{O}(n)$$\end{document} bits) that can be opened locally (without revealing the full string). This in turn can be used to provide succinct arguments for any NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textsf {NP}}$$\end{document} statement.We formulate four possible worlds of hashing-related assumptions (in the spirit of Impagliazzo’s worlds). They are (1) Nocrypt, where no one-way functions exist, (2) Unihash, where one-way functions exist, and hence also UOWHFs and signature schemes, but no Multi-CRH functions exist, (3) Minihash, where Multi-CRH functions exist but no CRH functions exist, and (4) Hashomania, where CRH functions exist. We show that these four worlds are distinct in a black-box model: we show a separation of CRH from Multi-CRH and a separation of Multi-CRH from one-way functions. More... »
PAGES162-194
Advances in Cryptology – EUROCRYPT 2018
ISBN
978-3-319-78374-1
978-3-319-78375-8
http://scigraph.springernature.com/pub.10.1007/978-3-319-78375-8_6
DOIhttp://dx.doi.org/10.1007/978-3-319-78375-8_6
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1101874799
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": "Cornell Tech, 10044, NewYork, NY, USA",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Cornell Tech, 10044, NewYork, NY, USA"
],
"type": "Organization"
},
"familyName": "Komargodski",
"givenName": "Ilan",
"id": "sg:person.012204235441.12",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012204235441.12"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Weizmann Institute of Science, 76100, Rehovot, Israel",
"id": "http://www.grid.ac/institutes/grid.13992.30",
"name": [
"Weizmann Institute of Science, 76100, Rehovot, 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": "Weizmann Institute of Science, 76100, Rehovot, Israel",
"id": "http://www.grid.ac/institutes/grid.13992.30",
"name": [
"Weizmann Institute of Science, 76100, Rehovot, Israel"
],
"type": "Organization"
},
"familyName": "Yogev",
"givenName": "Eylon",
"id": "sg:person.015120037757.44",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015120037757.44"
],
"type": "Person"
}
],
"datePublished": "2018-03-31",
"datePublishedReg": "2018-03-31",
"description": "A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a x1\u2260x2\\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}$$x_1 \\ne x_2$$\\end{document} s.t. h(x1)=h(x2)\\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}$$h(x_1) = h(x_2)$$\\end{document}. Collision resistant hash functions are one of the more useful cryptographic primitives both in theory and in practice and two prominent applications are in signature schemes and succinct zero-knowledge arguments.In this work we consider a relaxation of the above requirement that we call Multi-CRH: a function where it is hard to find x1,x2,\u2026,xk\\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}$$x_1, x_2, \\ldots , x_k$$\\end{document} which are all distinct, yet h(x1)=h(x2)=\u22ef=h(xk)\\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}$$ h(x_1) = h(x_2) = \\cdots = h(x_k)$$\\end{document}. We show that for some of the major applications of CRH functions it is possible to replace them by the weaker notion of a Multi-CRH, albeit at the price of adding interaction: we show a constant-round statistically-hiding commitment scheme with succinct interaction (committing to poly(n)\\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}$$\\mathsf {poly}(n)$$\\end{document} bits requires exchanging O~(n)\\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}$$\\tilde{O}(n)$$\\end{document} bits) that can be opened locally (without revealing the full string). This in turn can be used to provide succinct arguments for any NP\\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}$${\\textsf {NP}}$$\\end{document} statement.We formulate four possible worlds of hashing-related assumptions (in the spirit of Impagliazzo\u2019s worlds). They are (1) Nocrypt, where no one-way functions exist, (2) Unihash, where one-way functions exist, and hence also UOWHFs and signature schemes, but no Multi-CRH functions exist, (3) Minihash, where Multi-CRH functions exist but no CRH functions exist, and (4) Hashomania, where CRH functions exist. We show that these four worlds are distinct in a black-box model: we show a separation of CRH from Multi-CRH and a separation of Multi-CRH from one-way functions.",
"editor": [
{
"familyName": "Nielsen",
"givenName": "Jesper Buus",
"type": "Person"
},
{
"familyName": "Rijmen",
"givenName": "Vincent",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-319-78375-8_6",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-319-78374-1",
"978-3-319-78375-8"
],
"name": "Advances in Cryptology \u2013 EUROCRYPT 2018",
"type": "Book"
},
"keywords": [
"one-way functions",
"collision-resistant hash functions",
"hash function",
"signature scheme",
"useful cryptographic primitive",
"zero-knowledge arguments",
"cryptographic primitives",
"black-box models",
"succinct arguments",
"commitment scheme",
"Collision Resistant",
"above requirements",
"prominent applications",
"major applications",
"weaker notion",
"scheme",
"possible worlds",
"primitives",
"applications",
"requirements",
"input",
"world",
"work",
"collisions",
"model",
"notion",
"function",
"one",
"assumption",
"interaction",
"statements",
"practice",
"prices",
"theory",
"turn",
"argument",
"multiple collisions",
"separation",
"relaxation",
"Resistant",
"paranoid",
"CRH functions",
"CRH"
],
"name": "Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions",
"pagination": "162-194",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1101874799"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-319-78375-8_6"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-319-78375-8_6",
"https://app.dimensions.ai/details/publication/pub.1101874799"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-20T07:47",
"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/chapter/chapter_384.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-319-78375-8_6"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
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/978-3-319-78375-8_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/978-3-319-78375-8_6'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-78375-8_6'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-78375-8_6'
This table displays all metadata directly associated to this object as RDF triples.
125 TRIPLES
23 PREDICATES
68 URIs
61 LITERALS
7 BLANK NODES
Subject | Predicate | Object | |
---|---|---|---|
1 | sg:pub.10.1007/978-3-319-78375-8_6 | schema:about | anzsrc-for:08 |
2 | ″ | ″ | anzsrc-for:0804 |
3 | ″ | schema:author | N252c1836fe8e4c8a80eb626cfa7878eb |
4 | ″ | schema:datePublished | 2018-03-31 |
5 | ″ | schema:datePublishedReg | 2018-03-31 |
6 | ″ | schema:description | A collision resistant hash (CRH) function is one that compresses its input, yet it is hard to find a collision, i.e. a x1≠x2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_1 \ne x_2$$\end{document} s.t. h(x1)=h(x2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h(x_1) = h(x_2)$$\end{document}. Collision resistant hash functions are one of the more useful cryptographic primitives both in theory and in practice and two prominent applications are in signature schemes and succinct zero-knowledge arguments.In this work we consider a relaxation of the above requirement that we call Multi-CRH: a function where it is hard to find x1,x2,…,xk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_1, x_2, \ldots , x_k$$\end{document} which are all distinct, yet h(x1)=h(x2)=⋯=h(xk)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ h(x_1) = h(x_2) = \cdots = h(x_k)$$\end{document}. We show that for some of the major applications of CRH functions it is possible to replace them by the weaker notion of a Multi-CRH, albeit at the price of adding interaction: we show a constant-round statistically-hiding commitment scheme with succinct interaction (committing to poly(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {poly}(n)$$\end{document} bits requires exchanging O~(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tilde{O}(n)$$\end{document} bits) that can be opened locally (without revealing the full string). This in turn can be used to provide succinct arguments for any NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textsf {NP}}$$\end{document} statement.We formulate four possible worlds of hashing-related assumptions (in the spirit of Impagliazzo’s worlds). They are (1) Nocrypt, where no one-way functions exist, (2) Unihash, where one-way functions exist, and hence also UOWHFs and signature schemes, but no Multi-CRH functions exist, (3) Minihash, where Multi-CRH functions exist but no CRH functions exist, and (4) Hashomania, where CRH functions exist. We show that these four worlds are distinct in a black-box model: we show a separation of CRH from Multi-CRH and a separation of Multi-CRH from one-way functions. |
7 | ″ | schema:editor | N72f35c14851b41edbfe25f4ebc6fbcfc |
8 | ″ | schema:genre | chapter |
9 | ″ | schema:inLanguage | en |
10 | ″ | schema:isAccessibleForFree | false |
11 | ″ | schema:isPartOf | Nb1df8c3ee74f4084b1454bc2ceac7a90 |
12 | ″ | schema:keywords | CRH |
13 | ″ | ″ | CRH functions |
14 | ″ | ″ | Collision Resistant |
15 | ″ | ″ | Resistant |
16 | ″ | ″ | above requirements |
17 | ″ | ″ | applications |
18 | ″ | ″ | argument |
19 | ″ | ″ | assumption |
20 | ″ | ″ | black-box models |
21 | ″ | ″ | collision-resistant hash functions |
22 | ″ | ″ | collisions |
23 | ″ | ″ | commitment scheme |
24 | ″ | ″ | cryptographic primitives |
25 | ″ | ″ | function |
26 | ″ | ″ | hash function |
27 | ″ | ″ | input |
28 | ″ | ″ | interaction |
29 | ″ | ″ | major applications |
30 | ″ | ″ | model |
31 | ″ | ″ | multiple collisions |
32 | ″ | ″ | notion |
33 | ″ | ″ | one |
34 | ″ | ″ | one-way functions |
35 | ″ | ″ | paranoid |
36 | ″ | ″ | possible worlds |
37 | ″ | ″ | practice |
38 | ″ | ″ | prices |
39 | ″ | ″ | primitives |
40 | ″ | ″ | prominent applications |
41 | ″ | ″ | relaxation |
42 | ″ | ″ | requirements |
43 | ″ | ″ | scheme |
44 | ″ | ″ | separation |
45 | ″ | ″ | signature scheme |
46 | ″ | ″ | statements |
47 | ″ | ″ | succinct arguments |
48 | ″ | ″ | theory |
49 | ″ | ″ | turn |
50 | ″ | ″ | useful cryptographic primitive |
51 | ″ | ″ | weaker notion |
52 | ″ | ″ | work |
53 | ″ | ″ | world |
54 | ″ | ″ | zero-knowledge arguments |
55 | ″ | schema:name | Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions |
56 | ″ | schema:pagination | 162-194 |
57 | ″ | schema:productId | N1f41d567f1314cea99f3690a5a1afd74 |
58 | ″ | ″ | N31d6187e60024bc9802da251767ff58b |
59 | ″ | schema:publisher | N5a5024d155a24a59a5ef205d6df543e7 |
60 | ″ | schema:sameAs | https://app.dimensions.ai/details/publication/pub.1101874799 |
61 | ″ | ″ | https://doi.org/10.1007/978-3-319-78375-8_6 |
62 | ″ | schema:sdDatePublished | 2022-05-20T07:47 |
63 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |
64 | ″ | schema:sdPublisher | N4889d605c5b847b4ab1ecd03cfdc163b |
65 | ″ | schema:url | https://doi.org/10.1007/978-3-319-78375-8_6 |
66 | ″ | sgo:license | sg:explorer/license/ |
67 | ″ | sgo:sdDataset | chapters |
68 | ″ | rdf:type | schema:Chapter |
69 | N0ee6858197c04aac949aad29507fe49d | schema:familyName | Nielsen |
70 | ″ | schema:givenName | Jesper Buus |
71 | ″ | rdf:type | schema:Person |
72 | N1f2766e74141411fa36344f277585f44 | rdf:first | N6aa01d4815bf473c8b35c48d65b6e9d7 |
73 | ″ | rdf:rest | rdf:nil |
74 | N1f41d567f1314cea99f3690a5a1afd74 | schema:name | dimensions_id |
75 | ″ | schema:value | pub.1101874799 |
76 | ″ | rdf:type | schema:PropertyValue |
77 | N252c1836fe8e4c8a80eb626cfa7878eb | rdf:first | sg:person.012204235441.12 |
78 | ″ | rdf:rest | Na0942e4c17194a4b977dbceff947ba89 |
79 | N31d6187e60024bc9802da251767ff58b | schema:name | doi |
80 | ″ | schema:value | 10.1007/978-3-319-78375-8_6 |
81 | ″ | rdf:type | schema:PropertyValue |
82 | N4889d605c5b847b4ab1ecd03cfdc163b | schema:name | Springer Nature - SN SciGraph project |
83 | ″ | rdf:type | schema:Organization |
84 | N5a5024d155a24a59a5ef205d6df543e7 | schema:name | Springer Nature |
85 | ″ | rdf:type | schema:Organisation |
86 | N6aa01d4815bf473c8b35c48d65b6e9d7 | schema:familyName | Rijmen |
87 | ″ | schema:givenName | Vincent |
88 | ″ | rdf:type | schema:Person |
89 | N72f35c14851b41edbfe25f4ebc6fbcfc | rdf:first | N0ee6858197c04aac949aad29507fe49d |
90 | ″ | rdf:rest | N1f2766e74141411fa36344f277585f44 |
91 | N98245949eadb42588716818e55f14859 | rdf:first | sg:person.015120037757.44 |
92 | ″ | rdf:rest | rdf:nil |
93 | Na0942e4c17194a4b977dbceff947ba89 | rdf:first | sg:person.07776170271.83 |
94 | ″ | rdf:rest | N98245949eadb42588716818e55f14859 |
95 | Nb1df8c3ee74f4084b1454bc2ceac7a90 | schema:isbn | 978-3-319-78374-1 |
96 | ″ | ″ | 978-3-319-78375-8 |
97 | ″ | schema:name | Advances in Cryptology – EUROCRYPT 2018 |
98 | ″ | rdf:type | schema:Book |
99 | anzsrc-for:08 | schema:inDefinedTermSet | anzsrc-for: |
100 | ″ | schema:name | Information and Computing Sciences |
101 | ″ | rdf:type | schema:DefinedTerm |
102 | anzsrc-for:0804 | schema:inDefinedTermSet | anzsrc-for: |
103 | ″ | schema:name | Data Format |
104 | ″ | rdf:type | schema:DefinedTerm |
105 | sg:person.012204235441.12 | schema:affiliation | grid-institutes:None |
106 | ″ | schema:familyName | Komargodski |
107 | ″ | schema:givenName | Ilan |
108 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012204235441.12 |
109 | ″ | rdf:type | schema:Person |
110 | sg:person.015120037757.44 | schema:affiliation | grid-institutes:grid.13992.30 |
111 | ″ | schema:familyName | Yogev |
112 | ″ | schema:givenName | Eylon |
113 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015120037757.44 |
114 | ″ | rdf:type | schema:Person |
115 | sg:person.07776170271.83 | schema:affiliation | grid-institutes:grid.13992.30 |
116 | ″ | schema:familyName | Naor |
117 | ″ | schema:givenName | Moni |
118 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07776170271.83 |
119 | ″ | rdf:type | schema:Person |
120 | grid-institutes:None | schema:alternateName | Cornell Tech, 10044, NewYork, NY, USA |
121 | ″ | schema:name | Cornell Tech, 10044, NewYork, NY, USA |
122 | ″ | rdf:type | schema:Organization |
123 | grid-institutes:grid.13992.30 | schema:alternateName | Weizmann Institute of Science, 76100, Rehovot, Israel |
124 | ″ | schema:name | Weizmann Institute of Science, 76100, Rehovot, Israel |
125 | ″ | rdf:type | schema:Organization |