bluuebunny/crossref_metadata_2025_split huggingface dataset:
Analysis of Factors Influencing the Transformation of the Workforce from the Agricultural Sector to the Non-Agricultural Sector in Bagik Polak Village, West Lombok Regency
Authors: Puspawati Sumarni , Daeng Akung , Arini Gusti Ayu 
Published: July 2024

This study aims to analyze the influence of income, education, age and gender on the transformation of the workforce from the agricultural sector to the non-agricultural sector in Bagik Polak Village. The type of research used in this study is the associative quantitative method. The test was carried out on 94 respondents spread across 7 hamlets, namely Karang buncu lauq, Karang buncu Barat, Karang buncu daye, Rerot, Karang kebon timur, Karang kebon Barat and Enjak. Data was obtained by distributing questionnaires and sampling research using the purposive sampling method. The analysis tool used is logistic regression (logit) which has three tests including Assessing the Overall Model Fit, Testing the Feasibility of the Regression Model (Goodness of Fit Test) and Determination Coefficient (Nagelkerke's R Square). As well as statistical tests, namely the Likelihood Ratio Test (Simultaneous Test F) and the Wald Test (Partial Test t). The results of the analysis show that purely of the four variables used in this study, there are two variables that have a positive and significant effect, namely income with a significant value of 0.045< 0.05; and education with a significant value of 0.019 < 0.05. Meanwhile, the age variables with a significant value of 0.796 > 0.05 and gender with a significant value of 0.851 > 0.05 did not have a significant effect on the transformation of the workforce from the agricultural sector to the non-agricultural sector in Bagik Polak Village. Meanwhile, simultaneously that together, the independent variable (X) has an effect on the transformation of the workforce from the agricultural sector to the non-agricultural sector with a significant chi-square value of 0.004 < 0.05. Meanwhile, Nagelkerke's R2 value shows that all independent variables are able to explain the dependent variable by 42.7% and the remaining 57.3% are explained by other variables that are not included in the model.
Clinical and Radiological Characteristics of Respiratory Tuberculosis Treatment Failures in Children and Adolescents and Timing of their Detection Depending on Examination Method
Authors: Petrakova I. Yu. , Gubkina M. F. , Tyurin I. E. 
Published: July 2024

The objective: selection of optimal timing for chest CT to identify respiratory tuberculosis treatment failures in children and adolescents through clinical and radiological comparison.Subjects and Methods. A retrospective comparative study was conducted. Totally 70 patients aged from 2 to 17 years with various clinical forms of respiratory tuberculosis were examined. Retrospectively, patients were divided into 3 groups: Group 1 (35 people) – CT was performed before the treatment start and, as the first control, after 2-3 months of chemotherapy; Group 2 (17 people) had a CT before the chemotherapy start and after 2-3 months – plain X-ray (or in combination with linear tomography), CT control – after 6-9 months after the chemotherapy start; Group 3 (18 people) included patients who had only plain X-ray (or in combination with linear tomography) before and during chemotherapy, CT was first performed after treatment failureResults. In all groups, in more than 40% of cases, radiological changes were the only informative criterion of treatment failure. CT performed in the early stages was optimal for timely detection of treatment failure: before the chemotherapy start and in 2-3 months (Group 1). In patients of Groups 2 and 3, opportunities for timely correction of chemotherapy were missed due to inadequate assessment of pathological changes. CT performed after 6-9 months of treatment reliably revealed irreversible changes in 53% and 78% (Groups 2 and 3), respectively.
The Effect of Numbered Head Together (NHT) Model on Elementary School Learning Motivation (Literature Study)
Authors: Fadhli Dzil Ikrom  , Fajar Yumanhadi Aripin  
Published: July 2024

Penelitian bertujuan dalam rangka mengukur rendahnya motivasi belajar siswa dalam pembelajaran IPS, yang dikarenakan kurangnya inovasi guru dalam kegiatan belajar mengajar (KBM). Tujuan penelitian ini guna mengetahui pengaruhnya model pembelajaran kooperatif tipe Numbered Head Together (NHT) Terhadap motivasi belajar IPS di sekolah dasar . Penelitian ini menggunakan teknik penelitian kualitatif. Jenis penelitian ini merupakan analisis studi literatur yang pengambilan datanya atau instrumen-instrumen penelitian dari sumber primer dan sumber sekunder. Berdasarkan hasil analisis data primer dan data sekunder maka diperoleh bahwa pembelajaran yang diterapkan dengan model Numbered Head Together (NHT) berpengaruh terhadap motivasi belajar IPS. Dengan demikian, pembelajaran yang menggunakan strategi atau model pembelajaran konvensional terhadap motivasi belajarnya lebih rendah (hasil belajar).Hal ini dapat disimpulkan bahwa adanya pengaruh model pembelajaran kooperatif tipe Numbered Head Together (NHT) Terhadap motivasi belajar siswa pada pembelajaran IPS.
Implementation of the PBL Learning Model in Increasing Students' Curiosity through Animation Video Media
Authors: Hilda Dhaniartika Nurma'ardi  , Fadhli Dzil Ikrom  
Published: July 2024

Rasa ingin tahu merupakan salah satu pendorong yang menjadi cikal bakal siswa dalam mempelajari sesuatu. Sebab itulah, memiliki rasa ingin tahu sangat penting untuk dimiliki oleh siswa. Penelitian ini dilakukan guna mendeskripsikan serta memberikan gambaran mengenai pencapain dari penggunaan model pembelajaran PBL berbantuan media video Animasi dalam meningkatkan rasa ingin tahu siswa kelas IV SDN Ranjeng. Metode yang digunakan dalam penelitian ini ialah metode penelitian desktiptif kualitatif. Guna mencari gambaran nyata dilapangan, pengumpulan data pada penelitian ini dilakukan melalui kegiatan observasi, wawancara, dokumentasi, dan kuesioner. Berlandasan penelitian yang telah dilakukan, dapat di tarik kesimpulan bahwa penerapan pembelajaran PBL berbantuan video animasi dapat meningkatkan rasa ingin tahu siswa sekolah dasar pada mata pelajaran IPA.
تنازع الاختصاص بين القضاء العسكري والقضاء المدني
Authors: الراشدي وليد بدر نجم 
Published: July 2024

يهدف البحث الحالي الى توضيح موقف المشرع العسكري العراقي من تنازع الاختصاص بعد صدور قانون اصول المحاكمات الجزائية العسكري الجديد ذي الرقم (22) لسنة 2016 وتوضيح مفهوم الاختصاص بكل ابعاده اللغوية والاصطلاحية والقانونية وإضافة لبنة اجرائية تخلى عنها المشرع الجزائي او لم يعالجها بصورة صريحة، إذ تنبع أهمية البحث من أهمية موضوع الاختصاص الذي يحتل موقع مهم واساس في تحديد مهمة القضاء الذي تناط به مهمة التثبت من تهمة المتهم او نفيها عنه، وتوصل الباحث الى العديد من الاستنتاجات كان أهمها ان الاختصاص يراد به اهلية المحكمة للنظر في الدعوى، اما تنازع الاختصاص فيراد به الخلاف بين جهتين قضائيتين في شأن اختصاصها بنظر دعوى معينة. والتنازع على الاختصاص قد يقع بين محكمتين عسكريتين او قد يقع بين محكمة عسكرية ومحكمة جزائية عادية، وأوصى الباحث بضرورة إيراد المشرع العراقي لنص صريح وواضح يحدد الجهة المختصة في حل التنازع على الاختصاص الايجابي او السلبي الواقع بين المحاكم العسكرية والمحاكم الجزائية العادية بالإضافة الى ضرورة اعطاء اطراف الدعوى الحق في طلب تعيين المرجع المختص بحل التنازع، وعدم اقتصار ذلك على المحكمة فقط.
A Survey of Polynomial Multiplications for Lattice-Based Cryptosystems
Authors: Hwang Vincent 
Published: July 2024

We survey various mathematical tools used in software works multiplying polynomials in

ℤ
q

[
x
]

⟨

x
n

−
α
x
−
β

⟩

.

In particular, we survey implementation works targeting polynomial multiplications in lattice-based cryptosystems Dilithium, Kyber, NTRU, NTRU Prime, and Saber with instruction set architectures/extensions Armv7-M, Armv7E-M, Armv8-A, and AVX2.
There are three emphases in this paper: (i) modular arithmetic, (ii) homomorphisms, and (iii) vectorization. For modular arithmetic, we survey Montgomery, Barrett, and Plantard multiplications. For homomorphisms, we survey (a) various homomorphisms such as Cooley–Tukey FFT, Good–Thomas FFT, Bruun's FFT, Rader's FFT, Karatsuba, and Toom–Cook; (b) various algebraic techniques for adjoining nice properties to the coefficient rings, including localization, Schönhage's FFT, Nussbaumer's FFT, and coefficient ring switching; and (c) various algebraic techniques related to the polynomial moduli, including twisting, composed multiplication, evaluation at

∞

, truncation, incomplete transformation, striding, and Toeplitz matrix-vector product. For vectorization, we survey the relations between homomorphisms and vector arithmetic.
We then go through several case studies: We compare the implementations of modular multiplications used in Dilithium and Kyber, explain how the matrix-to-vector structure was exploited in Saber, and review the design choices of transformations for NTRU and NTRU Prime with vectorization. Finally, we outline several interesting implementation projects.
Ad Hoc Broadcast, Trace, and Revoke
Authors: Luo Ji 
Published: July 2024

Traitor tracing schemes [Chor–Fiat–Naor, Crypto ’94] help content distributors fight against piracy and are defined with the content distributor as a trusted authority having access to the secret keys of all users. While the traditional model caters well to its original motivation, its centralized nature makes it unsuitable for many scenarios. For usage among mutually untrusted parties, a notion of *ad hoc* traitor tracing (naturally with the capability of broadcast and revocation) is proposed and studied in this work. Such a scheme allows users in the system to generate their own public/secret key pairs, without trusting any other entity. To encrypt, a list of public keys is used to identify the set of recipients, and decryption is possible with a secret key for any of the public keys in the list. In addition, there is a tracing algorithm that given a list of recipients’ public keys and a pirate decoder capable of decrypting ciphertexts encrypted to them, identifies at least one recipient whose secret key must have been used to construct the said decoder.
Two constructions are presented. The first is based on functional encryption for circuits (conceptually, obfuscation) and has constant-size ciphertext, yet its decryption time is linear in the number of recipients. The second is a generic transformation that reduces decryption time at the cost of increased ciphertext size. A matching lower bound on the trade-off between ciphertext size and decryption time is shown, indicating that the two constructions achieve all possible optimal trade-offs, i.e., they fully demonstrate the Pareto front of efficiency. The lower bound also applies to broadcast encryption (hence all mildly expressive attribute-based encryption schemes) and is of independent interest.
Twinkle: A family of Low-latency Schemes for Authenticated Encryption and Pointer Authentication
Authors: Wang Jianhua , Huang Tao , Wu Shuang , Liu Zilong 
Published: July 2024

In this paper, we aim to explore the design of low-latency authenticated encryption schemes particularly for memory encryption, with a focus on the temporal uniqueness property. To achieve this, we present the low-latency Pseudo-Random Function (PRF) called Twinkle with an output up to 1152 bits. Leveraging only one block of Twinkle, we developed Twinkle-AE, a specialized authenticated encryption scheme with six variants covering different cache line sizes and security requirements. We also propose Twinkle-PA, a pointer authentication algorithm, which takes a 64-bit pointer and 64-bit context as input and outputs a tag of 1 to 32 bits.
We conducted thorough security evaluations of both the PRFs and these schemes, examining their robustness against various common attacks. The results of our cryptanalysis indicate that these designs successfully achieve their targeted security objectives.
Hardware implementations using the FreePDK45nm library show that Twinkle-AE achieves an encryption and authentication latency of 3.83 ns for a cache line. In comparison, AES-CTR with WC-MAC scheme and Ascon-128a achieve latencies of 9.78 ns and 27.30 ns, respectively. Moreover, Twinkle-AE is also most area-effective for the 1024-bit cache line. For the pointer authentication scheme Twinkle-PA, the latency is 2.04 ns, while QARMA-64-sigma0 has a latency of 5.57 ns.
A Long Tweak Goes a Long Way: High Multi-user Security Authenticated Encryption from Tweakable Block Ciphers
Authors: Cogliati Benoît , Jean Jérémy , Peyrin Thomas , Seurin Yannick 
Published: July 2024

We analyze the multi-user (mu) security of a family of nonce-based authentication encryption (nAE) schemes based on a tweakable block cipher (TBC). The starting point of our work is an analysis of the mu security of the SCT-II mode which underlies the nAE scheme Deoxys-II, winner of the CAESAR competition for the defense-in-depth category. We extend this analysis in two directions, as we detail now.
First, we investigate the mu security of several TBC-based variants of the counter encryption mode (including CTRT, the encryption mode used within SCT-II) that differ by the way a nonce, a random value, and a counter are combined as tweak and plaintext inputs to the TBC to produce the keystream blocks that will mask the plaintext blocks. Then, we consider the authentication part of SCT-II and study the mu security of the nonce-based MAC Nonce-as-Tweak (NaT) built from a TBC and an almost universal (AU) hash function. We also observe that the standard construction of an AU hash function from a (T)BC can be proven secure under the assumption that the underlying TBC is unpredictable rather than pseudorandom, allowing much better conjectures on the concrete AU advantage. This allows us to derive the mu security of the family of nAE modes obtained by combining these encryption/MAC building blocks through the NSIV composition method.
Some of these modes require an underlying TBC with a larger tweak length than what is usually available for existing ones. We then show the practicality of our modes by instantiating them with two new TBC constructions, Deoxys-TBC-512 and Deoxys-TBC-640, which can be seen as natural extensions of the Deoxys-TBC family to larger tweak input sizes. Designing such TBCs with unusually large tweaks is prone to pitfalls: Indeed, we show that a large-tweak proposal for SKINNY published at EUROCRYPT 2020 presents an inherent construction flaw. We therefore provide a sound design strategy to construct large-tweak TBCs within the Superposition Tweakey (STK) framework, leading to new Deoxys-TBC and SKINNY variants. We provide software benchmarks indicating that while ensuring a very high security level, the performances of our proposals remain very competitive.
Efficient isochronous fixed-weight sampling with applications to NTRU
Authors: Filho Décio , Silva Tomás , López Julio 
Published: July 2024

We present a solution to the open problem of designing a linear-time, unbiased and timing attack-resistant shuffling algorithm for fixed-weight sampling. Although it can be implemented without timing leakages of secret data in any architecture, we illustrate with ARMv7-M and ARMv8-A implementations; for the latter, we take advantage of architectural features such as NEON and conditional instructions, which are representative of features available on architectures targeting similar systems, such as Intel. Our proposed algorithm improves asymptotically upon the current approach based on constant-time sorting networks (

O
(
n
)

versus

O
(
n

log
2

n
)

), and an implementation of the new algorithm applied to NTRU is also faster in practice, by a factor of up to

6.91

(
591
%
)

on ARMv8-A cores and

12.89

(
1189
%
)

on the Cortex-M4; it also requires fewer uniform random bits. This translates into performance improvements for NTRU encapsulation, compared to state-of-the-art implementations, of up to 50% on ARMv8-A cores and 72% on the Cortex-M4, and small improvements to key generation (up to 2.7% on ARMv8-A cores and 6.1% on the Cortex-M4), with negligible impact on code size and a slight improvement in RAM usage for the Cortex-M4.
Communication-Efficient Multi-Party Computation for RMS Programs
Authors: Attema Thomas , van Baarsen Aron , van den Berg Stefan , Capitão Pedro , Dunning Vincent , Kohl Lisa 
Published: July 2024

Despite much progress, general-purpose secure multi-party computation (MPC) with active security may still be prohibitively expensive in settings with large input datasets. This particularly applies to the secure evaluation of graph algorithms, where each party holds a subset of a large graph. Recently, Araki et al. (ACM CCS '21) showed that dedicated solutions may provide significantly better efficiency if the input graph is sparse. In particular, they provide an efficient protocol for the secure evaluation of “message passing” algorithms, such as the PageRank algorithm. Their protocol's computation and communication complexity are both

O

~

(
M
·
B
)

instead of the

O
(

M
2

)

complexity achieved by general-purpose MPC protocols, where

M

denotes the number of nodes and

B

the (average) number of incoming edges per node. On the downside, their approach achieves only a relatively weak security notion;

1

-out-of-

3

malicious security with selective abort.
In this work, we show that PageRank can instead be captured efficiently as a restricted multiplication straight-line (RMS) program, and present a new actively secure MPC protocol tailored to handle RMS programs. In particular, we show that the local knowledge of the participants can be leveraged towards the first maliciously-secure protocol with communication complexity linear in

M

, independently of the sparsity of the graph. We present two variants of our protocol. In our communication-optimized protocol, going from semi-honest to malicious security only introduces a small communication overhead, but results in quadratic computation complexity

O
(

M
2

)

. In our balanced protocol, we still achieve a linear communication complexity

O
(
M
)

, although with worse constants, but a significantly better computational complexity scaling with

O
(
M
·
B
)

. Additionally, our protocols achieve security with identifiable abort and can tolerate up to

n
−
1

corruptions.
Simple Watermarking Pseudorandom Functions from Extractable Pseudorandom Generators
Authors: Bock Estuardo , Brzuska Chris , Lai Russell 
Published: July 2024

Watermarking pseudorandom functions (PRF) allow an authority to embed an unforgeable and unremovable watermark into a PRF while preserving its functionality. In this work, we extend the work of Kim and Wu [Crypto'19] who gave a simple two-step construction of watermarking PRFs from a class of extractable PRFs satisfying several other properties – first construct a mark-embedding scheme, and then upgrade it to a message-embedding scheme.
While the message-embedding scheme of Kim and Wu is based on complex homomorphic evaluation techniques, we observe that much simpler constructions can be obtained and from a wider range of assumptions, if we forego the strong requirement of security against the watermarking authority. Concretely, we introduce a new notion called extractable PRGs (xPRGs), from which extractable PRFs (without security against authorities) suitable for the Kim-Wu transformations can be simply obtained via the Goldreich-Goldwasser-Micali (GGM) construction. We provide simple constructions of xPRGs from a wide range of assumptions such as hardness of computational Diffie-Hellman (CDH) in the random oracle model, as well as LWE and RSA in the standard model.
Navigating Educational Leadership Challenges: Transformations and Policy Implications for Filipino Principals
Authors: Jesher Edrei Perez  
Published: July 2024

This study explored the multifaceted challenges confronting Filipino school principals in primary education. It synthesized and analyzed eight significant leadership challenges: corruption, political involvement, socio-economic disparities, systemic Department of Education issues, curriculum challenges, principal-centeredness, religious diversity, and the impact of regional military conflicts. To address these challenges effectively, the research proposes several strategies. Firstly, it recommends adopting a distributed leadership model, promoting collaboration among all education stakeholders. Shifting away from a principal-centered approach can alleviate managerial burdens and enhance teaching and learning quality. The study also emphasizes the need for a cultural shift in educational leadership. Principals should actively engage in re-culturing efforts to instill new values, beliefs, and norms within their school communities, fostering a more conducive learning environment and encouraging innovative teaching practices. At the national level, policy reforms are essential to support principals. These reforms should include clear directives on religious instruction, combating corruption within the Department of Education, and revamping teacher support training programs for personal and professional development rather than mandatory attendance. In conclusion, this research underscores the intricate challenges faced by Filipino principals and proposes a roadmap for practical solutions. They embrace distributed leadership, initiate cultural change through reculturing, and implement national policy reforms to empower Filipino principals to lead their schools toward improved educational outcomes.
Pengaruh Model Pembelajaran Circuit Lerning Terhadap Hasil Belajar Siswa Dalam Pelajaran Sejarah
Authors: Martini Martini 
Published: July 2024

Penulisan artikel ini merupakan pencarian informasi yang bertujuan mengetahui pengaruh model pembelajaran circuit learning terhadap hasil belajar siswa dalam pelajaran sejarah. Penulisan ini dilakukan dengan rentang waktu yang sangat singkat. Permasalahan dalam penulisan ini adalah rendahnya kemandirian siswa dan hasil belajar sejarah di dalam pelajaran sekolah menengah atas . Tujuan penulisan ini adalah untuk mengetahui peningkatan kemandirian siswa dan hasil belajar sejarah dalam pelajaran sejarah melalui penerapan Model Circuit Learning tetapi hanya dengan pengumpulan sumber-sumber yang sudah, seperti penelitian-penelitian orang yang sudah jelas dan sah. Akan tetapi semua itu tidak berarti bahwa penulisan ini tidak valid tetapi tulisan ini merupakan tulisan yang valid, karena sumber-sumber dan data-data yang di kutip merupakan data-data yang valid.
Kajian Buku Teks Sejarah Kontroversial: Gerakan PRRI dan PERMESTA dalam Konflik dan Dampaknya Terhadap Stabilitas Nasional Tahun 1958-1961
Authors: Putri Kamelia , Raihan Rendy , Fauzan Rikza 
Published: July 2024

Peristiwa PRRI (Pemerintahan Revolusioner Republik Indonesia) dan Permesta (Perjuangan Semesta) merupakan dua gerakan separatis yang terjadi di Indonesia pada akhir 1950-an hingga awal 1960-an. PRRI diumumkan pada 15 Februari 1958 di Sumatera Barat oleh beberapa tokoh militer dan politisi yang tidak puas dengan kebijakan pemerintahan pusat di bawah Presiden Soekarno. Sementara itu, Permesta dideklarasikan pada 2 Maret 1957 di Sulawesi Utara oleh tokoh-tokoh militer yang juga menginginkan otonomi daerah yang lebih besar dan perbaikan ekonomi di wilayah mereka. Kedua gerakan ini mencerminkan ketidakpuasan daerah-daerah luar Jawa terhadap pemerintahan pusat yang dianggap tidak adil dan terlalu sentralistik. Adapun tujuan penulisan ini ialah untuk menggali lebih dalam tentang dinamika konflik dan dampaknya bagi kondisi sosial dan ekonomi di daerah-daerah yang terlibat dalam pemberontakan, serta bagaimana ketidakpuasan tersebut mempengaruhi tindakan-tindakan mereka.