152 search results - page 3 / 31 » Constructive Proofs of Concentration Bounds |
CSFW
2012
IEEE
11 years 10 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L L which has the same...
SCN
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely...
ECCC
2002
13 years 7 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...