Alternative Variants of Zero-Knowledge Proofs by Rafael Pass PDF

By Rafael Pass

ISBN-10: 9172839333

ISBN-13: 9789172839335

Show description

Read or Download Alternative Variants of Zero-Knowledge Proofs PDF

Similar nonfiction_5 books

Read e-book online Prospects for Citizenship PDF

This article deals a perspicuous, empirically-informed theoretical evaluate of the customers for citizenship within the mild of its present political context. The authorial workforce contains best names from around the box, delivering a leading edge research of the issues and pressures of citizenship within the twenty-first century.

Download e-book for iPad: Next Generation Intelligent Environments: Ambient Adaptive by C. Goumopoulos (auth.), Wolfgang Minker, Tobias Heinroth

Clever environments signify an rising subject in study. subsequent new release clever Environments: Ambient Adaptive structures will hide all key subject matters within the box of clever ambient adaptive structures. It specializes in the implications labored out in the framework of the ATRACO (Adaptive and depended on Ambient eCOlogies) venture.

Additional info for Alternative Variants of Zero-Knowledge Proofs

Example text

Concerning quasipolynomial time simulatable proofs, we note that since the running time of the simulator is longer than the allowed running time of the verifier, the simulator can not be run by the verifier. Quasi-polynomial time simulatable proofs therefore do not guarantee deniability. 3 Our Results Our main contributions can be summarized as follows: • We formally define the notion of T (n)-simulatable proofs and show that it encompasses the notion of WI. Our characterization of WI in terms of a simulation-based definition sheds new light on the notion of WI, and might lead to alternative constructions of WI proofs.

24 CHAPTER 2. PRELIMINARIES Definition 25 (Witness Indistinguishability with Shared Objects) Let (P, V ) be an interactive proof in a model with shared objects for the language L ∈ N P, and RL be a fixed witness relation for L. We say that (P, V ) is witness indistinguishable for RL if for every probabilistic polynomial-time algorithm V ∗ and every two sequences W 1 = {wx1 }x∈L and W 2 = {wx2 }x∈L, such that wx1 , wx2 ∈ RL (x), the following two ensembles are computationally indistinguishable (when the distinguishing gap is a function in |x|): • { P R (wx1 ), V ∗R (z) (x)}x∈L,z∈{0,1}∗ • { P R (wx2 ), V ∗R (z) (x)}x∈L,z∈{0,1}∗ where R is a random variable uniformly distributed in either 1poly(n) → {0, 1} or {0, 1}poly(n) → {0, 1}poly(n).

2. It is interesting to note that the notions of straight-line strong T (n)-simulatability is strictly stronger than the notion of straight-line concurrent T (n)-simulatability. 5 constitutes an evidence of this fact. See remark 11. 7 We formalize this feature through a composition theorem, which loosely speaking states that for a large class of natural protocols the security of these protocols is not affected when concurrently executed with multiple straight-line concurrent T (n)-simulatable arguments.

Download PDF sample

Alternative Variants of Zero-Knowledge Proofs by Rafael Pass


by Robert
4.0

Rated 4.02 of 5 – based on 37 votes