Published by the Department of Computer Science University of Chicago.
Discrete logarithm and Diffie-Hellman problems in identity black-box groups
by Gábor Ivanyos, Antoine Joux, and Miklos Santha
A Family of Dictatorship Tests with Perfect Completeness for 2–to–2 Label Cover
by Joshua Brakensiek and Venkatesan Guruswami
Vanishing-Error Approximate Degree and QMA Complexity
by Alexander A. Sherstov and Justin Thaler