Article
Multidisciplinary Sciences
Sijia Li, Zhiyi Liao, Zhengyang Wu, Zheng Wu, Lin Ding
Summary: Symmetric cryptosystems are crucial for securing mobile telephony systems, and the SNOW-V stream cipher is designed to provide confidentiality and integrity for 5G communications. In this study, we propose TMDTO attacks on SNOW-V and analyze its security against quantum TMDTO attacks, revealing potential risks.
Article
Chemistry, Multidisciplinary
Muhammad Nadeem, Ali Arshad, Saman Riaz, Syeda Wajiha Zahra, Ashit Kumar Dutta, Sultan Almotairi
Summary: This paper discusses cloud computing and data security, and proposes a secure architecture and algorithm implementation to prevent replay attacks.
APPLIED SCIENCES-BASEL
(2022)
Article
Computer Science, Hardware & Architecture
Congwu Li, Le Guan, Jingqiang Lin, Bo Luo, Quanwei Cai, Jiwu Jing, Jing Wang
Summary: Cryptography is essential for computer and network security, and protecting cryptographic keys from memory disclosure attacks is critical. Mimosa introduces a solution to safeguard RSA private keys using hardware transactional memory to ensure sensitive data protection. While there are potential DoS threats due to transactional memory fragility, splitting RSA private-key computations into multiple transactional parts can help mitigate these threats and maintain effectiveness and efficiency of Mimosa.
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
(2021)
Article
Cultural Studies
Antonio L. Manzanero, Rocio Vallet, Sergio Escorial, Juan Fernandez, Francisco de Vicente, Marta Guarch-Rubio, Alba Vara
Summary: The study found that the passage of time has a significant impact on the characteristics of memories of violent events, such as terrorist attacks. The flashbulb memory characteristics often only appear in the medium term and fade after about a year. The features of memory depend more on the relevance given to the event, rather than just the elapsed time.
Article
Chemistry, Multidisciplinary
Muhammad Nadeem, Ali Arshad, Saman Riaz, Syeda Wajiha Zahra, Ashit Kumar Dutta, Abdulrahman Alruban, Badr Almutairi, Sultan Almotairi
Summary: This paper investigates the issue of data protection in cloud computing, proposing an efficient encryption algorithm to enhance data security and address the challenge of attackers decrypting encrypted data. The research utilizes a two-layer encryption approach to improve data security. A comparison of different studies and technologies is conducted, leading to conclusions based on the results.
APPLIED SCIENCES-BASEL
(2022)
Article
Engineering, Multidisciplinary
Tarek Hagras, Doaa Salama, Hassan Youness
Summary: This paper presents iEncrypt, a symmetric-key block encryption/decryption algorithm based on DES-DNA. With a 64-nucleotides secret-key, iEncrypt achieves the intractability of a 128-bits secret-key. Experimental results demonstrate the resistance of both versions of iEncrypt against brute force attacks, and one version is also resistant to differential cryptanalysis attacks.
ALEXANDRIA ENGINEERING JOURNAL
(2022)
Article
Computer Science, Hardware & Architecture
Abdulrahman Abu Elkhail, Nada Lachtar, Duha Ibdah, Rustam Aslam, Hamza Khan, Anys Bacha, Hafiz Malik
Summary: Encryption is used to preserve confidentiality, but it has been misused by cybercriminals to deny access to data through ransomware attacks. In response, a runtime solution has been proposed to defend against such attacks by preventing maliciously encrypted data from being permanently committed to storage. Extensive validation shows the robustness of the solution against various ransomware samples, and minimal performance impact is observed in a proof-of-concept implementation.
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
(2023)
Article
Computer Science, Theory & Methods
Xiaoxuan Lou, Tianwei Zhang, Jun Jiang, Yinqian Zhang
Summary: Side-channel attacks pose a severe threat to the confidentiality of computer applications and systems, with microarchitectural attacks being a popular type. Research on attacks and defenses in cryptographic applications can inspire the discovery of new attacks and propose new defense solutions.
ACM COMPUTING SURVEYS
(2021)
Article
Computer Science, Information Systems
Muhammad Nadeem, Ali Arshad, Saman Riaz, Syeda Wajiha Zahra, Shahab S. Band, Amir Mosavi
Summary: Many organizations focus on protecting cloud servers from external attacks, but the majority of risks come from internal sources. While there are algorithms in place to safeguard against attacks, hackers constantly find ways to bypass these security measures. Cloud cryptography provides the best data protection algorithm for secure data exchange between authentic users.
CMC-COMPUTERS MATERIALS & CONTINUA
(2023)
Article
Computer Science, Theory & Methods
Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir
Summary: This paper investigates the upper bounds on the performance of Hellman's algorithm in the quantum setting and proposes an improved curve to enhance its time and space complexities. By extending the cryptanalytic problem to a time/memory/data tradeoff attack, better attack results are achieved with lower time complexity compared to traditional algorithms.
DESIGNS CODES AND CRYPTOGRAPHY
(2023)
Article
Physics, Multidisciplinary
Zhe Sun, Junping Wan, Bin Wang, Zhiqiang Cao, Ran Li, Yuanyuan He
Summary: Data-driven deep learning has accelerated the spread of social computing applications. Researchers have conducted extensive research on securely building collaborative training models to protect privacy information in gradients. The proposed mechanism based on sigma-protocol and Pedersen commitment can help prevent gradient stealing behavior, ensuring the effectiveness and efficiency of collaborative training in large-scale social computing.
FRONTIERS IN PHYSICS
(2021)
Article
Physics, Multidisciplinary
Sourav Kundu, Ben Reichardt
Summary: This article introduces the concept and applications of one-time memories in secure computation, proposes a physical construction method based on isolated Majorana islands, and enhances error robustness of the system using classical error-correcting codes.
NEW JOURNAL OF PHYSICS
(2022)
Article
Computer Science, Hardware & Architecture
Jipeng Zhang, Junhao Huang, Zhe Liu, Sujoy Sinha Roy
Summary: This paper presents an implementation of the Saber+ protocol, an improved version of Saber, that achieves reduced memory consumption and better performance. By using different generation methods and various optimization strategies, Saber+ achieves significant performance improvement on memory-constrained devices.
IEEE TRANSACTIONS ON COMPUTERS
(2022)
Article
Quantum Science & Technology
Kai Wang, Jie Zhang
Summary: The paper discusses the security of the Quantum noise stream cipher system under the assumption of collective attacks by eavesdropper. The maximum security capacity for encrypted data, running key, and the entire system is derived, with positive information capacity observed within 300 km data transmission distance. The security of the entire system is shown to depend on the security of the running key and data, with a need to improve data security for longer distances in the QNSC system.
QUANTUM INFORMATION PROCESSING
(2021)
Article
Computer Science, Information Systems
Munir Geden, Kasper Rasmussen
Summary: CPU registers are used to store temporary data and instructions within the CPU, and they are immune to memory attacks and manipulation. This paper presents RegGuard, a software-based technique that utilizes CPU registers and cryptographic primitives to protect critical variables with hardware-level assurance. RegGuard effectively addresses control- and data-oriented attacks targeting the stack, even by adversaries with full knowledge of program memory. It also provides practical protection and performance benefits.
COMPUTERS & SECURITY
(2023)
Article
Computer Science, Information Systems
Andre Nies, Frank Stephan
Summary: We investigate word automaticity for nilpotent groups of class 2 with prime exponent p. It is proven that the infinitely generated free group in this category is not word automatic. However, the infinite extra-special p-group Ep and an intermediate group Hp with an infinite center are both word automatic. Additionally, a method for demonstrating automaticity of central extensions of abelian groups via co-cycles is introduced.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Chik How Tan, Theo Fanuela Prabowo
Summary: This paper presents a new key recovery attack on a Hamming-metric code-based signature scheme proposed by SHMWW. The attack extends the statistical part of the attack proposed by ABDKPS. In addition to classifying the columns of the secret matrix, the attack also determines the entries of the identity columns of this matrix via statistical method. The attack has better time complexity and can recover the secret key in under 45 minutes with no more than 1500 signatures.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Julio Araujo, Victor Campos, Darlan Girao, Joao Nogueira, Antonio Salgueiro, Ana Silva
Summary: This paper studies the parameter hull number in a graph convexity called Cycle Convexity, which is motivated by related notions in Knot Theory. The authors define the interval function and investigate the properties and computational methods of the minimum convex set for a graph G.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn
Summary: The investigation on the approximation ratio of the longest processing time (LPT) scheduling algorithm has been conducted in various studies. While the ratio is known for identical processors, it remains unknown for processors with different speeds. This study provides a tight approximation ratio for three, four, and five processors, showing that the ratios are no larger than the lower bound provided by Gonzalez et al. (1977) [14]. The ratios are approximately 1.38, 1.43, and 1.46 for three, four, and five processors, respectively.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Nidia Obscura Acosta, Alexandru I. Tomescu
Summary: This paper presents a new linear-time checkable characterization of directed graphs with a unique Eulerian circuit. The characterization is based on a simple condition of when two edges must appear consecutively in all Eulerian circuits, in terms of cut nodes of the underlying undirected graph of G. Additionally, the paper proposes a method to compute all maximal safe walks appearing in all Eulerian circuits in linear time.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo
Summary: The research states that the single-machine makespan minimization problem can be solved as an assignment problem in O(n3) time. Subsequent research shows that if the job-dependent learning effects are correlated with the level of sophistication of the jobs and have a lower bound, the scheduling problem can be solved in O(nlogn) time by sequencing the jobs according to the shortest processing time rule. The SPT job sequence remains optimal when the job-dependent learning effects are inversely correlated with the level of sophistication and have an upper bound. The main results of the paper are correct, but there are errors in Corollary 1 and incomplete proofs for Proposition 1 and Corollary 1. This note provides a counter example for the latter case and a modified corollary. A lemma is presented to complete the proofs for Proposition 1 and Corollary 1. Finally, a simple algorithm is developed to solve the latter case in O(n2) time.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Maximilien Mackie
Summary: This research investigates encodings for modular arithmetic in the lambda-calculus. Two approaches are considered: adapting existing numeral systems and creating a new one. The focus of this paper is to provide original techniques for encoding modular arithmetic directly. A modular arithmetic numeral system is presented, complete with multiplication and an implementation of the Chinese remainder theorem, all without recursion i.e., without using fixed-point operators.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah
Summary: We demonstrate that polynomial-size constant-rank linear decision trees (LDTs) can be transformed into polynomial-size depth-2 threshold circuits LTF o LTF. An intermediate structure is polynomial-size decision lists that refer to a conjunction of a fixed number of linear threshold functions (LTFs); we prove that these are equivalent to polynomial-size exact linear decision lists (ELDLs), which query precise threshold functions (ELTFs).
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur
Summary: Count sketch is a popular sketching algorithm used for frequency estimation in data streams and pairwise inner product for real-valued vectors. This paper extends count sketch and introduces a higher-order count sketch algorithm, which compresses input tensors to approximate the queried features. It is shown that the higher-order count sketch can also closely approximate the pairwise inner product and provides a concentration analysis of the estimate.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Jean Lienardy, Frederic Lafitte
Summary: OCB3 is an authenticated encryption mode of operation that allows for associated data (AEAD), and it is known for its maturity and provable security. However, this note highlights a small flaw in the security proof of OCB3 that can result in a loss of security when using short nonces. This flaw has implications worse than nonce-repetition, as it compromises confidentiality and authenticity until the key is changed. Various approaches to fix this flaw in OCB3 are presented.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Majid Mirzanezhad
Summary: This paper proposes the first data structure for curves under the (continuous) Frechet distance in higher dimensions, which can efficiently report all curves with distances less than a given value to a query curve. For a given k value in the preprocessing stage, we propose a deterministic data structure that can answer (1 + epsilon)delta-ANNS queries in O (kd) query time, where D is the diameter of P.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Je Hong Park, Woo-Hwan Kim
Summary: This paper revisits Zhu et al.'s attack on a certificate-based proxy signature scheme proposed by Verma et al., and shows that the fundamental problem of Verma et al.'s scheme lies in its use of a weak ordinary signature scheme. Furthermore, the paper demonstrates that the attack against Verma et al.'s scheme can be similarly applied to the revised scheme, as they share many components using the weak signature.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Lluis Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
Summary: This study focuses on two variants of the Maximum Linear Arrangement problem, namely the planar variant for free trees and the projective variant for rooted trees. Linear time and space complexity algorithms are presented to solve these two problems. Additionally, properties of maximum projective and planar arrangements are proven, and it is shown that caterpillar trees maximize planar MaxLA among all trees of a fixed size, thereby generalizing a previous extremal result on trees.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Mislav Blazevic, Stefan Canzar, Khaled Elbassioni, Domagoj Matijevic
Summary: This paper studies the Tai mapping and anti Tai mapping problems between rooted labeled trees. For unordered trees, finding the maximum-weight Tai mapping is proven to be NP-complete. The paper provides an efficient algorithm for finding the maximum-weight anti Tai mapping and presents a polynomial computable lower bound for the optimal anti Tai mapping based on special conditions.
INFORMATION PROCESSING LETTERS
(2024)
Article
Computer Science, Information Systems
Xiaowei Li, Xiwen Lu
Summary: The facility location problem with maximum distance constraint is investigated and a (3,1)-approximation algorithm is proposed. The algorithm is compared with the previous one and is found to have lower memory requirements and is suitable for large-scale problems.
INFORMATION PROCESSING LETTERS
(2024)
