490 search results - page 62 / 98 » Impossibilities for roommate problems |
EUROCRYPT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We propose and realize a definition of security for passwordbased key exchange within the framework of universally composable (UC) security, thus providing security guar...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
In many real-world design problems, uncertainties are often present and practically impossible to avoid. Many existing works on Evolutionary Algorithm (EA) for handling uncertaint...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
IFM
2005
Springer
14 years 2 months ago
2005
Springer
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
WDAG
2005
Springer
14 years 2 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...