3190 search results - page 63 / 638 » cans 2011 |
87
Voted
IACR
2011
14 years 6 days ago
2011
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
124
click to vote
IACR
2011
14 years 6 days ago
2011
The Keccak hash function is one of the five finalists in NIST’s SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: Afte...
113
Voted
IACR
2011
14 years 6 days ago
2011
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
99
Voted
IACR
2011
14 years 6 days ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
147
Voted
AML
2011
14 years 7 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...