In this paper, adapting a novel dual authentication method based on smart cards in public networks is proposed. This method uses the ElGamal public key cryptosystem and extend Chaum–van Antwerpen’s scheme to authenticate a signature between the signer and verifier using a dual protocol with a smart card that has tamper-resistant features. We propose the method to change the verification and dis...

As the application of digital signature is progressed in real life, the situation of using digital signatures tends to become more complex. Depending on applications a user may need to generate multiple signatures for the same message with his multiple signing keys. But the general approach of generating multiple independent signatures is not efficient. To solve this problem, we propose multi-k...

Digital signature schemes are a foundational building block enabling integrity and non-repudiation. We propose a graph signature scheme and corresponding proofs that allow a prover (1) to obtain a signature on a committed graph and (2) to subsequently prove to a verifier knowledge of such a graph signature. The graph signature scheme and proofs are a building block for certification systems tha...

An Attribute Based Group Signature (ABGS) allows a verifier to request a signature from a member of a group who possesses certain attributes. Therefore, a signature should authenticate a person in a group and prove ownership of certain properties. The major difference between our scheme and previous group signatures, is that the verifier can determine the role of the actual signer within the gr...

This article revisits the original designated confirmer signature scheme of Chaum. Following the same spirit we naturally extend the Chaum’s construction in a more general setting and analyze its security in a formal way. We prove its security in the random oracle model by using a random hash function and a random permutation. We notably consider the confirmer as an attacker against the existen...

In the (t, n) proxy signature scheme, the signature, originally signed by a signer, can be signed by t or more proxy signers out of a proxy group of n members. Recently, an efficient nonrepudiable threshold proxy signature scheme with known signers was proposed by H.-M. Sun. Sun’s scheme has two advantages. One is nonrepudiation. The proxy group cannot deny that having signed the proxy signatur...

The paper addresses the problem of bad signature identification in batch verification of digital signatures. The number of generic tests necessary to identify all bad signatures in a batch instance, is used to measure the efficiency of verifiers. The divide-and-conquer verifier DCVα(x,n) is defined. The verifier identifies all bad signatures in a batch instance x of the length n by repeatedly s...

Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a signature, and hence allow the signer to control the verifiability of his signatures. Convertible undeniable signatures, introduced by Boyar, Chaum, Damg̊ard, and Pedersen, furthermore allow the signer to convert signatures to publicly verifiable ones by publicizing a verifica...

A novel protocol to achieve privacy-preserving universal authentication protocol for wireless communications called Priauth. Verifier-Local Revocation Group Signature with Backward Unlinkability (VLR-GS-BU), it can satisfy all requirements. Priauth belongs to the class of Universal Authentication Protocols in which same protocol and signaling flows are used regardless of the domain (home or for...

The concept of ring signature was introduced by Rivest, Shamir and Tauman. This signature is considered to be a simplified group signature from which identity of signer is ambiguous although verifier knows the group to which signer belong. In this paper we introduce a new proxy ring signature scheme.