%0 Journal Article
%T Identity-based ring signcryption scheme with constant size ciphertext
密文长度固定的基于身份环签密方案*
%A SUN Hu
%A ZHENG Xue-feng
%A YU Yi-ke
%A HAN Xiao-guang
%A
孙华
%A 郑雪峰
%A 于义科
%A 韩晓光
%J 计算机应用研究
%D 2010
%I
%X This paper presented an identity-based ring signcryption scheme without random oracle by using bilinear pairings. The size of the ciphertext was a constant and independent of the size of the ring. By introducing the selective identity and selective chosen message attack model, this paper proved unforgeability of the scheme under the hardness of DHI problem and its indistinguishability against selective identity and chosen ciphertext attack under the hardness of DBDHE problem. This scheme is more efficient compared with other ring signcryption schemes.
%K ring signcryption
%K bilinear pairing
%K decisional bilinear Diffie-Hellman exponent problem
%K Diffie-Hellman inversion problem
环签密
%K 双线性对
%K DBDHE问题
%K DHI问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=D62E992FBF3A9F2EDEF0E3F2C8E265BF&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=38B194292C032A66&sid=92CE31955C2FC520&eid=2E7DE3EE3BC61ED0&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=14