165 search results - page 8 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
162
click to vote
IANDC
2007
15 years 4 months ago
2007
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
115
click to vote
DATAMINE
2007
15 years 4 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
152
click to vote
CRYPTO
2005
Springer
15 years 9 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
136
click to vote
CORR
2010
Springer
15 years 29 days ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
157
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...