CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
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/...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. The shrinking generator is a well-known keystream generator composed of two linear feedback shift registers, LFSR1 and LFSR2, where LFSR1 is clock-controlled according to...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
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...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
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...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
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...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Building on a previous important work of Cachin, Cr´epeau, and Marcil [15], we present a provably secure and more efficient protocol for 2 1 -Oblivious Transfer with a storage-bou...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
An (n, m, k)-resilient function is a function f : Fn 2 → Fm 2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed ...