Dan Boneh Introduction Discrete Probability (crash course) 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.
Occupancy Problems m balls being randomly assigned to one of n bins. (Independently and uniformly) The questions: - what is the maximum number of balls.
Notation Intro. Number Theory Online Cryptography Course Dan Boneh
1 The Monte Carlo method. 2 (0,0) (1,1) (-1,-1) (-1,1) (1,-1) 1 Z= 1 If  X 2 +Y 2  1 0 o/w (X,Y) is a point chosen uniformly at random in a 2  2 square.
Probabilistic Analysis and Randomized Algorithm. Worst case analysis Probabilistic analysis  Need the knowledge of the distribution of the inputs Indicator.
1 Discrete Structures & Algorithms Discrete Probability.
An Algorithm for Polytope Decomposition and Exact Computation of Multiple Integrals.
ACT1 Slides by Vera Asodi & Tomer Naveh. Updated by : Avi Ben-Aroya & Alon Brook Adapted from Oded Goldreich’s course lecture notes by Sergey Benditkis,
Assignment 2 Chapter 2: Problems  Due: March 1, 2004 Exam 1 April 1, 2004 – 6:30-8:30 PM Exam 2 May 13, 2004 – 6:30-8:30 PM Makeup.
The Goldreich-Levin Theorem: List-decoding the Hadamard code
A gentle introduction to Gaussian distribution. Review Random variable Coin flip experiment X = 0X = 1 X: Random variable.
A random variable that has the following pmf is said to be a binomial random variable with parameters n, p The Binomial random variable.
1 Discrete Probability Hsin-Lung Wu Assistant Professor Advanced Algorithms 2008 Fall.
1 Random Variables and Probability Distributions: Discrete versus Continuous For this portion of the session, the learning objective is:  Learn that the.
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.
Dan Boneh Authenticated Encryption Definitions Online Cryptography Course Dan Boneh.
Dan Boneh Intro. Number Theory Intractable problems Online Cryptography Course Dan Boneh.
Dan Boneh Introduction Course Overview 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.
Physics Fluctuomatics (Tohoku University) 1 Physical Fluctuomatics 2nd Mathematical Preparations (1): Probability and statistics Kazuyuki Tanaka Graduate.
PBG 650 Advanced Plant Breeding
Great Theoretical Ideas In Computer Science Steven Rudich, Anupam GuptaCS Spring 2004 Lecture 22April 1, 2004Carnegie Mellon University
Chapter 10 Introduction to Simulation Modeling Monte Carlo Simulation.
Dan Boneh Block ciphers More attacks on block ciphers Online Cryptography Course Dan Boneh.
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.
CSCE 411 Design and Analysis of Algorithms Set 9: Randomized Algorithms Prof. Jennifer Welch Fall 2014 CSCE 411, Fall 2014: Set 9 1.
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.
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
Markov Chains and Random Walks. Def: A stochastic process X={X(t),t ∈ T} is a collection of random variables. If T is a countable set, say T={0,1,2, …
1 Continuous Probability Distributions Continuous Random Variables & Probability Distributions Dr. Jerrell T. Stracener, SAE Fellow Leadership in Engineering.
COMPSCI 102 Introduction to Discrete Mathematics.
1 Randomized Algorithms Andreas Klappenecker. 2 Randomized Algorithms A randomized algorithm is an algorithm that makes random choices during their execution.
Physics Fluctuomatics (Tohoku University) 1 Physical Fluctuomatics 3rd Random variable, probability distribution and probability density function Kazuyuki.
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.
AP STATISTICS Section 7.1 Random Variables. Objective: To be able to recognize discrete and continuous random variables and calculate probabilities using.
Chapter 3 Discrete Random Variables and Probability Distributions  Random Variables.2 - Probability Distributions for Discrete Random Variables.3.
Lectures prepared by: Elchanan Mossel Yelena Shvets Introduction to probability Stat 134 FAll 2005 Berkeley Follows Jim Pitman’s book: Probability Section.
Cryptography Lecture 2 Arpita Patra. Recall >> Crypto: Past and Present (aka Classical vs. Modern Cryto) o Scope o Scientific Basis (Formal Def. + Precise.
Great Theoretical Ideas in Computer Science for Some.
Master Method (4. 3) Recurrent formula T(n) = a  T(n/b) + f(n) 1) if for some  > 0 then 2) if then 3) if for some  > 0 and a  f(n/b)  c  f(n) for.
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.
SS r SS r This model characterizes how S(t) is changing.
Dan Boneh Intro. Number Theory Arithmetic algorithms Online Cryptography Course Dan Boneh.
Dan Boneh Odds and ends Deterministic Encryption 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:
Dan Boneh Introduction Discrete Probability (crash course, cont.) Online Cryptography Course Dan Boneh See also:
Dan Boneh Public Key Encryption from trapdoor permutations Constructions Online Cryptography Course Dan Boneh Goal: construct chosen-ciphertext secure.
An Example of {AND, OR, Given that} Using a Normal Distribution By Henry Mesa.
10.Deterministic Randomness 1.Random Sequences Random Sequences A sequence of numbers r 1, r 2,... is random if there are no discernible patterns.
Lecture 3 B Maysaa ELmahi.
B504/I538: Introduction to Cryptography
Graduate School of Information Sciences, Tohoku University
Cryptography Lecture 2 Arpita Patra © Arpita Patra.
An Example of {AND, OR, Given that} Using a Normal Distribution
Cryptography Lecture 2 Arpita Patra © Arpita Patra.
B504/I538: Introduction to Cryptography
Suppose you roll two dice, and let X be sum of the dice. Then X is
Master Method (4. 3) Recurrent formula T(n) = aT(n/b) + f(n)
CS200: Algorithm Analysis
Topic 3: Prob. Analysis Randomized Alg.
... DISCRETE random variables X, Y Joint Probability Mass Function y1
Consider the following problem
Presentation transcript:

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

Dan Boneh U: finite set (e.g. U = {0,1} n ) Def: Probability distribution P over U is a function P: U [0,1] such that Σ P(x) = 1 Examples: 1.Uniform distribution:for all x ∈ U: P(x) = 1/|U| 2.Point distribution at x 0 :P(x 0 ) = 1, ∀ x≠x 0 : P(x) = 0 Distribution vector: ( P(000), P(001), P(010), …, P(111) ) x∈Ux∈U

Dan Boneh Events For a set A ⊆ U: Pr[A] = Σ P(x) ∈ [0,1] The set A is called an event Example: U = {0,1} 8 A = { all x in U such that lsb 2 (x)=11 } ⊆ U for the uniform distribution on {0,1} 8 : Pr[A] = 1/4 x∈Ax∈A note: Pr[U]=1

Dan Boneh The union bound For events A 1 and A 2 Pr [ A 1 ∪ A 2 ] ≤ Pr[A 1 ] + Pr[A 2 ] Example: A 1 = { all x in {0,1} n s.t lsb 2 (x)=11 } ; A 2 = { all x in {0,1} n s.t. msb 2 (x)=11 } Pr [ lsb 2 (x)= 11 or msb 2 (x)= 11 ] = Pr [ A 1 ∪ A 2 ] ≤ ¼+¼ = ½ A 1 A2A2 A2A2

Dan Boneh Random Variables Def: a random variable X is a function X:UV Example: X: {0,1} n {0,1} ; X(y) = lsb(y) ∈ {0,1} For the uniform distribution on U: Pr[ X=0 ] = 1/2, Pr[ X=1 ] = 1/2 More generally: rand. var. X induces a distribution on V: Pr[ X=v ] := Pr [ X -1 (v) ] lsb=1 0 1 lsb=0 UV

Dan Boneh The uniform random variable Let U be some set, e.g. U = {0,1} n We write r U to denote a uniform random variable over U for all a ∈ U: Pr [ r = a ] = 1/|U| ( formally, r is the identity function: r(x)=x for all x ∈ U ) R

Dan Boneh Let r be a uniform random variable on {0,1} 2 Define the random variable X = r 1 + r 2 Then Pr[X=2] = ¼ Hint: Pr[X=2] = Pr[ r=11 ]

Dan Boneh Randomized algorithms Deterministic algorithm: y A(m) Randomized algorithm y A( m ; r ) where r {0,1} n output is a random variable y A( m ) Example: A(m ; k) = E(k, m), y A( m ) A(m) m inputs outputs A(m) m R R R

Dan Boneh End of Segment