# Computational indistinguishability

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- CRYPTO
- 2014

We define a notion of semantic security of multilinear (a.k.a. graded) encoding schemes, which stipulates security of class ofâ€¦Â (More)

Is this relevant?

2010

2010

- ACM Conference on Computer and Communicationsâ€¦
- 2010

Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational modelsâ€¦Â (More)

Is this relevant?

2010

2010

- IEEE 24th Computer Security Foundations Symposium
- 2010

We defined a new notion of computational indistinguishability: termination-insensitive computational indistinguishability (ticâ€¦Â (More)

Is this relevant?

2010

2010

- TCC
- 2010

It is well known that two random variables X and Y with the same range can be viewed as being equal (in a well-defined senseâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- ACM Conference on Computer and Communicationsâ€¦
- 2008

Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, weâ€¦Â (More)

Is this relevant?

2005

2005

- 2005

Computational Definitions As a first attempt, we can say that a scheme (E,D) is T -secure if there is no T sized circuit thatâ€¦Â (More)

Is this relevant?

2005

2005

- Journal of Cryptology
- 2005

We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem toâ€¦Â (More)

Is this relevant?

1996

1996

- Theor. Comput. Sci.
- 1996

We present a simple proof to the existence of a probability ensemble with tiny support which cannot be distinguished from theâ€¦Â (More)

Is this relevant?

1990

1990

- Inf. Process. Lett.
- 1990

-We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pair ofâ€¦Â (More)

Is this relevant?

1990

1990

- 1990

| We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pairâ€¦Â (More)

Is this relevant?