73 search results - page 14 / 15 » Security of erasable memories against adaptive adversaries |
CCS
2009
ACM
14 years 11 months ago
2009
ACM
In distributed systems users need the ability to share sensitive content with multiple other recipients based on their ability to satisfy arbitrary policies. One such system is el...
ACNS
2003
Springer
14 years 4 months ago
2003
Springer
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
INDOCRYPT
2003
Springer
14 years 4 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
COMCOM
2006
13 years 11 months ago
2006
This paper describes an INtrusion-tolerant routing protocol for wireless SEnsor NetworkS (INSENS). INSENS securely and efficiently constructs tree-structured routing for wireless ...
INDOCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
This paper applies generalized birthday attacks to the FSB compression function, and shows how to adapt the attacks so that they run in far less memory. In particular, this paper p...