On the security of pairing-based non-interactive designated verifier proofs of undeniable signature schemes

Since the introduction of undeniable signature schemes, various proof systems with different properties and features have been introduced to be incorporated in the structure of undeniable signature schemes. Nonetheless, the non-interactive designated verifier proof system of Jakobsson et al. with it...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Behnia, R., Swee-Huay Heng, Che-Sheng Gan
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Since the introduction of undeniable signature schemes, various proof systems with different properties and features have been introduced to be incorporated in the structure of undeniable signature schemes. Nonetheless, the non-interactive designated verifier proof system of Jakobsson et al. with its distinguishing properties and features was recognized as the most practical proof system. Due to its interesting features, a variation of Jakobsson et al. proof system has been employed in all of the proposed identity-based and certificateless undeniable signature schemes. We analyze the security of the variation of such proof system in the identity-based setting, and present a secure pairing-based non-interactive proof system with complete set of security proofs.
ISSN:1985-5753
DOI:10.1109/STUDENT.2012.6408405