Private Constrained PRFs (and More) from LWE by Brakerski, Zvika, Tsabary, Rotem, Vaikuntanathan, Vinod, Wee, Hoeteck

“…Boneh, Kim and Montgomery (EUROCRYPT 2017) recently presented a construction of private constrained PRF for point function constraints, and Canetti and Chen (EUROCRYPT 2017) presented a completely different construction for more general NC1 constraints. …”
Get full text

Reusable Fuzzy Extractors for Low-Entropy Distributions by Canetti, Ran, Fuller, Benjamin, Paneth, Omer, Reyzin, Leonid, Smith, Adam

“…Fuzzy extractors (Dodis et al., in Advances in cryptology—EUROCRYPT 2014, Springer, Berlin, 2014, pp 93–110) convert repeated noisy readings of a secret into the same uniformly distributed key. …”
Get full text

Topology-Hiding Computation on All Graphs by Akavia, Adi, LaVigne, Rio, Moran, Tal

“…Previous results have shown that topology-hiding computation protocols exist for graphs of constant degree and logarithmic diameter in the number of nodes (Moran–Orlov–Richelson, TCC’15; Hirt et al., Crypto’16) as well as for other graph families, such as cycles, trees, and low circumference graphs (Akavia–Moran, Eurocrypt’17), but the feasibility question for general graphs was open. …”
Get full text

Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation by Chen, Yilei, Hhan, Minki, Vaikuntanathan, Vinod, Wee, Hoeteck

“…Along the way, we simplify the “tensor switching lemmas” introduced in previous IO attacks.We show that a subclass of the candidate local-PRG proposed by Barak et al. [Eurocrypt 2018] can be broken using simple matrix algebra.We show that augmenting the CVW18 IO candidate with a matrix PRF provably immunizes the candidate against all known algebraic and statistical zeroizing attacks, as captured by a new and simple adversarial model.…”
Get full text