Author of the publication

Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity.

, , , and . ICITS, volume 9063 of Lecture Notes in Computer Science, page 33-50. Springer, (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Perfectly secure message transmission over partially synchronous networks., , and . ICDCN, page 302-306. ACM, (2019)On perfectly secret message transmission in digraphs tolerating dual failures., , , and . ICDCN, page 29:1-29:10. ACM, (2016)On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission., , , and . IEEE Trans. Inf. Theory, 64 (2): 1404-1422 (2018)CRAFT: Composable Randomness and Almost Fairness from Time., , , , , and . IACR Cryptol. ePrint Arch., (2020)A novel algorithm for enhancing search results by detecting dissimilar patterns based on correlation method., , and . Int. Arab J. Inf. Technol., 14 (1): 60-69 (2017)On minimal connectivity requirements for secure message transmission in directed networks., , and . Inf. Process. Lett., (2018)CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time., , , , , and . Public Key Cryptography (1), volume 13940 of Lecture Notes in Computer Science, page 439-470. Springer, (2023)Assuring BetterTimes., , , and . J. Comput. Secur., 26 (4): 557-587 (2018)Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity., , , and . ICITS, volume 9063 of Lecture Notes in Computer Science, page 33-50. Springer, (2015)A Mathematical Analysis of Elliptic Curve Point Multiplication.. SSCC, volume 467 of Communications in Computer and Information Science, page 192-200. Springer, (2014)