1679 search results - page 146 / 336 » Security Properties and CSP |
180
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
170
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
162
click to vote
INFOCOM
2005
IEEE
16 years 19 hour ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
193
click to vote
WINE
2005
Springer
15 years 12 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
162
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...