what does random mean
play

What does random mean? Random - Something or a group of things - PowerPoint PPT Presentation

Oct 19, 2022 •345 likes •677 views

What does random mean? Random - Something or a group of things that follow no criteria or pattern. A word often misused by morons who dont know very many other words. -- supaDISC What does random mean? Please

  2. What does “random” mean? Random - “Something or a group of things that follow no criteria or pattern. A word often misused by morons who don’t know very many other words.” -- supaDISC

  3. What does “random” mean? “Please people, use it when something really is random. See example below. ” -- Madi (from www.urbandictionary.com) Sorry your hamster British rail should died, Bob. watch out for flying man-eating deckchairs!

  4. Why it matters Security of protocols like RSA fails if keys are not random enough. [ Lenstra+ 12, Heninger+ 12] P,Q P,Q (primes)

  5. Why it matters Info security professionals rely on tests like these. “[We assume] that the developer understands the behavior of the entropy source and has made a good- faith effort to produce a consistent source of entropy.” Can we do better than this?

  7. Bell inequalities certify quantumness Suppose Alice plays the CHSH game N times and calculates the avg. Input The CHSH Game score. O 1 Å O 2 = 1 Score if Score if Inputs O 1  O 2 = 0 O 1  O 2 = 1 0 1 00 +1 -1 0 0 0 1 01 +1 -1 10 +1 -1 11 -1 +1 1 0 1 0 0 1 … …

  8. Bell inequalities certify quantumness Suppose Alice plays the CHSH game N times and calculates the avg. score. 0 1 0 0 N=5 0 1 0.72 1 0 0.5 1 0 0 1 … …

  9. Bell inequalities certify quantumness Suppose Alice plays the CHSH game N times and calculates the avg. score. 0 1 0 0 N=500 0 1 0.72 1 0 0.5 1 0 0 1 … …

  10. Bell inequalities certify quantumness Suppose Alice plays the CHSH game N times and calculates the avg. score. 0 1 0 0 N=100000 0 1 0.72 1 0 0.5 1 0 0 1 … …

  11. Bell inequalities certify quantumness Suppose Alice plays the CHSH game N times and calculates the avg. score. If it’s > 0.501, she assumes outputs were partially random, and applies a randomness extractor . [Colbeck 2006] 0 1 0 0 N=100000 0 1 0.72 1 0 0.5 1 0 0 1 … …

  12. Bell inequalities certify quantumness Does this work? Yes – from the perspective of any classical adversary. [Pironio+ 10, Pironio+ 13, Fehr+ 13, Coudron+ 13]. 0 1 0 0 N=100000 0 1 0.72 1 0 0.5 1 0 0 1 … …

  13. Quantum adversaries are stronger What about an entangled adversary? Problem: Quantum information can be locked – accessible only to entangled adversaries. [E.g., DiVincenzo+ 04] 0 1 0 0 0 1 1 0 1 0 0 1 … …

  14. Quantum adversaries are stronger If we can require perfect performance, [Vazirani-Vidick 12] proves entangled security. QIP 2014: We proved entangled security allowing error 0.028 . 0 1 0 0 Quantum security 0 1 1 0 1 0 0 1 … … Classical security

  15. Quantum adversaries are stronger If we can require perfect performance, [Vazirani-Vidick 12] proves entangled security. QIP 2014: We proved entangled security allowing error 0.028 . Our new results: 0 1 0 0 Quantum security The two thresholds 0 1 are in fact the same. Any Bell inequality can be used. 1 0 1 0 0 1 … … Classical security

  17. Randomness from Trusted Measurements Randomness Expansion At each iteration, the device locates a 0 [Several authors]: Security proof against an unentangled adversary. 0 qubit. If input = 0, it measures along 1 0 {|+>, |->}; if input = 1, along {|0>, |1>}. 0 Small resources, high rate 0 0 0 Not fully secure 1 0 0 + + 11011 - 1010010001011101010001011101101010001111111010100010 …. 0 1

  18. Randomness from Trusted Measurements Randomness Expansion Idea: We want the device to prepare an 0 [Several authors]: Security proof against an unentangled adversary. 0 approximate |0> state and measure 1 0 along {|+>, |->}. 0 Small resources, high rate 0 0 0 Protocol adapted from CVY13, VV12. Not fully secure 1 1. Give the device N biased (1 – d, d ) 0 0 coin flips. 2. If output “1” has occurred more than (1-C) d N times, abort. + 3. Apply randomness extractor. + 11011 - 1010010001011101010001011101101010001111111010100010 …. 0 Is this secure? +

  19. Randomness from Trusted Measurements Randomness Expansion Initial adversary state: 0 [Several authors]: Security proof against an unentangled adversary. r 0 1 0 0 Small resources, high rate After 1 iteration: 0 0 ( 1 – d) r +  ( 1 – d) r -  d r 0  d r 1 0 State = r Not fully secure 1 0 0 After N iterations: ( 1 – d) N r ++..+  ( 1 – d) N r ++..-  ...  d N r 11..1 + At the end we exclude “abort” states. + 11011 - Is the result random? 1010010001011101010001011101101010001111111010100010 …. 0 +

  20. A New Uncertainty Principle for Tr[X c ] Randomness Expansion Theorem: 0 [Several authors]: Security proof against an unentangled adversary. 0 Let 1 0 0 Small resources, high rate 0 0 0 State = r Not fully secure 1 0 0 0 Then (X,Y) must fit in this region: (1,1) (0,1) + + 11011 (1,1- e ) (0,1- e ) - 1010010001011101010001011101101010001111111010100010 …. 0 +

  21. A New Uncertainty Principle for Tr[X c ] Randomness Expansion By an inductive argument, the protocol is 0 [Several authors]: Security proof against an unentangled adversary. secure provided the abort threshold (C) is > 0.5. 0 1 0 0 Small resources, high rate 0 0 0 State = r Not fully secure 1 0 0 + + 11011 - 1010010001011101010001011101101010001111111010100010 …. 0 Classical threshold = quantum threshold! +

  23. Randomness Expansion Randomness from Noncommuting Measurements Change the device to a general non- 0 [Several authors]: Security proof against an unentangled adversary. 0 commuting device. 1 A device whose 0 0 measurements {A 0 , Small resources, high rate 0 By similar proof, the protocol is secure 0 A 1 } and {B 0 , B 1 } 0 provided C > T. Not fully secure 1 always satisfy 0 0 Classical threshold = quantum threshold again! + + 11011 - 1010010001011101010001011101101010001111111010100010 …. 0 +

  24. Randomness Expansion Randomness from Untrusted Devices Insight (generalizing 0 0 our previous work): Random input Nonlocal games simulate noncommuting - OR - CHSH measurements. Output Output

  25. Randomness Expansion Randomness from Untrusted Devices Protocol from CVY13, VV12. 0 0 [Several authors]: Security proof against an unentangled adversary. 0 0 1. Run the device N times. During 1 1 0 0 “game rounds,” play a nonlocal 0 0 Small resources, high rate 0 game. Otherwise, just input (0,0). 0 Game rounds 0 0 2. If the average score during game 0 0 occur with Not fully secure 1 0 probability e. rounds was < C, abort. 0 0 0 0 3. Apply randomness extractor. By simulation, classical threshold = 1 0 quantum threshold. 1 1 11011 0 1 1 1 1010010001011101010001011101101010001111111010100010 ….

  26. Randomness Expansion Randomness from Kochen-Specker Inequalities Horodecki+ 10, Abbott+ 12, Deng+ 13, Um+ 13 A B In a contextuality game , the device makes [Several authors]: Security proof against an unentangled adversary. A B C simultaneous measurements assumed to D A B be consistent and commuting. A B Small resources, high rate A B A A B C A B Not fully secure E A A E B A B D Klyachko+ 08 B 1 0 1 1 11011 0 1 Classical threshold = quantum threshold. 1 1 1010010001011101010001011101101010001111111010100010 ….

  27. Randomness Expansion Randomness from Kochen-Specker Inequalities Horodecki+ 10, Abbott+ 12, Deng+ 13, Um+ 13 MISSION ACCOMPLISHED A B In a contextuality game , the device makes [Several authors]: Security proof against an unentangled adversary. A B C simultaneous measurements assumed to D Any Bell inequality (or K-S inequality) can be used to A B be consistent and commuting. A B Small resources, high rate A B produce true random numbers. A A B C A B Not fully secure E A A E B A B D Klyachko+ 08 B 1 0 1 1 11011 0 1 Classical threshold = quantum threshold. 1 1 1010010001011101010001011101101010001111111010100010 ….

  29. Open Problems What are the best resource tradeoffs? Entanglement . Quality of seed. 011110000010000100000111111111110111100000 01111000010100001110100000000001111101000… # of devices. Expansion rate. Exponential, unbounded …

  30. Open Problems What is the best 0.03 QIP 2015 rate curve for 0 CHSH? 0.72 0.5 Important for 1.0 QKD. QIP 2014 0

  31. The Schatten norm Our uncertainty principle relies on the uniform convexity of the (1+ e )-Schatten norm [Ball+ 94]. U r U * r 11011 r +  r - 1010010001011101010001011101101010001111111010100010 …. What else can we learn from the geometry of this norm?

Recommend

Random Numbers RANDOM VS PSEUDO RANDOM Truly Random numbers From Wolfram: A random number

Random Numbers RANDOM VS PSEUDO RANDOM Truly Random numbers From Wolfram: A random number

Random Numbers RANDOM VS PSEUDO RANDOM Truly Random numbers From Wolfram: A random number is a number chosen as if by chance from some specified distribution such that selection of a large set of these numbers reproduces the underlying

720 views • 12 slides
E [ X ] = X 1 ( 2 ) ? X 1 ( 2 ) = { HHT , HTH , THH } . All the outcomes a Pr

E [ X ] = X 1 ( 2 ) ? X 1 ( 2 ) = { HHT , HTH , THH } . All the outcomes a Pr

Alex Psomas: Lecture 17. Random Variables: Definitions Random Variables: Definitions Definition A random variable, X , for a random experiment with sample space is a function X : . Random Variables: Expectation, Variance Thus, X

423 views • 7 slides
6. random variables T T T T H T H H Random VariablesIntro 2

6. random variables T T T T H T H H Random VariablesIntro 2

CSE 312, 2017 Winter, W.L.Ruzzo 6. random variables T T T T H T H H Random VariablesIntro 2 random variables A random variable is a numeric function of the outcome of an experiment, not the outcome itself.

1.17k views • 95 slides
Chapter 9 Object recognition Random Forests 9.9 Random forests 2 9.9 Random forests

Chapter 9 Object recognition Random Forests 9.9 Random forests 2 9.9 Random forests

Chapter 9 Object recognition Random Forests 9.9 Random forests 2 9.9 Random forests Random forests a classification approach that is especially well suited for prob- lems with many classes when large datasets are available for

382 views • 21 slides
Discrete Random Variables October 7, 2010 Discrete Random Variables Random Variables In many

Discrete Random Variables October 7, 2010 Discrete Random Variables Random Variables In many

Discrete Random Variables October 7, 2010 Discrete Random Variables Random Variables In many situations, we are interested in numbers associated with the outcomes of a random experiment. For example: Testing cars from a production line, we are

489 views • 38 slides
E [ X ] = X 1 ( a ) := { | X ( ) = a } . a Pr [ X = a ] . 3. Important

E [ X ] = X 1 ( a ) := { | X ( ) = a } . a Pr [ X = a ] . 3. Important

CS70: Random Variables (contd.) Random Variables: Definitions Expectation - Definition Definition A random variable, X , for a random experiment with sample space is a function X : . Random Variables: Expectation Thus, X ( )

329 views • 3 slides
Quenched invariance principle for random walks and random divergence forms in random media on

Quenched invariance principle for random walks and random divergence forms in random media on

Quenched invariance principle for random walks and random divergence forms in random media on cones Takashi Kumagai (RIMS, Kyoto University, Japan) On-going joint work with Z.Q. Chen (Seattle) and D.A. Croydon (Warwick).

884 views • 22 slides
Simulation Random numbers Random numbers Anyone who considers arithmetic methods of

Simulation Random numbers Random numbers Anyone who considers arithmetic methods of

Simulation Random numbers Random numbers Anyone who considers arithmetic methods of producing random digits is, of course, in a state of sin , John v. Neumann Only seemingly random (pseudo random numbers) are used in simulation

502 views • 32 slides
Random Planar Map A random triangulation [Courtesy of N. Curien]. Random Planar Map A random

Random Planar Map A random triangulation [Courtesy of N. Curien]. Random Planar Map A random

CLE E XTREME N ESTING &amp; L IOUVILLE Q UANTUM G RAVITY Bertrand Duplantier Institut de Physique Th eorique Universit e Paris-Saclay, France G EOMETRY , A NALYSIS AND P ROBABILITY A Symposium in Honor of P ETER W. J ONES KIAS, Seoul, Korea

588 views • 32 slides
Probability and Random Processes Lecture 10 Random processes Kolmogorovs extension

Probability and Random Processes Lecture 10 Random processes Kolmogorovs extension

Probability and Random Processes Lecture 10 Random processes Kolmogorovs extension theorem Random sequences and waveforms Mikael Skoglund, Probability and random processes 1/16 Random Objects A probability space ( , A , P

199 views • 8 slides
CONTENTS OF DAY 2 I. Random Sampling 3 Connection with independent random variables 4

CONTENTS OF DAY 2 I. Random Sampling 3 Connection with independent random variables 4

1 2 CONTENTS OF DAY 2 I. Random Sampling 3 Connection with independent random variables 4 Problems with small populations 9 II. Why Random Sampling is Important 14 A myth, an urban legend, and the real reason III. Overview of

322 views • 20 slides
Expected Value Theory James H. Steiger Department of Psychology and Human Development Vanderbilt

Expected Value Theory James H. Steiger Department of Psychology and Human Development Vanderbilt

Introduction Expected Value of a Random Variable Variance of a Random Variable Covariance of Two Random Variables Correlation of Two Random Variables Algebra of Variances and Covariances Joint Distributions and Conditional Expectation Matrix

504 views • 22 slides
E [ X ] = Roll a die n times. X ( ) Pr [ ] . X 1 + X 2 + + X n Theorem:

E [ X ] = Roll a die n times. X ( ) Pr [ ] . X 1 + X 2 + + X n Theorem:

CS70: Jean Walrand: Lecture 26. Random Variables: Review Expectation Definition: The expectation (mean, expected value) of a random Expectation; Geometric &amp; Poisson Definition variable X is A random variable, X , for a random experiment with

389 views • 5 slides
W HAT DOES IT MEAN ? Given a graph G with vertex set [ n ] : Pr ( G ( n , p ) = G ) = p e ( G ) ( 1

W HAT DOES IT MEAN ? Given a graph G with vertex set [ n ] : Pr ( G ( n , p ) = G ) = p e ( G ) ( 1

Carg` ese Fall School on Random Graphs Carg` ese, Corsica, September 20-26, 2015 I NTRODUCTION TO RANDOM GRAPHS Tomasz uczak Adam Mickiewicz University, Pozna n, Poland T WO MAIN RANDOM GRAPH MODELS T HE BINOMIAL RANDOM GRAPH G ( n , p )

1.93k views • 174 slides
Random Numbers, Files, and Onwards Random Numbers Computers cannot produce truly random numbers.

Random Numbers, Files, and Onwards Random Numbers Computers cannot produce truly random numbers.

Random Numbers, Files, and Onwards Random Numbers Computers cannot produce truly random numbers. We make do with pseudo-random numbers, which are good enough. The pseudo-random generation algorithm is given a seed value. The same seed will always

331 views • 12 slides
Efficient Simulation of Random States and Random Unitaries Gorjan Alagic, Christian Majenz and

Efficient Simulation of Random States and Random Unitaries Gorjan Alagic, Christian Majenz and

Efficient Simulation of Random States and Random Unitaries Gorjan Alagic, Christian Majenz and Alexander Russell Eurocrypt 2020, in Cyberspace Results overview We study the simulation of random quantum objects , i.e. random states and

847 views • 63 slides
tYff distribution of random a variable connection between with Vanities random and

tYff distribution of random a variable connection between with Vanities random and

Chapter of Distribution I : Random Variable a Lattin Defy Distributed ) ( Identically variables { Xilie # random of collection A distributed it for all and seek identically is have i. je I we any - IPCX ; ex ) IP ( Xi ex ) . K

629 views • 10 slides
Probability and Random Processes Lecture 5 Probability and random variables The law of

Probability and Random Processes Lecture 5 Probability and random variables The law of

Probability and Random Processes Lecture 5 Probability and random variables The law of large numbers Mikael Skoglund, Probability and random processes 1/21 Why Measure Theoretic Probability? Stronger limit theorems Conditional

328 views • 11 slides
Week 1: Introduc/on Random errors 2 1.2B Random errors 3

Week 1: Introduc/on Random errors 2 1.2B Random errors 3

1 Week 1: Introduc/on Random errors 2 1.2B Random errors 3 Laser distance measurement Repeated individual measurements mean = truth Width measurement no. 4 Random errors where

398 views • 12 slides
Knudsen billiards and random walks in random environment with unbounded jumps Random billiards

Knudsen billiards and random walks in random environment with unbounded jumps Random billiards

Random billiards with cosine reflection law Stationary random tube: quenched invariance principles Finite tube: crossing probabilities and crossing time Knudsen billiards with drift A strongly transient RWRE with unbounded jumps Knudsen

761 views • 29 slides
What does a random 3-manifold look like? Nathan Dunfield University of Illinois slides and

What does a random 3-manifold look like? Nathan Dunfield University of Illinois slides and

What does a random 3-manifold look like? Nathan Dunfield University of Illinois slides and references at: http://dunfield.info/preprints/ Random Heegaard splittings: Fix g and Pick at random: generators S for MCG ( g ) . A random

320 views • 4 slides
Efficient Simulation of Random States and Random Unitaries Gorjan Alagic, Christian Majenz and

Efficient Simulation of Random States and Random Unitaries Gorjan Alagic, Christian Majenz and

Efficient Simulation of Random States and Random Unitaries Gorjan Alagic, Christian Majenz and Alexander Russell QCrypt 2020, in Cyberspace Results overview We study the simulation of random quantum objects , i.e. random quantum states

1.08k views • 72 slides
RANDOM WALK IN DYNAMIC RANDOM ENVIRONMENT Frank den Hollander Leiden University The Netherlands

RANDOM WALK IN DYNAMIC RANDOM ENVIRONMENT Frank den Hollander Leiden University The Netherlands

RANDOM WALK IN DYNAMIC RANDOM ENVIRONMENT Frank den Hollander Leiden University The Netherlands Joint work with: M. Hil ario, R. dos Santos (Belo Horizonte) V. Sidoravicius, A. Teixeira (Rio de Janeiro) School and Workshop on Random

521 views • 18 slides
Random numbers We have seen that in many applications we need random number generators For

Random numbers We have seen that in many applications we need random number generators For

Random numbers We have seen that in many applications we need random number generators For example we sue random number generator to obtain session keys; to avoid key guessing If an adversary sees a sequence of session keys He/she

426 views • 16 slides

More recommend