Flattening EntropiesSpeaker: Yi-Hsiu
Title: Flattening Entropies
Date: 14 May 2018 5:30pm-7:00pm
Location: Pierce 320
Food: Chinese food
Abstract: (Smooth) Min and max entropies are useful in characterizing some basic properties of random variables. In a flattening entropy problem, we ask how many independent copies we need to convert Shannon entropy to min or max entropies? The problem (in a more general model) is a component in the constructions of pseudorandom generators and other cryptographic primitives from one-way functions. The complexity is often the main efficiency bottleneck. The connection between the flattening problem and the cryptographic constructions motivates studies for both the upper bound algorithms and the lower bounds complexity. We will discuss results on both sides. unknown.