4217 search results - page 2 / 844 » Computational indistinguishability logic |
ASIAN
2006
Springer
15 years 1 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
94
Voted
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
ECCC
1998
14 years 9 months ago
1998
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
