5891 search results - page 230 / 1179 » On the Computational Security of a Distributed Key Distribut... |
159
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
176
click to vote
AISS
2010
15 years 4 months ago
2010
As the World Wide Web grows rapidly on a daily basis, the number of new computer attacks is also growing at a matching rate. It is increasing by development of information and com...
130
click to vote
IPPS
2007
IEEE
16 years 28 days ago
2007
IEEE
1 Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as Grids and PlanetLab. This paper proposes a scalable Grid monitoring architect...
139
click to vote
ESORICS
2009
Springer
16 years 7 months ago
2009
Springer
We present a traffic analysis of the ADU anonymity scheme presented at ESORICS 2008, and the related RADU scheme. We show that optimal attacks are able to de-anonymize messages mor...
166
click to vote
TCC
2007
Springer
16 years 22 days ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...