5484 search results - page 328 / 1097 » Almost-Everywhere Secure Computation |
177
click to vote
SENSYS
2003
ACM
16 years 7 hour ago
2003
ACM
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
173
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...
174
click to vote
ICALP
2004
Springer
16 years 4 days ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
139
click to vote
IMA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
173
Voted
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies t...