Encrypted Messages Research Articles

Trkic G00gle: Why and How Users Game Translation Algorithms

Individuals interact with algorithms in various ways. Users even game and circumvent algorithms so as to achieve favorable outcomes. This study aims to come to an understanding of how various stakeholders interact with each other in tricking algorithms, with a focus towards online review communities. We employed a mixed-method approach in order to explore how and why users write machine non-translatable reviews as well as how those encrypted messages are perceived by those receiving them. We found that users are able to find tactics to trick the algorithms in order to avoid censoring, to mitigate interpersonal burden, to protect privacy, and to provide authentic information for enabling the formation of informative review communities. They apply several linguistic and social strategies in this regard. Furthermore, users perceive encrypted messages as both more trustworthy and authentic. Based on these findings, we discuss implications for online review community and content moderation algorithms.

Is Artificial Intelligence Transforming Dentistry Today?

Since the birth of science, the most fascinating structure of the human body is the human brain. Over the past centuries’ researchers have been developing the latest technologies to imitate and explore how the human brain functions. However, to develop a machine that thinks like a human brain is still a dream for researchers. Aristotle’s early efforts to devise logical thinking via his syllogisms (a three-part deductive reasoning) were a source of inspiration for modern computers and technologies1. In the1950, Alan Turing designed a machine to decode encrypted messages, which was a breakthrough of super computers in the days of yore. He designed the “Turing Test” which was coined to assess whether a computer could exhibit intelligence better known as “artificial intelligence” (AI) today2. AI is “a field of science and engineering concerned with the computational understanding of what is commonly called intelligent behavior, and with the creation of artifacts that exhibit such behaviour”3.
 Since 1980, AI has come a long way, virtual reality is being used in dental education these days to create real life situations and promote clinical work on simulators to eliminate risk factors associated with training on live patients. Recently artificial intelligence has been integrated with tutoring systems like “Unified Medical Language System” (UMLS), which have resulted in a better quality of feedback, which the preclinical virtual patients provide to the students4,5. This interactive phase helps students to evaluate their clinical skills and compare their skills with the standard ones, thus creating an ideal and high-quality training environment. Studies have been carried out regarding the efficacy of AI systems, which have stipulated that preclinical students build higher competencies than with the use of traditional simulator units6-8.
 Currently AI inbuilt virtual dental assistants are present in the market. They can execute various chair side tasks with greater accuracy and less manpower ensuring minimum error during the procedures. In the world of implantology and maxillofacial surgery AI helps plan and prepare surgeries with smallest details forgoing actual surgery. Some exceptional uses of AI include robotic surgeries in the field of maxillofacial surgery and bioprinting (where tissues and organs can be reconstructed in thin layers)9. The field of AI has flourished to great extent in the past decade; AI systems are an aid to the field of dentistry and dental education. 
 This narrative attempts to explain possible AI-based applications in the future, it can be used for dental diagnosis, planning out treatments, conducting image analysis, and record keeping. AI-based technologies streamline and reduce laborious workforce to routine tasks, it ensures dental procedures are possible at a lower cost and ultimately makes predictive, preventive, and participatory dentistry possible. The use of AI in dental procedures needs to be guaranteed; its application with human oversight and evidence-based dentistry shall be expected. Dental education needs to be introduced to clinical AI solutions by promoting digital literacy in the future dental liveware.

Improvement security in e-business systems using hybrid algorithm

E-business security becomes an important issue in the development of technology, to ensure the safety and comfort of transactions in the exchange of information is privacy. This study aims to improve security in e-business systems using a hybrid algorithm that combines two types of keys, namely symmetric and asymmetric keys. Encryption and decryption of messages or information carried by a symmetric key using the simple symmetric key algorithm and asymmetric keys using the Rivest Shamir Adleman (RSA) algorithm. The proposed hybrid algorithm requires a high running time in the decryption process compared to the application of a single algorithm. The level of security is stronger because it implements the process of message encryption techniques with two types of keys simultaneously.

Communication-Efficient and Fine-Grained Forward-Secure Asynchronous Messaging

In recent years, motivated by the revelation of long-term and widespread surveillance of personal communications, extensive efforts have been putting into <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">store-and-forward</i> asynchronous messaging systems (e.g., email and SMS) for providing critical security guarantees. Of particular interest among them is forward security, which makes past messages remain secure in the event that the secret key gets exposed. Traditional forward-secure public key encryption can provide forward security for asynchronous scenarios, but it is not flexible enough for instant messaging systems. This is mainly because that, after updating his/her secret key, the user totally loses the decryption capacity of ciphertexts that have not been received. In this paper, to achieve practical forward-security of asynchronous messaging systems, we investigate the construction of a new primitive named forward-secure puncturable encryption (FSPE) that captures fine-grained forward security. Namely, the user can maintain the decryption capacity of those encrypted messages that have not been received yet. Meanwhile, even if the secret key is disclosed, those received messages can still remain secure. Specifically, we propose a communication-efficient FSPE scheme for achieving fine-grained forward-secure asynchronous messaging. Moreover, to improve the efficiency of asynchronous messaging built upon FSPE, we extend it to support outsourced decryption. We also implement the proposed scheme and evaluate a proof-of-concept of main algorithms, so as to increase confidence on its correctness and practicability.

بناء مصفوفات تبديلية من مراتب عليا وتطبيقاتها في التشفير

نقدّم في هذا البحث طريقة لبناء مصفوفات تحقّق الخاصة التبديلية للضرب انطلاقا من مصفوفات دائريّة، حيث يمكن تجزئة كلّ مصفوفة من هذه المصفوفات إلى أربع مصفوفات دائريّة، وكذلك يمكن أن نبني مصفوفات تحقق الخاصة التبديلية للضرب من مراتب عليا ولا تُجزّأ بالضرورة إلى مصفوفات دائريّة. وباستخدام هذه المصفوفات نقدّم طريقة لتبادل مفتاح سري للتشفير عبارة عن مصفوفة مربّعة بشكل آمن عبر قنوات اتّصال مفتوحة، ثم نستخدم هذا المفتاح في تبادل رسائل مشفّرة بين جهتين أو طرفين. الأكثر من ذلك نقدّم أيضاً باستخدام هذه المصفوفات طريقة تشفير ذات مفتاح معلن، بحيث يتبادل الطرفان رسائل مشفّرة دون الاتفاق مسبقاً على مفتاحٍ سرّيٍّ مشتركٍ بينهما.

How Did Esau Die? On Jewish–Gentile Relations in Pseudepigrapha and Rabbinic Literature

Abstract The Bible is silent regarding the death of Esau, Jacob’s brother, but Second Temple and rabbinic literature filled the lacuna. Although similar in their basic narrative, these versions differ in significant details, most notably the circumstances of and the person responsible for Esau’s death. This paper examines the extent to which these accounts not only present different views of the fraternal relationship but also reflect divergent attitudes towards Jewish relations with the non-Jewish world that are dictated by the time and place of their authorship. Reflecting its diasporan setting, the version in the Babylonian Talmud, it is shown, employs a particularly complex tactic of message encryption.

A Secure, Privacy-Preserving, and Lightweight Authentication Scheme for VANETs

The vehicular network is a collection of vehicles and other components facilitated with versatile sensors to communicate, which is backboned by authentication. Present authentication protocols focus on either the lightweight feature or security. On the other hand, privacy during authentication is essential. Moreover, existing schemes are dependent on the trusted authority for checking the legitimacy of a communicating node, which suffers from the infrastructure-less scenario. Alternatively, existing protocols are dependent on a secure communication channel during the registration phase. To address these concerns, an elliptic curve cryptography-based authentication protocol has been designed. Moreover, a secure key establishment is shown in this paper. Pseudo-id-based authentication is used to provide the privacy-preservation on the scheme. On the other hand, symmetric-key cryptography with a session key is used for message encryption during communication. A security analysis on the proposed scheme using the BAN logic and AVISPA shows the protocol’s resilience capabilities on various attacks. Alternatively, the mathematical proof of the protocol represents the proof of correctness. Moreover, extensive performance analysis with the existing authentication schemes shows that the proposed algorithm is better in computation cost, communication cost, and energy cost. Lastly, the NS3 simulation shows the packet data transfer among the nodes in the network.

Privacy-Preserving Distributed Optimal Power Flow With Partially Homomorphic Encryption

Distribution grid agents are obliged to exchange and disclose their states explicitly to neighboring regions to enable distributed optimal power flow dispatch. However, the states contain sensitive information of individual agents, such as voltage and current measurements. These measurements can be inferred by adversaries, such as other participating agents or eavesdroppers, leading to the privacy leakage problem. To address the issue, we propose a privacy-preserving distributed optimal power flow (OPF) algorithm based on partially homomorphic encryption (PHE). First of all, we exploit the alternating direction method of multipliers (ADMM) to solve the OPF in a distributed fashion. In this way, the dual update of ADMM can be encrypted by PHE. We further relax the augmented term of the primal update of ADMM with the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm regularization. In addition, we transform the relaxed ADMM with the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm regularization to a semidefinite program (SDP), and prove that this transformation is exact. The SDP can be solved locally with only the sign messages from neighboring agents, which preserves the privacy of the primal update. At last, we strictly prove the privacy preservation guarantee of the proposed algorithm. Numerical case studies validate the effectiveness and exactness of the proposed approach. In particular, the case studies show that the encrypted messages cannot be inferred by adversaries. Besides, the proposed algorithm obtains the solutions that are very close to the global optimum, and converges much faster compared to competing alternatives.

Tracing encrypted messages: an analysis of the law

Tracing encrypted messages: an analysis of the law

ANALYZING PASSWORD DECRYPTION TECHNIQUES USING DICTIONARY ATTACK

To guard ourselves against a word attack or a breach, it is always important to have an awareness of the unremarkably used sorts of attacks. The most common type of attack is password guessing. Hackers can guess the passwords locally or remotely using either manually or through an automated approach. One such attack is Dictionary Attack. A dictionary attack tries to make an authentication mechanism fail by sequentially entering each word in a dictionary as a password or trying to find the decryption key of an encrypted message or document. In this paper, an empirical research on how dictionary attack works are performed. In addition to that, different techniques and approaches to the existing dictionary attacks are implemented to make the system more robust. Furthermore, a comparison of methods is performed to find which approach is better to protect the system.

A Key Management Protocol Based on the Hash Chain Key Generation for Securing LoRaWAN Networks.

Recently, many Low Power Wide Area Network (LPWAN) protocols have been proposed for securing resource-constrained Internet of Things (IoT) devices with negligible power consumption. The Long Range Wide Area Network (LoRaWAN) is a low power communication protocol that supports message authentication, integrity, and encryption using two-session preshared secret keys. However, although the LoRaWAN supports some security functions, it suffers from session key generation and key update problems. This motivates us to introduce a new key management protocol that resolves the LoRaWAN problems and supports key updates. The proposed protocol is based on hash chain generation using a one-way hash function. Network entities share a common hash chain of n key elements to allow using a unique signing key per message. We also propose a salt hashing algorithm that encrypts the original keys into a different form to avoid the physical attacks at the end device side. We analyzed the proposed key generation performance in terms of the computation time, the required storage, and the communication overhead. We implemented and tested the proposed key generation protocol using the NS-3 network simulator. The proposed lightweight key generation protocol significantly enhances the security of the original LoRaWAN at a negligible overhead. The proposed protocol reduces the power consumption and transmission time by two times compared with some previous protocols. In addition, the proposed key generation protocol can resist attacks, such as key compromising attacks and replay attacks, and it supports the Perfect Forward Secrecy, which was not supported by LoRaWAN.

Over 100x Faster Bootstrapping in Fully Homomorphic Encryption through Memory-centric Optimization with GPUs

Fully Homomorphic encryption (FHE) has been gaining in popularity as an emerging means of enabling an unlimited number of operations in an encrypted message without decryption. A major drawback of FHE is its high computational cost. Specifically, a bootstrapping step that refreshes the noise accumulated through consequent FHE operations on the ciphertext can even take minutes of time. This significantly limits the practical use of FHE in numerous real applications.By exploiting the massive parallelism available in FHE, we demonstrate the first instance of the implementation of a GPU for bootstrapping CKKS, one of the most promising FHE schemes supporting the arithmetic of approximate numbers. Through analyzing CKKS operations, we discover that the major performance bottleneck is their high main-memory bandwidth requirement, which is exacerbated by leveraging existing optimizations targeted to reduce the required computation. These observations motivate us to utilize memory-centric optimizations such as kernel fusion and reordering primary functions extensively.Our GPU implementation shows a 7.02× speedup for a single CKKS multiplication compared to the state-of-the-art GPU implementation and an amortized bootstrapping time of 0.423us per bit, which corresponds to a speedup of 257× over a single-threaded CPU implementation. By applying this to logistic regression model training, we achieved a 40.0× speedup compared to the previous 8-thread CPU implementation with the same data.

Perpaduan Algoritma Kriptografi Atbash dan Autokey Cipher dalam Mengamankan Data

Data security is an important thing that must be done in the cyber era. The use of various kinds of digital technology in helping various human activities needs to be balanced with adequate data security. One of the ways that can be used in securing data is through cryptography. Atbash cipher is one of the cryptographic techniques used in securing data. However, this algorithm has a weakness because it only uses the process of reversing the position of the characters to be secured. This study proposes a cryptographic model that can maximize data security from the atbash cipher. The proposed model is a combination of the atbash cipher with the autokey cipher. The tests carried out on the proposed model have a 100% success rate, meaning that the encrypted message resulting from the proposed encryption process has been successfully restored to its original form through the proposed decryption process. The results of this study indicate that the atbash cipher cryptographic algorithm, combined with the autokey cipher algorithm can produce an encrypted message that is more difficult to crack.

The Snowden Phone: A Comparative Survey of Secure Instant Messaging Mobile Applications

In recent years, it has come to attention that governments have been doing mass surveillance of personal communications without the consent of the citizens. As a consequence of these revelations, developers have begun releasing new protocols for end-to-end encrypted conversations, extending and making popular the old Off-the-Record protocol. New implementations of such end-to-end encrypted messaging protocols have appeared, and several popular chat applications have been updated to use such protocols. In this survey, we compare six existing applications for end-to-end encrypted instant messaging, namely, Signal, WhatsApp, Wire, Viber, Riot, and Telegram, most of them implementing one of the recent and popular protocols called Signal. We conduct five types of experiments on each of the six applications using the same hardware setup. During these experiments, we test 21 security and usability properties specially relevant for applications (not protocols). The results of our experiments demonstrate that the applications vary in terms of the usability and security properties they provide, and none of them are perfect. In consequence, we make 12 recommendations for improvement of either security, privacy, or usability, suitable for one or more of the tested applications.

Key Management Scheme for Secure Channel Establishment in Fog Computing

Fog computing is a promising extension of cloud computing, and enables computing directly at the edge of the network. Due to the decentralized and distributed nature of fog nodes, secure communication channels have to be supported in fog computing, which are generally realized through secure keys. Key management schemes are usually employed to generate, distribute and maintain the secret keys. In this paper, we propose a key management scheme called dynamic contributory broadcast encryption (DConBE) for secure channel establishment in fog computing. It allows a group of fog nodes that want to establish a fog system to negotiate a public encryption key and each node’s decryption key in one round without a trusted dealer. Any end user may encrypt messages under the public encryption key with short ciphertexts to any subset of the fog nodes in the system. Only selected fog nodes in the system can decrypt the encrypted messages using their respective decryption key. Our new key management scheme also achieves the properties of fog node dynamics, fully collusion-resistant and stateless.

Analisa Antimagicness Super dari Shackle Graf Parasut dan Aplikasinya pada Polyalphabetic Cipher

Super (\emph{a,d})-$\mathcal{H}$-antimagic total covering on a graph \emph{G}=(\emph{V,E}) is the total labeling of $\lambda$ of \emph {V(G)} $\cup$ \emph{E(G)} with positive integers \{1, 2, 3,\dots ,$|V(G) \cup E(G)|$\}, for any subgraph \emph{H'} of \emph{G} that is isomorphic to \emph{H} where $\sum$ \emph{H'} = $\sum_{v \in V(H)} \lambda (v ) + \sum_{e \in E(H)} \lambda (e)$ is an arithmetic sequence \{\emph{a, a+d, a+2d,\dots,a+(s-1)d}\} where \emph{a}, \emph{d} are positive numbers where \emph{a} is the first term, \emph{d} is the difference, and \emph{s} is the number of covers. If $\lambda(v)_{v \in V} = {1,2,3,\dots,|V(G)|}$ then the graph \emph{G} have the label of super $\mathcal{H}$-antimagic covering. One of the techniques that can be applied to get the super antimagic total covering on the graph is the partition technique. Graph applications that can be developed for super antimagic total covering are \emph{ciphertext} and \emph{streamcipher}. \emph{Ciphertext} is an encrypted message and is related to cryptography. \emph{Stream cipher} is an extension of \emph{Ciphertext}. This article study the super (a,d)-$\mathcal{H}$-antimagic total covering on the shackle of parachute graph and its application in \emph{ciphertext}. The graphs that used in this article are some parachute graphs denoted by \emph{shack}($\mathcal{P}_{m},e,n$).

Private communication with quantum cascade laser photonic chaos

Mid-infrared free-space optical communication has a large potential for high speed communication due to its immunity to electromagnetic interference. However, data security against eavesdroppers is among the obstacles for private free-space communication. Here, we show that two uni-directionally coupled quantum cascade lasers operating in the chaotic regime and the synchronization between them allow for the extraction of the information that has been camouflaged in the chaotic emission. This building block represents a key tool to implement a high degree of privacy directly on the physical layer. We realize a proof-of-concept communication at a wavelength of 5.7 μm with a message encryption at a bit rate of 0.5 Mbit/s. Our demonstration of private free-space communication between a transmitter and receiver opens strategies for physical encryption and decryption of a digital message.

A Study of Machine Learning Techniques in Cryptography for Cybersecurity

The importance of cybersecurity is on the rise as we have become more technologically dependent on the internet than ever before. Cybersecurity implies the process of protecting and recovering computer systems, networks, devices, and programs from any cyber attack. Cyber attacks are an increasingly sophisticated and evolving danger to our sensitive data, as attackers employ new methods to circumvent traditional security controls. Cryptanalysis is mainly used to crack cryptographic security systems and gain access to the contents of the encrypted messages, even if the key is unknown. It focuses on deciphering the encrypted data as it works with ciphertext, ciphers, and cryptosystems to understand how they work and find techniques for weakening them. For classical cryptanalysis, the recovery of ciphertext is difficult as the time complexity is exponential. The traditional cryptanalysis requires a significant amount of time, known plaintexts, and memory. Machine learning may reduce the computational complexity in cryptanalysis. Machine learning techniques have recently been applied in cryptanalysis, steganography, and other data-securityrelated applications. Deep learning is an advanced field of machine learning which mainly uses deep neural network architecture. Nowadays, deep learning techniques are usually explored extensively to solve many challenging problems of artificial intelligence. But not much work has been done on deep learning-based cryptanalysis. This paper attempts to summarize various machine learning based approaches for cryptanalysis along with discussions on the scope of application of deep learning techniques in cryptography.

Analysis of Combination Algorithm Data Encryption Standard (DES) and Blum-Blum-Shub (BBS)

Data Encryption Standard (DES) has a weakness in the key that is vulnerable to security threats, but it is quite popular to use because of the fast encryption and decryption process. Combining the DES algorithm with the Pseudo-random number generator Blum-Blum-Shub (BBS) in generating external keys in the encryption and decryption process of messages, produces a unique key and a good level of security. The longer the selected key and seed, the higher the security level of the DES encryption and decryption key. The use of BBS as an external key generator in the DES algorithm does not significantly affect the encryption (key and seed generated is around 0,001 – 0,003 seconds for the 2 – 4 digits experiment) processing time, meanwhile, the time in the decryption process has no effect because the BBS key and seed are no longer subject to feasibility testing or number requirements. The combination of DES and BBS algorithms can increase security in terms of encryption and decryption keys because the random number of DES keys generated by the BBS algorithm is unique and does not burden the user in determining the keys used in the DES algorithm because the keys are generated from the programming language.

An implementation of Rabin-p cryptosystem and affine cipher in a hybrid scheme to secure text

One way to keep digital information secure is by using cryptographic techniques. With respect to its keys, cryptography generally is divided into two types: symmetric and asymmetric. Symmetric cryptography algorithm uses the same key in both encryption and decryption while asymmetric uses different keys for each of these processes. Asymmetric cryptography algorithm is known to be ineffective to encrypt big messages since it takes more CPU time to do the computation and the resulting ciphertext is usually much bigger than the original message. To eliminate these problems, in this research, we combine Rabin-p cryptosystem, an asymmetric cryptography algorithm, and affine cipher, a symmetric cryptography algorithm, in a hybrid scheme in order to secure messages from unwanted parties. The affine cipher is used for message encryption while Rabin-p is used for affine cipher’s key encryption. The result of this research is a hybrid cryptography scheme that can encrypt and decrypt message in the form of *.pdf files and be able to restore the message without losing integrity.