A reduction of security notions in designated confirmer signatures

DOI10.1016/j.tcs.2015.12.025zbMath1361.94047OpenAlexW2216901882WikidataQ115036530 ScholiaQ115036530MaRDI QIDQ2634663

Yingjie Xia, Xuejiao Liu, Guilin Wang, Fubiao Xia

Publication date: 18 February 2016

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

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

zbMATH Keywords

security reductiondesignated confirmer signaturefully verification

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Pairings for cryptographers
• Short signatures from the Weil pairing
• Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
• Security Analysis of the Strong Diffie-Hellman Problem
• Designated Confirmer Signatures Revisited
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs
• On the Generic and Efficient Constructions of Secure Designated Confirmer Signatures
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A reduction of security notions in designated confirmer signatures