CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. In this paper, we study the security of 2Rschemes [17,18], which are the "minus variant" of two-round schemes. This variant consists in removing some of the n p...
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...