J. Byun et al. In Secure Data Management, LNCS 4165, 2006. 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 2019/5/29
Outline Introduction Analysis of Boneh et al. scheme Analysis of Park et al. scheme1 Analysis of Park et al. scheme2 Conclusion 2019/5/29
Intro. Off-Line Keyword Guessing Attacks: similar to chosen keyword attack. Guessing: dictionary attack 2019/5/29
Intro. Recent Keyword Search Schemes: Boneh’s PEKS Park 1,2 PECK 2019/5/29
Outline Introduction Analysis of Boneh et al. scheme Analysis of Park et al. scheme1 Analysis of Park et al. scheme2 Conclusion 2019/5/29
Analysis of Boneh Boneh et al. scheme (the most early public key search scheme) 2019/5/29
Analysis of Boneh First Attacker A gets a valid trapdoor Then selects Tests as follow: Public key 2019/5/29
Outline Introduction Analysis of Boneh et al. scheme Analysis of Park et al. scheme1 Analysis of Park et al. scheme2 Conclusion 2019/5/29
Analysis of Park1 Park et al. scheme1 (the most early public key conjunctive search scheme) 2019/5/29
Analysis of Park1 Attacker first gets Then computes Test as follow: 2019/5/29
Outline Introduction Analysis of Boneh et al. scheme Analysis of Park et al. scheme1 Analysis of Park et al. scheme2(略) Conclusion 2019/5/29
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. 2019/5/29