How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A course in computational algebraic number theory
A course in computational algebraic number theory
Proceedings of the 4th ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Baghdad Method for Calculating Multiplicative Inverse
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
| Hi-index | 0.00 |
Since the invention of the first idea of digital signatures relied on public key algorithms many properties are added, and numerous novel schemes are developed. Besides this grow, a novel idea in identification schemes relied on public key algorithms is also presented, that is zero knowledge proof of identity. However, along with this development many remarkable schemes for instance the Fiat-Shamir protocol is generated. The Fiat-Shamir protocol is relied on one particular type of digital signature scheme that is RSA scheme, but generates signature for its own, which is vulnerable compared with the digital signature generated by the RSA scheme. The zero knowledge identification scheme proofs ownership of the digital signature on publicly known messages. The aim of this paper is to present a new idea in digital signature schemes based on computational delegation and is claimed to be more efficient than the current schemes.