7434 search results - page 1476 / 1487 » Still |
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
EMMCVPR
2011
Springer
12 years 7 months ago
2011
Springer
Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we pr...
HOTI
2011
IEEE
12 years 7 months ago
2011
IEEE
—There are many APIs for connecting and exchanging data between network peers. Each interface varies wildly based on metrics including performance, portability, and complexity. S...
IACR
2011
12 years 7 months ago
2011
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...