This paper reviews the recent advances on proxy signatures, discusses few notable proposals, analyzes schemes' security and efficiency, and provides an overall remark of these proposals.

/pdf/algorithms-and-approaches-of-proxy-signature-a-survey-3pbc8mga0j.pdf

Algorithms and Approaches of Proxy Signature: A Survey

In this article, we proposed a batch verification scheme for multiple proxy signatures to reduce the proxy signature verification time. The proposed scheme is not only efficient because it does not...

/pdf/a-batch-verification-for-multiple-proxy-signature-210raa2pcm.pdf

A batch verification for multiple proxy signature

.tw Abstract. A rich set of proxy signature schemes have been widely researched and dis- cussed so far. However, they have been mainly focusing on dealing with one or two separate proxy situations each. In this article, the authors proposed the generalization of the ( t1=n1 t2=n2) proxy signature scheme based on the factorization of the square root modulo of a composite number. This scheme can be applied to every proxy situation. The ( t1=n1 t2=n2) proxy signature scheme allows the original group of original signers to delegate their signing capability to a designated proxy group of proxy signers. Any verier can verify the proxy signatures on the messages with the knowledge of the identities of the actual original signers and the actual proxy signers. Furthermore, all possible attacks that have been analyzed so far have failed to break the proposed scheme. Keywords: Digital signature, Proxy signature, Multi-proxy multi-signature scheme, Proxy multi-signature scheme, Threshold proxy signature

/pdf/generalization-of-proxy-signature-based-on-factorization-1en99hh4e9.pdf

Generalization of proxy signature based on factorization

Traditional public key cryptography uses certificates to bind the users with their public keys and are considered the best alternative for key distribution, but requires to have a very involved key management process. Identity based cryptography makes the key management easier but suffers from the key escrow problem and requires secure channel to issue the private keys to the users. Key issuing protocols deal with secret key issuing (SKI) process to overcome the two problems. We present an efficient and secure key issuing protocol which enables the identity based cryptosystems to be more acceptable and applicable in the real world. In the protocol, neither key generating center nor key privacy authority can impersonate the users to obtain the private keys. Performance and security analysis are being carried out for the protocol and is shown that it is efficient and secure against replay, man-in-the-middle and insider attacks.

Threshold SKI Protocol for ID-based Cryptosystems

(Bilinear pairing is a new and increasingly popular way of constructing cryptographic protocols. This has resulted in the development of Identity Based Encryption (IBE) that is ideally used in identity aware devices. The security of such devices using pairing algorithms against side-channel and fault attack has not been studied extensively. This paper examines the security of existing countermeasures and show their weakness against fault attacks. Subsequently, it proposes a new countermeasure that prevents such kind of attacks. The paper also discusses for the first time fault attacks and countermeasures against bilinear pairing in Edwards coordinates.

Fault Attack, Countermeasures on Pairing Based Cryptography.

We present a proxy signature scheme using bilinear pairings that provides effective proxy revocation. The scheme uses a binding-blinding technique to avoid secure channel requirements in the key issuance stage. With this technique, the signer receives a partial private key from a trusted authority and unblinds it to get his private key, in turn, overcomes the key escrow problem which is a constraint in most of the pairing-based proxy signature schemes. The scheme fulfills the necessary security requirements of proxy signature and resists other possible threats.

Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings

/pdf/proxy-signature-scheme-with-effective-revocation-using-2z5er786ku.pdf

The paper presents a secure protocol for authentication in mobile-communications. We analyse some existing works with their weaknesses. In our protocol we use a simple blinding-binding technique for users secret keys generation such that the base-station authentication center never comes to know users secret keys. Our protocol not only overcomes the weakness of existing works but also avoids the need of certificate management, secure channel and satisfies necessary security properties of wireless communications.

Ashutosh Saxena

Papers

Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings

Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings

SPAM: secure protocol for authentication in mobile-communications