Sciweavers

2967 search results - page 231 / 594
» Cryptology
Sort
View
161
Voted
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Minimal Complete Primitives for Secure Multi-party Computation
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Raf...
CRYPTO
2001
Springer
155views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
RSA-OAEP Is Secure under the RSA Assumption
Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OA...
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointch...
CRYPTO
2001
Springer
136views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Session-Key Generation Using Human Passwords Only
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
Oded Goldreich, Yehuda Lindell
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Forward-Secure Signatures with Optimal Signing and Verifying
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
Gene Itkis, Leonid Reyzin