Notice of RetractionID-based constant-size deniable ring authentication using a secure accumulator

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

Deniable ring authentication allows a member of an adhoc sunset of participants to authenticate a message without revealing which member has issued the signature, and the verifier cannot convince any third party that message m was indeed authenticated. Most of the proposed deniable ring authentication schemes´s signature size is dependent linearly on the number of ring members which causes inefficiency especially when the size of the ring is large. Some authors have studied the deniable ring authentication with constantsize signature. In this paper, we show that a constant-size scheme has some security problems by using an insecure accumulator. Then we propose a new id-based deniable ring authentication scheme with constant size signature which uses a secure accumulator on bilinear pairings.