Provably secure zero knowledge undeniable signature scheme over non-abelian group

Provably secure zero knowledge undeniable signature scheme over non-abelian group

In this paper, we propose a zero knowledge undeniable signature scheme over non-abelian group. Security of the proposed scheme relies on the intractability of Discrete Logarithm Problem with Conjugacy Search Problem (DLCSP) (Goel et al in Appl Algebra Eng Commun Comput 27(6):523–535, 2016). The sche...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Sadhana (Bangalore) 2023-11, Vol.48 (4), Article 253
Hauptverfasser: Goel, Neha, Gupta, Indivar, Dass, B K
Format: Artikel
Sprache:eng
Schlagworte:
Engineering
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose a zero knowledge undeniable signature scheme over non-abelian group. Security of the proposed scheme relies on the intractability of Discrete Logarithm Problem with Conjugacy Search Problem (DLCSP) (Goel et al in Appl Algebra Eng Commun Comput 27(6):523–535, 2016). The scheme is proved to be secure with respect to unforgeability, unimpersonation and invisibility in random oracle model.
ISSN:0973-7677
0973-7677
DOI:10.1007/s12046-023-02296-9