Qassim Al Mahmoud

Work place: Faculty of Mathematics and Computer Science, the University of Bucharest, Romania



Research Interests: Computer Science & Information Technology, Information Security, Information-Theoretic Security


Qassim Al Mahmoud received his B.S. degree in Mathematics and Computer Science from University of Baghdad in Iraq, 2002. He received his M.S. degree in Information Technology from University of Arab Academic for accounting and Information Technology in Jordan, 2007. He received a Ph.D. degree in the Information Security, Faculty of Mathematics and Computer Science, University of Bucharest, Romania. Now he is Assistance Professor of computer science at King Khalid University.

Author Articles
A Novel Verifiable Secret Sharing with Detection and Identification of Cheaters' Group

By Qassim Al Mahmoud

DOI:, Pub. Date: 8 Apr. 2016

Shamir's (t, n)-SS scheme is very simple to generate and distribute the shares for a secret among n participants by using such polynomial. We assume the dealer a mutually trust parity when he distributes the shares to participants securely. In addition when the participants pooling their shares in the secret reconstruction phase a honest participants can always reconstruct the real secret by Pooling areal shares. The property of verifiability enables participants to verify that their shares are consistent. Tompa and Woll suggested an important cheating scenario in Shamir's secret reconstruction. They found a solution to remove a single cheater with small probability, unfortunately, their scheme is based on computational assumptions. In addition each participants will receive a huge number of shares. In this paper we will construct scheme to be information-theoretically secure verifiable secret sharing which does not contain a single cheater. On the other hand we will eliminate these problems in Tompa and Woll scheme. Our proposed scheme is not only to detect and identify a cheater, but to prevent him from recovering the secret when the honest participants cannot.

[...] Read more.


DOI:, Pub. Date: 20 Jun. 2023

[...] Read more.
Other Articles