Author of the publication

Signcryption from Randomness Recoverable PKE Revisited.

, and . ICISS, volume 8303 of Lecture Notes in Computer Science, page 78-90. Springer, (2013)

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

Determining Number of Generalized and Double Generalized Petersen Graph.. CALDAM, volume 12016 of Lecture Notes in Computer Science, page 131-140. Springer, (2020)A generalization of Pappus graph., and . Electron. J. Graph Theory Appl., 10 (1): 345 (2022)An efficient IND-CCA2 secure Paillier-based cryptosystem., and . Inf. Process. Lett., 112 (22): 885-888 (2012)Computationally Secure Cheating Identifiable Multi-Secret Sharing for General Access Structure., , and . ICDCIT, volume 8956 of Lecture Notes in Computer Science, page 278-287. Springer, (2015)Determining Number of Kneser Graphs: Exact Values and Improved Bounds., and . Discret. Math. Theor. Comput. Sci., (2022)Plaintext Checkable Signcryption., and . ICISS, volume 9478 of Lecture Notes in Computer Science, page 324-333. Springer, (2015)On α-Domination in Graphs., , and . Graphs Comb., 34 (1): 193-205 (2018)On twin preserving spanning subgraph., , , , , and . J. Intell. Fuzzy Syst., 40 (5): 9505-9513 (2021)Connected domination value in graphs.. Electron. J. Graph Theory Appl., 9 (1): 113-123 (2021)Infinite graphs with finite dominating sets.. Discret. Math. Algorithms Appl., 9 (4): 1750053:1-1750053:9 (2017)