152 search results - page 8 / 31 » Constructive Proofs of Concentration Bounds |
EUROCRYPT
2010
Springer
14 years 12 days ago
2010
Springer
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
CIE
2007
Springer
13 years 9 months ago
2007
Springer
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...
FSE
2001
Springer
14 years 3 days ago
2001
Springer
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various l...
STOC
1992
ACM
13 years 11 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...