Sciweavers

ACISP
2009
Springer
13 years 9 months ago
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
Abstract. We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been...
Ahto Buldas, Aivo Jürgenson, Margus Niitsoo
FSTTCS
2001
Springer
13 years 9 months ago
The First-Order Isomorphism Theorem
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...
Manindra Agrawal
PROVSEC
2009
Springer
13 years 9 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo
MFCS
2009
Springer
13 years 11 months ago
Parameterized Complexity Classes under Logical Reductions
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
Anuj Dawar, Yuguo He