Abstract
The notion of concurrent zero knowledge has been introduced by Dwork et al. [STOC 1998] motivated by the growing use of asynchronous networks as the Internet.
In this paper we show a transformation that, for any language L admitting a Σ-protocol, produces a 4-round concurrent zero-knowledge argument system with concurrent soundness in the bare public-key (BPK, for short) model. The transformation only adds O(1) modular exponentiations, and uses standard number-theoretic assumptions and polynomial-time simulation.
A tool that we construct and use for our main result is that of efficient concurrent equivocal commitments. We give an efficient construction of this gadget in the BPK model that can be of independent interest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. In: proc. of (STOC 1985)., pp. 291–304 (1985)
Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: proc. of STOC, pp. 409–418. ACM, New York (1998)
Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-Box Concurrent Zero-Knowledge Requires ω(logn) Rounds. In: proc. of STOC, pp. 570–579. ACM Press, New York (2001)
Micciancio, D., Petrank, E.: Simulatable Commitments and Efficient Concurrent Zero-Knowledge. In: EUROCRYPT 2001, vol. 2045, pp. 140–159. Springer-Verlag, Heidelberg (2003)
Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent Zero-Knowledge with Logarithmic Round Complexity. In: proc. of FOCS 2002, pp. 366–375 (2002)
Di Crescenzo, G., Ostrovsky, R.: On Concurrent Zero-Knowledge with Pre-processing (Extended Abstract). In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, Springer, Heidelberg (1999)
Blum, M., De Santis, A., Micali, S., Persiano, G.: Non-Interactive Zero-Knowledge. SIAM J. on Computing 20, 1084–1118 (1991)
Damgård, I.B.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, Springer, Heidelberg (2000)
Persiano, G., Visconti, I.: Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 228–240. Springer, Heidelberg (2005)
Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable Zero-Knowledge. In: proc. of STOC, pp. 235–244. ACM Press, New York (2000)
Micali, S., Reyzin, L.: Soundness in the Public-Key Model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, Springer, Heidelberg (2001)
Di Crescenzo, G., Persiano, G., Visconti, I.: Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 237–253. Springer, Heidelberg (2004)
Pass, R.: Simulation in Quasi-Polynomial Time and Its Applications to Protocol Composition. In: proc. of Eurocrypt 2003. LNCS, vol. 2045, pp. 160–176 (2003)
Brassard, J., Chaum, D., Crepéau, C.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Science 37, 156–189 (1988)
Pass, R., Rosen, A.: New and Improved Constructions of Non-Malleable Cryptographic Protocols. In: proc. of STOC, pp. 533–542. ACM Press, New York (2005)
Di Crescenzo, G., Visconti, I.: Concurrent Zero Knowledge in the Public-Key Model. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 816–827. Springer, Heidelberg (2005)
Catalano, D., Visconti, I.: Hybrid Trapdoor Commitments and Their Applications. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 298–310. Springer, Heidelberg (2005)
Cramer, R.J.F., Schoenmakers, B., Damgård, I.B.: Proof of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)
De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On Monotone Formula Closure of SZK. In: Proc. of FOCS, pp. 454–465 (1994)
Schnorr, C.P.: Efficient Signature Generation for Smart Cards. Journal of Cryptology 4, 239–252 (1991)
Shamir, A., Feige, U.: Zero Knowledge Proofs of Knowledge in Two Rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 526–544. Springer, Heidelberg (1990)
Damgård, I.B.: On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 17–27. Springer, Heidelberg (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Visconti, I. (2006). Efficient Zero Knowledge on the Internet. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_3
Download citation
DOI: https://doi.org/10.1007/11787006_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35907-4
Online ISBN: 978-3-540-35908-1
eBook Packages: Computer ScienceComputer Science (R0)