Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Computational_indistinguishability> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Computational_indistinguishability abstract "In computational complexity, if and are two distribution ensembles indexed by a security parameter n (which usually refers to the length of the input), then we say they are computationally indistinguishable if for any non-uniform probabilistic polynomial time algorithm A, the following quantity is a negligible function in n: denoted . In other words, every efficient algorithm A's behavior does not significantly change when given samples according to Dn or En in the limit as . Another interpretation of computational indistinguishability, is that polynomial-time algorithms actively trying to distinguish between the two ensembles cannot do so: That any such algorithm will only perform negligibly better than if one were to just guess.Implicit in the definition is the condition that the algorithm, , must decide based on a single sample from one of the distributions. One might conceive of a situation in which the algorithm trying to distinguish between two distributions, could access as many samples as it needed. Hence two ensembles that cannot be distinguished by polynomial-time algorithms looking at multiple samples are deemed indistinguishable by polynomial-time sampling. It turns out that if the polynomial-time algorithm can generate samples in polynomial time, or has access to random oracle that generates samples for it, then indistinguishable by polynomial-time sampling is equivalent to computational indistinguishability.".
- Computational_indistinguishability wikiPageExternalLink main-89-656.html.
- Computational_indistinguishability wikiPageID "1467815".
- Computational_indistinguishability wikiPageRevisionID "559381903".
- Computational_indistinguishability hasPhotoCollection Computational_indistinguishability.
- Computational_indistinguishability id "3457".
- Computational_indistinguishability title "computationally indistinguishable".
- Computational_indistinguishability subject Category:Algorithmic_information_theory.
- Computational_indistinguishability comment "In computational complexity, if and are two distribution ensembles indexed by a security parameter n (which usually refers to the length of the input), then we say they are computationally indistinguishable if for any non-uniform probabilistic polynomial time algorithm A, the following quantity is a negligible function in n: denoted . In other words, every efficient algorithm A's behavior does not significantly change when given samples according to Dn or En in the limit as .".
- Computational_indistinguishability label "Computational indistinguishability".
- Computational_indistinguishability sameAs m.053wlc.
- Computational_indistinguishability sameAs Q5157322.
- Computational_indistinguishability sameAs Q5157322.
- Computational_indistinguishability wasDerivedFrom Computational_indistinguishability?oldid=559381903.
- Computational_indistinguishability isPrimaryTopicOf Computational_indistinguishability.