In distributed pseudorandom functions (DPRFs), a PRF secret key SK is shared among N servers so that each server can locally compute partial evaluation of the on some input X. A combiner collects t evaluations then reconstruct F(SK, X) under initial key. So far, all non-interactive constructions in standard model are based lattice assumptions. One caveat they only known to be secure static corr...

Introduction Implicit surfaces are a powerful shape description for many applications in computer graphics. An implicit surface is defined by a function f :R → R as the set of points satisfying f(p) = 0. Implicit representation becomes more effective when f is a signed distance function, i.e., when |f | gives the distance to the closest point on the surface and f is negative inside the object a...

The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of n players with t = t(n) faults. They showed that the majority protocol, in which each player sends a random bit and the output is the majority of the players’ bits, can tolerate t(n) = O( √ n) even in the presence of adapti...