An efficient multi-use multi-secret sharing scheme based on hash function. - Angsuman Das; Avishek Adhikari (Appl. Math. Lett., 2010)

An efficient IND-CCA2 secure Paillier-based cryptosystem. - Angsuman Das; Avishek Adhikari (Inf. Process. Lett., 2012)

Signcryption from Randomness Recoverable PKE Revisited. - Angsuman Das; Avishek Adhikari (ICISS, 2013)

Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture. - Angsuman Das; Sabyasachi Dutta; Avishek Adhikari (ProvSec, 2013)

Computationally Secure Cheating Identifiable Multi-Secret Sharing for General Access Structure. - Partha Sarathi Roy 001; Angsuman Das; Avishek Adhikari (ICDCIT, 2015)

Plaintext Checkable Signcryption. - Angsuman Das; Avishek Adhikari (ICISS, 2015)

Plaintext checkable encryption with designated checker. - Angsuman Das; Avishek Adhikari; Kouichi Sakurai (Adv. Math. Commun., 2015)

Connected Fair Domination in Graphs. - Angsuman Das; Wyatt J. Desormeaux (ICMC, 2017)

Coefficient of domination in graph. - Angsuman Das (Discret. Math. Algorithms Appl., 2017)

Infinite graphs with finite dominating sets. - Angsuman Das (Discret. Math. Algorithms Appl., 2017)

On α-Domination in Graphs. - Angsuman Das; Renu C. Laskar; Nader Jafari Rad (Graphs Comb., 2018)

Determining Number of Generalized and Double Generalized Petersen Graph. - Angsuman Das (CALDAM, 2020)

Triameter of graphs. - Angsuman Das (Discuss. Math. Graph Theory, 2021)

Connected domination value in graphs. - Angsuman Das (Electron. J. Graph Theory Appl., 2021)

On twin preserving spanning subgraph. - Khola Wahid; Angsuman Das; Anam Rani; Saira Amanat; Muhammad Imran 006; Usman Ali 008 (J. Intell. Fuzzy Syst., 2021)

On neighborhood graphs: Domination, coloring and other properties. - Angsuman Das (Discret. Math. Algorithms Appl., 2022)

Determining Number of Kneser Graphs: Exact Values and Improved Bounds. - Angsuman Das; Hiranya Kishore Dey (Discret. Math. Theor. Comput. Sci., 2022)

A generalization of Pappus graph. - Sucharita Biswas; Angsuman Das (Electron. J. Graph Theory Appl., 2022)

On the difference of the enhanced power graph and the power graph of a finite group. - Sucharita Biswas; Peter J. Cameron; Angsuman Das; Hiranya Kishore Dey (J. Comb. Theory, Ser. A, 2024)

A Family of Iterated Maps on Natural Numbers. - Angsuman Das (Exp. Math., 2024)