6164 search results - page 126 / 1233 » Teaching Computer Security |
148
click to vote
EUROCRYPT
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
183
click to vote
CRYPTO
2007
Springer
16 years 15 days 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...
175
click to vote
SAINT
2005
IEEE
15 years 12 months ago
2005
IEEE
Pervasive user mobility, wireless connectivity and the widespread diffusion of portable devices raise new challenges for ubiquitous service provisioning. An emerging architecture ...
178
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
191
click to vote
TIT
2008
15 years 6 months ago
2008
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...