Decoy Password Vaults: At Least as Hard as Steganography?

被引:2
作者
Pasquini, Cecilia [1 ,2 ]
Schoettle, Pascal [1 ,2 ]
Boehme, Rainer [1 ,2 ]
机构
[1] Univ Innsbruck, Dept Comp Sci, Innsbruck, Austria
[2] Univ Munster, Dept Informat Syst, Munster, Germany
来源
ICT SYSTEMS SECURITY AND PRIVACY PROTECTION, SEC 2017 | 2017年 / 502卷
关键词
D O I
10.1007/978-3-319-58469-0_24
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cracking-resistant password vaults have been recently proposed with the goal of thwarting offline attacks. This requires the generation of synthetic password vaults that are statistically indistinguishable from real ones. In this work, we establish a conceptual link between this problem and steganography, where the stego objects must be undetectable among cover objects. We compare the two frameworks and highlight parallels and differences. Moreover, we transfer results obtained in the steganography literature into the context of decoy generation. Our results include the infeasibility of perfectly secure decoy vaults and the conjecture that secure decoy vaults are at least as hard to construct as secure steganography.
引用
收藏
页码:356 / 370
页数:15
相关论文
共 17 条
[1]  
[Anonymous], 2012, THESIS
[2]  
[Anonymous], P 2 INT WORKSH DIG W
[3]  
Böhme R, 2009, LECT NOTES COMPUT SC, V5806, P15, DOI 10.1007/978-3-642-04431-1_2
[4]  
Bojinov H, 2010, LECT NOTES COMPUT SC, V6345, P286, DOI 10.1007/978-3-642-15497-3_18
[5]  
Cachin C, 1998, LECT NOTES COMPUT SC, V1525, P306
[6]  
Chatterjee R., 2016, IEEE SECUR PRIV, P481
[7]   Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes [J].
Filler, Tomas ;
Judas, Jan ;
Fridrich, Jessica .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2011, 6 (03) :920-935
[8]  
Florencio D., 2007, ACM INT C WORLD WID, P656
[9]  
Fridrich J, 2004, LECT NOTES COMPUT SC, V3200, P67
[10]  
Fridrich J., 2009, INFORM HIDING