Reviewerly/exHarmony huggingface dataset:
Understanding The Phenomenon and Risks of Identity Theft and Fraud on Social Media

The use of social media platforms has created new opportunities for people to connect and share information with one another. However, this has also increased the risk of identity theft and fraud. The purpose of this paper is to provide an overview of the phenomenon of identity theft and fraud on social media by exploring the various methods used by perpetrators to gain access to personal information, the ways in which they utilize this information to commit fraud, and the impact that these crimes can have on the victim’s privacy. This paper will also examine the various strategies that individuals and organizations can use to protect their privacy on the internet from identity theft and fraud on social media. Ultimately, this paper aims to increase understanding of the risks of social media use and to provide practical recommendations for minimizing these risks.
Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis

A functional commitment allows a user to commit to an input $$\textbf{x}\in \{0,1\}^\ell $$ and later open up the commitment to a value $$y = f(\textbf{x})$$ with respect to some function f. In this work, we focus on schemes that support fast verification. Specifically, after a preprocessing step that depends only on f, the verification time as well as the size of the commitment and opening should be sublinear in the input length $$\ell $$ , We also consider the dual setting where the user commits to the function f and later, opens up the commitment at an input $$\textbf{x}$$ . In this work, we develop two (non-interactive) functional commitments that support fast verification. The first construction supports openings to constant-degree polynomials and has a shorter CRS for a broad range of settings compared to previous constructions. Our second construction is a dual functional commitment for arbitrary bounded-depth Boolean circuits that supports fast verification with security from falsifiable assumptions. Both schemes are lattice-based and avoid non-black-box use of cryptographic primitives or lattice sampling algorithms. Security of both constructions rely on the $$\ell $$ -succinct short integer solutions (SIS) assumption, a falsifiable q-type generalization of the SIS assumption (Preprint 2023). In addition, we study the challenges of extending lattice-based functional commitments to extractable functional commitments, a notion that is equivalent to succinct non-interactive arguments (when considering openings to quadratic relations). We describe a general methodology that heuristically breaks the extractability of our construction and provides evidence for the implausibility of the knowledge k-R- $$\textsf{ISIS}$$ assumption of Albrecht et al. (CRYPTO 2022) that was used in several constructions of lattice-based succinct arguments. If we additionally assume hardness of the standard inhomogeneous SIS assumption, we obtain a direct attack on a variant of the extractable linear functional commitment of Albrecht et al.
Cryptocurrency Exchange Selection Decision Support System Using Preference Selection Index

Cryptocurrency trading is a very popular business of buying and selling digital money today. Many investors trade cryptocurrency assets through cryptocurrency exchange platforms in the hope of getting a large profit difference. However, the cryptocurrency trading business is not always favourable for investors as choosing the wrong cryptocurrency exchange can result in huge losses from the trades made. Based on these problems, it is necessary to have a decision support system for selecting the most relevant cryptocurrency exchange to be used as a cryptocurrency trading platform that can increase the chances of investors making profits. The decision support system method used in this research is Preference Selection Index (PSI). The results of the selection of cryptocurrency exchanges using the Preference Selection Index (PSI) method in this study recommend Indodax as the most relevant cryptocurrency exchange used by investors to gain profits in running a cryptocurrency trading business because it gets the highest value (0.893662729) compared to 4 other alternatives.
Optical multi-image encryption scheme with chaotic apertured quaternion fractional Mellin transform

To enhance the encryption quality and the transmission efficiency, an optical compression and encryption scheme for multiple images based on chaotic apertured quaternion fractional Mellin transform (QFrMT) is designed. The apertured optical systems and the quaternions with several imaginary components guarantee our designed scheme harder for the attackers to acquire valuable information. The QFrMT with the chaotic aperture is proposed to eliminate potential insecurity resulting from the known-plaintext attack and the phase-retrieval attack. The quaternion signal containing the main information of the plaintext images is converted into the chaotic apertured QFrMT domain, and then the resulting amplitude is encrypted with the chaotic mask constructed by the truncated phase in the fractional Fourier plane for nonlinear processing and information integrity. The chaos-based non-conventional diffusion is applied to further enhance the robustness against attacks. Extensive experiments results verify the security and efficiency of the presented optical multi-image encryption scheme.
Knowledge in Medical Prescriptions with the Help of Genetic Fuzzy Hybrid Model

Following the progress made in the construction of high-speed processors, the limiting effect of the way data is entered into the computer on the speed of information transfer has become more apparent. By using processing devices, in addition to achieving higher speed in the data retrieval stage, it is also possible to use their pre-processing capabilities and change the data format. Considering the importance of the topic and the work that has been done in this field, the need to discover the knowledge of the existing features with the help of choosing the appropriate feature for the classification of texts is well felt. In this article, genetic algorithm and fuzzy logic have been used to present a method for classifying texts in insurance booklets. This system is based on several stages. These steps include the learning phase that examines a set of educational texts to extract the characteristics of the categories to be the characteristics of each category; the test phase of the system is used to classify uncategorized texts. The proposed method's accuracy has been assessed using a collection of patient notebooks, and the outcomes indicate an accuracy of around 98% for the classification.
Public Place Crowd Transaction Monitoring System

Currently, the phenomenon of abnormal movement in public spaces by groups is becoming increasingly prominent, leading to issues concerning public flow and safety. The escalating problems of high crowd density, the presence of controlled dangerous items, and unexpected group activities highlight the necessity for timely detection in public settings. Timely identification of such scenarios will facilitate prompt responses and assistance from relevant government departments. Exploring how artificial intelligence technology can aid urban management personnel in effectively detecting abnormal group behaviors is crucial. Having the ability to swiftly and efficiently evacuate crowds in emergency situations holds significant practical importance. This paper employs deep learning methodologies to assist urban management personnel in efficiently monitoring crowd density and detecting abnormal behaviors. The aim is to maintain crowd density within reasonable limits and enable rapid and effective crowd evacuation in emergency situations. Detection of abnormal group behaviors typically involves methods based on global features, extracting feature patterns like optical flow from entire video segments and constructing corresponding histograms. Given that automatic classification of crowd patterns involves sudden and abnormal changes, a novel method is proposed to extract motion "textures" from dynamic STV (Space-Time Volume) blocks formed from real-time video streams.
Message Hiding Using the Least Significant Bit Method with Shifting Hill Cipher Security

Technological developments go hand in hand with advances in digital messaging. In protecting the confidentiality of the message, it is necessary to double secure the data. This security can be done with a combination of steganography and cryptographic techniques. Steganography algorithm which is a technique for hiding messages well, one of which is Least Significant Bit (LSB). The LSB algorithm is a simple method because it only converts the value of the last bit in a message with the inserted message bit, which is a convenience of the LSB algorithm, but it becomes vulnerable to message theft attacks if not combined with other algorithms for security. So it is necessary to increase security. This research developed a combination method of LSB algorithm for steganography technique with Hill Cipher algorithm for cryptographic technique, Hill Cipher was developed with shifting (shifting) 2 (two) characters. With the development of this method, hackers will find it difficult to crack messages, and is expected to improve the performance of the algorithm in affecting image quality and travel time in running the algorithm. The results of this study will be tested using several evaluation tools MSE, PSNR, BER, CER, AE, and Entropy. With the development of this method, hackers will find it difficult to decipher messages, and from the results of this experiment has been able to improve the performance of the algorithm in maintaining image quality and can shorten travel time in running the algorithm.
Watermarking using DCT and DWT on Pneumonia images

Watermarking is a branch of the data hiding technique. Watermarking is a technique used to insert a copyright label on an image, so that the copyright of the image can be protected. Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) are techniques that can be used to watermark. In this study, the Discrete Cosine Transform and Discrete Wavelet Transform methods will be used to watermark images to 5 different host images. In the tests carried out, watermarking techniques will be compared using DCT, DWT, DCT-DWT combination and DWT-DCT combination. The results obtained in this study were the highest PSNR value obtained at 41.931, the highest SSIM obtained 0.99515, the highest entropy was also obtained at 7.4186, The best UACI value is 0.0071158 and the best NCPR value is obtained at 93.9068% then, for the best CC value is obtained at 0.99953. As well as the NCC value, the value obtained is the same all in each test, namely with a value of 1.
Analysis of the Relationship between Marx's Doctoral Thesis and Modern Enlightenment Thought

Marx's Doctoral thesis, as the starting point of Marx's thought, has always been the focus of domestic scholars' attention. Marx's thought is the product of enlightenment, although Marx did not specifically discuss the inheritance of Enlightenment thought in the texts left by Marx, so in what sense Marx's thought inherited the Enlightenment thought is a topic worth exploring. In his Doctoral Thesis, Marx's analysis of Epicurean philosophy in ancient Greece is a key to understanding the relationship between Marx and Enlightenment thought, and the principle of agency in Epicurean philosophy can be regarded as the key to Epicurean philosophy. The relationship between Epicurus, enlightenment and Marx has become an inescapable topic in understanding Marx's thought.
Present Situation and Hotspot of Eco-Hydrological Process Research in China based on Citespace Analysis

In order to fully understand the current hot spots and trends of eco-hydrological research, based on the bibliometrics method and taking 458 relevant literatures from CNKI 2000 to 2021 as the research objects, this paper used the knowledge graph computing tool CiteSpace to carry out visual analysis of the eco-hydrological process in China, and analyzed the research status, hot spots and trends. The results show that: ecohydrological process and ecological restoration are the prefaces of the current ecohydrological research. From 2000 to 2008, the research of ecohydrological field in China is in the rapid development stage, from 2009 to 2015, it enters the stable adjustment stage, and from 2016 to 2021, it accelerates the development stage. The state Key Laboratory of Surface Processes and Resource Economics, State Key Laboratory of Remote Sensing Science, Center for Excellence and Innovation in Tibetan Plateau Earth Sciences, Chinese Academy of Sciences, School of Geographic Sciences, and Cold and Arid Regions Environmental and Engineering Research Institute have close cooperation in eco-hydrology.
The Effects of Learning Mandarin Online with a Native Lecturer to University Students’ Anxiety

The Diploma Mandarin Language Study Program at UNS transitioned to online learning as an alternative to face-to-face instruction following the COVID-19 pandemic. Foreign language learning, including Mandarin Chinese, typically involves native speakers as instructors. However, online learning with native speakers can inadvertently result in student anxiety. To address this issue, the program collaborated with the UNS Confucius Institute to bring native lecturers onboard. Nevertheless, certain native lecturers encountered visa-related challenges that prevented them from teaching in a face-to-face setting. Inspired by the post-COVID online learning landscape, the Study Program formulated a policy to continue certain Chinese language courses online.This study aims to analyze the impact of online Chinese language learning with native lecturers on the levels of anxiety among Diploma Mandarin Language students. A quantitative approach was employed, utilizing a case study design and data collection techniques, including observation and questionnaires. The research seeks to contribute theoretically by addressing the gaps in the literature related to student anxiety during online Mandarin learning with native speakers. The study involved 30 randomly selected students from the Diploma Mandarin Language classes of 2021 and 2022 at UNS. The results of this study indicated that 73.33% of the respondents experienced anxiety while participating in online learning with native instructors. The types of anxiety included reduced learning conditions, diminished self-efficacy, and decreased learning effectiveness.
Homomorphic Polynomial Evaluation Using Galois Structure and Applications to BFV Bootstrapping

BGV and BFV are among the most widely used fully homomorphic encryption (FHE) schemes. Both schemes have a common plaintext space, with a rich algebraic structure. Our main contribution is to show how this structure can be exploited to more efficiently homomorphically evaluate polynomials. Namely, using Galois automorphisms, we present an algorithm to homomorphically evaluate a polynomial of degree d in only $$3\log (d)$$ (in some cases only $$2\log (d)$$ ) many ciphertext-ciphertext multiplications and automorphism evaluations, where d is bounded by the ring degree. In other words, as long as the degree of the polynomial is bounded, we achieve an exponential speedup compared to the state of the art. In particular, the approach also improves on the theoretical lower bound of $$2\sqrt{d}$$ many ciphertext-ciphertext multiplications, which would apply if automorphisms were not available. We investigate how to apply our improved polynomial evaluation to the bootstrapping procedure for BFV, and show that we are able to significantly improve its performance. We demonstrate this by providing an implementation of our improved BFV bootstrapping using the Microsoft SEAL library. More concretely, we obtain a $$1.6\times $$ speed up compared to the prior implementation given by Chen and Han (Eurocrypt 2018). The techniques are independent of, and can be combined with, the more recent optimisations presented by Geelen et al. (Eurocrypt 2023). As an additional contribution, we show how the bootstrapping approach used in schemes such as FHEW and TFHE can be applied in the BFV context. In particular, we demonstrate that programmable bootstrapping can be achieved for BFV. Moreover, we show how this bootstrapping approach can be improved in the BFV context to make better use of the Galois structure. However, we estimate that its complexity is around three orders of magnitude slower than the classical approach to BFV bootstrapping.
CCA-1 Secure Updatable Encryption with Adaptive Security

Updatable encryption (UE) enables a cloud server to update ciphertexts using client-generated tokens. There are two types of UE: ciphertext-independent (c-i) and ciphertext-dependent (c-d). In terms of construction and efficiency, c-i UE utilizes a single token to update all ciphertexts. The update mechanism relies mainly on the homomorphic properties of exponentiation, which limits the efficiency of encryption and updating. Although c-d UE may seem inconvenient as it requires downloading parts of the ciphertexts during token generation, it allows for easy implementation of the Dec-then-Enc structure. This methodology significantly simplifies the construction of the update mechanism. Notably, the c-d UE scheme proposed by Boneh et al. (ASIACRYPT’20) has been reported to be 200 times faster than prior UE schemes based on DDH hardness, which is the case for most existing c-i UE schemes. Furthermore, c-d UE ensures a high level of security as the token does not reveal any information about the key, which is difficult for c-i UE to achieve. However, previous security studies on c-d UE only addressed selective security; the studies for adaptive security remain an open problem. In this study, we make three significant contributions to ciphertext-dependent updatable encryption (c-d UE). Firstly, we provide stronger security notions compared to previous work, which capture adaptive security and also consider the adversary’s decryption capabilities under the adaptive corruption setting. Secondly, we propose a new c-d UE scheme that achieves the proposed security notions. The token generation technique significantly differs from the previous Dec-then-Enc structure, while still preventing key leakages. At last, we introduce a packing technique that enables the simultaneous encryption and updating of multiple messages within a single ciphertext. This technique helps alleviate the cost of c-d UE by reducing the need to download partial ciphertexts during token generation.
The Pre-Shared Key Modes of HPKE

The Hybrid Public Key Encryption (HPKE) standard was recently published as RFC 9180 by the Crypto Forum Research Group (CFRG) of the Internet Research Task Force (IRTF). The RFC specifies an efficient public key encryption scheme, combining asymmetric and symmetric cryptographic building blocks. Out of HPKE’s four modes, two have already been formally analyzed by Alwen et al. (EUROCRYPT 2021). This work considers the remaining two modes: $$\textsf{HPKE}_\textsf{PSK}$$ and $$\textsf{HPKE}_\textsf{AuthPSK}$$ . Both of them are “pre-shared key” modes that assume the sender and receiver hold a symmetric pre-shared key. We capture the schemes with two new primitives which we call pre-shared key public-key encryption ( $$\textsf{pskPKE}$$ ) and pre-shared key authenticated public-key encryption ( $$\textsf{pskAPKE}$$ ). We provide formal security models for $$\textsf{pskPKE}$$ and $$\textsf{pskAPKE}$$ and prove (via general composition theorems) that the two modes $$\textsf{HPKE}_\textsf{PSK}$$ and $$\textsf{HPKE}_\textsf{AuthPSK}$$ offer active security (in the sense of insider privacy and outsider authenticity) under the Gap Diffie-Hellman assumption. We furthermore explore possible post-quantum secure instantiations of the HPKE standard and propose new solutions based on lattices and isogenies. Moreover, we show how HPKE’s basic $$\textsf{HPKE}_\textsf{PSK}$$ and $$\textsf{HPKE}_\textsf{AuthPSK}$$ modes can be used black-box in a simple way to build actively secure post-quantum/classic-hybrid (authenticated) encryption schemes. Our hybrid constructions provide a cheap and easy path towards a practical post-quantum secure drop-in replacement for the basic HPKE modes $$\textsf{HPKE}_\textsf{Base}$$ and $$\textsf{HPKE}_\textsf{Auth}$$ .
Exploiting Algebraic Structures in Probing Security

The so-called $$\omega $$ -encoding, introduced by Goudarzi, Joux and Rivain (Asiacrypt 2018), generalizes the commonly used arithmetic encoding. By using the additionnal structure of this encoding, they proposed a masked multiplication gadget (GJR) with quasilinear (randomness and operations) complexity. A follow-up contribution by Goudarzi, Prest, Rivain and Vergnaud in this line of research appeared in TCHES 2021. The authors revisited the aforementioned multiplication gadget (GPRV), and brought the IOS security notion for refresh gadgets to allow secure composition between probing secure gadgets. In this paper, we propose a follow up on GPRV, that is, a region-probing secure arithmetic circuit masked compiler. Our contribution stems from a single Lemma, linking algebra and probing security for a wide class of circuits, further taking advantage of the algebraic structure of $$\omega $$ -encoding, and the extension field structure of the underlying field that was so far left unexploited. On the theoretical side, we propose a security notion for $$\boldsymbol{\omega }_d$$ -masked circuits which we call Reducible-To-Independent-K-linear (RTIK). When the number of shares d is less than or equal to the degree k of , RTIK circuits achieve region-probing security. Moreover, RTIK circuits may be composed naively and remain RTIK. We also propose a weaker version of IOS, which we call KIOS, for refresh gadgets. This notion allows to compose RTIK circuits with a randomness/security tradeoff compared to the naive composition. To substantiate our new definitions, we also provide examples of competitively efficient gadgets verifying the latter weaker security notions. Explicitly, we give 1) two refresh gadgets that use $$d-1$$ random field elements to refresh a length d encoding, both of which are KIOS but not IOS, and 2) a multiplication gadget with bilinear multiplication complexity $$d^{\log 3}$$ and uses d fresh random elements per run. Our compiler outperforms ISW asymptotically, but for our security proofs to hold, we do require that the number of shares d is less than or equal to the degree of as an extension, so that there is sufficient structure to exploit.
Systematic Literature Review (SLR ), Peningkatan Pengetahuan Tentang Donor Darah.

The number of people donating blood in Indonesia is relatively low, with the number of regular donors at 250 thousand compared to the population in Indonesia which has 230-240 million people (Ministry of Health of the Republic of Indonesia, 2019), this shows that awareness of voluntary blood donation among the public is still low . The aim of this research is to conduct a literature review, namely to provide information about blood donation and provide understanding to the public about carrying out blood donation. The technique used is the Systematic Literature Review (SLR) strategy, which aims to identify, review and evaluate all relevant research so as to answer research questions at specified stages. The conclusion obtained from the results of this research is that this community service activity is able to increase knowledge about blood donation in the community