OffLine Keyword Guessing Attacks on Recent Keyword Search Schemes over Encrypted Data

1
Off-Line Keyword Guessing Attacks on Recent
Keyword Search Schemes over Encrypted Data

• J. Byun et al. In Secure Data Management, LNCS
  4165, 2006.
• Presenter Yu-Chi Chen

2
Outline

• Introduction
• Analysis of Boneh et al. scheme
• Analysis of Park et al. scheme1
• Analysis of Park et al. scheme2
• Conclusion

3
Intro.

• Off-Line Keyword Guessing Attacks similar to
  chosen keyword attack.
• Guessing dictionary attack

4
Intro.

• Recent Keyword Search SchemesBonehs PEKSPark
  1,2 PECK

5
Outline

• Introduction
• Analysis of Boneh et al. scheme
• Analysis of Park et al. scheme1
• Analysis of Park et al. scheme2
• Conclusion

6
Analysis of Boneh

• Boneh et al. scheme(the most early public key
  search scheme)

7
Analysis of Boneh

• First Attacker A gets a valid trapdoor
• Then selects
• Tests as follow

Public key
8
Outline

• Introduction
• Analysis of Boneh et al. scheme
• Analysis of Park et al. scheme1
• Analysis of Park et al. scheme2
• Conclusion

9
Analysis of Park1

• Park et al. scheme1(the most early public key
  conjunctive search scheme)

10
Analysis of Park1

• Attacker first gets
• Then computes
• Test as follow

11
Outline

• Introduction
• Analysis of Boneh et al. scheme
• Analysis of Park et al. scheme1
• Analysis of Park et al. scheme2(?)
• Conclusion

12
Conclusion

• No method that can defense off-line guessing
  attack, since everyone can encrypt.
• Since scholars purposed the off-line guessing
  attack, many searchable encryption schemes are
  often based on symmetrical encryption system.