Dan Boneh Introduction Discrete Probability (crash course, cont.) Online Cryptography Course Dan Boneh See also:

Slides:



Advertisements
Similar presentations
ElGamal Security Public key encryption from Diffie-Hellman
Advertisements

Let X 1, X 2,..., X n be a set of independent random variables having a common distribution, and let E[ X i ] = . then, with probability 1 Strong law.
Notation Intro. Number Theory Online Cryptography Course Dan Boneh
Use of moment generating functions. Definition Let X denote a random variable with probability density function f(x) if continuous (probability mass function.
Probabilistic Analysis and Randomized Algorithm. Worst case analysis Probabilistic analysis  Need the knowledge of the distribution of the inputs Indicator.
Chapter 5: Probability Concepts
Great Theoretical Ideas in Computer Science.
The Goldreich-Levin Theorem: List-decoding the Hadamard code
Random Variables November 23, Discrete Random Variables A random variable is a variable whose value is a numerical outcome of a random phenomenon.
Samples vs. Distributions Distributions: Discrete Random Variable Distributions: Continuous Random Variable Another Situation: Sample of Data.
Princeton University COS 433 Cryptography Fall 2005 Boaz Barak COS 433: Cryptography Princeton University Fall 2005 Boaz Barak Lecture 2: Perfect Secrecy.
The probabilistic method & infinite probability spaces Great Theoretical Ideas In Computer Science Steven Rudich, Anupam GuptaCS Spring 2004 Lecture.
A random variable that has the following pmf is said to be a binomial random variable with parameters n, p The Binomial random variable.
The moment generating function of random variable X is given by Moment generating function.
1 Discrete Probability Hsin-Lung Wu Assistant Professor Advanced Algorithms 2008 Fall.
Princeton University COS 433 Cryptography Fall 2005 Boaz Barak COS 433: Cryptography Princeton University Fall 2005 Boaz Barak Lecture 2: Perfect Secrecy.
Dan Boneh Intro. Number Theory Modular e’th roots Online Cryptography Course Dan Boneh.
Dan Boneh Collision resistance Generic birthday attack Online Cryptography Course Dan Boneh.
Probability Theory: Counting in Terms of Proportions Great Theoretical Ideas In Computer Science Steven Rudich, Anupam GuptaCS Spring 2004 Lecture.
LECTURE UNIT 4.3 Normal Random Variables and Normal Probability Distributions.
Distribution Function properties. Density Function – We define the derivative of the distribution function F X (x) as the probability density function.
Dan Boneh Intro. Number Theory Intractable problems Online Cryptography Course Dan Boneh.
Dan Boneh Introduction Course Overview Online Cryptography Course Dan Boneh.
Dan Boneh Stream ciphers The One Time Pad Online Cryptography Course Dan Boneh.
CS526Topic 3: One-time Pad and Perfect Secrecy 1 Information Security CS 526 Topic 3 Cryptography: One-time Pad, Information Theoretic Security, and Stream.
Section 15.8 The Binomial Distribution. A binomial distribution is a discrete distribution defined by two parameters: The number of trials, n The probability.
CIVL 181Tutorial 5 Return period Poisson process Multiple random variables.
Random Variables & Probability Distributions Outcomes of experiments are, in part, random E.g. Let X 7 be the gender of the 7 th randomly selected student.
Great Theoretical Ideas In Computer Science Steven Rudich, Anupam GuptaCS Spring 2004 Lecture 22April 1, 2004Carnegie Mellon University
Topic 21 Cryptography CS 555 Topic 2: Evolution of Classical Cryptography CS555.
1 Two-point Sampling. 2 X,Y: discrete random variables defined over the same probability sample space. p(x,y)=Pr[{X=x}  {Y=y}]: the joint density function.
Great Theoretical Ideas in Computer Science.
Dan Boneh Introduction Discrete Probability (crash course) Online Cryptography Course Dan Boneh See also:
Dan Boneh Introduction Discrete Probability (crash course) Online Cryptography Course Dan Boneh.
The Mean of a Discrete RV The mean of a RV is the average value the RV takes over the long-run. –The mean of a RV is analogous to the mean of a large population.
COMP 170 L2 L17: Random Variables and Expectation Page 1.
Dan Boneh Collision resistance Introduction Online Cryptography Course Dan Boneh.
Mathematics and Statistics Boot Camp II David Siroky Duke University.
1 Continuous Probability Distributions Continuous Random Variables & Probability Distributions Dr. Jerrell T. Stracener, SAE Fellow Leadership in Engineering.
COMPSCI 102 Introduction to Discrete Mathematics.
Chapter 5 Joint Probability Distributions Joint, n. 1. a cheap, sordid place. 2. the movable place where two bones join. 3. one of the portions in which.
4.3 More Discrete Probability Distributions NOTES Coach Bridges.
Notation Intro. Number Theory Online Cryptography Course Dan Boneh
Dan Boneh Stream ciphers Stream ciphers are semantically secure Online Cryptography Course Dan Boneh Goal: secure PRG ⇒ semantically secure stream cipher.
TELECOMMUNICATIONS Dr. Hugh Blanton ENTC 4307/ENTC 5307.
Chapter 5. Continuous Random Variables. Continuous Random Variables Discrete random variables –Random variables whose set of possible values is either.
February 16. In Chapter 5: 5.1 What is Probability? 5.2 Types of Random Variables 5.3 Discrete Random Variables 5.4 Continuous Random Variables 5.5 More.
Dan Boneh Collision resistance The Merkle-Damgard Paradigm Online Cryptography Course Dan Boneh.
Great Theoretical Ideas in Computer Science for Some.
Dan Boneh Stream ciphers PRG Security Defs Online Cryptography Course Dan Boneh.
Tutorial 5: Discrete Probability I Reference: cps102/lecture11.ppt Steve Gu Feb 15, 2008.
Dan Boneh Intro. Number Theory Fermat and Euler Online Cryptography Course Dan Boneh.
Great Theoretical Ideas In Computer Science John LaffertyCS Fall 2006 Lecture 10 Sept. 28, 2006Carnegie Mellon University Classics.
Central Limit Theorem Let X 1, X 2, …, X n be n independent, identically distributed random variables with mean  and standard deviation . For large n:
Sums of Random Variables and Long-Term Averages Sums of R.V. ‘s S n = X 1 + X X n of course.
Random Variables By: 1.
Great Theoretical Ideas in Computer Science.
Random Variables Introduction to Probability & Statistics Random Variables.
Existence of Non-measurable Set
Basics of Multivariate Probability
Random Variable 2013.
Introduction to Discrete Mathematics
B504/I538: Introduction to Cryptography
Existence of Non-measurable Set
Great Theoretical Ideas In Computer Science
Great Theoretical Ideas In Computer Science
Chap 8 Bivariate Distributions Ghahramani 3rd edition
... DISCRETE random variables X, Y Joint Probability Mass Function y1
EE 5345 Multiple Random Variables 2-D RV’s Conditional RV’s
Presentation transcript:

Dan Boneh Introduction Discrete Probability (crash course, cont.) Online Cryptography Course Dan Boneh See also:

Dan Boneh Recap U: finite set (e.g. U = {0,1} n ) Prob. distr. P over U is a function P: U [0,1] s.t. Σ P(x) = 1 A ⊆ U is called an event and Pr[A] = Σ P(x) ∈ [0,1] A random variable is a function X:UV. X takes values in V and defines a distribution on V x∈Ux∈U x∈Ax∈A

Dan Boneh Independence Def: events A and B are independent if Pr[ A and B ] = Pr[A] ∙ Pr[B] random variables X,Y taking values in V are independent if ∀ a,b ∈ V: Pr[ X=a and Y=b] = Pr[X=a] ∙ Pr[Y=b] Example: U = {0,1} 2 = {00, 01, 10, 11} and r U Define r.v. X and Y as: X = lsb(r), Y = msb(r) Pr[ X=0 and Y=0 ] = Pr[ r=00 ] = ¼ = Pr[X=0] ∙ Pr[Y=0] R

Dan Boneh Review: XOR XOR of two strings in {0,1} n is their bit-wise addition mod ⊕

Dan Boneh An important property of XOR Thm:Y a rand. var. over {0,1} n, X an indep. uniform var. on {0,1} n Then Z := YX is uniform var. on {0,1} n Proof: (for n=1) Pr[ Z=0 ] =

Dan Boneh The birthday paradox Let r 1, …, r n ∈ U be indep. identically distributed random vars. Thm: when n = 1.2 × |U| 1/2 then Pr [ ∃ i≠j: r i = r j ] ≥ ½ Example: Let U = {0,1} 128 After sampling about 2 64 random messages from U, some two sampled messages will likely be the same notation: |U| is the size of U

Dan Boneh |U|=10 6 # samples n collision probability

Dan Boneh End of Segment