Efficient Concurrent Zero-Knowledge in the Auxiliary String Model

DMCA

Efficient Concurrent Zero-Knowledge in the Auxiliary String Model (2000)

Cached

Download Links

[www.mathmagic.cn]
[www.daimi.au.dk]
[www.iacr.org]

Other Repositories/Bibliography

DBLP

by Ivan Damgård

Citations:

122 - 2 self

BibTeX

@MISC{Damgård00efficientconcurrent,
    author = {Ivan Damgård},
    title = {Efficient Concurrent Zero-Knowledge in the Auxiliary String Model},
    year = {2000}
}

OpenURL

Abstract

We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a prescribed distribution is available to the players. We also show that a wide range of known efficient proofs of knowledge using specialized assumptions can be modified to work in this model with no essential loss of efficiency. We argue that the assumptions of the model will be satisfied in many practical scenarios where public key cryptography is used, in particular our construction works given any secure public key infrastructure. Finally, we point out that in a model with preprocessing (and no auxiliary string) proposed earlier, concurrent zero-knowledge for NP can be based on any one-way function.

Keyphrases

efficient concurrent zero-knowledge auxiliary string model secure public key infrastructure efficient proof public key cryptography prescribed distribution np problem short auxiliary string specialized assumption 3-round concurrent zero-knowledge argument wide range one-way function exists many practical scenario essential loss concurrent zero-knowledge one-way function auxiliary string

DMCA