Subhayan Roy Moulick

Siddharth Patwardhan, Subhayan Roy Moulick, Prasanta K. Panigrahi

We study controlled quantum secure direct communication (CQSDC), a cryptographic scheme where a sender can send a secret bit-string to an intended recipient, without any secure classical channel, who can obtain the complete bit-string only with the permission of a controller. We report an efficient protocol to realize CQSDC using Cluster state and then go on to construct a (2-3)-CQSDC using Brown state, where a coalition of any two of the three controllers is required to retrieve the complete message. We argue both protocols to be unconditionally secure and analyze the efficiency of the protocols to show it to outperform the existing schemes while maintaining the same security specifications.

Subhayan Roy Moulick, Prasanta K. Panigrahi

We propose the idea of a Quantum Cheque Scheme, a cryptographic protocol in which any legitimate client of a trusted bank can issue a cheque, that cannot be counterfeited or altered in anyway, and can be verified by a bank or any of its branches. We formally define a Quantum Cheque and present the first Unconditionally Secure Quantum Cheque Scheme and show it to be secure against any no-signaling adversary. The proposed Quantum Cheque Scheme can been perceived as the quantum analog of Electronic Data Interchange, as an alternate for current e-Payment Gateways.

Subhayan Roy Moulick, Siddharth Arora, Chirag Jain et al.

A semi-blind watermarking scheme is presented based on Singular Value Decomposition (SVD), which makes essential use of the fact that, the SVD subspace preserves significant amount of information of an image and is a one way decomposition. The principal components are used, along with the corresponding singular vectors of the watermark image to watermark the target image. For further security, the semi-blind scheme is extended to an invisible hash based watermarking scheme. The hash based scheme commits a watermark with a key such that, it is incoherent with the actual watermark, and can only be extracted using the key. Its security is analyzed in the random oracle model and shown to be unforgeable, invisible and satisfying the property of non-repudiation.