Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...