2816 search results - page 421 / 564 » Submodular function minimization |
112
click to vote
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
ESORICS
2007
Springer
15 years 4 months ago
2007
Springer
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...