Short and efficient convertible undeniable signature schemes without random oracles
DOI10.1016/J.TCS.2013.01.010zbMATH Open1260.94066OpenAlexW1984887081MaRDI QIDQ1945933FDOQ1945933
Authors: 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
Recommendations
- (Convertible) Undeniable Signatures Without Random Oracles
- Short Undeniable Signatures Without Random Oracles: The Missing Link
- Short Signature and Universal Designated Verifier Signature Without Random Oracles
- Advances in Cryptology - EUROCRYPT 2004
- Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length
- Provably secure convertible undeniable signatures with unambiguity
- Convertible and selectively convertible undeniable signature schemes
- Verifiable encrypted signatures without random oracles
- Practical verifiably encrypted signatures without random oracles
identity-based encryptionstandard modelsignature schemeconvertible undeniable signaturestrong Diffie-Hellman assumption
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cited In (17)
- Provably secure convertible user designating confirmer partially blind signatures
- New Approach for Selectively Convertible Undeniable Signature Schemes
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length
- Universally Convertible Directed Signatures
- A Generic Construction for Universally-Convertible Undeniable Signatures
- Provably secure convertible undeniable signatures with unambiguity
- Time-selective convertible undeniable signatures with short conversion receipts
- Ambiguous one-move nominative signature without random oracles
- Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures
- (Convertible) Undeniable Signatures Without Random Oracles
- Digital signatures
- New convertible undeniable signature schemes
- Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
- Relation between verifiable random functions and convertible undeniable signatures, and new constructions
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
- Short 2-Move Undeniable Signatures
This page was built for publication: Short and efficient convertible undeniable signature schemes without random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945933)
