13 search results - page 3 / 3 » On Black-Box Complexity of Universally Composable Security i... |
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
CRYPTO
2006
Springer
13 years 8 months 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, ...
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...