bluuebunny/crossref_metadata_2025 huggingface dataset:
Komunikasi Partisipatif Kepala Sekolah dalam Mengembangkan Kolaborasi dengan Komunitas dan Stakeholder
Authors: Zahria Ismi
Published: October 2024

This study aims to explore the communication strategies employed by the school principal in building collaboration with the community and stakeholders at SMK Diponegoro Tumpang. The principal plays a key role in improving the quality of education through participatory communication, involving parents, teachers, and the local community in decision-making. This research employs a qualitative method with a case study approach, conducting in-depth interviews with the principal to understand the challenges and successes in building collaboration. The findings indicate that the principal's use of face-to-face and digital communication successfully increased stakeholder engagement and strengthened support for school programs. However, the main challenges identified include the digital divide and differing expectations among stakeholders. This study highlights the importance of open, participatory, and flexible communication to ensure successful collaboration between schools and the community.
PLURALISME AGAMA-AGAMA DI INDONESIA: IMAN KRISTEN UNTUK MENINGKATKAN MOTIVASI PENDIDIKAN AGAMA KRISTEN DI GEREJA
Authors: Widiyaningtyas Ester , Plestari Delsi
Published: October 2024

Artikel ini berisi pembahasan tentang pandangan iman Kristiani dalam menghadapi pluralisme dan apa yang menjadikan landasan pemikiran dan sikap teologis dan etis umat beriman terhadap Yesus Kristus, dalam ajaran dunia yang semakin mengancam iman dan keyakinan Kristiani. Pluralisme adalah hal yang nyata dan pasti terjadi di kalangan pluralisme agama, sebagai umat Kristiani tentunya membawa kabar keselamatan melalui Yesus Kristus. Tulisan ini mengkaji bahwa pluralisme agama berkembang sangat pesat di era pluralisme agama, dalam perkembangan pluralisme ini dimana nilai-nilai Kristiani yang menekankan Kristus sebagai satu-satunya jalan keselamatan dan kebenaran ditolak oleh pluralisme. Iman Kristiani dalam situasi ini memberikan tanggapan dalam perspektif doktrin, yaitu Tritunggal yang memiliki hubungan dengan pluralitas. Adanya situasi seperti ini membawa umat Kristiani pada panggilan sebagai umat pilihan Tuhan dan melakukan apologetika serta memperluas karya Tuhan dan menerapkan kasih agape kepada umat lintas agama. This article discusses the views of the Christian faith in the face of pluralism and what makes the basis of the theological and ethical thinking and attitude of the faithful towards Jesus Christ, in the teachings of the world that increasingly threaten Christian faith and belief. Pluralism is a real and definite thing that happens among religious pluralism, as Christians, of course, bringing the news of salvation through Jesus Christ. This paper examines that religious pluralism developed very rapidly in the era of religious pluralism, in the development of this pluralism where Christian values that emphasize Christ as the only way of salvation and truth are rejected by pluralism. The Christian faith in this situation responds in a doctrinal perspective, namely the Trinity which has a relationship with plurality. The existence of a situation like this leads Christians to the vocation as God's chosen people and to do apologetics and expand God's work and apply agape love to people of all faiths.
ĐÁNH GIÁ TÌNH TRẠNG DINH DƯỠNG TRƯỚC - SAU GHÉP VÀ CHẾ ĐỘ ĂN TUẦN ĐẦU SAU PHẪU THUẬT Ở 10 NGƯỜI BỆNH GHÉP THẬN, TẠI BỆNH VIỆN QUÂN Y 175
Authors: Bùi Thị Duyên  , Đặng Quỳnh Nghi  , Đỗ Thị Hằng
Published: October 2024

Mục tiêu: Đánh giá tình trạng dinh dưỡng trước - sau ghép thận và chế độ ăn sớm (tuần đầu) sau phẫu thuật ở người bệnh ghép thận.
Đối tượng và phương pháp: Nghiên cứu hồi cứu kết hợp tiến cứu, theo dõi cắt ngang nhiều thời điểm trên 10 người bệnh ghép thận (chọn mẫu toàn bộ), tại Bệnh viện Quân y 175, từ tháng 8/2023 đến tháng 02/2024). Phân tích thành phần cơ thể người bệnh qua chiều cao, cân nặng, BMI thời điểm trước và sau ghép thận 3 tháng; phân tích khẩu phần ăn 24 giờ trong tuần đầu sau ghép thận.
Kết quả: Trước ghép thận, tỉ lệ người bệnh suy dinh dưỡng, thừa cân và có khối tế bào cơ thấp lần lượt là 10%, 10% và 30%. Sau ghép thận 3 tháng, tỉ lệ người bệnh có BMI bình thường và có tỉ lệ mỡ cơ thể cao lần lượt là 100% và 30%. Khẩu phần ăn sớm sau ghép thận cho thấy có 50% người bệnh đạt đủ nhu cầu về năng lượng; lượng đạm trung bình chưa đạt mức đạm tối ưu, nhưng 70% người bệnh đạt đủ khoảng nhu cầu đạm.
Abuso Sexual en las Infancias y Adolescencias. Revisión sistemática
Authors: Baez Zanni Melany Belén , Ferrero Florencia Paula , Martínez Sandra
Published: October 2024

En la presente revisión sistemática, se expone la temática del abuso sexual en las infan- cias y adolescencias. Dicho flagelo es recientemente conocido como un problema de salud pública. Se busca dar visibilidad, generar conciencia, sensibilización y profundizar en el conocimiento del abuso sexual en las infancias y adolescencias, a su vez, conocer sus diversos indicadores y aspectos para su prevención. Se utilizaron las siguientes bases de datos: Google Académico, Scielo, Redalyc, ResearchGate y Science Direct. La muestra estuvo compuesta por 20 investigaciones, elegidas de entre 300 artículos, que correspon- den a los años entre 2002 y 2019. Los resultados arrojaron que el sexo de las víctimas en mayor medida es femenino, y que los agresores sexuales pertenecen en gran porcentaje al círculo familiar de la misma. Además, las consecuencias fueron mayoritariamente psíquicas y conductuales. Y a su vez, se evidenció la eficacia en la implementación de programas para su prevención. Se concluye que cada vivencia es única y distinta, por lo cual no existe un plazo fijo de recuperación para las víctimas.
Efficient Heart Disease Prediction Using PSO Optimized LSTM Classifier
Authors: A Tamizharasi , S Mohanalakshmi
Published: October 2024

Accurate diagnosis and prognosis of cardiovascular disease are essential in the medical field, enabling cardiologists to administer appropriate treatments. Machine learning has gained prominence in the healthcare sector due to its ability to identify patterns in data. Leveraging machine learning for classifying cardiovascular disease occurrences, significantly minimize misdiagnosis. This research focuses on developing a robust model capable of accurately predicting cardiovascular diseases, ultimately aiming to decrease the mortality rates associated with these conditions. To find clusters of data objects in a dataset, K-means clustering algorithm is implemented. The technique known as particle swarm optimization (PSO) is used to estimate solutions to extremely challenging or unsolvable numerical minimization and maximization problems. LSTM classifier, a deep learning technology is employed to categorize the attacks under various scenarios. In addition to greatly enhancing the healthcare system, this research gives medical practitioners access to an invaluable diagnostic tool. The outcomes of proposed work is examined using programs written in Python Jupyter software tool.
Advanced Malware detection with Inception V3 for Enhanced Computer Security
Authors: R Arun Kumar , JB Shriram
Published: October 2024

In the domain of computer security, identifying and categorizing malware is of utmost importance. Malicious software frequently employs sophisticated methods to avoid detection, underscoring the urgency of early identification to protect computer networks and the Internet from extensive harm. This study tackles the obstacles related to malware detection and presents an innovative solution leveraging Convolutional Neural Network (CNN) classification through Inception V3.The input dataset is pre-processed to make the procedure easier. Initial stage of pre-processing is performed on dataset followed by data visualization. These data visualizations help identify the abnormalities and their existence or absence, as well as the structure of data. The categorization process is performed by Inception V3, a CNN-based classification network. The Inception V3 is compared with the most accurate models to assess the effectiveness of proposed system. The implementation of the proposed approach is carried out using the Python programming language. The outcomes of this research showcase the proficiency of the developed system, highlighting its potential in enhancing the accuracy and efficiency of malware detection.
Der EGMR im Kampf um rechtsstaatliche Asylverfahren in Europa
Authors: Schmalz Dana
Published: October 2024

Der Europäische Gerichtshof für Menschenrechte (EGMR) hat Ungarn am 19. September 2024 für eine Verletzung des Verbots der Kollektivausweisung verurteilt. Die Tatsachen des Falls bilden eine lange Liste von Rechtsstaatsproblemen ab. Das Urteil stellt weiter den Schutzumfang des Art. 4 des 4. Zusatzprotokolls klar. Zugleich zeigt es, wie sich das Gericht – leise und ohne viel öffentliche Reaktion – gegen die vollständige Untergrabung rechtlicher Standards im Asyl- und Migrationsrecht stemmt.
APPLICATION OF NEW INFORMATION TECHNOLOGIES IN THE PROCESS OF PEDAGOGICAL SOFTWARE
Authors: Avetisyan Gagik
Published: October 2024

The use of new information technologies in practically every field of activity in modern society defines the need for the development of elements of students’ creative imagination. In the digital environment, the cognitive motivation of students is strengthened. The changes introduced by new information technologies in the development of students can have a cognitive, emotional, and motivational nature and affect their temperament and individual characteristics. One of the essential arguments accompanying the introduction of new information technologies in teaching is directly related to the increase in their educational and cognitive activity, which is expressed in the complexity of educational tasks, considering the capabilities of learners, as well as the choice of the maximum learning rate, the effectiveness of control, the increase of objectivity, and especially in the process of organizing pedagogical software tools.

Partial methodologies based on the application of new information technologies are used in the process of pedagogical software tools, depending on the educational goals or educational situations. In one case, it is necessary to understand the needs of the learner more deeply; in another case, the analysis of knowledge in the field of the relevant subject is important, as well as accounting for the psychological principles of learning. Accordingly, the use of new information technologies in the field of education as a means of disseminating information contributes to faster and fuller assimilation and dissemination of the material.
Pertimbangan Penyelidik Dalam Penghentian Penyelidikan Tindak Pidana Narkotika Berdasarkan Restoratif Justice
Authors: Nefri Ardi , Faniyah Iyah
Published: October 2024

Keadilan Restoratif menurut Pasal 1 Angka 3 Peraturan Polri Nomor 8 Tahun 2021 ialah penanganan delik dengan mencari penyelesaian yang bersifat adil menekankan pemulihan kembali pada keadaan semula. Pendekatan yang digunakan adalah pendekatan Yuridis Normatif yang didukung pendekatan Yuridis Empiris. Pertimbangan penyelidik dalam penghentian penyelidikan tindak pidana narkotika di Satresnarkoba Polresta Padang adalah dengan persyaratan khusus yaitu pecandu narkoba dan korban penyalahgunaan narkoba yang mengajukan rehabilitasi tidak ditemukan barang bukti tindak pidana narkotika namun hasil tes urine menunjukkan positif narkoba pelaku tidak terlibat dalam jaringan tindak pidana narkotika atau pengedar. Telah dilaksanakan assessmen oleh tim asessmen terpadu dan pelaku bersedia bekerjasama dengan penyidik untuk melakukan penyelidikan lanjutan. Akibat hukum dari penanganan tindak pidana narkotika melalui keadilan restoratif adalah tidak dilanjutkannya proses hukum terhadap pelaku. Kendala penyelidik dalam penghentian penyelidikan tindak pidana narkotika di Satresnarkoba Polresta Padang terdiri atas faktor eksternal yakni Pemahaman masyarakat yang kurang terhadap restorative justice yang dilakukan oleh polisi, masyarakat menganggap polisi justru melakukan pelanggaran hukum karena tidak menindak pelaku kejahatan tetapi justru memberikan kesempatan untuk bebas dari tuduhan dengan dalih restorative justice. Faktor internal yang menjadi hambatan yakni kendala finansial, kurang optimalnya profesional dan keahlian polisi, masih lemahnya penegakan hukum, dan adanya oknum aparat.
Nivel de Inteligencia Emocional en Estudiantes de Ingeniería Industrial: El Caso ITS de Tierra Blanca
Authors: Fuentes Rosas Liliana , Tobón Galicia Lucila Guadalupe , Rojas Mora Lot
Published: October 2024

La vida universitaria supone un desafío para los estudiantes en consecuencia de las nuevas responsabilidades que implica formarse como profesionista, en este proceso habrá situaciones que podrían desequilibrar su estado emocional. Las organizaciones educativas tienen la labor ineludible de promover la formación integral de los estudiantes, dotarlos tanto de habilidades duras como de habilidades blandas (inteligencia emocional entre ellas); las segundas en observación a que, en tiempos recientes, los empleadores prestan especial atención a las soft skills para la contratación de nuevos trabajadores. El objetivo de la investigación fue conocer el nivel de Inteligencia Emocional que prevalece entre el estudiantado de la carrera de Ingeniería Industrial. Los investigadores realizaron un estudio con enfoque cuantitativo no experimental (observacional), descriptivo, correlacional, comparativo y de corte transversal. Aplicaron, a una muestra de 161 estudiantes, la Escala Rasgos de Metaconocimiento sobre Estados Emocionales TMMS-24 en su versión castellana, integrada por 24 ítems con escala Likert de cinco niveles, con una confiabilidad de 0.910 dada por el Alfa de Cronbach. Los resultados arrojan que el nivel de Inteligencia Emocional del alumnado se ubica en adecuado, marcando ligeras diferencias a favor de la población de varones, sin que sean significativas; lo que ofrece la oportunidad de implementar estrategias para robustecer la habilidad en cuestión entre el alumnado.
Development and Validation of a New HPLC Bio Analytical Internal Standard Method for the Analysis of Two Immunology Drugs (Lamivudine and Dolutegravir) in Human Plasma
Authors: Prasad K.R.S. , Kumar Abbaraju V.D.N. , Uma Maheswar K. , Darapureddy Chaitanya , RS CH Phani
Published: October 2024

Bioanalytical methods are useful for the quantitative analysis of drugs and their metabolites in biological fluids. Bio-analytical internal standards methods plays vital role in areas of human clinical pharmacology. The aim of this work is to development and validation of bio-analytical internal standard method for determination of two immunology drugs Lamivudine (LMVD) and Dolutegravir (DTGR) in plasma with Abacavir(ABVR) drug as internal standard (IS). Liquid-liquid extraction with Diethyl ether and methanol in the ratio of 50:50 (v/v) was used for the extraction of drugs from the biological matrix. The optimized chromatography conditions consist of Water, Acetonitrile and Methanol in the ratio of 40:25:35 (v/v) as a mobile phase with Ascentis, C18 Column (250 X 4.6 mm, 5μ) as stationery phase. Isocratic elution with 1.2 ml flow separates theLMVD at 3.5 min, DTGR at 9.8 min and ABVR at 6.8 min. The method was validated as per ICH guidelines. The relative standard deviation (%RSD) were found to be <5%for precision studies. Hence the method was found to be suitable fort the analysis of LMVD and DTGR in spiked human plasma.
A Security Analysis of Restricted Syndrome Decoding Problems
Authors: Beullens Ward , Briaud Pierre , Øygarden Morten
Published: October 2024

Restricted syndrome decoding problems (R-SDP and R-SDP(

G

)) provide an interesting basis for post-quantum cryptography. Indeed, they feature in CROSS, a submission in the ongoing process for standardizing post-quantum signatures.

This work improves our understanding of the security of both problems. Firstly, we propose and implement a novel collision attack on R-SDP(

G

) that provides the best attack under realistic restrictions on memory. Secondly, we derive precise complexity estimates for algebraic attacks on R-SDP that are shown to be accurate by our experiments. We note that neither of these improvements threatens the updated parameters of CROSS.
Multi Designated Verifier Ring Signatures
Authors: Kolby Sebastian , Pagnin Elena , Yakoubov Sophia
Published: October 2024

We study signatures well suited for sensitive applications (e.g. whistleblowing) where both the signer's anonymity and deniability are important. Two independent lines of work have tackled these two goals: ring signatures ensure the signer's anonymity (within a set of signers, called a ring), and — separately — multi designated verifier signatures ensure that all the intended recipients agree on whether a signature is valid, while maintaining the signer's deniability by preventing the intended recipients from convincing an outsider of the validity of the signature. In this paper, we introduce multi designated verifier ring signatures (MDVRS), which simultaneously offer both signer anonymity and deniability. This makes MDVRS uniquely suited for sensitive scenarios.

Following the blueprint of Damgård et al (TCC'20) for multi designated verifier signatures, we introduce provably simulatable designated verifier ring signatures (PSDVRS) as an intermediate building block which we then compile into an MDVRS. We instantiate PSDVRS in a concretely efficient way from discrete logarithm based sigma protocols, encryption and commitments.
Efficient Boolean-to-Arithmetic Mask Conversion in Hardware
Authors: Shahmirzadi Aein , Hutter Michael
Published: October 2024

Masking schemes are key in thwarting side-channel attacks due to their robust theoretical foundation. Transitioning from Boolean to arithmetic (B2A) masking is a necessary step in various cryptography schemes, including hash functions, ARX-based ciphers, and lattice-based cryptography. While there exists a significant body of research focusing on B2A software implementations, studies pertaining to hardware implementations are quite limited, with the majority dedicated solely to creating efficient Boolean masked adders. In this paper, we present first- and second-order secure hardware implementations to perform B2A mask conversion efficiently without using masked adder structures. We first introduce a first-order secure low-latency gadget that executes a B2A2k in a single cycle. Furthermore, we propose a second-order secure B2A2k gadget that has a latency of only 4 clock cycles. Both gadgets are independent of the input word size k. We then show how these new primitives lead to improved B2Aq hardware implementations that perform a B2A mask conversion of integers modulo an arbitrary number. Our results show that our new gadgets outperform comparable solutions by more than a magnitude in terms of resource requirements and are at least 3 times faster in terms of latency and throughput. All gadgets have been formally verified and proven secure in the glitch-robust PINI security model. We additionally confirm the security of our gadgets on an FPGA platform using practical TVLA tests.
Almost pairwise independence and resilience to deep learning attacks
Authors: Takhanov Rustem
Published: October 2024

Almost pairwise independence (API) is a quantitative property of a class of functions that is desirable in many cryptographic applications. This property is satisfied by Learning with errors (LWE)-mappings and by special Substitution-Permutation Networks (SPN). API block ciphers are known to be resilient to differential and linear cryptanalysis attacks. Recently, security of protocols against neural network-based attacks became a major trend in cryptographic studies. Therefore, it is relevant to study the hardness of learning a target function from an API class of functions by gradient-based methods.

We propose a theoretical analysis based on the study of the variance of the gradient of a general machine learning objective with respect to a random choice of target function from a class. We prove an upper bound and verify that, indeed, such a variance is extremely small for API classes of functions. This implies the resilience of actual LWE-based primitives against deep learning attacks, and to some extent, the security of SPNs. The hardness of learning reveals itself in the form of the barren plateau phenomenon during the training process, or in other words, in a low information content of the gradient about the target function. Yet, we emphasize that our bounds hold for the case of a regular parameterization of a neural network and the gradient may become informative if a class is mildly pairwise independent and a parameterization is non-regular. We demonstrate our theory in experiments on the learnability of LWE mappings.
Unforgeability of Blind Schnorr in the Limited Concurrency Setting
Authors: Harding Franklin , Xu Jiayu
Published: October 2024

Blind signature schemes enable a user to obtain a digital signature on a message from a signer without revealing the message itself. Among the most fundamental examples of such a scheme is blind Schnorr, but recent results show that it does not satisfy the standard notion of security against malicious users, One-More Unforgeability (OMUF), as it is vulnerable to the ROS attack. However, blind Schnorr does satisfy the weaker notion of sequential OMUF, in which only one signing session is open at a time, in the Algebraic Group Model (AGM) + Random Oracle Model (ROM), assuming the hardness of the Discrete Logarithm (DL) problem.

This paper serves as a first step towards characterizing the security of blind Schnorr in the limited concurrency setting. Specifically, we show that blind Schnorr satisfies OMUF when at most two signing sessions can be concurrently open (in the AGM+ROM, assuming DL). Our argument suggests that it is plausible that blind Schnorr satisfies OMUF for up to polylogarithmically many concurrent signing sessions. Our security proof involves interesting techniques from linear algebra and combinatorics.
Efficient Maliciously Secure Oblivious Exponentiations
Authors: Baum Carsten , Berlips Jens , Chen Walther , Damgård Ivan , Esvelt Kevin , Foner Leonard , Gretton Dana , Kysel Martin , Rivest Ronald , Roy Lawrence , Sage-Ling Francesca , Shamir Adi , Vaikuntanathan Vinod , Van Hauwe Lynn , Vogel Theia , Weinstein-Raun Benjamin , Wichs Daniel , Wooster Stephen , Yao Andrew , Yu Yu
Published: October 2024

Oblivious Pseudorandom Functions (OPRFs) allow a client to evaluate a pseudorandom function (PRF) on her secret input based on a key that is held by a server. In the process, the client only learns the PRF output but not the key, while the server neither learns the input nor the output of the client. The arguably most popular OPRF is due to Naor, Pinkas and Reingold (Eurocrypt 2009). It is based on an Oblivious Exponentiation by the server, with passive security under the Decisional Diffie-Hellman assumption. In this work, we strengthen the security guarantees of the NPR OPRF by protecting it against active attacks of the server. We have implemented our solution and report on the performance. Our main result is a new batch OPRF protocol which is secure against maliciously corrupted servers, but is essentially as efficient as the semi-honest solution. More precisely, the computation (and communication) overhead is a multiplicative factor

o
(
1
)

as the batch size increases. The obvious solution using zero-knowledge proofs would have a constant factor overhead at best, which can be too expensive for certain deployments. Our protocol relies on a novel version of the DDH problem, which we call the Oblivious Exponentiation Problem (OEP), and we give evidence for its hardness in the Generic Group model. We also present a variant of our maliciously secure protocol that does not rely on the OEP but nevertheless only has overhead

o
(
1
)

over the known semi-honest protocol. Moreover, we show that our techniques can also be used to efficiently protect threshold blind BLS signing and threshold ElGamal decryption against malicious attackers.
Analysis of Layered ROLLO-I: A BII-LRPC code-based KEM
Authors: Chee Seongtaek , Jeong Kyung , Lange Tanja , Lee Nari , Pellegrini Alex , Ryu Hansol
Published: October 2024

We analyze Layered ROLLO-I, a code-based cryptosystem published in IEEE Communications Letters and submitted to the Korean post-quantum cryptography competition. Four versions of Layered ROLLO-I have been proposed in the competition. We show that the first two versions do not provide the claimed security against rank decoding attacks and give reductions to small instances of the original ROLLO-I scheme, which was a candidate in the NIST competition and eliminated there due to rank decoding attacks. As a second contribution, we provide two efficient message recovery attacks, affecting every security level of the first three versions of Layered ROLLO-I and security levels 128 and 192 of the fourth version.
Efficiently Detecting Masking Flaws in Software Implementations
Authors: Mahdion Nima , Oswald Elisabeth
Published: October 2024

Software implementations of cryptographic algorithms often use masking schemes as a countermeasure against side channel attacks. A number of recent results show clearly the challenge of implementing masking schemes in such a way, that (unforeseen) micro-architectural effects do not cause masking flaws that undermine the intended security goal of an implementation. So far, utilising a higher-order version of the non-specific (fixed-vs-random) input test of the Test Vector Leakage Assessment (TVLA) framework has been the best option to identify such flaws. The drawbacks of this method are both its significant computation cost, as well as its inability to pinpoint which interaction of masking shares leads to the flaw. In this paper we propose a novel version, the fixed-vs-random shares test, to tackle both drawbacks. We explain our method and show its application to three case studies, where each time it outperforms its conventional TVLA counterpart. The drawback of our method is that it requires control over the shares, which, we argue, is practically feasible in the context of in-house evaluation and testing for software implementations.
Information Theoretic Evaluation of Raccoon's Side-Channel Leakage
Authors: Kamel Dinal , Standaert François-Xavier , Bronchain Olivier
Published: October 2024

Raccoon is a lattice-based scheme submitted to the NIST 2022 call for additional post-quantum signatures. One of its main selling points is that its design is intrinsically easy to mask against side-channel attacks. So far, Raccoon's physical security guarantees were only stated in the abstract probing model. In this paper, we discuss how these probing security results translate into guarantees in more realistic leakage models. We also highlight that this translation differs from what is usually observed (e.g., in symmetric cryptography), due to the algebraic structure of Raccoon's operations. For this purpose, we perform an in-depth information theoretic evaluation of Raccoon's most innovative part, namely the AddRepNoise function which allows generating its arithmetic shares on-the-fly. Our results are twofold. First, we show that the resulting shares do not enforce a statistical security order (i.e., the need for the side-channel adversary to estimate higher-order moments of the leakage distribution), as usually expected when masking. Second, we observe that the first-order leakage on the (large) random coefficients manipulated by Raccoon cannot be efficiently turned into leakage on the (smaller) coefficients of its long-term secret. Concretely, our information theoretic evaluations for relevant leakage functions also suggest that Raccoon's masked implementations can ensure high security with less shares than suggested by a conservative analysis in the probing model.
Tweakable ForkCipher from Ideal Block Cipher
Authors: Mandal Sougata
Published: October 2024

In ASIACRYPT 2019, Andreeva et al. introduced a new symmetric key primitive called the forkcipher, designed for lightweight applications handling short messages. A forkcipher is a keyed function with a public tweak, featuring fixed-length input and fixed-length (expanding) output. They also proposed a specific forkcipher, ForkSkinny, based on the tweakable block cipher SKINNY, and its security was evaluated through cryptanalysis. Since then, several efficient AEAD and MAC schemes based on forkciphers have been proposed, catering not only to short messages but also to various purposes such as leakage resilience and cloud security. While forkciphers have proven to be efficient solutions for designing AEAD schemes, the area of forkcipher design remains unexplored, particularly the lack of provably secure forkcipher constructions.

In this work, we propose forkcipher design for various tweak lengths, based on a block cipher as the underlying primitive. We provide proofs of security for these constructions, assuming the underlying block cipher behaves as an ideal block cipher. First, we present a forkcipher,

F

~

1

, for an

n

-bit tweak and prove its optimal (

n

-bit) security. Next, we propose another construction,

F

~

2

, for a

2
n

-bit tweak, also proving its optimal (

n

-bit) security. Finally, we introduce a construction,

F

~

r

, for a general

r
n

-bit tweak, achieving

n

-bit security.
Exponent-Inversion P-Signatures and Accountable Identity-Based Encryption from SXDH
Authors: Yuen Tsz , Chow Sherman , Wu Huangting , Zhang Cong , Yiu Siu-Ming
Published: October 2024

Salient in many cryptosystems, the exponent-inversion technique began without randomization in the random oracle model (SCIS '03, PKC '04), evolved into the Boneh-Boyen short signature scheme (JoC '08) and exerted a wide influence. Seen as a notable case, Gentry's (EuroCrypt '06) identity-based encryption (IBE) applies exponent inversion on a randomized base in its identity-based trapdoors. Making use of the non-static q-strong Diffie-Hellman assumption, Boneh-Boyen signatures are shown to be unforgeable against q-chosen-message attacks, while a variant q-type decisional assumption is used to establish the security of Gentry-IBE. Challenges remain in proving their security under weaker static assumptions.

Supported by the dual form/system framework (Crypto '09, AsiaCrypt '12), we propose dual form exponent-inversion Boneh-Boyen signatures and Gentry-IBE, with security proven under the symmetric external Diffie-Hellman (SXDH) assumption. Starting from our signature scheme, we extend it into P-signatures (TCC '08), resulting in the first anonymous credential scheme from the SXDH assumption, serving as a competitive alternative to the static-assumption construction of Abe et al. (JoC '16). Moreover, from our Gentry-IBE variant, we propose an accountable-authority IBE scheme also from SXDH, surpassing the fully secure Sahai-Seyalioglu scheme (PKC '11) in efficiency and the generic Kiayias-Tang transform (ESORICS '15) in security. Collectively, we present a suite of results under static assumptions.
Efficient Algorithm for Generating Optimal Inequality Candidates for MILP Modeling of Boolean Functions
Authors: Bille Alexander , Tischhauser Elmar
Published: October 2024

Mixed-Integer Linear Programming (MILP) modeling has become an important tool for both the analysis and the design of symmetric cryptographic primitives. The bit-wise modeling of their nonlinear components, especially the S-boxes, is of particular interest since it allows more informative analysis compared to word-oriented models focusing on counting active S-boxes. At the same time, the size of these models, especially in terms of the number of required inequalities, tends to significantly influence and ultimately limit the applicability of this method to real-world ciphers, especially for larger number of rounds.

It is therefore of great cryptographic significance to study optimal linear inequality descriptions for Boolean functions. The pioneering works of Abdelkhalek et al. (FSE 2017), Boura and Coggia (FSE 2020) and Li and Sun (FSE 2023) provided various heuristic techniques for this computationally hard problem, decomposing it into two algorithmic steps, coined Problem 1 and Problem 2, with the latter being identical to the well-known NP-hard set cover problem, for which there are many heuristic and exact algorithms in the literature.

In this paper, we introduce a novel and efficient branch-and-bound algorithm for generating all minimal, non-redundant candidate inequalities that satisfy a given Boolean function, therefore solving Problem 1 in an optimal manner without relying on heuristics. We furthermore prove that our algorithm correctly computes optimal solutions. Using a number of dedicated optimizations, it provides significantly improved runtimes compared to previous approaches and allows the optimal modeling of the difference distribution tables (DDT) and linear approximation tables (LAT) of many practically used S-boxes. The source code for our algorithm is publicly available as a tool for researchers and practitioners in symmetric cryptography.
A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level
Authors: Aranha Diego , Fotiadis Georgios , Guillevic Aurore
Published: October 2024

For more than two decades, pairings have been a fundamental tool for designing elegant cryptosystems, varying from digital signature schemes to more complex privacy-preserving constructions. However, the advancement of quantum computing threatens to undermine public-key cryptography. Concretely, it is widely accepted that a future large-scale quantum computer would be capable to break any public-key cryptosystem used today, rendering today's public-key cryptography obsolete and mandating the transition to quantum-safe cryptographic solutions. This necessity is enforced by numerous recognized government bodies around the world, including NIST which initiated the first open competition in standardizing post-quantum (PQ) cryptographic schemes, focusing primarily on digital signatures and key encapsulation/public-key encryption schemes. Despite the current efforts in standardizing PQ primitives, the landscape of complex, privacy-preserving cryptographic protocols, e.g., zkSNARKs/zkSTARKs, is at an early stage. Existing solutions suffer from various disadvantages in terms of efficiency and compactness and in addition, they need to undergo the required scrutiny to gain the necessary trust in the academic and industrial domains. Therefore, it is believed that the migration to purely quantum-safe cryptography would require an intermediate step where current classically secure protocols and quantum-safe solutions will co-exist. This is enforced by the report of the Commercial National Security Algorithm Suite version 2.0, mandating transition to quantum-safe cryptographic algorithms by 2033 and suggesting to incorporate ECC at 192-bit security in the meantime. To this end, the present paper aims at providing a comprehensive study on pairings at 192-bit security level. We start with an exhaustive review in the literature to search for all possible recommendations of such pairing constructions, from which we extract the most promising candidates in terms of efficiency and security, with respect to the advanced Special TNFS attacks. Our analysis is focused, not only on the pairing computation itself, but on additional operations that are relevant in pairing-based applications, such as hashing to pairing groups, cofactor clearing and subgroup membership testing. We implement all functionalities of the most promising candidates within the RELIC cryptographic toolkit in order to identify the most efficient pairing implementation at 192-bit security and provide extensive experimental results.
Block Cipher Doubling for a Post-Quantum World
Authors: Bhaumik Ritam , Chailloux André , Frixons Paul , Mennink Bart , Naya-Plasencia María
Published: October 2024

In order to maintain a similar security level in a post-quantum setting, many symmetric primitives should have to double their keys and increase their state sizes. So far, no generic way for doing this is known that would provide convincing quantum security guarantees. In this paper we propose a new generic construction, QuEME, that allows one to double the key and the state size of a block cipher in such a way that a decent level of quantum security is guaranteed. The QuEME design is inspired by the ECB-Mix-ECB (EME) construction, but is defined for a different choice of mixing function than what we have seen before, in order to withstand a new quantum superposition attack that we introduce as a side result: this quantum superposition attack exhibits a periodic property found in collisions and breaks EME and a large class of its variants. We prove that QuEME achieves n-bit security in the classical setting, where n is the block size of the underlying block cipher, and at least (n/6)-bit security in the quantum setting. We finally propose a concrete instantiation of this construction, called Double-AES, that is built with variants of the standardized AES-128 block cipher.
Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions
Authors: Jaques Samuel
Published: October 2024

The security of lattice-based crytography (LWE, NTRU, and FHE) depends on the hardness of the shortest-vector problem (SVP). Sieving algorithms give the lowest asymptotic runtime to solve SVP, but depend on exponential memory. Memory access costs much more in reality than in the RAM model, so we consider a computational model where processors, memory, and meters of wire are in constant proportions to each other. While this adds substantial costs to route data during lattice sieving, we modify existing algorithms to amortize these costs and find that, asymptotically, a classical computer can achieve the previous RAM model cost of

2

0.2925
d
+
o
(
d
)

to sieve a

d

-dimensional lattice for a computer existing in 3 or more spatial dimensions, and can reach

2

0.3113
d
+
o
(
d
)

in 2 spatial dimensions, where “spatial dimensions” are the dimensions of the physical geometry in which the computer exists.

Since this result implies an increased cost in 2 spatial dimensions, we make several assumptions about the constant terms of memory access and lattice attacks so that we can give bit security estimates for Kyber and Dilithium. These estimates support but do not increase the security categories claimed in the Kyber and Dilithium specifications, at least with respect to known attacks.
Finding Practical Parameters for Isogeny-based Cryptography
Authors: Santos Maria , Eriksen Jonathan , Meyer Michael , Rodríguez-Henríquez Francisco
Published: October 2024

Isogeny-based schemes often come with special requirements on the field of definition of the involved elliptic curves. For instance, the efficiency of SQIsign, a promising candidate in the NIST signature standardisation process, requires a large power of two and a large smooth integer

T

to divide

p
2

−
1

for its prime parameter

p

. We present two new methods that combine previous techniques for finding suitable primes: sieve-and-boost and XGCD-and-boost. We use these methods to find primes for the NIST submission of SQIsign. Furthermore, we show that our methods are flexible and can be adapted to find suitable parameters for other isogeny-based schemes such as AprèsSQI or POKE. For all three schemes, the parameters we present offer the best performance among all parameters proposed in the literature.
Frequency of viral hepatitis D among hepatic patients positive for HBV through PCR presenting at Aria Institute of Medical Sciences.
Authors: Zafar H Tanveer  , Mohsin Ali Hassn  , Muhammad Abdul Basit Ashraf  , Qudsia Umaira Khan  , Sobia Humerah  , Farzana Majeed
Published: October 2024

Objective: The purpose of this study is to report frequency of hepatitis D virus among hepatitis B positive patients.Methodology: This observational study was conducted from March 15, 2024 to August 28, 2024; at Aria Institute of Med-ical Sciences Quetta. Data for the research was collected after approval from IRB approval letter no ARIA-IRB-009-2024. Samples from all patients were collected after written consent permission with reassurance for anonymity of the data and it will be used only for research purpose. Samples were collected from those patients who were not diagnosed previously to hepatitis D.Results: A total 138 positive HBS positive patient’s samples were tested for HDV through PCR among total samples 27 were positive and 111 were negative for HDV. Patient were divided into 3 age groups among them HBV positive were most common in 13 – 36 age group and HDV positive were most common in same age group.Conclusion: HDV virus is becoming very common in 13 – 36 age groups which are positive for HBV virus.
Keywords: KAP, Immunization, Mothers, Infectious Diseases, Vaccination
An Audit of Post-neonatal Infant Morbidity and Mortality from Admissions in an Emergency Unit of a Tertiary Hospital in Sokoto, Northwest Nigeria
Authors: O Isezuo Khadijat , Omar Memunat
Published: October 2024

Background The first year of life is a critical period of adaptation for a young infant during which the child becomes exposed to a lot of infectious agents and other environmental problems as its immune systems and other organs are developing. Magnitude of deaths within the first year of life is a significant socioeconomic index of any population. Challenges can also be brought to the forefront which can be tackled by appropriate authorities. Objectives To assess the causes of morbidity and mortality amongst infants aged 29 days to 12 months admitted in the emergency Paediatric unit (EPU) of Usmanu Danfodiyo University Teaching Hospital (UDUTH), Sokoto over a 5- year period. Materials and Methods The admission records of children aged 29 days to 12 months were retrieved. Information extracted included socio-demographic data, diagnosis and outcome of admission. These were entered into a study proforma and analysed with SPSS version 23. Results Total admissions were 1776 in the five-year review. Majority were males accounting for 1030 (58%) with M:F ratio of 1.38:1. 972 (55.4%) were aged 6 to 12 months. Top causes of admissions were diarrhoea disease 328 (18.5%), pneumonia 280 (15.8%), sepsis 211 (11.9%), malaria 202 (11.4%) and malnutrition 154 (8.7%). Mortalities were 223 (12.6%). Highest fatalities out of 223 were from sepsis 47 (21.1%), pneumonia 40 (17.9%), malaria 27 (12.1%), malnutrition 25 (11.2%) and diarrhoea disease 20 (9.0%). Higher proportion of the mortalities were in females 14.5% vs 11.2% (X2 = 4.3; p=0.038). Sepsis mortality was high throughout likewise pneumonia but mortality pattern of other disease conditions varied throughout infancy. Conclusion Post-neonatal admissions were mainly due to infections, likewise mortality of which the top causes varied throughout infancy. Females were more proportionately affected by mortality. These insights on the morbidity and mortality patterns calls for more concerted efforts on child survival strategies and targeting this group of infants is imperative.
ASSESSING THE POTENTIAL OF RAILWAYS TO REDUCE CO2 EMISSIONS: A COINTEGRATION STUDY OF ESTONIA'S TRANSPORT SECTOR
Authors:   School of Economics and Business Administration, University of Tartu, Tartu, Estonia, Abbasov Zakariyya
Published: October 2024

This The transportation sector is a major contributor to CO2 emissions, playing a significant role in exacerbating climate change. Railways, known for their greater energy efficiency compared to other modes of transport, present a viable solution for mitigating emissions, particularly in countries like Estonia. In 2014, transport-related CO2 emissions in Estonia were recorded at 12.7%, marking an overall upward trend since 1995, despite experiencing some fluctuations over the years. This study aims to explore the long-term equilibrium relationship between CO2 emissions from transport and railway passenger kilometers in Estonia through the application of cointegration analysis. Utilizing Engle-Granger and Phillips-Ouliaris cointegration tests, the analysis reveals a stable, long-term equilibrium relationship between the two variables. The findings suggest that an increase in railway passenger kilometers could potentially lead to a reduction in CO2 emissions from transport. These results underscore the importance of enhancing railway infrastructure and usage as a strategic measure to curb transportation-related emissions and contribute to environmental sustainability.
DOES GREEN MARKETING WORK? CONSUMER REACTIONS TOWARD GREEN APPROACHES
Authors:   Department of Business and Economy, Azerbaijan University, Baku, Azerbaijan, Karimov Elvin
Published: October 2024

This article examines green marketing approaches and effects on consumers in various societies. Currently green marketing notion spreads faster than before, even in developing countries and this tendencies prove the importance of sustainable and green approaches in markets. People have been becoming more environmental conscious because of the results surrounded them. Disposition against over-consumption, criticizing careless actions of companies made firms modify company policies and cultures. Now, changing behaviors of customers force companies to produce more sustainable, green products and services. However, there are organizations and people argue that green marketing just a new marketing method for making situation legitimate. This article explores the consequences of greenwashing deceptions.
Attention Based Energy Demand Forecasting in Smart Grid Environments
Authors: Işıkdemir Yunus Emre , Akal Fuat
Published: October 2024

The smart grid is a crucial aspect of the modern energy landscape, providing a reliable, efficient, and sustainable way of meeting the growing energy demands. However, the vast amounts of data generated by smart grid technology necessitate the development of advanced data processing and analysis techniques. In this paper, we propose an attention-based time series workflow that combines dilated convolution and attention mechanisms for time series forecasting in smart grid applications. This workflow extracts temporal features from time series data using dilated convolutions and emphasizes significant temporal points in the hidden states using attention mechanisms. Experimental evaluations showed up to an 8% better performance for energy demand forecasting compared to commonly used deep learning-based methods. Our workflow achieved this gain by requiring 1/3 of the training time other models took. We also improved performance by 42% in various domains, demonstrating the adaptability of our approach across different areas. This study may assist researchers in constructing accurate forecasting models for smart grid environments. Furthermore, it highlights that the attention-based approach can be employed to promote sustainable energy and optimize smart grid environments.