Undeniable signature scheme based over group ring

作者：Goel Neha^*; Gupta Indivar; Dubey M K; Dass B K

来源：Applicable Algebra in Engineering Communication and Computing, 2016, 27(6): 523-535.

DOI：10.1007/s00200-016-0293-8

• Conjugacy Search Problem
• Discrete Logarithm Problem
• Group ring
• Undeniable signatures

D. Chaum and H. van Antwerpen first introduced the concept of an undeniable signature scheme where the verification step is verified with the signer's co-operation. In this paper, first we discuss a combination of Discrete Logarithm Problem (DLP) and Conjugacy Search Problem (CSP) analysing its security. Then we propose an undeniable signature scheme in a non-abelian group over group ring whose security relies on difficulty of the combination of the DLP and the CSP. The complexity and security of our proposed scheme has also been discussed.

• 出版日期2016-12