ID-based deniable ring authentication with constant-size signature

Front. Comput. Sci. ›› 2008, Vol. 2 ›› Issue (1) : 106 -112.

PDF (123KB)
Front. Comput. Sci. ›› 2008, Vol. 2 ›› Issue (1) : 106 -112. DOI: 10.1007/s11704-008-0003-1

ID-based deniable ring authentication with constant-size signature

Author information +
History +
PDF (123KB)

Abstract

Deniable ring authentication allows a member of an ad-hoc sunset of participants to authenticate a message without revealing which member has issued the signature, and the verifier cannot transfer the signature to any third party. It is an important cryptographic primitive for privacy and anonymous communication. Unfortunately, the size of the signature of the proposed deniable ring authentication is dependent on the size of the ring. It is inefficient especially when the size of the ring is large. In this paper, we propose an ID-based version of deniable ring authentication. We present a generic construction which uses dynamic accumulators to construct ID-based deniable ring authentication with constant-size signature. We also give an ID-based deniable ring authentication based on bilinear pairings, which is proved to be secure in the random oracle model.

Keywords

deniable ring authentication, privacy, ID-based, constant-size signature, bilinear pairings

Cite this article

Download citation ▾
null. ID-based deniable ring authentication with constant-size signature. Front. Comput. Sci., 2008, 2(1): 106-112 DOI:10.1007/s11704-008-0003-1

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (123KB)

980

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/