165 search results - page 1 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
ICS
2010
Tsinghua U.
14 years 1 months ago
2010
Tsinghua U.
ICS
2010
Tsinghua U.
14 years 1 months ago
2010
Tsinghua U.
: Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are s...
CRYPTO
2003
Springer
13 years 9 months ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...