Domain Name System Security Extensions (DNSSEC) uses public-key digital signatures to provide integrity and authentication for DNS query responses. The current standardized DNS for reliable UDP delivery limits DNS response (including the message, signature, and public key) to a maximum of 1232 bytes. Incorporating NIST's post-quantum digital signatures into the DNS protocol results in a response size that exceeds the limit set by the Ethernet standardization, making PQC incompatible with the current standardized DNS. To address the incompatibility and enable PQC to protect the authenticity against the quantum-equipped adversaries, previous research proposed fragmenting the DNSSEC messages. Fragmentation however exposes DNSSEC to Fragmentation Mis-Association threat, traditionally studied in the broader IP fragmentation contexts and not applicable in the current DNSSEC with classical/pre-quantum cipher (no fragmentation needed). We distinguish our work from the previous research incorporating PQC to DNSSEC to defend against the Fragmentation Mis-Association Threat by chaining the fragments and applying cryptographic commit-and-reveal. We also advance the previous research and further reduce the number of packet fragments, which can be particularly useful as the DNSSEC based on UDP is prone to packet transmission failure increasing the chance of the DNS response failure when sent in multiple fragments, by using blockchain to offload and enable the offline delivery of the public key. Our scheme thus even allows the Falcon-512 PQC cipher incorporation to forgo the fragmentation, in contrast to the previous research requiring fragmentation for Falcon-512; the other PQC ciphers, i.e., Dilithium ciphers and Falcon-1024, still require fragmentation in our scheme due to the standardized signature sizes. We implement our scheme and analyze the effectiveness and performances through experimentation.

coronary artery disease (CAD) remains a prevalent cardiovascular condition, posing significant health risks worldwide. Accurate segmentation of coronary arteries from coronary computed tomography angiography (CCTA) images is crucial for diagnosis and treatment planning. Despite advancements, coronary artery segmentation (CAS) remains a significant challenge due to the considerable variability in the scale of coronary arteries, the complex anatomical structure and morphology, and the low contrast between blood vessels and the surrounding tissue. To effectively tackle these issues, we propose an attention-guided feature-aggregated network (AGFA-Net) specifically designed for CAS using CCTA images. AGFA-Net leverages attention mechanisms, feature refinement and hierarchical feature aggregation to capture salient features, acquire a more distinctive semantic representation and enhance segmentation accuracy. Evaluation on a dataset comprising 1,000 CCTAs demonstrates AGFA-Net's superior performance, achieving an average Dice coefficient similarity of 86.74 % and a 95% Hausdorff distance of 0.82 mm during 5-fold cross-validation. Ablation studies further validate the effectiveness of the proposed modules, highlighting their contributions to improved segmentation accuracy. Overall, AGFA-Net offers a robust and reliable solution for CAS, addressing challenges posed by varying arterial sizes, complex anatomies, and low image contrast.

To realize the computational advantages of quantum mechanics, it is necessary to be able to effectively perform quantum state tomography, and Bayesian methods provide significant opportunities in this regard, being applicable in the uncertainty regimes, where the local approaches based on Cramer-Rao bound become ill-defined. ${\mathcal{P}}{\mathcal{T}}$ -symmetric quantum mechanics provides a unique advantage for Bayesian parameter estimation having an additional degree of freedom, absent in the regular Hermitian case, which significantly enhances the quantum Fisher information and reduces variance of the obtained results. While previous studies have examined ${\mathcal{P}}{\mathcal{T}}$ -symmetric Bayesian parameter estimation in theory, we conduct experimental studies using IBM Quantum Experience and compare them with theoretical calculations. In our approach, the evolution of a qubit controlled by a ${\mathcal{P}}{\mathcal{T}}$-symmetric Hamiltonian is realized by the dilation method using ancilla qubit. We show that our implementation is consistent with the theoretical model and, in particular, we observe a good correspondence between the theoretical and experimental likelihood distributions. Thus we bridge the gap between theory and practical implementations in ${\mathcal{P}}{\mathcal{T}}$-symmetric quantum mechanics and its practical applications in quantum information science.

Post-quantum ciphers (PQC) provide cryptographic algorithms for public-key ciphers which are computationally secure against the threats from quantum-computing adversaries. Because the devices in mobile computing are limited in hardware and power, we analyze the PQC power overheads. We implement the new NIST PQCs across a range of device platforms to simulate varying resource capabilities, including multiple Raspberry Pis with different memories, a laptop, and a desktop computer. We compare the power measurements with the idle cases as our baseline and show the PQCs consume considerable power. Our results show that PQC ciphers can be feasible in the resource-constrained devices (simulated with varying Raspberry Pis in our case); while PQCs consume greater power than the classical cipher of RSA for laptop and desktop, they consume comparable power for the Raspberry Pis.

Random number generators are used in computing, security, and cryptographic applications. The random number outputs retaining the entropy without bias is critical for the integrity of the random number generator and the relying applications. $\mathcal{P}\mathcal{T}$-symmetric quantum mechanics provides a mechanism to improve the detection of the bias in randomness since it can convert two non-orthogonal quantum states into orthogonal ones. We propose a new randomness bias detection and quantification method by using $\mathcal{P}\mathcal{T}$-symmetric quantum mechanics. Previous studies show that, if the bias amount is a priori known, its presence can be detected by, in principle, a single measurement in $\mathcal{P}\mathcal{T}$-symmetric system. Taking advantage of an additional degree of freedom provided by $\mathcal{P}\mathcal{T}$ symmetry, we extend this approach to the case when the bias amount is not a priori known. We provide an algorithm and the analysis using $\mathcal{P}\mathcal{T}$ symmetry for randomness bias detection and quantification.

Public Key Infrastructure (PKI) generates and distributes digital certificates to provide the root of trust for securing digital networking systems. To continue securing digital networking in the quantum era, PKI should transition to use quantum-resistant cryptographic algorithms. The cryptography community is developing quantum-resistant primitives/algorithms, studying, and analyzing them for cryptanalysis and improvements. National Institute of Standards and Technology (NIST) selected finalist algorithms for the post-quantum digital signature cipher standardization, which are Dilithium, Falcon, and Rainbow. We study and analyze the feasibility and the processing performance of these algorithms in memory/size and time/speed when used for PKI, including the key generation from the PKI end entities (e.g., a HTTPS/TLS server), the signing, and the certificate generation by the certificate authority within the PKI. The transition to post-quantum from the classical ciphers incur changes in the parameters in the PKI, for example, Rainbow I significantly increases the certificate size by 163 times when compared with RSA 3072. Nevertheless, we learn that the current X.509 supports the NIST post-quantum digital signature ciphers and that the ciphers can be modularly adapted for PKI. According to our empirical implementations-based study, the post-quantum ciphers can increase the certificate verification time cost compared to the current classical cipher and therefore the verification overheads require careful considerations when using the post-quantum-cipher-based certificates.