基于身份加密的分布式在线社会网络隐私保护方法研究

发布时间：2018-09-18 15:48

【摘要】：近年来，分布式在线社会网络DOSNs（Distributed Online Social Networks）作为一种新型的在线社会网络结构备受关注。它在一定程度上克服了集权式管理的缺点，但在分布式在线社会网络中用户隐私信息分散性强，导致隐私信息更易泄露。本文的选题着眼于设计分布式在线社会网络中的隐私保护方案，具有理论意义和实践价值。为解决在无安全通道情况下的安全加密问题，本文改进了基于身份加密的方案，为分布式在线社会网络提出了一种基于身份加密在线/离线方案，从而减轻了网络负担和计算量。本文在分析基于身份加密IBE（Identity-based Encryption）的秘密共享SS（SecretSharing）方案的基础上，为基于身份加密的分布式在线社会网络设计了一种基于密钥隐私机构KPA（Key Privacy Authority）和隐私密友PC（Privacy Chum）的秘密共享在线/离线隐私保护方案。在此方案中，密钥隐私机构和隐私密友都不能通过效仿网络中的用户获取用户密钥。为了保证PC的可靠性，本文采用拜占庭容错协议BFT（Byzantine faulttolerance）来对其可靠性进行验证。新方案的主要思想是将隐私保护方案分为两个阶段——离线阶段和在线阶段。离线阶段不需要用户身份和明文，复杂的计算由KPA预先完成形成离线密文；在线阶段获取了明文和用户身份后只需进行简单整数乘法运算就可加密明文并发布密钥，由此极大地降低了网络的负载，，节省时间和资源。本文不仅给出了两种隐私保护方案的具体实现，同时还对方案进行了仿真，详细分析了仿真结果。仿真实验结果表明此方案在保证网络安全性的前提下，高效且可行性强，并能支持大规模的在线社会网络。
[Abstract]:In recent years, distributed online social network (DOSNs (Distributed Online Social Networks) has attracted much attention as a new online social network structure. To some extent, it overcomes the shortcomings of centralized management, but in the distributed online social network, the privacy information of users is dispersive, which leads to the privacy information more easily leaked. This paper focuses on the design of privacy protection scheme in distributed online social network, which has theoretical significance and practical value. In order to solve the problem of secure encryption in the absence of secure channels, this paper improves the ID-based encryption scheme, and proposes an ID-based online / offline scheme for distributed online social networks. Thus reducing the network burden and calculation. This paper analyzes the secret sharing SS (SecretSharing) scheme based on identity encryption IBE (Identity-based Encryption). A secret sharing online / offline privacy protection scheme based on KPA (Key Privacy Authority) and PC (Privacy Chum) is designed for the distributed online social network based on identity encryption. In this scheme, neither the key privacy agency nor the privacy confidant can obtain the user key by imitating the users in the network. In order to ensure the reliability of PC, this paper uses Byzantine fault-tolerant protocol BFT (Byzantine faulttolerance) to verify its reliability. The main idea of the new scheme is to divide the privacy protection scheme into two phases: offline and online. In the off-line phase, the user identity and plaintext are not required. The complex calculation is completed by KPA in advance to form an off-line ciphertext. After obtaining the clear text and the user identity in the online stage, the plaintext can be encrypted and the key can be published only by simple integer multiplication. This greatly reduces the network load and saves time and resources. This paper not only gives the implementation of two privacy protection schemes, but also simulates the scheme, and analyzes the simulation results in detail. The simulation results show that the proposed scheme is efficient and feasible under the premise of guaranteeing network security and can support large-scale online social networks.
【学位授予单位】：中南民族大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP393.08

【相似文献】