Virual Oral Presentation Slide by Slide

IEEE/ICACT20230044 Slide.18        [Big Slide]       [YouTube]	Oral Presentation
	From the results, we can conclude that: Our schemes provide a key distribution scheme where the number of keys stored is static so that can decrease the memory consumption. The using of Lucas polynomial and XOR operation to obtain the group key makes our scheme lightweight. Our scheme also support backward secrecy and forward secrecy.

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!