The problem of chasing convex functions is easy to state: faced with a sequence of convex functions {f_t}, the goal of the algorithm is to output a point x_t at each time, so that the sum of the function costs f_t(x_t), plus the movement costs ||

We construct a succinct non-interactive publicly-verifiable delegation scheme for any logspace uniform circuit under the sub-exponential Learning With Errors (LWE) assumption.

Abstract: Suppose we have N time series available where one time-series could be causally dependent on others. For example, such dependence can be found in economic data or weather data.

Abstract: Deep Learning has witnessed a 300,000X growth in compute demand in the last 6 years, matched equally by a growth in hardware capability – primarily riding on half precision compute and systolic arrays.

Abstract: A fundamental open problem in information-theoretically secure multi-party computation (MPC) is to characterize functions which admit MPC protocols (say, secure against passive corruption), when more than 2 parties are i