740 search results - page 93 / 148 » Lower bounds for Buchsbaum* complexes |
136
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
185
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
146
click to vote
WCC
2005
Springer
15 years 11 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
148
click to vote
CTRSA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper analyses periodic properties of counter assisted stream ciphers. In particular, we analyze constructions where the counter system also has the purpose of provi...
149
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...