Tancrede Lepoint: Using the Rényi Divergence Rather than the Statistical Distance in Lattice Crypto
Tancrede Lepoint, SRI
Date: Friday, November 04, 2016
Time: 10:30 AM to 12:00 PM
Location: Hewlett, G882
Host: Vinod Vaikuntanathan
Contact: Deborah Goodwin, 617.324.7303, email@example.com
Speaker URL: None
TALK: Tancrede Lepoint: Using the Rényi Divergence Rather than the Statistical Distance in Lattice Crypto
Abstract: The Rényi divergence is a measure of closeness of two probability distributions. In this talk, Ill show that it can often be used as an alternative to the statistical distance in security proofs for lattice-based cryptography. Using the Rényi divergence is particularly suited for security proofs of primitives in which the attacker is required to solve a search problem (e.g., forging a signature). Then I'll show that it may also be used in the case of distinguishing problems (e.g., semantic security of encryption schemes), when they enjoy a *public sampleability* property. The techniques lead to security proofs for schemes with smaller parameters, and sometimes to simpler security proofs than the existing ones.
Created by Deborah Goodwin at Tuesday, November 01, 2016 at 10:31 AM.