290 search results - page 15 / 58 » Pseudorandom Bits for Polynomials |
148
click to vote
ICMCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we analyze the security of Least Significant Bit (LSB) embedding for hiding messages in high-color-depth digital images. We introduce a powerful steganalytic techni...
183
click to vote
CRYPTO
2012
Springer
13 years 8 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
158
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
122
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
141
click to vote
JC
2007
15 years 5 months ago
2007
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...