CS 6113 Lecture 19 Quantitative Information Flow 12 November 2013
نویسندگان
چکیده
Quantitative information flow was first proposed by Denning [5] and Gray [6]. Its goal is to measure the amount of information leaked about a secret by observing the running of a program. Quantitative definitions of information leakage are often borrowed from information theory. Indeed, early models of quantitative information flow directly used the Shannon mutual information I(X;Y ), which measures the (expected) reduction in uncertainty about the value of random variable X given by learning the value of Y (see §2). Doing information flow quantitatively immediately raises the following issues, among others:
منابع مشابه
Optical Supercomputing - Third International Workshop, OSC 2010, Bertinoro, Italy, November 17-19, 2010, Revised Selected Papers
optical supercomputing third international workshop osc 2010 bertinoro italy november 17 19 2010 revised selected papers lecture notes in computer science. Book lovers, when you need a new book to read, find the book here. Never worry not to find what you need. Is the optical supercomputing third international workshop osc 2010 bertinoro italy november 17 19 2010 revised selected papers lecture...
متن کاملCS 2429 - Foundations of Communication Complexity Lecture # 8 : 7 November 2012 Lecturer : Lila Fontes
Today we’ll cover some recent results from the paper Lower bounds on information complexity via zero-communication bounds and applications by Kerenidis, Laplante, Lerays, Roland, and Xiao (FOCS 2012). We’ll also recall results covered in past lectures from the papers The partition bound for classical communication complexity and query complexity by Jain and Klauck (CCC 2010) and How to compress...
متن کاملCS 229 r : Algorithms for Big Data Fall 2013 Lecture 4 — September 12 , 2013
2 Algorithm for Fp, p > 2 2 2.1 Alternate formulation of Chernoff bound . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Returning to proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Digression on Perfect Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.4 Finishing proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملCS - 621 Theory Gems November 14 , 2012 Lecture 16 Lecturer : Aleksander Madry Scribes : Chidambaram Annamalai
In the last lecture, we introduced the streaming model. The goal of this model is to help us develop algorithms that are useful in the scenarios where we want to process large amounts of data while having only very limited storage (and processing time) at our disposal. The motivating example here is a network router. This device has an extremely small memory compared to the network traffic that...
متن کامل