290 search results - page 15 / 58 » Pseudorandom Bits for Polynomials |
ICMCS
2000
IEEE
14 years 2 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...
CRYPTO
2012
Springer
12 years 6 days 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...
STOC
1999
ACM
14 years 2 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...
CORR
2008
Springer
13 years 9 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 ...
JC
2007
13 years 9 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...