Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Computational indistinguishability

Known as: Indistinguishability by polynomial-time sampling, Computationally indistinguishable, Polynomial-time indistinguishable 
In computational complexity, if and are two distribution ensembles indexed by a security parameter n (which usually refers to the length of the input… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
One of the most salient features of smart city is to utilize big data to make our lives more convenient and more intelligent… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We propose the first construction for achieving adaptively secure functional encryption (FE) for poly-sized circuits (without… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We define a notion of semantic security of multilinear (a.k.a. graded) encoding schemes, which stipulates security of a class of… Expand
Is this relevant?
2014
2014
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability… Expand
  • figure 5
  • figure 4
Is this relevant?
2010
2010
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models… Expand
  • figure 1
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We propose a formal framework for the security analysis of on-demand source routing protocols for wireless ad hoc networks. Our… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Breaking and fixing the Needham-Schroeder public-key protocol using FDR.- Reconciling Two Views of Cryptography.- Theory and… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract We describe some general relations between cryptographic and abstracted security definitions, and we present a novel… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We show that the following two conditions are equivalent: (1) the existence of pseudorandom generators; (2) the existence of a… Expand
Is this relevant?