Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
AlgorithmAnalysis of algorithmsCiphertext indistinguishabilityCryptographically secure pseudorandom number generator

Broader (1)

Algorithmic information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Formal Abstractions for Attested Execution
Realistic secure processors, including those built for academic and commercial purposes, commonly realize an “attested execution… 
Highly Cited
2015
Highly Cited
2015
Capacity Limits of Pseudorandom Channels in Deception Problems
Supraliminal channels were introduced in 1998 as a means to achieve public key exchange in the presence of an active warden… 
2015
2015
Attribute-Based Signatures without Pairings by the Fiat-Shamir Transform ( Corrected Version ) ?
We propose an attribute-based signature scheme (ABS) with features of pairing-free, short signatures and security proof in the… 
2011
2011
Termination-Insensitive Computational Indistinguishability (and Applications to Computational Soundness)
We defined a new notion of computational indistinguishability: termination-insensitive computational indistinguishability (tic… 
2009
2009
The computational SLR: a logic for reasoning about computational indistinguishability
Computational indistinguishability is a notion in complexity-theoretic cryptography and is used to define many security criteria… 
2009
2009
Crisp sets as classes of discontinuous fuzzy sets
2008
2008
Exploring trusted platform module capabilities: a theoretical and experimental study
Trusted platform modules (TPMs) are hardware modules that are bound to a computer's motherboard, that are being included in many… 
2007
2007
Random Oracle Instantiation in Distributed Protocols Using Trusted Platform Modules
The random oracle model is an idealized theoretical model that has been successfully used for designing many cryptographic… 
2000
2000
On secret set schemes
1990
1990
A Note on Computational Indistinguishability 1
| We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pair… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)