598 search results - page 23 / 120 » Predicting Lattice Reduction |
118
click to vote
ASIACRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
129
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper describes a new approximate maximum-likelihood (ML) MIMO detection approach by studying a Lagrangian dual relaxation (LDR) of ML. Unlike many existing relaxed ML method...
114
click to vote
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
An efficient scalable predictive coding method is proposed for the Wyner-Ziv problem, using nested lattice quantization followed by multi-layer Slepian-Wolf coders (SWC) with laye...
134
click to vote
TCC
2010
Springer
16 years 28 days ago
2010
Springer
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
269
click to vote
IACR
2011
14 years 3 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...