Parallel Multi-recipient Signcryption for Multicast Networks
Yiliang Han, Xiaolin Gui, Xiaoyuan Yang, Haibin Yang · 2010
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.