Searcharxiv⌕ Search

arXiv subjects

Sourav Mukhopadhyay

Publications and source records attributed to Sourav Mukhopadhyay.

15 recordsLinked to original sources

Radiation Tolerance Characterisation of an Indigenously Developed p-type Silicon Pad Sensor for Forward Calorimetry Applications

We report on the radiation tolerance characterisation of a p-type silicon pad sensor indigenously designed by BARC-VECC and fabricated at Bharat Electronics Limited (BEL), India -- representing a significant step toward establishing a domestic silicon sensor manufacturing capability for high-energy physics applications. Single-pad test structures were irradiated with neutrons over a range of fluences from $\sim10^{7}$ to $\sim2.5\times10^{14}$~1~MeV~$n_{\mathrm{eq}}$/cm$^{2}$, spanning the operational regime relevant to forward calorimetry in high-luminosity heavy-ion collider experiments. Post-irradiation performance was characterised through systematic measurement of leakage current evolution and calorimetric response as functions of accumulated neutron fluence. A single-exponential annealing model is introduced to describe the time dependence of leakage current within the observation window, and the current-related damage constant $α$ is extracted and compared with the RD48 reference value. The results demonstrate that the sensors survive the target fluence with measurable but recoverable degradation, validating the fabrication process and providing a baseline for future qualification of this indigenous sensor production chain.

physics.ins-det↗

A Post-Quantum Secure End-to-End Verifiable E-Voting Protocol Based on Multivariate Polynomials

Voting is a primary democratic activity through which voters select representatives or approve policies. Conventional paper ballot elections have several drawbacks that might compromise the fairness, effectiveness, and accessibility of the voting process. Therefore, there is an increasing need to design safer, effective, and easily accessible alternatives. E-Voting is one such solution that uses digital tools to simplify voting. Existing state-of-the-art designs for secure E-Voting are based on number-theoretic hardness assumptions. These designs are no longer secure due to quantum algorithms such as Shor's algorithm. We present the design and analysis of \textit{first} post-quantum secure end-to-end verifiable E-Voting protocol based on multivariate polynomials to address this issue. The security of our proposed design depends on the hardness of the MQ problem, which is an NP-hard problem. We present a simple yet efficient design involving only standard cryptographic primitives as building blocks.

cs.CR↗

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

Digital signatures are one of the simplest cryptographic building blocks that provide appealing security characteristics such as authenticity, unforgeability, and undeniability. In 1984, Shamir developed the first Identity-based signature (IBS) to simplify public key infrastructure and circumvent the need for certificates. It makes the process uncomplicated by enabling users to verify digital signatures using only the identifiers of signers, such as email, phone number, etc. Nearly all existing IBS protocols rely on several theoretical assumption-based hard problems. Unfortunately, these hard problems are unsafe and pose a hazard in the quantum realm. Thus, designing IBS algorithms that can withstand quantum attacks and ensure long-term security is an important direction for future research. Quantum cryptography (QC) is one such approach. In this paper, we propose an IBS based on QC. Our scheme's security is based on the laws of quantum mechanics. It thereby achieves long-term security and provides resistance against quantum attacks. We verify the proposed design's correctness and feasibility by simulating it in a prototype quantum device and the IBM Qiskit quantum simulator. The implementation code in qiskit with Jupyternotebook is provided in the Annexure. Moreover, we discuss the application of our design in secure email communication.

cs.CR↗

A wide swing charge sensitive amplifier for a prototype Si-W EM calorimeter

A wide swing charge sensitive amplifier (CSA) has been developed, as a part of a front-end electronics (FEE) readout ASIC, for a prototype silicon tungsten (Si-W) based electromagnetic (EM) calorimeter. The CSA, designed in 0.35 $μ$m N-well CMOS technology using 5V MOS transistors, has a wide linear operating range of 2.6 pC w.r.t the input charge with a power dissipation of 2.3 mW. A noise figure (ENC) of 820 e$^-$ at 0 pF of detector capacitance with a noise slope of 25 e$^-$/pF has been achieved (when followed by a CR-RC$^2$ filter of 1.2 $μ$s peaking time). This design of CSA provides a dynamic range (ratio of maximum detectable signal to noise floor) of 79 dB for the maximum input charge of 2.6 pC when connected to a silicon detector with a capacitance of 40 pF. Using folded cascode architecture-based input stage and low voltage high swing current mirrors as the load, the CSA provides an enlarged output swing when biasing the output node towards one supply rail and utilizing the voltage range towards the opposite rail. The design philosophy works for both polarities of a large input signal. This paper presents the design of CSA with a wide negative output swing for an anticipated input signal of positive polarity in the target application with a known detector biasing scheme.

physics.ins-det↗

Development and characterization of a large area silicon pad array for an electromagnetic calorimeter

We present the research and development work of the first version of a 6*6 array of silicon pad detectors, carried out in India, for the proposed forward calorimeter (FOCAL) as part of the ALICE collaboration upgrade program at CERN. The primary motivation is to develop a large area silicon pad array realizing the challenging requirements of high-energy physics experiments such as low leakage current, high breakdown voltage and evaluate its performance as an active layer in the prototype silicon tungsten (Si-W) electromagnetic (EM) calorimeter. Towards these goals, a 36-pad silicon sensor with an individual pad size of 1 cm2 is designed on a 4-inch high resistivity N-type wafer and fabricated at Bharat Electronics Limited, Bangalore. The sensors have been used to assemble the prototype Si-W calorimeters and were successfully tested with high-energy particle beams. The design and development of the large area silicon sensor and its characterization using radioactive sources in the laboratory and high-energy particle beams are reported in this paper.

physics.ins-det↗

$(t, n)$ Threshold $d$-level quantum secret sharing based on quantum Fourier transformation

Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for $(n, n)$ threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of $(t, n)$ threshold schemes, Song {\it et al.} (Scientific Reports, 2017) have proposed a $(t, n)$ threshold QSS utilizing $QFT$. Later, Kao and Hwang (arXiv:1803.00216) have identified a loophole in the scheme but have not suggested any remedy. In this present study, we have proposed a $(t, n)$ threshold QSS scheme to share a $d$ dimensional classical secret. This scheme can be implemented using local operations (such as $QFT$, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.

quant-ph↗

Grover on SIMON

For any symmetric key cryptosystem with $n$-bit secret key, the key can be recovered in $O(2^{n/2})$ exploiting Grover search algorithm, resulting in the effective key length to be half. In this direction, subsequent work has been done on AES and some other block ciphers. On the other hand, lightweight ciphers like SIMON was left unexplored. In this backdrop, we present Grover's search algorithm on all the variants of SIMON and enumerate the quantum resources to implement such attack in terms of NOT, CNOT and Toffoli gates. We also provide the T-depth of the circuits and the number of qubits required for the attack. We show that the number of qubits required for implementing Grover on SIMON $2n/mn$ is $O(2nr+mn)$, where $r$ is the number of chosen plaintext-cipher text pairs. We run a reduced version of SIMON in IBMQ quantum simulator and the 14-qubits processor as well. We found that where simulation supports theory, the actual implementation is far from the reality due to the infidelity of the gates and short decoherence time of the qubits. The complete codes for all version of SIMON have also been presented.

quant-ph↗

Fabrication and beam test of a silicon-tungsten electromagnetic calorimeter

A silicon-tungsten (Si-W) sampling calorimeter, consisting of 19 alternate layers of silicon pad detectors (individual pad area of 1~cm$^2$) and tungsten absorbers (each of one radiation length), has been constructed for measurement of electromagnetic showers over a large energy range. The signal from each of the silicon pads is readout using an ASIC with a dynamic range from $-300$~fC to $+500$~fC. Another ASIC with a larger dynamic range, $\pm 600$~fC has been used as a test study. The calorimeter was exposed to pion and electron beams at the CERN Super Proton Synchrotron (SPS) to characterise the response to minimum ionising particles (MIP) and showers from electromagnetic (EM) interactions. Pion beams of 120 GeV provided baseline measurements towards the understanding of the MIP behaviour in the silicon pad layers, while electron beams of energy from 5 GeV to 60 GeV rendered detailed shower profiles within the calorimeter. The energy deposition in each layer, the longitudinal shower profile, and the total energy deposition have been measured for each incident electron energy. Linear behaviour of the total measured energy ($E$) with that of the incident particle energy ($E_{0}$) ensured satisfactory calorimetric performance. For a subset of the data sample, selected based on the cluster position of the electromagnetic shower of the incident electron, the dependence of the measured energy resolution on $E_{0}$ has been found to be $σ/E = (15.36/\sqrt{E_0(\mathrm{GeV)}} \oplus 2.0) \%$.

physics.ins-det↗

Device Independent Quantum Secret Sharing in Arbitrary Even Dimension

We present a device independent quantum secret sharing scheme in arbitrary even dimension. We propose a $d$-dimensional $N$-partite linear game, utilizing a generic multipartite higher dimensional Bell inequality, a generalization of Mermin's inequality in the higher dimension. Probability to win this linear game defines the device independence test of the proposed scheme. The security is proved under causal independence of measurement devices and it is based on the polygamy property of entanglement. By defining $ε_{cor}$-correctness and $ε^c$-completeness for a quantum secret sharing scheme, we have also shown that the proposed scheme is $ε_{cor}$-correct and $ε^c$-complete.

quant-ph↗

Measurement Device Independent Quantum Private Query with Qutrits

Measurement Device Independent Quantum Private Query (MDI QPQ) with qutrits is presented. We compare the database security and client's privacy in MDI QPQ for qubits with qutrits. For some instances, we observe that qutrit will provide better security for database than qubit. However, when it comes to the question of client's privacy we have to take additional measures in case of qutrit. Hence we conclude that though in case of Quantum Key Distribution (QKD) higher dimension provides better security but in case of QPQ this is not obvious.

quant-ph↗

Test and characterization of a prototype silicon-tungsten electromagnetic calorimeter

New generation high-energy physics experiments demand high precision tracking and accurate measurements of a large number of particles produced in the collisions of lementary particles and heavy-ions. Silicon-tungsten (Si-W) calorimeters provide the most viable technological option to meet the requirements of particle detection in high multiplicity environments. We report a novel Si-W calorimeter design, which is optimized for $γ/π^0$ discrimination up to high momenta. In order to test the feasibility of the calorimeter, a prototype mini-tower was constructed using silicon pad detector arrays and tungsten layers. The performance of the mini-tower was tested using pion and electron beams at the CERN Proton Synchrotron (PS). The experimental results are compared with the results from a detailed GEANT-4 simulation. A linear relationship between the observed energy deposition and simulated response of the mini-tower has been obtained, in line with our expectations.

physics.ins-det↗

Security Enhancement of Biometric Authentication Scheme for Telecare Medicine Information Systems with Nonce

Telecare medicine information systems (TMIS) present the platform to deliver clinical service door to door. The technological advances in mobile computing are enhancing the quality of healthcare and a user can access these services using its mobile device. Existing authentication schemes for TMIS are either vulnerable to attacks or they have higher computational cost. We propose a biometric based efficient authentication scheme for TMIS which only requires the computation of the hash and XOR functions.

cs.CR↗

Cryptanalysis and Improvement of Jiang et al.'s Smart Card Based Remote User Authentication Scheme

The smart card based authentication protocols try to ensure secure and authorized communication between remote entities. In 2012, Wei et al. presented an improvement of Wu et al.'s two-factor authentication scheme for TMIS which is proven vulnerable to off-line password guessing attack by Zhu. Zhu also proposed a modified scheme to overcome with weakness of Wei et al.'s scheme, although Lee and Liu showed the failure of his scheme to resist parallel session attacks. Moreover, Lee and Liu introduced an improved scheme. We analyze Wei et al.'s, Zhu's and Lee and Liu's schemes and identify that none of the schemes resist on-line password guessing attack. Moreover, these schemes do not present efficient login and password chance phase. We also show that how inefficient password change phase causes denial of service attack. Further, we propose an improved password based remote user authentication scheme with the aim to eliminate all the drawbacks of previously presented schemes.

cs.CR↗

Cryptanalysis of Wu and Xu's authentication scheme for Telecare Medicine Information Systems

Remote user authentication is desirable for a Telecare medicine information system (TMIS) to verify the correctness of remote users. In 2013, Jiang et al. proposed privacy preserving authentication scheme for TMIS. Recently, Wu and Xu analyzed Jiang's scheme and identify serious security flaws in their scheme, namely, user impersonation attack, DoS attack and off-line password guessing attack. In this article, we analyze Wu and Xu's scheme and show that their scheme is also vulnerable to off-line password guessing attack and does not protect user anonymity. Moreover, we identify the inefficiency of incorrect input detection of the login phase in Wu and Xu's scheme, where the smart card executes the login session in-spite of wrong input.

cs.CR↗