ASIACRYPT
2011
Springer
13 years 22 days ago
2011
Springer
We propose a lattice-based functional encryption scheme for inner product predicates whose security follows from the difficulty of the learning with errors (LWE) problem. This co...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
ECCC
2007
14 years 21 days ago
2007
Program checking, program self-correcting and program selftesting were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain con...
CORR
2010
Springer
14 years 25 days ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
COCO
2010
Springer
14 years 4 months ago
2010
Springer
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
PODC
2004
ACM
14 years 6 months ago
2004
ACM
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
SBMF
2009
Springer
14 years 7 months ago
2009
Springer
Types Hongwei Xi Boston University Work partly funded by NSF grants no. CCR-0229480 and no. CCF-0702665 and General Theoretical Account for Abstract Types – p.1/20