1562 search results - page 198 / 313 » Mathematics, Cryptology, Security |
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
FC
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a secure Generalized Vickrey Auction (GVA) scheme that does not require third-party servers, i.e., the scheme is executed only by an auctioneer and bidders. Com...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...