3504 search results - page 410 / 701 » Secure protocol composition |
130
Voted
ASIACRYPT
2009
Springer
15 years 9 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...
107
click to vote
PKC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
129
Voted
SENSYS
2003
ACM
15 years 7 months 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...
124
Voted
NSPW
2004
ACM
15 years 8 months ago
2004
ACM
Digital rights management systems allow copyrighted content to be commercialized in digital format without the risk of revenue loss due to piracy. Making such systems secure is no...
137
Voted
EUROCRYPT
2008
Springer
15 years 4 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...