( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Grafting Key Trees: Efficient Key Management for Overlapping Groups.

, , , , , , , и . IACR Cryptol. ePrint Arch., (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Anwar Baig

Shahram Ahadi

Ahad Bazzazi

Ahad Rahmanzadeh

Jawaid Ahmad Baig

 

Другие публикации лиц с тем же именем

Long-lived counters with polylogarithmic amortized step complexity., , , и . Distributed Comput., 36 (1): 29-43 (марта 2023)Grafting Key Trees: Efficient Key Management for Overlapping Groups., , , , , , , и . TCC (3), том 13044 из Lecture Notes in Computer Science, стр. 222-253. Springer, (2021)Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity., , , и . PODC, стр. 31-40. ACM, (2020)Grafting Key Trees: Efficient Key Management for Overlapping Groups., , , , , , , и . IACR Cryptol. ePrint Arch., (2021)Efficiently Testable Circuits., , , , , и . ITCS, том 251 из LIPIcs, стр. 10:1-10:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Long-Lived Counters with Polylogarithmic Amortized Step Complexity., , , и . DISC, том 146 из LIPIcs, стр. 3:1-3:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)PODC 2020 Review., , , и . SIGACT News, 51 (4): 75-81 (2020)Efficiently Testable Circuits., , , , , и . IACR Cryptol. ePrint Arch., (2022)Efficiently Testable Circuits Without Conductivity., , , , , и . TCC (3), том 14371 из Lecture Notes in Computer Science, стр. 123-152. Springer, (2023)