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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
