Concurrent zero-knowledge

331Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

Concurrent executions of a zero-knowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zero-knowledge in toto; for example, in the case of zero-knowledge interactive proofs or arguments, the interactions remain proofs but may fail to remain zero-knowledge. This paper addresses the problem of achieving concurrent zero-knowledge. We introduce timing in order to obtain zero-knowledge in concurrent executions. We assume that the adversary is constrained in its control over processors' clocks by what we call an (α, β)-constraint for some α

Cite

CITATION STYLE

APA

Dwork, C., Naor, M., & Sahai, A. (1998). Concurrent zero-knowledge. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 409–418). ACM. https://doi.org/10.1145/276698.276853

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free