793 search results - page 21 / 159 » Argumentation and standards of proof |
FOCS
1991
IEEE
14 years 2 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
EUROCRYPT
2010
Springer
14 years 2 months ago
2010
Springer
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in...
COCOON
2007
Springer
14 years 5 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
CRYPTO
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...