Undeniable signature scheme based over group ring

详细信息    查看全文

• 作者：Neha Goel ; Indivar Gupta ; M. K. Dubey…
• 关键词：Conjugacy Search Problem ; Discrete Logarithm Problem ; Group ring ; Undeniable signatures
• 刊名：Applicable Algebra in Engineering, Communication and Computing
• 出版年：2016
• 出版时间：December 2016
• 年：2016
• 卷：27
• 期：6
• 页码：523-535
• 全文大小：412 KB
• 刊物类别：Computer Science
• 刊物主题：Symbolic and Algebraic Manipulation
  Computer Hardware
  Theory of Computation
  Artificial Intelligence and Robotics
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1432-0622
• 卷排序：27

文摘

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.