作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (24): 132-134. doi: 10.3969/j.issn.1000-3428.2006.24.047

• 安全技术 • 上一篇    下一篇

隐文加密系统中的隐文B+树加密索引方法

钱景辉   

  1. (南京工业大学信息科学与工程学院,南京210009)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-12-20 发布日期:2006-12-20

Index Method of Steg B+-tree in Steganography Systems

QIAN Jinghui   

  1. (College of Information Science and Engineering, Nanjing University of Technology, Nanjing 210009)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-12-20 Published:2006-12-20

摘要: 传统方法使用对文件或整个磁盘进行加密来保护数据信息,加密后的信息本身无法隐藏自身的存在,文件本身的存在会促使感兴趣的攻击者破解加密信息。在某些情况下攻击者可以使用强迫手段迫使文件的主人公开他的加密密钥,这使得复杂的加密技术变得毫无意义。该文介绍了一种着重于隐藏数据存在性的加密手段——隐文加密,对重要文件的存储进行加密,该方法采用隐文B+树建立Unix系统文件索引,通过隐藏表将隐文B+树索引隐蔽起来,使攻击者无法知道重要信息的存在,保障了信息的安全性。

关键词: 隐文B+树索引, 隐文加密, 隐藏表

Abstract: Traditional cryptographic technologies can protect digital information by encrypting the file or the whole disk volume. The encrypted cipher text itself is the evidence of existence of the valuable data, which could prompt a motivated attacker to circumvent the protection. Cryptography also provides little protection against instruments that force the owner of the data to unlock it. This paper presents steg B+-tree which uses steganographic technologies to overcome weakness by hiding the existence of the data so that an adversary gets no information about whether the protected data ever exists without correct object name and access key.

Key words: Steg B+-tree index, Steganography, Hidden table