Sumit Kumar Debnath

Orcid: 0000-0001-6374-1410

According to our database1, Sumit Kumar Debnath authored at least 40 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An efficient quantum oblivious transfer protocol.
Clust. Comput., December, 2024

Designing quantum-secure attribute-based encryption.
Clust. Comput., December, 2024

Cryptanalysis of a quantum identity-based signature and its improvement.
Quantum Inf. Process., September, 2024

Quantum Secure Threshold Private Set Intersection Protocol for IoT-Enabled Privacy-Preserving Ride-Sharing Application.
IEEE Internet Things J., January, 2024

An Efficient and Secure Boolean Function Evaluation Protocol.
IACR Cryptol. ePrint Arch., 2024

A new approach to delegate signing rights to proxy signers using isogeny-based cryptography.
CoRR, 2024

An Experimentally Validated Feasible Quantum Protocol for Identity-Based Signature with Application to Secure Email Communication.
CoRR, 2024

2023
An information-theoretically secure quantum multiparty private set intersection.
J. Inf. Secur. Appl., November, 2023

A Multivariate-Based Provably Secure Certificateless Signature Scheme With Applications To The Internet Of Medical Things.
Comput. J., October, 2023

A constant round quantum secure protocol for oblivious polynomial evaluation.
J. Inf. Secur. Appl., September, 2023

Study of mediating effect of interpersonal relationship and emotional coping ability in the relationship between emotional intelligence and wellness of nursing professionals.
Int. J. Syst. Assur. Eng. Manag., August, 2023

Mul-IBS: a multivariate identity-based signature scheme compatible with IoT-based NDN architecture.
J. Cryptogr. Eng., June, 2023

On the security of multivariate-based ring signature and other related primitives.
J. Inf. Secur. Appl., May, 2023

An Overview of Hash Based Signatures.
IACR Cryptol. ePrint Arch., 2023

Blockchain-Envisioned Post-Quantum Secure Sanitizable Signature for Audit Logs Management.
CoRR, 2023

Quantum Secure Protocols for Multiparty Computations.
CoRR, 2023

A multivariate identity-based broadcast encryption with applications to the internet of things.
Adv. Math. Commun., 2023

Delegating signing rights in a multivariate proxy signature scheme.
Adv. Math. Commun., 2023

2022
Blockchain-Envisioned Provably Secure Multivariate Identity-Based Multi-Signature Scheme for Internet of Vehicles Environment.
IEEE Trans. Veh. Technol., 2022

A post-quantum signcryption scheme using isogeny based cryptography.
J. Inf. Secur. Appl., 2022

Quantum secure privacy preserving technique to obtain the intersection of two datasets for contact tracing.
J. Inf. Secur. Appl., 2022

Efficient post-quantum private set-intersection protocol.
Int. J. Inf. Comput. Secur., 2022

2021
Feasible private set intersection in quantum domain.
Quantum Inf. Process., 2021

A secure and efficient group signature scheme based on multivariate public key cryptography.
J. Inf. Secur. Appl., 2021

Post-quantum secure multi-party private set-intersection in star network topology.
J. Inf. Secur. Appl., 2021

Secure and efficient multiparty private set intersection cardinality.
Adv. Math. Commun., 2021

Storage Friendly Provably Secure Multivariate Identity-Based Signature from Isomorphism of Polynomials Problem.
Proceedings of the 18th International Conference on Security and Cryptography, 2021

Cryptanalysis of LRainbow: The Lifted Rainbow Signature Scheme.
Proceedings of the Provable and Practical Security, 2021

Secure Outsourced Private Set Intersection with Linear Complexity.
Proceedings of the IEEE Conference on Dependable and Secure Computing, 2021

2020
Post-quantum digital signature scheme based on multivariate cubic problem.
J. Inf. Secur. Appl., 2020

Post-quantum protocol for computing set intersection cardinality with linear complexity.
IET Inf. Secur., 2020

2019
Provably Secure Private Set Intersection With Constant Communication Complexity.
Int. J. Cyber Warf. Terror., 2019

2016
Towards fair mutual private set intersection with linear complexity.
Secur. Commun. Networks, 2016

Fair mPSI and mPSI-CA: Efficient Constructions in Prime Order Groups with Security in the Standard Model against Malicious Adversary.
IACR Cryptol. ePrint Arch., 2016

New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness.
Proceedings of the Information Security and Cryptology - ICISC 2016 - 19th International Conference, Seoul, South Korea, November 30, 2016

How to Meet Big Data When Private Set Intersection Realizes Constant Communication Complexity.
Proceedings of the Information and Communications Security - 18th International Conference, 2016

Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter.
Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

2015
Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries.
Proceedings of the Provable Security, 2015

Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter.
Proceedings of the Information Security - 18th International Conference, 2015

2014
A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function.
Proceedings of the Information Security and Cryptology - ICISC 2014, 2014


  Loading...