Miracle-dz/UniFAR-FTUs huggingface dataset:
Implementing and Optimizing Matrix Triples with Homomorphic Encryption

In today’s interconnected world, data has become a valuable asset, leading to a growing interest in protecting it through techniques such as privacy-preserving computation. Two well-known approaches are multi-party computation and homomorphic encryption with use cases such as privacy-preserving machine learning evaluating or training neural networks. For multi-party computation, one of the fundamental arithmetic operations is the secure multiplication in the malicious security model and by extension the multiplication of matrices which is expensive to compute in the malicious model. Transferring the problem of secure matrix multiplication to the homomorphic domain enables savings in communication complexity, reducing the main bottleneck. In this work, we implement and optimize the homomorphic generation of matrix triples. We provide an open-source implementation for the leveled BGV (Brakerski Gentry Vaikuntanathan) scheme supporting plaintext moduli of arbitrary size using state-of-the-art implementation techniques. We also provide a new, use-case specific approach to parameter generation for leveled BGV-like schemes heuristically optimizing for computation time and taking into account architecture-specific constraints. Finally, we provide an in-depth analysis of the homomorphic circuit enabling the re-use of key switching keys and eliminating constant multiplications, combining our results in an implementation to generate homomorphic matrix triples for arbitrary plaintext moduli. Our implementation is publicly available and up to 2.1 × faster compared to previous work while also providing new time-memory trade-offs for different computing environments. Furthermore, we implement and evaluate additional, use-case specific optimization opportunities such as matrix slicing for the matrix triple generation.
A Visual Communication Design Study: Graphic Element Design Under Traditional Handwork

The addition of traditional elements can enhance the uniqueness of visual communication design. This paper briefly introduced visual communication and applications of traditional elements in visual communication design and applied paper cuts, a handmade graphic element, to the logo design of Dezhou University's 50th anniversary. The convolutional neural network (CNN) algorithm and the analytic hierarchy process method were applied to evaluation analysis and compared with the support vector machine (SVM) algorithm. The results of the CNN algorithm on the test set verified its effectiveness. The evaluation results of the CNN algorithm were similar to the manual evaluation results, further proving the effectiveness and high efficiency of the CNN algorithm. The hierarchical analysis and the analysis of the assessment results of the CNN algorithm found that the two logo designs made full use of paper cuts.
Tagged Chameleon Hash from Lattice and Application to Redactable Blockchain

Chameleon hash (CH) is a trapdoor hash function. Generally it is hard to ﬁnd collisions, but with the help of trapdoor, ﬁnding collisions becomes easy. CH plays an important role in converting a conventional blockchain to a redactable one. However, most of the existing CH schemes are too weak to support redactable blockchain. The currently known CH schemes serving for redactable blockchain have the best security of so-called “full collision resistance (f-CR)”, but they are built either on random oracle model or rely on heavy tools like the simulation-sound extractable non-interactive zero-knowledge (SSE-NIZK) proof system. Moreover, up to now there is no CH scheme with post-quantum f-CR security in the standard model. Therefore, no CH can support redactable blockchain in a post-quantum way without relying on random oracles. In this paper, we introduce a variant of CH, namely tagged chameleon hash (tCH). Tagged chameleon hash takes a tag into hash evaluations and collision ﬁnding algorithms. We deﬁne two security notions for tCH, collision resistance (CR) and full collision resistance (f-CR), and prove the equivalence between CR and f-CR when tCH works in the one-time tag mode. We propose a tCH scheme from lattice without using any NIZK proof, and prove that its collision resistance is (almost) tightly reduced to the Short Integer Solution (SIS) assumption in the standard model. We also show how to apply tCH to a blockchain in one-time tag mode so that the blockchain can be compiled to a redactable one. Our tCH scheme provides the ﬁrst post-quantum solution for redactable blockchains, without resorting to random oracles or NIZK proofs. Besides, we also construct a more eﬃcient tCH scheme with CR tightly reduced to SIS in the random oracle model, which may be of independent interest.
Building Unclonable Cryptography: A Tale of Two No-cloning Paradigms

Unclonable cryptography builds primitives that enjoy some form of unclonability, such as quantum money, software copy protection, and bounded execution programs. These are impossible in the classical model as classical data is inherently clonable. Quantum computing, with its no-cloning principle, offers a solution. However, it is not enough to realize bounded execution programs; these require one-time memory devices that self-destruct after a single data retrieval query. Very recently, a new no-cloning technology has been introduced [Eurocrypt’22], showing that unclonable polymers—proteins—can be used to build bounded-query memory devices and unclonable cryptographic applications. In this paper, we investigate the relation between these two technologies; whether one can replace the other, or complement each other such that combining them brings the best of both worlds. Towards this goal, we review the quantum and unclonable polymer models, and existing unclonable cryptographic primitives. Then, we discuss whether these primitives can be built using the other technology, and show alternative constructions and notions when possible. We also offer insights and re-marks for the road ahead. We believe that this study will contribute in advancing the field of unclonable cryptography on two fronts: developing new primitives, and realizing existing ones using new constructions.
On the State of Crypto-Agility

The demand for crypto-agility, although dating back for more than two decades, recently started to increase in the light of the expected post-quantum cryptography (PQC) migration. Nevertheless, it started to evolve into a science on its own. Therefore, it is important to establish a uniﬁed deﬁnition of the notion, as well as its related aspects, scope, and practical applications. This paper presents a literature survey on crypto-agility and discusses respective development efforts categorized into different areas, including requirements, characteristics, and possible challenges. We explore the need for crypto-agility beyond PQC algorithms and security protocols and shed some light on current solutions, existing automation mechanisms, and best practices in this ﬁeld. We evaluate the state of readiness for crypto-agility, and offer a discussion on the identiﬁed open issues. The results of our survey indicate a need for a comprehensive understanding. Further, more agile design paradigms are required in developing new IT-systems, and in refactoring existing ones, in order to realize crypto-agility on a broad scale.
High-Throughput Deep Convolutional Neural Networks on Fully Homomorphic Encryption Using Channel-By-Channel Packing

Secure Machine Learning as a Service is a viable solution where clients seek secure delegation of the ML computation while protecting their sensitive data. We propose an efficient method to securely evaluate deep standard convolutional neural networks based on CKKS fully homomorphic encryption, in the manner of batch inference. In this paper, we introduce a packing method called Channel-by-Channel Packing that maximizes the slot compactness and single-instruction-multiple-data capabilities in ciphertexts. Along with further optimizations such as lazy rescaling, lazy Baby-Step Giant-Step, and ciphertext level management, we could significantly reduce the computational cost of standard ResNet inference. Simulation results show that our work has improvements in amortized time by 5 . 04 × (from 79 . 46 s to 15 . 76 s) and 5 . 20 × (from 455 . 56 s to 87 . 60 s) for ResNet-20 and ResNet-110, compared to the previous best results, resp. We also got a dramatic reduction in memory usage for rotation keys from several hundred GBs to 6.91GB, which is about 38 × smaller than the previous result.
On Central Bank Digital Currency: A composable treatment

: Central Bank Digital Currency (CBDC) is in the phase of discussion in most of countries. In this paper, we consider the security issues of centralized retail CBDC. Our focus is on the design and analysis of the underlying cryptographic protocol. The main security requirements against the protocol are transaction anonymity and protection against tax evasion. The protocol provides security guarantees in case of the strongest model of an execution environment which is the general concurrent environment. We apply the Universal Composition (UC) methodology of Canetti [3],[4]. At the time of this writing, we are not aware of any published CBDC protocol with an aim to provide secure compositional guarantees.
Threshold Cryptosystems Based on 2k-th Power Residue Symbols

In this paper we introduce a novel version of the Joye-Libert cryptosystem that allows users to decrypt without knowing the factori-sation of the composite modulus. Then we use our construction as a building block for a threshold decryption protocol of the homomorphic Joye-Libert encryption scheme. Finally, we present several extensions of the threshold cryptosystem.
A 334μW 0.158mm2 ASIC for Post-Quantum Key-Encapsulation Mechanism Saber with Low-latency Striding Toom-Cook Multiplication Authors Version

The hard mathematical problems that assure the security of our current public-key cryptography (RSA, ECC) are broken if and when a quantum computer appears rendering them ineffective for use in the quantum era. Lattice based cryptography is a novel approach to public key cryptography, of which the mathematical investigation (so far) resists attacks from quantum computers. By choosing a module learning with errors (MLWE) algorithm as the next standard, National Institute of Standard&Technology (NIST) follows this approach. The multiplication of polynomials is the central bottleneck in the computation of lattice based cryptography. Because public key cryptography is mostly used to establish common secret keys, focus is on compact area, power and energy budget and to a lesser extent on throughput or latency. While most other work focuses on optimizing number theoretic transform (NTT) based multiplications, in this paper we highly optimize a Toom-Cook based multiplier. We demonstrate that a memory-efficient striding Toom-Cook with lazy interpolation, results in a highly compact, low power implementation, which on top enables a very regular memory access scheme. To demonstrate the efficiency, we integrate this multiplier into a Saber post-quantum accelerator, one of the four NIST finalists. Algorithmic innovation to reduce active memory, timely clock gating and shift-add multiplier has helped to achieve 38% less power than state-of-the art PQC core, 4x less memory, 36.8% reduction in multiplier energy and 118x reduction in active power with respect to state-of-the-art Saber accelerator (not silicon verified). This accelerator consumes 0.158mm2 active area which is lowest reported till date despite process disadvantages of the state-of-the-art designs.
KAIME : Central Bank Digital Currency with Realistic and Modular Privacy

Recently, with the increasing interest in Central Bank Digital Currency (CBDC), many countries have been working on researching and developing digital currency. The most important reasons for this interest are that CBDC eliminates the disadvantages of traditional cur-rencies and provides a safer, faster, and more efficient payment system. These benefits also come with challenges, such as safeguarding individuals’ privacy and ensuring regulatory mechanisms. While most researches address the privacy conflict between users and regulatory agencies, they miss an important detail. Important parts of a financial system are banks and financial institutions. Some studies ignore the need for privacy and include these institutions in the CBDC system, no system currently offers a solution to the privacy conflict between banks, financial institutions, and users. In this study, while we offer a solution to the privacy conflict between the user and the regulatory agencies, we also provide a solution to the privacy conflict between the user and the banks. Our solution, KAIME ∗ has also a modular structure. The privacy of the sender and receiver can be hidden if desired. Compared to previous related research, security analysis and implementation of KAIME is substantially simpler because simple and well-known cryptographic methods are used.
TLS → Post-Quantum TLS: Inspecting the TLS landscape for PQC adoption on Android

The ubiquitous use of smartphones has contributed to more and more users conducting their online browsing activities through apps, rather than web browsers. In order to provide a seamless browsing experience to the users, apps rely on a variety of HTTP-based APIs and third-party libraries, and make use of the TLS protocol to secure the underlying communication. With NIST’s recent announcement of the first standards for post-quantum algorithms, there is a need to better understand the constraints and requirements of TLS usage by Android apps in order to make an informed decision for migration to the post-quantum world. In this paper, we performed an analysis of TLS usage by highest-ranked apps from Google Play Store to assess the resulting overhead for adoption of post-quantum algorithms. Our results show that apps set up large numbers of TLS connections with a median of 94, often to the same hosts. At the same time, many apps make little use of resumption to reduce the overhead of the TLS handshake. This will greatly magnify the impact of the transition to post-quantum cryptography, and we make recommendations for developers, server operators and the mobile operating systems to invest in making more use of these mitigating features or improving their accessibility. Finally, we briefly discuss how alternative proposals for post-quantum TLS handshakes might reduce the overhead.
Response of fatal landslides to precipitation over the Chinese Loess Plateau under global warming

Rain-induced loess landslides are especially prevalent in the Chinese Loess Plateau (CLP). Some became fatal landslide disasters, leading to numerous casualties and significant socioeconomic losses. Extreme precipitation is the main cause of landslide occurrence. Therefore, in this study we discuss the correlation between seven extreme precipitation indices, single continuous precipitation events and fatal landslides in the CLP using Pearson correlation analysis. We also predict future precipitation under climate changes using five optimal CMIP6 models. During the period 2004–2016, fatal landslides in the CLP increased at a rate of 0.6 per year, with frequent landslide events occurring especially in the central and southwestern parts of the CLP. We find that SDII (simple daily intensity precipitation index) and R × 5day (max 5-day precipitation amount) show spatial distribution that are consistent with fatal landslides. Extreme precipitation events were frequent after year 2000; and several extreme precipitation indices show an increasing trend with a higher magnitude since 2000 than before 2000. In particular, in 2013 when the number of fatal landslides was as high as 17, SDII, R95pTOT (extremely wet days), R25mm (very heavy precipitation days), and R × 5day all showed abrupt increases. Single continuous precipitation events have profound effects on fatal landslides. We show that single continuous precipitation events with cumulative precipitation of 185–235 mm and duration of 6 days or longer have the highest correlation with fatal landslides. As the increasing occurrence of extreme rainfall events by the global warming, the CLP may face more fatal landslides in the future, especially in the high emission scenario of greenhouse gases (GHGs).
Extensive complex neocortical movement topography devolves to simple output following experimental stroke in mice

The neocortex encodes complex and simple motor outputs in all mammalian species that have been tested. Given that changes in neocortical reorganization (and corresponding corticospinal output) have been implicated in long term motor recovery after stroke injury, there remains a need to understand this biology in order to expedite and optimize clinical care. Here, changes in the neocortical topography of complex and simple movement outputs were evaluated in mice following experimental middle cerebral artery occlusion (MCAo). Neocortical motor output was defined using long-duration parameters of intracortical microstimulation (LD-ICMS) based on area and spatial coordinates of separate motor output types to build upon our recent report in uninjured mice. LD-ICMS test sites that elicited complex (multi-joint) movement, simple (single skeletal joint) movement, as well as co-elicited FORELIMB + HINDLIMB responses were detected and recorded. Forelimb reaching behavior was assessed using the single pellet reaching (SPR) task. At 6 weeks post-surgery, behavioral deficits persisted and neocortical territories for separate movements exhibited differences in neocortical area, and spatial location, and differed between MCAo-Injured animals (i.e., the MCAo group) and Sham-Injured animals (i.e., the Control group). MCAo-Injury reduced neocortical area of complex movements while increasing area of simple movements. Limited effects of injury were detected for spatial coordinates of neocortical movements. Significant positive correlations were detected between final SPR performance and either area of complex retract or area of co-occurring FORELIMB + HINDLIMB sites.
Zhilong Huoxue Tongyu capsule attenuates intracerebral hemorrhage induced redox imbalance by modulation of Nrf2 signaling pathway

Background: One of the severely debilitating and fatal subtypes of hemorrhagic stroke is intracerebral hemorrhage (ICH), which lacks an adequate cure at present. The Zhilong Huoxue Tongyu (ZLHXTY) capsule has been utilized effectively since last decade to treat ICH, in some provinces of China but the scientific basis for its mechanism is lacking. Purpose: To investigate the neuroprotective role of ZLHXTY capsules for ICH-induced oxidative injury through the regulation of redox imbalance with the Nrf2 signaling pathway. Methods: Autologous blood injection model of ICH in C57BL/6J mice was employed. Three treatment groups received ZLHXTY once daily through oral gavage at doses 0.35 g/kg, 0.7 g/kg, and 1.4 g/kg, started after 2 h and continued for 72 h of ICH induction. The neurological outcome was measured using a balance beam test. Serum was tested for inflammatory markers IL-1β, IL-6, and TNF-α through ELISA, oxidative stress through hydrogen peroxide content assay, and antioxidant status by total antioxidant capacity (T-AOC) assay. Nuclear extract from brain tissue was assayed for Nrf2 transcriptional factor activity. RT-qPCR was performed for Nfe2l2, Sod1, Hmox1, Nqo1, and Mgst1; and Western blotting for determination of protein expression of Nrf2, p62, Pp62, Keap, HO1, and NQO1. Fluoro-jade C staining was also used to examine neuronal damage. Results: ZLHXTY capsule treatment following ICH demonstrated a protective effect against oxidative brain injury. Neurological scoring showed improvement in behavioral outcomes. ELISA-based identification demonstrated a significant decline in the expression of serum inflammatory markers. Hydrogen peroxide content in serum was found to be reduced. The total antioxidant capacity was also reduced in serum, but the ZLHXTY extract showed a concentration-dependent increase in T-AOC speculating at its intrinsic antioxidant potential. Nrf2 transcriptional factor activity, mRNA and protein expression analyses revealed normalization of Nrf2 and its downstream targets, which were previously elevated as a result of oxidative stress induced by ICH. Neuronal damage was also reduced markedly after ZLHXTY treatment as revealed by Fluoro-jade C staining. Conclusion: ZLHXTY capsules possess an intrinsic antioxidant potential that can modulate the ICH-induced redox imbalance in the brain as revealed by the normalization of Nrf2 and its downstream antioxidant targets.
Axon terminal hypertrophy of striatal projection neurons with levodopa-induced dyskinesia priming

Background A rat model of levodopa-induced dyskinesia (LID) showed enlarged axon terminals of striatal direct pathway neurons in the internal segment of the globus pallidus (GPi) with excessive gamma-aminobutyric acid (GABA) storage in them. Massive GABA release to GPi upon levodopa administration determines the emergence of LID. Objectives We examined whether LID and axon terminal hypertrophy gradually develop with repeated levodopa treatment in Parkinsonian rats to examine if the hypertrophy reflects dyskinesia priming. Methods 6-hydroxydopamine-lesioned hemiparkinsonian rats were randomly allocated to receive saline injections (placebo group, 14 days; n = 4), injections of 6 mg/kg levodopa methyl ester combined with 12.5 mg/kg benserazide (levodopa-treated groups, 3-day-treatment; n = 4, 7-day-treatment; n = 4, 14-day-treatment; n = 4), or injections of 6 mg/kg levodopa methyl ester with 12.5 mg/kg benserazide and 1 mg/kg 8-hydroxy-2-(di-n-propylamino)tetralin for 14 days (8-OH-DPAT-treated group; n = 4). We evaluated abnormal involuntary movement (AIM) scores and axon terminals in the GPi. Results The AIM score increased with levodopa treatment, as did the hypertrophy of axon terminals in the GPi, showing an increased number of synaptic vesicles in hypertrophied terminals. Conclusion Increased GABA storage in axon terminals of the direct pathway neurons represents the priming process of LID.
Effect from usage and autoclave sterilization on torsional fracture resistance of heat-treated nickel-titanium instruments: an in-vitro study

This study aimed to evaluate the effect from usage and autoclaving on torsional fracture resistance of heat-treated nickel-titanium rotary instruments. ProTaper Gold F2 (PG) and TruNatomy Prime (TN) were selected. For group-N, new files were tested to make a baseline torsional resistance. For group-U, files underwent instrumentation in a J-shaped canal block, and files were tested. For group-S, files underwent instrumentation as in the group-U and followed by autoclave sterilization then were tested. Maximum torsional strength and distortion angel until fracture were measured using a customized device and toughness was calculated. Statistical analysis was conducted at the significance level of 95%. The topographic appearances of torsional fracture fragments were examined under scanning electron microscopy. PG showed significantly higher torsional strength after usage and sterilization; however, TN had reduced torsional strength (p < 0.05). PG showed significantly higher torsional strength in group-S than subgroup-N, while TN showed significantly lower torsional strength in group-U than group-N (p < 0.05). Regardless of the test conditions, PG showed significantly higher torsional strength and toughness than TN while TN had bigger distortion angle than PG (p < 0.05). The mechanical loads from usage and heat application during sterilization may result in alteration of torsional resistances according to geometry and alloy characteristics.