Scholarlink

<p>Named data networking (NDN) is considered a novel architecture of the next-generation Internet that delivers content by names. However, the human-readable name may potentially leak users’ privacy. Existing solutions have focused on encrypting to protect privacy, but they are neither efficient in the case of one publisher and multiple subscribers nor successful in supporting prefix matching. To address the above challenges, we propose an efficient and flexible name scheme with privacy preservation, which combines message-driven encryption with Bloom Filter. Firstly, message-driven encryption is utilized to protect name privacy, thus supporting efficient and secure encrypted name matching. Secondly, each name is divided into multiple components, and then each component is encrypted separately to support flexible prefix matching. Lastly, the technology of Bloom Filter with random numbers is explored to improve the efficiency and accuracy of name matching. Security and performance analysis shows that the proposed scheme effectively enhances the efficiency and accuracy of data matching while protecting name privacy.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Private, efficient, and flexible: protecting names based on message-derived encryption in named data networking

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年3月19日

查看全文
  • Kai He,
  • Shengyuan Shi,
  • Chunxiao Yin,
  • Hongyan Wan,
  • Jiaoli Shi

摘要

Named data networking (NDN) is considered a novel architecture of the next-generation Internet that delivers content by names. However, the human-readable name may potentially leak users’ privacy. Existing solutions have focused on encrypting to protect privacy, but they are neither efficient in the case of one publisher and multiple subscribers nor successful in supporting prefix matching. To address the above challenges, we propose an efficient and flexible name scheme with privacy preservation, which combines message-driven encryption with Bloom Filter. Firstly, message-driven encryption is utilized to protect name privacy, thus supporting efficient and secure encrypted name matching. Secondly, each name is divided into multiple components, and then each component is encrypted separately to support flexible prefix matching. Lastly, the technology of Bloom Filter with random numbers is explored to improve the efficiency and accuracy of name matching. Security and performance analysis shows that the proposed scheme effectively enhances the efficiency and accuracy of data matching while protecting name privacy.