BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks

azizi S, Ashouri-Talouki M, mala H. An Efficient and Secure Frequent Multiparty Summation protocol. JSDP. 2019; 15 (4) :31-40

URL: http://jsdp.rcisp.ac.ir/article-1-649-en.html

URL: http://jsdp.rcisp.ac.ir/article-1-649-en.html

**In the first phase, each user****selects a random number****, computes and publishes the vectors****of****components where each component****of****is of****form****. After it,****computes the vector****, such that each component****is of****form.****In the second phase, users jointly and securely compute their AV-net (Anonymous Veto network) masks and the Burmester-Desmedt (BD) conference key. To do so, each user****selects two random numbers****and****and publishes****to the group. Then,****computes and sends****to the group. Then, each user is able to compute****and****;****is the AV-net mask of****and****is the conference key.****In the third phase, using the AV-net mask and the conference key, group members securely and collaboratively compute the summation of their random numbers****,****. To achieve this, each user broadcasts****to the group, where****is the AV-net mask of****and****is the****’s portion of the conference key. Multiplying all****s results in canceling the AV-net mask and getting the value of****. Then each member is able to compute****by the following Eq.:**

Type of Study: Applicable |
Subject:
Paper

Received: 2016/09/2 | Accepted: 2019/01/9 | Published: 2019/03/8 | ePublished: 2019/03/8

Received: 2016/09/2 | Accepted: 2019/01/9 | Published: 2019/03/8 | ePublished: 2019/03/8

Send email to the article author