Seminars archive
Upcoming Seminars   No upcoming seminars currently scheduled.  Past Seminars   Seminar: Combinatorics Counting restricted orientations of random graphs Yoshi Kohayakawa, University of Sao Paulo   Seminar: Numerical Analysis and Scientific Computing A new tensor framework  theory and applications Dr. Misha Kilmer, Tufts University   Seminar: Algebra Unifying relaxed notions of modular forms Martin Raum, Chalmers Technical University, Gothenburg, Sweden   Seminar: Numerical Analysis and Scientific Computing On the Birkhoffvon Neumann decomposition and its use in solving sparse linear systems Dr. Bora Ucar, CNRS and ENS Lyon, France (visiting GaTech this year)   Seminar: Algebra Linked Fields of Characteristic 2 and their uInvariant. Dr. Adam Chapman, TelHai Academic College, Israel.   Seminar: Algebra Spectrum of singularities, exponential sums and the irreducibility of polynomials in two variables Jorge Jimenez Urroz, U. Politecnica, Catalunya   Defense: Dissertation Topics in Tropical and Analytic Geometry Charles Morrissey, Emory University   Defense Application of the DIKW Model in Malaria Systems Biology: From NGS Data to Disease Progression Insight JungTing Chien, Emory University   Seminar: Computer Science Perfect Secrecy vs. Computational Security in Private Key Encryption Schemes Steven La Fleur, Emory University Venue: Mathematics and Science Center, Room W301 Show abstract As evidenced by recent events, privacy and security of data is increasingly important. There is a lot of interest in the ability to securely encrypt and send messages between two parties in such a way that any potential eavesdropper will be unable to read the message. But what does "security" of an encryption scheme mean, and how do we measure how secure a given scheme is?\\
\\In this talk we will investigate formal definitions for security of an encryption schemes, and what it means to prove that an encryption scheme is secure using these definitions. We will consider the practical drawbacks of "perfect secrecy" and how the definitions and assumptions made for computational security fix these drawback while still maintaining secrecy from attackers of different strengths.\\
\\The talk is intended for undergraduate students who have taken a course in discrete mathematics for computer science and have a basic understanding of probability, theory of computation and rigorous proof.   Defense: Dissertation Efficient and Adaptive Skyline Computation Jinfei Liu, Emory University 
