Ambiguous One-Move Nominative Signature Without Random Oracles

DOI10.1007/978-3-319-12160-4_20zbMath1352.94050OpenAlexW2267538038MaRDI QIDQ3193272

Dennis Y. W. Liu, Qiong Huang, Duncan S. Wong

Publication date: 16 October 2015

Published in: Information Security and Cryptology -- ICISC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12160-4_20

zbMATH Keywords

security modelundeniable signaturenominative signaturenon-self-authenticating signature

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Ambiguous One-Move Nominative Signature Without Random Oracles

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient one-move nominative signature scheme
• Short and efficient convertible undeniable signature schemes without random oracles
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Non-transferable User Certification Secure against Authority Information Leaks and Impersonation Attacks
• Pairing-Based Nominative Signatures with Selective and Universal Convertibility
• Ambiguous One-Move Nominative Signature Without Random Oracles
• Programmable Hash Functions and Their Applications
• Ambiguous Optimistic Fair Exchange
• Provably Secure Convertible Nominative Signature Scheme
• One-Move Convertible Nominative Signature in the Standard Model
• Advances in Cryptology – CRYPTO 2004
• Information Security and Privacy
• Advances in Cryptology - CRYPTO 2003
• Formal Definition and Construction of Nominative Signature
• Information Security and Privacy

This page was built for publication: Ambiguous One-Move Nominative Signature Without Random Oracles