A new blind signature based on the discrete logarithm problem for untraceability

DOI10.1016/J.AMC.2004.06.034zbMath1069.94023OpenAlexW1993135935MaRDI QIDQ556120

Cheng-Chi Lee, Wei-Pang Yang, Min-Shiang Hwang

Publication date: 13 June 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.034

zbMATH Keywords

CryptographyBlind signatureCryptanalysisUntraceable

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme ⋮ Comment: A new blind signature based on the discrete logarithm problem for untraceability

Cites Work

• An ElGamal-like cryptosystem for enciphering large messages
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Unnamed Item
• Unnamed Item

This page was built for publication: A new blind signature based on the discrete logarithm problem for untraceability