2168 search results - page 189 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
165
click to vote
IACR
2011
14 years 4 months ago
2011
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
149
click to vote
MOBISYS
2004
ACM
16 years 4 months ago
2004
ACM
The focus of surveillance missions is to acquire and verify information about enemy capabilities and positions of hostile targets. Such missions often involve a high element of ri...
164
click to vote
CASES
2010
ACM
15 years 2 months ago
2010
ACM
Although cryptographic algorithms are designed to resist at least thousands of years of cryptoanalysis, implementing them with either software or hardware usually leaks additional...
156
click to vote
ICSOC
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a method to implement integrated services of networked home electric appliances, which provide more convenient and comfortable living for home users. The conve...
124
click to vote
AIPS
2009
15 years 5 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...