Ontology type: schema:Chapter Open Access: True
2013
AUTHORSRan Canetti , Huijia Lin , Omer Paneth
ABSTRACTPublic-coin zero-knowledge and concurrent zero-knowledge (cZK) are two classes of zero knowledge protocols that guarantee some additional desirable properties. Still, to this date no protocol is known that is both public-coin and cZK for a language outside BPP. Furthermore, it is known that no such protocol can be black-box ZK [Pass et.al, Crypto 09].We present a public-coin concurrent ZK protocol for any NP language. The protocol assumes that all verifiers have access to a globally specified function, drawn from a collision resistant hash function family. (This model, which we call the Global Hash Function, or GHF model, can be seen as a restricted case of the non-programmable reference string model.) We also show that the impossibility of black-box public-coin cZK extends also to the GHF model.Our protocol assumes CRH functions against quasi-polynomial adversaries and takes O(log1 + εn) rounds for any ε > 0, where n is the security parameter. Our techniques combine those for (non-public-coin) black-box cZK with Barak’s non-black-box technique for public-coin constant-round ZK. As a corollary we obtain the first simultaneously resettable zero-knowledge protocol with O(log1 + εn) rounds, in the GHF model. More... »
PAGES80-99
Theory of Cryptography
ISBN
978-3-642-36593-5
978-3-642-36594-2
http://scigraph.springernature.com/pub.10.1007/978-3-642-36594-2_5
DOIhttp://dx.doi.org/10.1007/978-3-642-36594-2_5
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1018051374
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/20",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Language, Communication and Culture",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/2004",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Linguistics",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Tel Aviv University, Israel",
"id": "http://www.grid.ac/institutes/grid.12136.37",
"name": [
"Boston University, USA",
"Tel Aviv University, Israel"
],
"type": "Organization"
},
"familyName": "Canetti",
"givenName": "Ran",
"id": "sg:person.012320111457.74",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012320111457.74"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "MIT, USA",
"id": "http://www.grid.ac/institutes/grid.116068.8",
"name": [
"Boston University, USA",
"MIT, USA"
],
"type": "Organization"
},
"familyName": "Lin",
"givenName": "Huijia",
"id": "sg:person.07447665001.15",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07447665001.15"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Boston University, USA",
"id": "http://www.grid.ac/institutes/grid.189504.1",
"name": [
"Boston University, USA"
],
"type": "Organization"
},
"familyName": "Paneth",
"givenName": "Omer",
"id": "sg:person.014073524511.68",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014073524511.68"
],
"type": "Person"
}
],
"datePublished": "2013",
"datePublishedReg": "2013-01-01",
"description": "Public-coin zero-knowledge and concurrent zero-knowledge (cZK) are two classes of zero knowledge protocols that guarantee some additional desirable properties. Still, to this date no protocol is known that is both public-coin and cZK for a language outside BPP. Furthermore, it is known that no such protocol can be black-box ZK [Pass et.al, Crypto 09].We present a public-coin concurrent ZK protocol for any NP language. The protocol assumes that all verifiers have access to a globally specified function, drawn from a collision resistant hash function family. (This model, which we call the Global Hash Function, or GHF model, can be seen as a restricted case of the non-programmable reference string model.) We also show that the impossibility of black-box public-coin cZK extends also to the GHF model.Our protocol assumes CRH functions against quasi-polynomial adversaries and takes O(log1\u2009+\u2009\u03b5n) rounds for any \u03b5\u2009>\u20090, where n is the security parameter. Our techniques combine those for (non-public-coin) black-box cZK with Barak\u2019s non-black-box technique for public-coin constant-round ZK. As a corollary we obtain the first simultaneously resettable zero-knowledge protocol with O(log1\u2009+\u2009\u03b5n) rounds, in the GHF model.",
"editor": [
{
"familyName": "Sahai",
"givenName": "Amit",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-642-36594-2_5",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-642-36593-5",
"978-3-642-36594-2"
],
"name": "Theory of Cryptography",
"type": "Book"
},
"keywords": [
"zero-knowledge",
"additional desirable properties",
"knowledge protocol",
"desirable properties",
"ZK protocols",
"collision-resistant hash function family",
"hash function family",
"function family",
"security parameters",
"zero-knowledge protocols",
"Concurrent Zero-Knowledge",
"hash model",
"such protocols",
"ZK",
"NP language",
"model",
"box technique",
"corollary",
"class",
"protocol",
"properties",
"language",
"BPP",
"verifier",
"function",
"adversary",
"parameters",
"technique",
"access",
"impossibility",
"Barak",
"CZK",
"family",
"rounds",
"date",
"CRH functions"
],
"name": "Public-Coin Concurrent Zero-Knowledge in the Global Hash Model",
"pagination": "80-99",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1018051374"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-642-36594-2_5"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-642-36594-2_5",
"https://app.dimensions.ai/details/publication/pub.1018051374"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-06-01T22:36",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_74.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-642-36594-2_5"
}
]
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-642-36594-2_5'
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-642-36594-2_5'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-36594-2_5'
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-642-36594-2_5'
This table displays all metadata directly associated to this object as RDF triples.
118 TRIPLES
23 PREDICATES
62 URIs
55 LITERALS
7 BLANK NODES
Subject | Predicate | Object | |
---|---|---|---|
1 | sg:pub.10.1007/978-3-642-36594-2_5 | schema:about | anzsrc-for:20 |
2 | ″ | ″ | anzsrc-for:2004 |
3 | ″ | schema:author | N3adeed706bd34ef19aa3671fbed3b425 |
4 | ″ | schema:datePublished | 2013 |
5 | ″ | schema:datePublishedReg | 2013-01-01 |
6 | ″ | schema:description | Public-coin zero-knowledge and concurrent zero-knowledge (cZK) are two classes of zero knowledge protocols that guarantee some additional desirable properties. Still, to this date no protocol is known that is both public-coin and cZK for a language outside BPP. Furthermore, it is known that no such protocol can be black-box ZK [Pass et.al, Crypto 09].We present a public-coin concurrent ZK protocol for any NP language. The protocol assumes that all verifiers have access to a globally specified function, drawn from a collision resistant hash function family. (This model, which we call the Global Hash Function, or GHF model, can be seen as a restricted case of the non-programmable reference string model.) We also show that the impossibility of black-box public-coin cZK extends also to the GHF model.Our protocol assumes CRH functions against quasi-polynomial adversaries and takes O(log1 + εn) rounds for any ε > 0, where n is the security parameter. Our techniques combine those for (non-public-coin) black-box cZK with Barak’s non-black-box technique for public-coin constant-round ZK. As a corollary we obtain the first simultaneously resettable zero-knowledge protocol with O(log1 + εn) rounds, in the GHF model. |
7 | ″ | schema:editor | N984c314df36e4eeb980c663bb7b9ac70 |
8 | ″ | schema:genre | chapter |
9 | ″ | schema:inLanguage | en |
10 | ″ | schema:isAccessibleForFree | true |
11 | ″ | schema:isPartOf | N2a4742c9f9fd46a5a25459bf5449f367 |
12 | ″ | schema:keywords | BPP |
13 | ″ | ″ | Barak |
14 | ″ | ″ | CRH functions |
15 | ″ | ″ | CZK |
16 | ″ | ″ | Concurrent Zero-Knowledge |
17 | ″ | ″ | NP language |
18 | ″ | ″ | ZK |
19 | ″ | ″ | ZK protocols |
20 | ″ | ″ | access |
21 | ″ | ″ | additional desirable properties |
22 | ″ | ″ | adversary |
23 | ″ | ″ | box technique |
24 | ″ | ″ | class |
25 | ″ | ″ | collision-resistant hash function family |
26 | ″ | ″ | corollary |
27 | ″ | ″ | date |
28 | ″ | ″ | desirable properties |
29 | ″ | ″ | family |
30 | ″ | ″ | function |
31 | ″ | ″ | function family |
32 | ″ | ″ | hash function family |
33 | ″ | ″ | hash model |
34 | ″ | ″ | impossibility |
35 | ″ | ″ | knowledge protocol |
36 | ″ | ″ | language |
37 | ″ | ″ | model |
38 | ″ | ″ | parameters |
39 | ″ | ″ | properties |
40 | ″ | ″ | protocol |
41 | ″ | ″ | rounds |
42 | ″ | ″ | security parameters |
43 | ″ | ″ | such protocols |
44 | ″ | ″ | technique |
45 | ″ | ″ | verifier |
46 | ″ | ″ | zero-knowledge |
47 | ″ | ″ | zero-knowledge protocols |
48 | ″ | schema:name | Public-Coin Concurrent Zero-Knowledge in the Global Hash Model |
49 | ″ | schema:pagination | 80-99 |
50 | ″ | schema:productId | N89da85d2af854a07a93224dfc1e2e0f7 |
51 | ″ | ″ | Nbb6ac88fa44e433bac3ed9dc033c2ce1 |
52 | ″ | schema:publisher | Ndac5094d6689436999b161f5cdbbb744 |
53 | ″ | schema:sameAs | https://app.dimensions.ai/details/publication/pub.1018051374 |
54 | ″ | ″ | https://doi.org/10.1007/978-3-642-36594-2_5 |
55 | ″ | schema:sdDatePublished | 2022-06-01T22:36 |
56 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |
57 | ″ | schema:sdPublisher | Nfbd34edd96b24a7e96c762f84f0cdecb |
58 | ″ | schema:url | https://doi.org/10.1007/978-3-642-36594-2_5 |
59 | ″ | sgo:license | sg:explorer/license/ |
60 | ″ | sgo:sdDataset | chapters |
61 | ″ | rdf:type | schema:Chapter |
62 | N0624733b1578405794a0ccbde44bd0f5 | rdf:first | sg:person.014073524511.68 |
63 | ″ | rdf:rest | rdf:nil |
64 | N2a4742c9f9fd46a5a25459bf5449f367 | schema:isbn | 978-3-642-36593-5 |
65 | ″ | ″ | 978-3-642-36594-2 |
66 | ″ | schema:name | Theory of Cryptography |
67 | ″ | rdf:type | schema:Book |
68 | N3adeed706bd34ef19aa3671fbed3b425 | rdf:first | sg:person.012320111457.74 |
69 | ″ | rdf:rest | N3f2f52df8d4642a7b3bbe4291eeabe50 |
70 | N3f2f52df8d4642a7b3bbe4291eeabe50 | rdf:first | sg:person.07447665001.15 |
71 | ″ | rdf:rest | N0624733b1578405794a0ccbde44bd0f5 |
72 | N89da85d2af854a07a93224dfc1e2e0f7 | schema:name | doi |
73 | ″ | schema:value | 10.1007/978-3-642-36594-2_5 |
74 | ″ | rdf:type | schema:PropertyValue |
75 | N984c314df36e4eeb980c663bb7b9ac70 | rdf:first | N9ec4438863e24fdfa0a7fde38194261d |
76 | ″ | rdf:rest | rdf:nil |
77 | N9ec4438863e24fdfa0a7fde38194261d | schema:familyName | Sahai |
78 | ″ | schema:givenName | Amit |
79 | ″ | rdf:type | schema:Person |
80 | Nbb6ac88fa44e433bac3ed9dc033c2ce1 | schema:name | dimensions_id |
81 | ″ | schema:value | pub.1018051374 |
82 | ″ | rdf:type | schema:PropertyValue |
83 | Ndac5094d6689436999b161f5cdbbb744 | schema:name | Springer Nature |
84 | ″ | rdf:type | schema:Organisation |
85 | Nfbd34edd96b24a7e96c762f84f0cdecb | schema:name | Springer Nature - SN SciGraph project |
86 | ″ | rdf:type | schema:Organization |
87 | anzsrc-for:20 | schema:inDefinedTermSet | anzsrc-for: |
88 | ″ | schema:name | Language, Communication and Culture |
89 | ″ | rdf:type | schema:DefinedTerm |
90 | anzsrc-for:2004 | schema:inDefinedTermSet | anzsrc-for: |
91 | ″ | schema:name | Linguistics |
92 | ″ | rdf:type | schema:DefinedTerm |
93 | sg:person.012320111457.74 | schema:affiliation | grid-institutes:grid.12136.37 |
94 | ″ | schema:familyName | Canetti |
95 | ″ | schema:givenName | Ran |
96 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012320111457.74 |
97 | ″ | rdf:type | schema:Person |
98 | sg:person.014073524511.68 | schema:affiliation | grid-institutes:grid.189504.1 |
99 | ″ | schema:familyName | Paneth |
100 | ″ | schema:givenName | Omer |
101 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014073524511.68 |
102 | ″ | rdf:type | schema:Person |
103 | sg:person.07447665001.15 | schema:affiliation | grid-institutes:grid.116068.8 |
104 | ″ | schema:familyName | Lin |
105 | ″ | schema:givenName | Huijia |
106 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07447665001.15 |
107 | ″ | rdf:type | schema:Person |
108 | grid-institutes:grid.116068.8 | schema:alternateName | MIT, USA |
109 | ″ | schema:name | Boston University, USA |
110 | ″ | ″ | MIT, USA |
111 | ″ | rdf:type | schema:Organization |
112 | grid-institutes:grid.12136.37 | schema:alternateName | Tel Aviv University, Israel |
113 | ″ | schema:name | Boston University, USA |
114 | ″ | ″ | Tel Aviv University, Israel |
115 | ″ | rdf:type | schema:Organization |
116 | grid-institutes:grid.189504.1 | schema:alternateName | Boston University, USA |
117 | ″ | schema:name | Boston University, USA |
118 | ″ | rdf:type | schema:Organization |