Sciweavers

165 search results - page 5 / 33
» Safely Composing Security Protocols
Sort
View
ASIACRYPT
2008
Springer
13 years 11 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 10 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
ISW
2004
Springer
14 years 3 months ago
Universally Composable Secure Mobile Agent Computation
We study the security challenges faced by the mobile agent paradigm, where code travels and performs computations on remote hosts in an autonomous manner. We define universally co...
Ke Xu, Stephen R. Tate
EUROCRYPT
2003
Springer
14 years 3 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
FOCS
2004
IEEE
14 years 1 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...