On the Bit Security of Cryptographic Primitives M E T R A S 7 - - PowerPoint PPT Presentation

on the bit security of cryptographic primitives
SMART_READER_LITE
LIVE PREVIEW

On the Bit Security of Cryptographic Primitives M E T R A S 7 - - PowerPoint PPT Presentation

On the Bit Security of Cryptographic Primitives M E T R A S 7 . 7 M Daniele Micciancio Michael Walter UCSD IST Austria eprint.iacr.org/2018/077 Security Security Adversary Game 1 Security Security Adversary Game


slide-1
SLIDE 1

On the Bit Security of Cryptographic Primitives

Daniele Micciancio Michael Walter

UCSD IST Austria

eprint.iacr.org/2018/077

M E T R A S 7 . 7 M
slide-2
SLIDE 2

Security

Security Game Adversary

1

slide-3
SLIDE 3

Security

Security Game Adversary

1

slide-4
SLIDE 4

Security

Security Game Adversary A's resources and advantage

1

slide-5
SLIDE 5

Proofs of Security

Simplicity Precision

2

slide-6
SLIDE 6

Proofs of Security

Asymptotic Proofs Simplicity Precision

2

slide-7
SLIDE 7

Proofs of Security

Asymptotic Proofs Concrete Security Simplicity Precision

2

slide-8
SLIDE 8

Proofs of Security

Asymptotic Proofs Concrete Security Bit Security Simplicity Precision

2

slide-9
SLIDE 9

Proofs of Security

Asymptotic Proofs Concrete Security Bit Security Simplicity Precision A's resources A's advantage

2

slide-10
SLIDE 10

Adversarial Advantage

3

slide-11
SLIDE 11

Adversarial Advantage

1) Search game:

3

slide-12
SLIDE 12

Adversarial Advantage

1) Search game: 2) Decision game:

3

slide-13
SLIDE 13

Adversarial Advantage

1) Search game: 2) Decision game:

A's resources A's advantage constant

3

slide-14
SLIDE 14

Adversarial Advantage

1) Search game: 2) Decision game: A's resources A's advantage not constant

A's resources A's advantage constant

3

slide-15
SLIDE 15

Adversarial Advantage

1) Search game: 2) Decision game: A's resources A's advantage not constant no bit secure PRG:

A's resources A's advantage constant

3

slide-16
SLIDE 16

Adversarial Advantage, contd.

4

slide-17
SLIDE 17

Adversarial Advantage, contd.

[HILL'99]

4

slide-18
SLIDE 18

Adversarial Advantage, contd.

[HILL'99]

4

slide-19
SLIDE 19

Adversarial Advantage, contd.

[HILL'99] [GL'89,L'93]

4

slide-20
SLIDE 20

Adversarial Advantage, contd.

[HILL'99] [GL'89,L'93]

4

slide-21
SLIDE 21

Adversarial Advantage, contd.

[HILL'99] [GL'89,L'93]

4

slide-22
SLIDE 22

Adversarial Advantage, contd.

[HILL'99] [GL'89,L'93]

4

slide-23
SLIDE 23

Adversarial Advantage, contd.

[HILL'99] [GL'89,L'93]

4

slide-24
SLIDE 24

Adversarial Advantage, contd.

[HILL'99] [GL'89,L'93]

4

slide-25
SLIDE 25

General Definition

5

slide-26
SLIDE 26

General Definition

  • unify search and decision games

5

slide-27
SLIDE 27

General Definition

  • unify search and decision games
  • characterize information gain of A

5

slide-28
SLIDE 28

General Definition

  • unify search and decision games
  • characterize information gain of A
  • specialize to search and decision games

5

slide-29
SLIDE 29

General Definition

  • unify search and decision games
  • characterize information gain of A
  • specialize to search and decision games

"right" advantage:

5

slide-30
SLIDE 30

General Definition

  • unify search and decision games
  • characterize information gain of A
  • specialize to search and decision games

"right" advantage: Search

5

slide-31
SLIDE 31

General Definition

  • unify search and decision games
  • characterize information gain of A
  • specialize to search and decision games

"right" advantage: Search Decision

5

slide-32
SLIDE 32

Security Reductions: One-Way vs Pseudorandom

OW PR

6

slide-33
SLIDE 33

Security Reductions: One-Way vs Pseudorandom

OW PR

6

slide-34
SLIDE 34

Security Reductions: One-Way vs Pseudorandom

OW PR bit secure OWF implies GL hardcore bit is bit pseudorandom [L'93]

6

slide-35
SLIDE 35

Security Reductions: One-Way vs Pseudorandom

OW PR bit secure OWF implies GL hardcore bit is bit pseudorandom [L'93]

6

slide-36
SLIDE 36

Security Reductions: One-Way vs Pseudorandom

OW PR bit secure OWF implies GL hardcore bit is bit pseudorandom [L'93] bit secure PRG is also bit secure OWF

6

slide-37
SLIDE 37

Security Reductions: Further Results

7

slide-38
SLIDE 38

Security Reductions: Further Results

  • Encryption: IND implies OW

7

slide-39
SLIDE 39

Security Reductions: Further Results

  • Hybrid Argument
  • Encryption: IND implies OW

7

slide-40
SLIDE 40

Security Reductions: Further Results

  • Hybrid Argument
  • Security for Approximate Samplers

with Less Precision

  • Encryption: IND implies OW

7