Data security challenges faced in the modern world demand functionality from encryption systems that traditional public key cryptography falls far short in delivering.
We present a fully polynomial time approximation scheme (FPTAS) for optimizing a very general class of non-linear functions of low rank over a polytope.
The widespread use of internet has raised serious concerns of privacy and trust. In order to address these concerns, cryptographic protocols are widely used.
Given a set $P$ of $n$ points in $R^d$, a weak $epsilon$-net of $P$ with respect to convex sets in a subset of $R^d$ that intersects every convex set containing an $epsilon$-fraction of the points in $P$.
This talk is based on "Simple channel coding bounds" by Wang et al, ISIT, 2009. New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel.
Problems in Metric embedding involve mapping a set (for our purposes, finite) of points from one metric space to another, while preserving pairwise distances.
