38 search results - page 4 / 8 » Universally Composable Protocols with Relaxed Set-Up Assumpt... |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
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...
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...
CRYPTO
2006
Springer
14 years 7 days ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
TCC
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated th...
MOBICOM
1997
ACM
14 years 22 days ago
1997
ACM
This paperintroduces the notion of “universalinteraction,” allowing a device to adapt its functionality to exploit services it discovers as it moves into a new environment. Us...