Short fail-stop signature scheme based on factorization and discrete logarithm assumptions

DOI10.1016/j.tcs.2008.10.025zbMath1162.94007OpenAlexW1986492283MaRDI QIDQ1006046

Willy Susilo

Publication date: 17 March 2009

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

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

zbMATH Keywords

unconditional securityauthenticationcomputational securityfail-stop signaturesproof of forgeryshort

Mathematics Subject Classification ID

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

Cites Work

• An interactive identification scheme based on discrete logarithms and factoring
• Digital signature schemes: general framework and fail-stop signatures
• Fail-stop blind signature scheme design based on pairings
• Comment fail-stop blind signature scheme design based on pairings
• Efficient Generic On-Line/Off-Line Signatures Without Key Exposure
• New directions in cryptography
• Fail-Stop Signatures
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Provably Secure Pairing-Based Convertible Undeniable Signature with Short Signature Length
• Information and Communications Security
• Financial Cryptography and Data Security
• Public Key Cryptography – PKC 2004
• Selecting cryptographic key sizes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Short fail-stop signature scheme based on factorization and discrete logarithm assumptions