A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
A Note on the Round-Complexity of Concurrent Zero-Knowledge
[chapter]

2000
*
Lecture Notes in Computer Science
*

We present

doi:10.1007/3-540-44598-6_28
fatcat:ogsxknyttvezhhbbeeszckyfse
*a*lower bound*on**the*number*of**rounds*required by*Concurrent**Zero*-*Knowledge*proofs for languages in N P. ...*of*its main parameter (which yields*a*9-*round*protocol),*the*protocol is not likely to be*Concurrent**Zero*-*Knowledge*. 1*The*lower bound*of*[18] (as well as our own work) applies only in*a*cleaner model ... I would also like to thank Yoav Rodeh for significant discussions, and Yehuda Lindell (as well as*the*anonymous referees) for commenting*on**the*earlier version*of*this paper. ...##
###
Responsive Round Complexity and Concurrent Zero-Knowledge
[chapter]

2001
*
Lecture Notes in Computer Science
*

We demonstrate

doi:10.1007/3-540-45682-1_25
fatcat:xrljgk4zr5buzbpjf6cxlbq63a
*the*significance*of*responsive*round**complexity*by presenting*a*new protocol for*concurrent**zero*-*knowledge*. ... While*the**round**complexity**of**the*new protocol is similar to what is known from previous works, its responsive*round**complexity*is*a*significant improvement: all known*concurrent**zero*-*knowledge*protocols ...*Round**Complexity**The*number*of**rounds*in*a*run*of**a*protocol can be*a*major time-consuming component. Therefore,*round**complexity*is*one**of**the*important*complexity*measures*of*protocols. ...##
###
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
[chapter]

2014
*
Lecture Notes in Computer Science
*

*The*traditional setting for

*concurrent*

*zero*

*knowledge*considers

*a*server that proves

*a*statement in

*zero*-

*knowledge*to multiple clients in multiple

*concurrent*sessions, where

*the*server's actions in

*a*session ... Specifically, they show

*a*protocol that has only slightly super-constant number

*of*

*rounds*; however

*the*communication

*complexity*in each session

*of*their protocol depends

*on*

*the*number

*of*other sessions ... For example, stand-alone

*zero*-

*knowledge*protocols can be implemented in

*a*constant number

*of*

*rounds*based

*on*any

*one*way function, while constant-

*round*

*concurrent*

*zero*-

*knowledge*protocols are not known ...

##
###
Bounded-concurrent secure multi-party computation with a dishonest majority

2004
*
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04
*

*The*core

*of*our protocol is

*a*novel construction

*of*(

*concurrently*) simulation-sound

*zero*-

*knowledge*protocols, which might be

*of*independent interest. ... Even though our main focus is

*on*feasibility

*of*

*concurrent*multi-party computation we actually obtain

*a*protocol using only

*a*constant number

*of*communication

*rounds*. ... Although our main focus is

*on*feasibility

*of*multi-party computation with

*a*dishonest majority that composes

*concurrently*, we actually achieve

*the*best

*one*could hope for in terms

*of*

*round*

*complexity*. ...

##
###
Resettable Zero-Knowledge in the Weak Public-Key Model
[chapter]

2003
*
Lecture Notes in Computer Science
*

In this WPK model

doi:10.1007/3-540-39200-9_8
fatcat:copbmriufjdixedalruvg23f74
*a*3-*round*(optimal) black-box resettable*zero*-*knowledge*argument with*concurrent*soundness for N P is presented assuming*the*security*of*RSA with large exponents against subexponential-time ... Our result improves Micali and Reyzin's result*of*resettable*zero*-*knowledge*argument with*concurrent*soundness for N P in*the*UPK model. ... This research is supported by*a*research grant*of*City University*of*Hong Kong (No. 7001232) and*a*research grant*of*Natural Science Funds*of*China (No. 60003007). ...##
###
Resettably-Sound Resettable Zero Knowledge in Constant Rounds
[chapter]

2017
*
Lecture Notes in Computer Science
*

., essentially by playing

doi:10.1007/978-3-319-70503-3_4
fatcat:d5egbjwknbel3omqxm3miypcie
*a*modification*of**the*construction*of*Chung et al. against*the*construction*of*Chung et al.) we obtain*the*first constant-*round*resettably-sound*concurrent**zero*-*knowledge*argument ... In this work we show*a*constant-*round*resettably-sound resettable*zero*-*knowledge*argument system, therefore improving*the**round**complexity*from polynomial to constant. ...*The*definition*of**concurrent**zero**knowledge*can be seen as*a*relaxation*of**the**one**of*resettable*zero**knowledge*. ...##
###
Page 3141 of Mathematical Reviews Vol. , Issue 2003d
[page]

2003
*
Mathematical Reviews
*

Our techniques transform

*a*non-*concurrent**zero*-*knowledge*protocol into*a**concurrent**zero*-*knowledge**one*. ... “In this paper we present*the*first constructions*of*proof systems that are*concurrent**zero*-*knowledge*without relying*on*unproven*complexity*assumptions. ...##
###
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
[chapter]

2004
*
Lecture Notes in Computer Science
*

[STOC 2000], constant-

doi:10.1007/978-3-540-28628-8_15
fatcat:ezzdxalomrcybcesm2dm75ehaq
*round*black-box*concurrent*and resettable*zero**knowledge*is possible as opposed to*the*standard model for*zero**knowledge*. ... Our result solves*the*main open problem*on*resettable*zero**knowledge*in*the*BPK model and improves*the*previous works*of*Micali and Reyzin [EuroCrypt 2001] and Zhao et al. ... Acknowledgments We would like to thank*the*anonymous referee for his/her very useful remarks*on*our submission. ...##
###
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
[chapter]

2004
*
Lecture Notes in Computer Science
*

In

doi:10.1007/978-3-540-30539-2_37
fatcat:jwtt2gddojdw3jycn62gozlp5i
*the*cPK model, we give*a*three-*round**concurrently*-sound resettable*zero*-*knowledge*argument*of*membership for NP. ... As pointed out by Micali and Reyzin [Crypto 2001],*the*notion*of*soundness in this model is more subtle and*complex*than in*the*classical model. ... Recently,*the*existence*of**a*constant-*round**concurrently*-sound resettable*zero*-*knowledge*argument in*the*BPK model has been proved by [15] where*a*4-*round**concurrently*-sound resettable*zero*-*knowledge*...##
###
Simultaneous Resettability from One-Way Functions

2013
*
2013 IEEE 54th Annual Symposium on Foundations of Computer Science
*

context

doi:10.1109/focs.2013.15
dblp:conf/focs/ChungOPV13
fatcat:47hibd5hzncntacjrxkrgz2wly
*of**zero*-*knowledge*, both*the*soundness and*the**zero*-*knowledge*conditions remain robust to resetting attacks. ... (polynomial-*round*) simultaneously resettable*zero*-*knowledge*argument system. ... Pass is supported in part by*a*Alfred P. ...##
###
The Knowledge Tightness of Parallel Zero-Knowledge
[chapter]

2012
*
Lecture Notes in Computer Science
*

As

doi:10.1007/978-3-642-28914-9_29
fatcat:p7f2eq2dcrc23dq5pidmjy2mty
*a*demonstration*of*our techniques, we give*a*self-contained proof*of**the*o(log n/ log log n) lower bound for*the**round**complexity**of*black-box*concurrent**zero*-*knowledge*protocols, first shown by Canetti ... As*a*function*of**the*number*of*parallel sessions, k, and*the**round**complexity**of**the*protocol, m,*the*bound is roughly k 1/m . ... Acknowledgments We thank to Iftach Haitner and Johan Håstad for useful discussion in*the*early stage*of*this research. ...##
###
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model
[chapter]

2013
*
Lecture Notes in Computer Science
*

We

doi:10.1007/978-3-642-42033-7_2
fatcat:touymnnphvbpvdbaxmwmqf5mxu
*note*that this constitutes*the*strongest result known*on*constantround*concurrent**zero**knowledge*in*the*plain model (under well accepted relaxations) and subsumes Barak's constant-*round*bounded*concurrent*... They showed that even though*the*model consists*of**a*relatively mild relaxation*of**the*standard model, it allows for*round*-efficient*concurrent**zero**knowledge*. ... Indeed, while we know how to achieve*zero*-*knowledge*in 4*rounds*,*a*sequence*of*results [21, 33, 6] increased*the*lower bound*on**the**round**complexity**of**concurrent**zero*-*knowledge*with black-box simulation ...##
###
Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge
[chapter]

2011
*
Lecture Notes in Computer Science
*

In this work, we study

doi:10.1007/978-3-642-25385-0_21
fatcat:aqrlkzfzbbcxvk6s74vypa5ft4
*the*question*of**round**complexity**of*simultaneous resettable*zero*-*knowledge*in*the*BPK model. ... We present*a*constant*round*protocol in such*a*setting based*on*standard cryptographic assumptions. Our techniques are significantly different from*the**ones*used ...*Note*that every resettable*zero*-*knowledge*protocol is also*concurrent**zero*-*knowledge*[CGGM00] . ...##
###
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
[chapter]

2005
*
Lecture Notes in Computer Science
*

Moreover,

doi:10.1007/11535218_9
fatcat:j5i4fxbv6bbtdmed7o73fw37te
*the*existence*of**a*constant-*round*non-black-box*concurrent**zero*-*knowledge*argument system is currently an open question (see [5] for*the*main results*on*non-black-box*zero**knowledge*). ... In light*of**the*previous state-*of*-*the*-art, our result completes*the*analysis*of**the**round**complexity**of*black-box*zero**knowledge*in*the*BPK model with respect to*the*notions*of*soundness and black-box ... Our result closes*the*analysis*on**the**round**complexity**of**the*BPK model with respect to notions*of*soundness and*zero**knowledge*, see Fig. 1 . ...##
###
Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
[chapter]

2009
*
Lecture Notes in Computer Science
*

We also show time-efficient instantiations

doi:10.1007/978-3-642-03351-3_10
fatcat:wsviypogyjaefofgbotmswpqhm
*of*our protocol, in which*the*transformation from*a*3-*round*honest-verifier*zero*-*knowledge*argument*of**knowledge*to*a*4-*round**concurrently*non-malleable*zero*-*knowledge*... Our main result is*a*constant-*round**concurrent*non-malleable*zero*-*knowledge*argument*of**knowledge*for any polynomial-time relation (associated to*a*language in N P), under*the*(minimal) assumption*of**the*...*The*protocol (P , V ) also enjoys*the*extraction property (and therefore*the**concurrent*non-malleability property). ...
« Previous

*Showing results 1 — 15 out of 36,266 results*