A Generalized Quantum Protocol for Secure Multiparty Summation

Sutradhar, Kartick; Om, Hari

doi:10.1109/tcsii.2020.2989447

Cited by 30 publications

(22 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2020, Sutradhar [34] cooperated with Om to present a generalized QSMS protocol, which needs to use entangled state and multiple quantum operations: QFT, SUM operation, and Pauli operation. Later, Cai et al [35] pointed out that this protocol has a security vulnerability due to the lack of eavesdropping detection during particle transmission.…”

Section: Comparisons and Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption ^*

Luo,

Li,

Liu

et al. 2024

J. Phys. A: Math. Theor.

View full text Add to dashboard Cite

The research of quantum secure multiparty computation is a subject of great importance in modern cryptography. In this study, we construct a veriﬁable quantum protocol for dynamic secure multiparty summation based on the cyclic property of d-level MUBs. Our protocol can realize dynamic parameter update in the aspect of members and secret inputs, improving the practicality of the protocol. Moreover, a veriﬁcation mechanism for result checking by applying ElGamal homomorphic encryption is given, and further enables the detectability of cheating behaviors, making our protocol safer. The security analysis proves the proposed protocol not only can resist a range of typical attacks from outside and inside, but also is secure against dishonest revoked participant attack which has been neglected in previous dynamic quantum summation protocols. From a theoretical perspective, compared with existing summation protocols, the protocol provides better practicability, higher privacy protection, and higher efﬁciency.

show abstract

Section: Comparisons and Discussionmentioning

confidence: 99%

“…Liu and Ma [18] Li et al [19] Sutradhar and Om [34] Zhang et al [32] Yi et al [33] Li et al [23] Ours -: not involving this feature or attack method.…”

Section: Protocolsmentioning

confidence: 98%

Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption ^*

Luo,

Li,

Liu

et al. 2024

J. Phys. A: Math. Theor.

View full text Add to dashboard Cite

show abstract

“…For details on secret sharing schemes we refer to Gopalakrishnan and Stinson, 4 Beimel 5 Koukouvinos et al 6 Changyuan, 7 Cramer et al 8 Huaixi et al 9 and Stinson and Wei, 10 among others. The proposed protocol can also be used to build the quantum protocols, see Sutradhar and Om 11‐19 …”

Section: Introductionmentioning

confidence: 99%

Perfect secret sharing schemes from combinatorial squares

Saurabh

Sinha

2022

Security and Privacy

View full text Add to dashboard Cite

Chaudhry et al. proposed perfect secret sharing schemes from combinatorial squares called Room squares based on certain balanced incomplete block designs. Their protocol is efficient and secure but it is based on a Room square of order r which exists if and only if r is odd and r ≠ 3, 5. Here, we have proposed the schemes from Room squares based on group divisible designs which are a broader class of designs.

show abstract

“…The dealer distributes the shares of a secret among n participants. When the dealer requires to retrieve the original secret, the t (threshold) number of participants will work together to retrieve it 8 – 11 . The quantum secret sharing can be used in various applications 12 – 20 , namely, secure multiparty summation 21 , 22 , multiplication 23 , comparison, sorting, voting, etc., as it preserves the secret from getting lost, damaged, or changed 24 – 26 .…”

Section: Introductionmentioning

confidence: 99%

Enhanced (t, n) threshold d-level quantum secret sharing

Sutradhar

2021

Sci Rep

Self Cite

View full text Add to dashboard Cite

The quantum secret sharing is an essential and fundamental technique for sharing a secret with the all participants in quantum cryptography. It can be used to design many complex protocols such as secure multiparty summation, multiplication, sorting, voting, etc. Recently, Song et al. have discussed a quantum protocol for secret sharing, which has (t, n) threshold approach and modulo d, where t and n denote the threshold number of participants and total number of participants, respectively. Kao et al. point out that the secret in the Song et al.’s protocol cannot be reconstructed without other participants’ information. In this paper, we discuss a protocol that overcomes this problem.

show abstract

A Generalized Quantum Protocol for Secure Multiparty Summation

Cited by 30 publications

References 17 publications

Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption ^*

Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption ^*

Perfect secret sharing schemes from combinatorial squares

Enhanced (t, n) threshold d-level quantum secret sharing

Contact Info

Product

Resources

About

A Generalized Quantum Protocol for Secure Multiparty Summation

Cited by 30 publications

References 17 publications

Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption *

Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption *

Perfect secret sharing schemes from combinatorial squares

Enhanced (t, n) threshold d-level quantum secret sharing

Contact Info

Product

Resources

About

Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption ^*

Verifiable quantum protocol for dynamic secure multiparty summation based on homomorphic encryption ^*