23 search results - page 4 / 5 » Universally composable contributory group key exchange |
CRYPTO
1995
Springer
14 years 5 days ago
1995
Springer
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
CRYPTO
2010
Springer
13 years 9 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...
CRYPTO
2006
Springer
14 years 10 days ago
2006
Springer
This paper considers the problem of password-authenticated key exchange (PAKE) in a client-server setting, where the server authenticates using a stored password file, and it is de...
CSFW
2012
IEEE
11 years 11 months ago
2012
IEEE
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...