12 search results - page 1 / 3 » Noisy Polynomial Interpolation and Noisy Chinese Remainderin... |
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
AAECC
2005
Springer
13 years 4 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Traditional channel quantization based methods for encryption key generation usually suffer from the quantization error which may decrease the key agreement ratio between authoriz...
COCO
2011
Springer
12 years 4 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
