Sciweavers

88 search results - page 17 / 18
» Long-Term Security and Universal Composability
Sort
View
CRYPTO
2005
Springer
96views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Privacy-Preserving Set Operations
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
Lea Kissner, Dawn Xiaodong Song
CSFW
2010
IEEE
13 years 11 months ago
A Framework for the Sound Specification of Cryptographic Tasks
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 8 months ago
Non-interactive and reusable non-malleable commitment schemes
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...
Ivan Damgård, Jens Groth
SCN
2010
Springer
142views Communications» more  SCN 2010»
13 years 6 months ago
How to Pair with a Human
We introduce a protocol, that we call Human Key Agreement, that allows pairs of humans to establish a key in a (seemingly hopeless) case where no public-key infrastructure is avail...
Stefan Dziembowski
CRYPTO
2006
Springer
155views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
A Method for Making Password-Based Key Exchange Resilient to Server Compromise
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...
Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan