CRYPTO
2001
Springer
14 years 1 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
14 years 1 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
14 years 1 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
14 years 1 months ago
2001
Springer
CRYPTO
2001
Springer
14 years 1 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 ...
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
in SIAM J. of Computing, Vol. 32, No. 3, pp. 586-615, 2003. An extended abstract of this paper appears in the Proceedings of Crypto 2001, volume 2139 of Lecture Notes in Computer S...
CRYPTO
2001
Springer
14 years 1 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
2001
Springer
14 years 1 months ago
2001
Springer
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
We initiate a study of on-line ciphers. These are ciphers that can take input plaintexts of large and varying lengths and will output the ith block of the ciphertext after having p...
CHES
2001
Springer
14 years 1 months ago
2001
Springer
This paper describes an algorithm and architecture based on an extension of a scalable radix-2 architecture proposed in a previous work. The algorithm is proven to be correct and t...