Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, t...Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications.展开更多
隐私保护交集算法(Private Set Intersection,PSI)可以在保护参与双隐私的情况下实现数据交集部分的计算,是数据共享领域一种重要的应用场景。传统的PSI算法需要依赖不经意传输等较为复杂的密码算法,无法实现对大数据集合的有效计算。...隐私保护交集算法(Private Set Intersection,PSI)可以在保护参与双隐私的情况下实现数据交集部分的计算,是数据共享领域一种重要的应用场景。传统的PSI算法需要依赖不经意传输等较为复杂的密码算法,无法实现对大数据集合的有效计算。依赖云计算中心辅助的算法效率较高,但它的安全性依赖于对计算中心的信任。因此,提出了一种基于区块链的隐私保护交集算法BPSI,可避免对云计算中心信任的假设,同时提供较高的计算效率。展开更多
基金Supported by the National Natural Science Foundation of China(6127117)
文摘Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications.
文摘隐私保护交集算法(Private Set Intersection,PSI)可以在保护参与双隐私的情况下实现数据交集部分的计算,是数据共享领域一种重要的应用场景。传统的PSI算法需要依赖不经意传输等较为复杂的密码算法,无法实现对大数据集合的有效计算。依赖云计算中心辅助的算法效率较高,但它的安全性依赖于对计算中心的信任。因此,提出了一种基于区块链的隐私保护交集算法BPSI,可避免对云计算中心信任的假设,同时提供较高的计算效率。
