SKC-CCCO: an encryption algorithm for quantum group signature

Feng, Yanyan; Zhou, Jian; Li, Jie; Wei, Zhao; Shi, Jinjing; Shi, Ronghua; Li, Wei

doi:10.1007/s11128-022-03664-w

Cited by 11 publications

(4 citation statements)

References 66 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…量子群签名作为经典群签名的量子对应物, 由Wen等人 [17] 首次提出. 此后, 不同类型的量子群签名算法被相继提出, 一类基于量子隐形传态 [13,[18][19][20][21] , 另一类则基于对称加密 [22,23] . 门限群签名是群签名的一个特殊分支, 适用于群组中不存在互相信任的参与方的场景.…”

Section: 群签名是数字签名的一种变体最早由Chaum和vanunclassified

“…由于硬币量子游走可以通过操控不同类型的硬币算子以生成不同的量子纠缠态, 因此它可以作为一种实现隐形传态技术的有效方式. 该技术可以从纠缠态的生成与测量方面提高隐形传态的效率, 已经在量子签名领域获得关注并取得了一些成果 [19,[34][35][36] . 此外, 硬币量子游走可以实现一种支持多方参与的广义隐形传态技术 [26,28] , 该技术为量子门限群签名的实现铺平了道路.…”

Section: 群签名是数字签名的一种变体最早由Chaum和vanunclassified

See 1 more Smart Citation

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

Tao,

PengLin,

YuChen

et al. 2024

Sci. Sin.-Phys. Mech. Astron.

View full text Add to dashboard Cite

Section: 群签名是数字签名的一种变体最早由Chaum和vanunclassified

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

Tao,

PengLin,

YuChen

et al. 2024

Sci. Sin.-Phys. Mech. Astron.

View full text Add to dashboard Cite

“…In terms of signature schemes designed based on quantum computing, Feng et al. [ 18 ] proposed a new quantum group signature scheme to enhance the non-repudiation of signatures. Lu et al.…”

Section: Introductionmentioning

confidence: 99%

Identity-Based Proxy Signature with Message Recovery over NTRU Lattice

Zhou

Zhang

2023

Entropy

View full text Add to dashboard Cite

Proxy signature is one of the important primitives of public-key cryptography and plays an essential role in delivering security services in modern communications. However, existing post quantum proxy signature schemes with larger signature sizes might not be fully practical for some resource-constrained devices (e.g., Internet of Things devices). A signature scheme with message recovery has the characteristic that part or all of the message is embedded in the signature, which can reduce the size of the signature. In this paper, we present a new identity-based proxy signature scheme over an NTRU lattice with message recovery (IB-PSSMR), which is more efficient than the other existing identity-based proxy signature schemes in terms of the size of the signature and the cost of energy. We prove that our scheme is secure under a Short Integer Solution (SIS) assumption that is as hard as approximating several worst-case lattice problems in the random oracle model. We also discussed some application scenarios of IB-PSSMR in blockchain and Internet of Things (IOT). This paper provides a new idea for the design of lattice signature schemes in low resource constrained environments.

show abstract

“…The continuous-time variant is described using only the position Hilbert space of the walker, whereas, the discrete-time variant requires an additional internal Hilbert space, dubbed the coin space of the walker. Continuous-time formalism, for example, has been effectively used in spatial search protocols [50], in defining graph kernels [51],encryption algorithms [52], and in modelling of energy transfer in photosynthesis [53]. The discrete-time quantum walk (DTQW) formalism offers the possibility of engineering the dynamics of the walker with more control, due to an additional degree of freedom provided by the coin Hilbert space.…”

Section: Introductionmentioning

confidence: 99%

Quantum walk-based protocol for secure communication between any two directly connected nodes on a network

Chawla,

Ajith,

Chandrashekar

2023

Phys. Scr.

View full text Add to dashboard Cite

The utilization of quantum entanglement as a cryptographic resource has superseded conventional approaches to secure communication. Security and fidelity of intranetwork communication between quantum devices is the backbone of a quantum network. This work presents an algorithm that generates entanglement between any two directly connected nodes of a quantum network to be used as a resource to enable quantum communication across that pair in the network. The algorithm is based on a directed discrete-time quantum walk and paves the way for private inter-node quantum communication channels in the network. We also present the simulation results of this algorithm on random networks generated from various models. We show that after implementation, the probability of the walker being at all nodes other than the source and target is negligible and this holds independent of the random graph generation model. This constitutes a viable method for the practical realisation of secure communication over any random network topology.

show abstract

SKC-CCCO: an encryption algorithm for quantum group signature

Cited by 11 publications

References 66 publications

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

Arbitrated quantum (t,n) threshold group signature scheme based on multi-coin quantum walk

Identity-Based Proxy Signature with Message Recovery over NTRU Lattice

Quantum walk-based protocol for secure communication between any two directly connected nodes on a network

Contact Info

Product

Resources

About