Most Go-playing programs use a combination of search and heuristics based on an influence function to determine whether territories are safe. However, to assure the correct evaluat...
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
We present an algorithm for computation of interpolatory splines of arbitrary order at triadic rational points. The algorithm is based on triadic subdivision of splines. Explicit ...
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...