Short and efficient convertible undeniable signature schemes without random oracles

DOI10.1016/J.TCS.2013.01.010zbMath1260.94066OpenAlexW1984887081MaRDI QIDQ1945933

Qiong Huang, Duncan S. Wong

Publication date: 17 April 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.010

zbMATH Keywords

standard modelidentity-based encryptionsignature schemeconvertible undeniable signaturestrong Diffie-Hellman assumption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Ambiguous One-Move Nominative Signature Without Random Oracles ⋮ Digital Signatures

This page was built for publication: Short and efficient convertible undeniable signature schemes without random oracles