380 search results - page 73 / 76 » Intrusion-Resilient Secret Sharing |
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
SP
2006
IEEE
15 years 3 months ago
2006
IEEE
Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors are possible (e.g., it is possible to change a bit “0” into a bi...
107
click to vote
MINENET
2006
ACM
15 years 3 months ago
2006
ACM
Progress in networking research depends crucially on applying novel analysis tools to real-world traces of network activity. This often conflicts with privacy and security requir...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
In a recent work, we have shown that it is not possible to dependably build any type of distributed f fault or intrusiontolerant system under the asynchronous model. This result f...
SASN
2006
ACM
15 years 3 months ago
2006
ACM
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...