TY - GEN
T1 - Parallel multi-recipient signcryption for multicast networks
AU - Han, Yiliang
AU - Gui, Xiaolin
AU - Yang, Xiaoyuan
AU - Yang, Haibin
PY - 2010
Y1 - 2010
N2 - In this paper, a parallel multi-recipient signcryption scheme called ParaSC-BLS is proposed, which is semantic secure in random oracle model assuming that the GDH problem is hard. With pre-computing, the speedup of ParaSC-BLS is up to N. As the number of recipients growing, the computational overheads of ParaSC-BLS are constant. For the randomness reusing, cipher text is aggregated and the total transmission overheads are reduced also. It is more efficient than all of known approaches.
AB - In this paper, a parallel multi-recipient signcryption scheme called ParaSC-BLS is proposed, which is semantic secure in random oracle model assuming that the GDH problem is hard. With pre-computing, the speedup of ParaSC-BLS is up to N. As the number of recipients growing, the computational overheads of ParaSC-BLS are constant. For the randomness reusing, cipher text is aggregated and the total transmission overheads are reduced also. It is more efficient than all of known approaches.
KW - Parallel signcryption
KW - Secure group communication
KW - Signcryption
UR - https://www.scopus.com/pages/publications/77953057966
U2 - 10.1109/ETCS.2010.323
DO - 10.1109/ETCS.2010.323
M3 - 会议稿件
AN - SCOPUS:77953057966
SN - 9780769539874
T3 - 2nd International Workshop on Education Technology and Computer Science, ETCS 2010
SP - 128
EP - 131
BT - 2nd International Workshop on Education Technology and Computer Science, ETCS 2010
T2 - 2nd International Workshop on Education Technology and Computer Science, ETCS 2010
Y2 - 6 March 2010 through 7 March 2010
ER -