Precise bounded-concurrent zero-knowledge proofs for NP

Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-know...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Ding, Ning [verfasserIn] Gu, DaWu [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2010

Schlagwörter:	interactive proofs and arguments zero-knowledge precise zero-knowledge proofs of knowledge bounded concurrency

Übergeordnetes Werk:	Enthalten in: Science in China - Heidelberg : Springer, 2001, 53(2010), 9 vom: Sept., Seite 1738-1752
Übergeordnetes Werk:	volume:53 ; year:2010 ; number:9 ; month:09 ; pages:1738-1752

Links:	Volltext

DOI / URN:	10.1007/s11432-010-4056-z

Katalog-ID:	SPR019304129

Internformat


LEADER	01000caa a22002652 4500
001	SPR019304129
003	DE-627
005	20220111065523.0
007	cr uuu---uuuuu
008	201006s2010 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1007/s11432-010-4056-z \|2 doi
035			\|a (DE-627)SPR019304129
035			\|a (SPR)s11432-010-4056-z-e
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 070 \|a 004 \|q ASE
084			\|a 54.00 \|2 bkl
100	1		\|a Ding, Ning \|e verfasserin \|4 aut
245	1	0	\|a Precise bounded-concurrent zero-knowledge proofs for NP
264		1	\|c 2010
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers.
650		4	\|a interactive proofs and arguments \|7 (dpeaa)DE-He213
650		4	\|a zero-knowledge \|7 (dpeaa)DE-He213
650		4	\|a precise zero-knowledge \|7 (dpeaa)DE-He213
650		4	\|a proofs of knowledge \|7 (dpeaa)DE-He213
650		4	\|a bounded concurrency \|7 (dpeaa)DE-He213
700	1		\|a Gu, DaWu \|e verfasserin \|4 aut
773	0	8	\|i Enthalten in \|t Science in China \|d Heidelberg : Springer, 2001 \|g 53(2010), 9 vom: Sept., Seite 1738-1752 \|w (DE-627)385614764 \|w (DE-600)2142898-0 \|x 1862-2836 \|7 nnns
773	1	8	\|g volume:53 \|g year:2010 \|g number:9 \|g month:09 \|g pages:1738-1752
856	4	0	\|u https://dx.doi.org/10.1007/s11432-010-4056-z \|z lizenzpflichtig \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_SPRINGER
912			\|a SSG-OPC-BBI
912			\|a SSG-OPC-ASE
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_32
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_74
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_101
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_120
912			\|a GBV_ILN_138
912			\|a GBV_ILN_152
912			\|a GBV_ILN_161
912			\|a GBV_ILN_171
912			\|a GBV_ILN_187
912			\|a GBV_ILN_224
912			\|a GBV_ILN_250
912			\|a GBV_ILN_281
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_702
936	b	k	\|a 54.00 \|q ASE
951			\|a AR
952			\|d 53 \|j 2010 \|e 9 \|c 09 \|h 1738-1752

Indexfelder

author_variant	n d nd d g dg
matchkey_str	article:18622836:2010----::rcsbuddocreteonweg
hierarchy_sort_str	2010
bklnumber	54.00
publishDate	2010
allfields	10.1007/s11432-010-4056-z doi (DE-627)SPR019304129 (SPR)s11432-010-4056-z-e DE-627 ger DE-627 rakwb eng 070 004 ASE 54.00 bkl Ding, Ning verfasserin aut Precise bounded-concurrent zero-knowledge proofs for NP 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers. interactive proofs and arguments (dpeaa)DE-He213 zero-knowledge (dpeaa)DE-He213 precise zero-knowledge (dpeaa)DE-He213 proofs of knowledge (dpeaa)DE-He213 bounded concurrency (dpeaa)DE-He213 Gu, DaWu verfasserin aut Enthalten in Science in China Heidelberg : Springer, 2001 53(2010), 9 vom: Sept., Seite 1738-1752 (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:53 year:2010 number:9 month:09 pages:1738-1752 https://dx.doi.org/10.1007/s11432-010-4056-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OPC-BBI SSG-OPC-ASE GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 54.00 ASE AR 53 2010 9 09 1738-1752
spelling	10.1007/s11432-010-4056-z doi (DE-627)SPR019304129 (SPR)s11432-010-4056-z-e DE-627 ger DE-627 rakwb eng 070 004 ASE 54.00 bkl Ding, Ning verfasserin aut Precise bounded-concurrent zero-knowledge proofs for NP 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers. interactive proofs and arguments (dpeaa)DE-He213 zero-knowledge (dpeaa)DE-He213 precise zero-knowledge (dpeaa)DE-He213 proofs of knowledge (dpeaa)DE-He213 bounded concurrency (dpeaa)DE-He213 Gu, DaWu verfasserin aut Enthalten in Science in China Heidelberg : Springer, 2001 53(2010), 9 vom: Sept., Seite 1738-1752 (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:53 year:2010 number:9 month:09 pages:1738-1752 https://dx.doi.org/10.1007/s11432-010-4056-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OPC-BBI SSG-OPC-ASE GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 54.00 ASE AR 53 2010 9 09 1738-1752
allfields_unstemmed	10.1007/s11432-010-4056-z doi (DE-627)SPR019304129 (SPR)s11432-010-4056-z-e DE-627 ger DE-627 rakwb eng 070 004 ASE 54.00 bkl Ding, Ning verfasserin aut Precise bounded-concurrent zero-knowledge proofs for NP 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers. interactive proofs and arguments (dpeaa)DE-He213 zero-knowledge (dpeaa)DE-He213 precise zero-knowledge (dpeaa)DE-He213 proofs of knowledge (dpeaa)DE-He213 bounded concurrency (dpeaa)DE-He213 Gu, DaWu verfasserin aut Enthalten in Science in China Heidelberg : Springer, 2001 53(2010), 9 vom: Sept., Seite 1738-1752 (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:53 year:2010 number:9 month:09 pages:1738-1752 https://dx.doi.org/10.1007/s11432-010-4056-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OPC-BBI SSG-OPC-ASE GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 54.00 ASE AR 53 2010 9 09 1738-1752
allfieldsGer	10.1007/s11432-010-4056-z doi (DE-627)SPR019304129 (SPR)s11432-010-4056-z-e DE-627 ger DE-627 rakwb eng 070 004 ASE 54.00 bkl Ding, Ning verfasserin aut Precise bounded-concurrent zero-knowledge proofs for NP 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers. interactive proofs and arguments (dpeaa)DE-He213 zero-knowledge (dpeaa)DE-He213 precise zero-knowledge (dpeaa)DE-He213 proofs of knowledge (dpeaa)DE-He213 bounded concurrency (dpeaa)DE-He213 Gu, DaWu verfasserin aut Enthalten in Science in China Heidelberg : Springer, 2001 53(2010), 9 vom: Sept., Seite 1738-1752 (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:53 year:2010 number:9 month:09 pages:1738-1752 https://dx.doi.org/10.1007/s11432-010-4056-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OPC-BBI SSG-OPC-ASE GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 54.00 ASE AR 53 2010 9 09 1738-1752
allfieldsSound	10.1007/s11432-010-4056-z doi (DE-627)SPR019304129 (SPR)s11432-010-4056-z-e DE-627 ger DE-627 rakwb eng 070 004 ASE 54.00 bkl Ding, Ning verfasserin aut Precise bounded-concurrent zero-knowledge proofs for NP 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers. interactive proofs and arguments (dpeaa)DE-He213 zero-knowledge (dpeaa)DE-He213 precise zero-knowledge (dpeaa)DE-He213 proofs of knowledge (dpeaa)DE-He213 bounded concurrency (dpeaa)DE-He213 Gu, DaWu verfasserin aut Enthalten in Science in China Heidelberg : Springer, 2001 53(2010), 9 vom: Sept., Seite 1738-1752 (DE-627)385614764 (DE-600)2142898-0 1862-2836 nnns volume:53 year:2010 number:9 month:09 pages:1738-1752 https://dx.doi.org/10.1007/s11432-010-4056-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OPC-BBI SSG-OPC-ASE GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 54.00 ASE AR 53 2010 9 09 1738-1752
language	English
source	Enthalten in Science in China 53(2010), 9 vom: Sept., Seite 1738-1752 volume:53 year:2010 number:9 month:09 pages:1738-1752
sourceStr	Enthalten in Science in China 53(2010), 9 vom: Sept., Seite 1738-1752 volume:53 year:2010 number:9 month:09 pages:1738-1752
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	interactive proofs and arguments zero-knowledge precise zero-knowledge proofs of knowledge bounded concurrency
dewey-raw	070
isfreeaccess_bool	false
container_title	Science in China
authorswithroles_txt_mv	Ding, Ning @@aut@@ Gu, DaWu @@aut@@
publishDateDaySort_date	2010-09-01T00:00:00Z
hierarchy_top_id	385614764
dewey-sort	270
id	SPR019304129
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR019304129</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220111065523.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2010 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11432-010-4056-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR019304129</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11432-010-4056-z-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="a">004</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ding, Ning</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Precise bounded-concurrent zero-knowledge proofs for NP</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">interactive proofs and arguments</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">zero-knowledge</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">precise zero-knowledge</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">proofs of knowledge</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bounded concurrency</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gu, DaWu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Science in China</subfield><subfield code="d">Heidelberg : Springer, 2001</subfield><subfield code="g">53(2010), 9 vom: Sept., Seite 1738-1752</subfield><subfield code="w">(DE-627)385614764</subfield><subfield code="w">(DE-600)2142898-0</subfield><subfield code="x">1862-2836</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:53</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:9</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:1738-1752</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11432-010-4056-z</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-ASE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">53</subfield><subfield code="j">2010</subfield><subfield code="e">9</subfield><subfield code="c">09</subfield><subfield code="h">1738-1752</subfield></datafield></record></collection>
author	Ding, Ning
spellingShingle	Ding, Ning ddc 070 bkl 54.00 misc interactive proofs and arguments misc zero-knowledge misc precise zero-knowledge misc proofs of knowledge misc bounded concurrency Precise bounded-concurrent zero-knowledge proofs for NP
authorStr	Ding, Ning
ppnlink_with_tag_str_mv	@@773@@(DE-627)385614764
format	electronic Article
dewey-ones	070 - News media, journalism & publishing 004 - Data processing & computer science
delete_txt_mv	keep
author_role	aut aut
collection	springer
remote_str	true
illustrated	Not Illustrated
issn	1862-2836
topic_title	070 004 ASE 54.00 bkl Precise bounded-concurrent zero-knowledge proofs for NP interactive proofs and arguments (dpeaa)DE-He213 zero-knowledge (dpeaa)DE-He213 precise zero-knowledge (dpeaa)DE-He213 proofs of knowledge (dpeaa)DE-He213 bounded concurrency (dpeaa)DE-He213
topic	ddc 070 bkl 54.00 misc interactive proofs and arguments misc zero-knowledge misc precise zero-knowledge misc proofs of knowledge misc bounded concurrency
topic_unstemmed	ddc 070 bkl 54.00 misc interactive proofs and arguments misc zero-knowledge misc precise zero-knowledge misc proofs of knowledge misc bounded concurrency
topic_browse	ddc 070 bkl 54.00 misc interactive proofs and arguments misc zero-knowledge misc precise zero-knowledge misc proofs of knowledge misc bounded concurrency
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Science in China
hierarchy_parent_id	385614764
dewey-tens	070 - News media, journalism & publishing 000 - Computer science, knowledge & systems
hierarchy_top_title	Science in China
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)385614764 (DE-600)2142898-0
title	Precise bounded-concurrent zero-knowledge proofs for NP
ctrlnum	(DE-627)SPR019304129 (SPR)s11432-010-4056-z-e
title_full	Precise bounded-concurrent zero-knowledge proofs for NP
author_sort	Ding, Ning
journal	Science in China
journalStr	Science in China
lang_code	eng
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works
recordtype	marc
publishDateSort	2010
contenttype_str_mv	txt
container_start_page	1738
author_browse	Ding, Ning Gu, DaWu
container_volume	53
class	070 004 ASE 54.00 bkl
format_se	Elektronische Aufsätze
author-letter	Ding, Ning
doi_str_mv	10.1007/s11432-010-4056-z
dewey-full	070 004
author2-role	verfasserin
title_sort	precise bounded-concurrent zero-knowledge proofs for np
title_auth	Precise bounded-concurrent zero-knowledge proofs for NP
abstract	Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers.
abstractGer	Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers.
abstract_unstemmed	Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER SSG-OPC-BBI SSG-OPC-ASE GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_152 GBV_ILN_161 GBV_ILN_171 GBV_ILN_187 GBV_ILN_224 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702
container_issue	9
title_short	Precise bounded-concurrent zero-knowledge proofs for NP
url	https://dx.doi.org/10.1007/s11432-010-4056-z
remote_bool	true
author2	Gu, DaWu
author2Str	Gu, DaWu
ppnlink	385614764
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1007/s11432-010-4056-z
up_date	2024-07-04T01:02:16.775Z
_version_	1803608325385879552
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR019304129</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220111065523.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2010 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11432-010-4056-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR019304129</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11432-010-4056-z-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="a">004</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ding, Ning</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Precise bounded-concurrent zero-knowledge proofs for NP</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Precise concurrent zero-knowledge is a new notion introduced by Pandey et al. in Eurocrypt’08. This notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in almost the same time. Pandey et al. also constructed some precise concurrent zero-knowledge argument systems. In this paper we construct a precise bounded-concurrent zero-knowledge proof for NP, which has the precision p(n, y) = poly(n) + O(ny). Bounded-concurrency means that an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. Our result holds even if adversarial verifiers adopt the dynamic scheduling strategy. We make no setup assumption. The advantage of proof systems over argument systems is that the soundness property of proof systems can resist computationally-unbounded adversarial provers, while that of argument systems can only resist polynomial-time adversarial provers.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">interactive proofs and arguments</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">zero-knowledge</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">precise zero-knowledge</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">proofs of knowledge</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">bounded concurrency</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gu, DaWu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Science in China</subfield><subfield code="d">Heidelberg : Springer, 2001</subfield><subfield code="g">53(2010), 9 vom: Sept., Seite 1738-1752</subfield><subfield code="w">(DE-627)385614764</subfield><subfield code="w">(DE-600)2142898-0</subfield><subfield code="x">1862-2836</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:53</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:9</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:1738-1752</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11432-010-4056-z</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-ASE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">53</subfield><subfield code="j">2010</subfield><subfield code="e">9</subfield><subfield code="c">09</subfield><subfield code="h">1738-1752</subfield></datafield></record></collection>
score	7.402667

Nicht das Richtige dabei?

Schreiben Sie uns!

Precise bounded-concurrent zero-knowledge proofs for NP

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?