Computational and Statistical Indistinguishabilities
نویسندگان
چکیده
We prove that a pair of polynomially samplable distributions are statistically indistinguishable if and only if no polynomial size circuits relative to NP sets (P NP nu-distinguishers) can tell them apart. As one application of this observation, we classify \zero-knowledge" notions that are used for interactive protocols.
منابع مشابه
Characterization and Implicit Identification of Sequential Indistinguishability
Effective diagnosis of integrated circuits relies critically on the quality of diagnostic test vectors. Diagnostic test pattern generation aims at producing test vectors that distinguish between all distinguishable pairs of faults, and proving the remaining pairs of faults to be indistinguishable. Proving indistinguishabilities, much like proving undetectabilities in the case of detection-orien...
متن کاملAn Algorithm to Compute the Transitive Closure, a Transitive Approximation and a Transitive Opening of a Proximity*
Equivalence relations are important in many branches of knowledge and especially in Classification theories and Cluster Analysis since they generate a partition on the universe of discourse and permit to classify their elements and make clusters. In many cases the relation we start with is not an equivalence relation but only a reflexive and symmetric one. A very important family of fuzzy relat...
متن کاملStability, Indistinguishability and Small Numbers
We describe a model for the fuzzy sets “near zero” (small numbers) and we show how to derive some T-indistinguishabilities in the real line, which are related to the model considered in probabilistic metric spaces. We revisite the concept of stability for functional equations arising in Fuzzy Logic by using the “near zero”’ model.
متن کاملOn a similarity ratio
The mathematical study of fuzzy equivalences or T indistinguishabilities has led to the publication of a good many papers see etc It is wor thy of note that within Theoretical Fuzzy Logic the mathematical analysis of T indistinguishabilities is a eld that is important in itself and of undeniable in terest for fuzzy logic applications such as control the ory for instance see etc Furthermore ther...
متن کاملOn the equivalence between distances and T-indistinguishabilities
iru dq| {> |> } # [/ wkhq g lv fdoohg d 80jhqhudol}hg glvwdqfh rq [ +vhh ^8`dqg ^6`,1 Erwk wkh svhxgr0 glvwdqfhv dqg wkh glvwdqfhv ghqhg rq oU. e| phdqv ri wkh rshudwlrq ./ wkh olqhdu rughu dqg h @ 3 duh h{dpsohv ri jhqhudol}hg glvwdqfhv1 Rq wkh rwkhu kdqg/ li 8 @ +V>>>v, lv d frppx0 wdwlyh rughuhg vhpljurxs zlwk d glvwlqjxlvkhg hoh0 phqw v/ d ixqfwlrq L = [ [ V lv fdoohg dq 80 lqglvwlqjxlvkdel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992