109
click to vote
IACR
2016
10 years 1 months ago
2016
A Universal Circuit (UC) is a circuit that can simulate any circuit of a maximum size, given its description as input. In this work, we look back at Valiant’s universal circuit c...
119
click to vote
IACR
2016
10 years 1 months ago
2016
The scatter-gather technique is a commonly-implemented approach to prevent cache-based timing attacks. In this paper we show that scatter-gather is not constant-time. We implement ...
110
click to vote
IACR
2016
10 years 1 months ago
2016
Abstract. We revisit the exact round complexity of secure computation in the multi-party and twoparty settings. For the special case of two-parties without a simultaneous message e...
112
click to vote
IACR
2016
10 years 1 months ago
2016
In this work, we present a new class of polynomial-time attacks on the original multilinear maps of Garg, Gentry, and Halevi (2013). Previous polynomial-time attacks on GGH13 were...
104
click to vote
IACR
2016
10 years 1 months ago
2016
We prove that a system of linear congruences of a particular form has at most a unique solution below a certain bound which can be computed efficiently. Using this result we devel...