• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on dependable and secure computing >A Logical Key Hierarchy Based Approach to Preserve Content Privacy in Decentralized Online Social Networks
【24h】

A Logical Key Hierarchy Based Approach to Preserve Content Privacy in Decentralized Online Social Networks

机译：基于逻辑的基于层次结构，以在分散的在线社交网络中保护内容隐私的方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Distributed Online Social Networks (DOSNs) have been proposed to shift the control over user data from a unique entity, the online social network provider, to the users of the DOSN themselves. In this paper we focus on the problem of preserving the privacy of the contents shared to large groups of users. In general, content privacy is enforced by encrypting the content, having only authorized parties being able to decrypt it. When efficiency has to be taken into account, new solutions have to be devised that: i) minimize the re-encryption of the contents published in a group when the composition of the group changes; and, ii) enable a fast distribution of the cryptographic keys to all the members of a group, each time a set of users is removed from or added to the group by the group owner. Current solutions fall short in meeting the above criteria, while our approach requires only encryption operations when a user is removed from a group (where is an input parameter of the system), and when a user joins the group. The effectiveness of our approach is evaluated through simulations based on a real online social network.
机译：已经提出分布式在线社交网络（DOSN）将对用户数据的用户数据转移到DOSN本身的用户的用户数据。在本文中，我们专注于保留对大型用户分享内容的隐私的问题。通常，通过加密内容来强制执行内容隐私，只有授权方能够解密它。当必须考虑效率时，必须设计新的解决方案：i）当组的组成变化时，最大限度地减少在组中发布的内容的重新加密;并且，ii）每次由组所有者删除一组用户或添加到组时，都会将加密键快速分布到组的所有成员。当前解决方案在满足上述标准时不足，而我们的方法只需要从组中删除用户时的加密操作（系统的输入参数），并且当用户加入该组时。我们的方法的有效性通过基于真正的在线社交网络的模拟来评估。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号