58 search results - page 6 / 12 » How to Round Any CSP |
SODA
2008
ACM
14 years 9 days ago
2008
ACM
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
ACISP
2008
Springer
14 years 5 months ago
2008
Springer
The elastic block cipher design employs the round function of a given, b-bit block cipher in a black box fashion, embedding it in a network structure to construct a family of ciphe...
ASIACRYPT
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
MP
2007
13 years 10 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...