Efficient quantum blind signature for quantum networks

Hongfeng Zhu, Yuanle Zhang, Zexi Li

Hong Lai, Mingxing Luo, Josef Pieprzyk +3 more

Wei Li, Ronghua Shi, Ying Guo

Mengjiao Yang, Dongmei Ke, Fengyin Li

The methods of network attacks are becoming more and more diverse In high-speed networks, and protecting private data is a key issue for users’ security. Proxy blind signature technology combines proxy and blind signature technology to achieve signature transitivity and message confidentiality. However, current signature schemes will not be secure in quantum environments. Meanwhile, the certificate storage of the existing scheme is relatively complicated. Therefore, to avoid the need for certificates and resist quantum attacks, this paper proposes an anti-quantum identity-based proxy blind signature (ID-Proxy-BS) scheme on lattice. This ID-Proxy-BS scheme improves the efficiency of signature through Gaussian distribution and sampling techniques. Security analysis shows that the scheme satisfies correctness, efficiency, blindness, and unforgeability.

XU Guang-xian, Ni Jibei, Ma Fei

The intermediate communication nodes are allowed by network coding to encode the received data. Moreover, it has been confirmed that the upper limit of the communication network capacity can be achieved, which is conducive to improving the throughput of the communication network, but it is vulnerable to pollution attacks when the classic channels are used as the auxiliary resources. Although the quantum network coding can be used to increase the transmission speed of quantum bits per unit time based on the existing channels, the same security problems have arisen from quantum network coding in terms of the pollution attacks. In this paper, based on the anti-pollution characteristics of quantum signatures, a kind of quantum blind signature network coding scheme is put forward. Since various performances of the signature added in the process of data transmission will be improved, the blind signature is added at the intermediate node of the secure butterfly network and the data has been blinded by means of the quantum entanglement characteristics, yet the data of the intermediate node data packet has not been changed. According to the analysis results, it has defended against pollution attacks with high fidelity, low resource consumption, and low rate area.

Hongfei Zhu, Yu‐an Tan, Liehuang Zhu +2 more

Fog computing extends the cloud computing to the network edge and allows deploying a new type of semioffline services, which can provide real‐time transactions between two entities, while the central cloud server is offline and network edge devices are online. For an e‐payment system and e‐voting with such feature, proxy blind signature is a cornerstone to protect users’ privacy. However, the signature based on number theorem, such as hard mathematical problems on factoring problem, discrete logarithm problem, and bilinear pairings, cannot defeat quantum computers attack. Meanwhile, these schemes need to depend on complex public key infrastructure. Thus, we construct an identity‐based proxy blind signature scheme based on number theorem research unit lattice, which can defeat quantum computers attack and does not need to depend on public key infrastructure. The security of the proposed scheme is dependent on Ring‐Small Integer Solution problem over number theorem research unit lattice. The proposed scheme meets the properties of blind signature and proxy signature. Then we compare the proposed scheme with other existing proxy blind signature schemes; the result shows that the proposed scheme outperforms ZM scheme except in proxy signer’s signature size and can be more secure than TA scheme and MMHP scheme.