38 search results - page 2 / 8 » cca 2009 |
FOCS
2009
IEEE
14 years 15 days ago
2009
IEEE
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...
CCA
2009
Springer
14 years 10 days ago
2009
Springer
We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x ≥ 0. The oracle machines can also check whethe...
CCA
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped λ-ca...
CCA
2009
Springer
14 years 10 days ago
2009
Springer
We extract a quantitative variant of uniqueness from the usual hypotheses of the implicit functions theorem. This leads not only to an a priori proof of continuity, but also to an ...
CCA
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...