English
Related papers

Related papers: Chosen-ciphertext attack on noncommutative Polly C…

200 papers

In a previous paper we generalized the definition of a multilinear map to arbitrary groups and introduced two multiparty key-exchange protocols using nilpotent groups. In this paper we have a closer look at the protocols and will address…

Group Theory · Mathematics 2021-02-09 Delaram Kahrobaei , Antonio Tortora , Maria Tota

This paper studies the security of a chaotic cryptosystem based on the Chua circuit and implemented with State Controlled Cellular Neural Networks. It is shown that the plaintext can be retrieved by ciphertext band-pass filtering after an…

Chaotic Dynamics · Physics 2007-06-21 A. B. Orue , G. Alvarez , F. Montoya , C. Sanchez-Avila

We propose a novel approach to improving software security called Cryptographic Path Hardening, which is aimed at hiding security vulnerabilities in software from attackers through the use of provably secure and obfuscated cryptographic…

Software Engineering · Computer Science 2012-02-03 Vijay Ganesh , Michael Carbin , Martin Rinard

We describe a new classical bit commitment protocol based on cryptographic constraints imposed by special relativity. The protocol is unconditionally secure against classical or quantum attacks. It evades the no-go results of Mayers, Lo and…

Quantum Physics · Physics 2016-09-08 Adrian Kent

This article provides a tool for analyzing mechanisms that aim to achieve resilience against stealthy, or undetectable, attacks on cyber-physical systems (CPSs). We consider attackers who are able to corrupt all of the inputs and outputs of…

Systems and Control · Electrical Eng. & Systems 2022-05-03 Paul Griffioen , Bruce H. Krogh , Bruno Sinopoli

We consider the problem of constructing an unconditionally secure cipher with a short key for the case where the probability distribution of encrypted messages is unknown. Note that unconditional security means that an adversary with no…

Cryptography and Security · Computer Science 2023-03-28 Boris Ryabko

In this letter, first, we investigate the security of a continuous-variable quantum cryptographic scheme with a postselection process against individual beam splitting attack. It is shown that the scheme can be secure in the presence of the…

Quantum Physics · Physics 2009-11-10 Ryo Namiki , Takuya Hirano

Encrypted control is a promising method for the secure outsourcing of controller computation to a public cloud. However, a feasible method for security proofs of control has not yet been developed in the field of encrypted control systems.…

Systems and Control · Electrical Eng. & Systems 2025-03-04 Kaoru Teranishi , Kiminao Kogiso

Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and…

Quantum Physics · Physics 2024-10-31 Pierre Botteron , Anne Broadbent , Eric Culf , Ion Nechita , Clément Pellegrini , Denis Rochette

We show that the revised KKKP protocol proposed by Kye and Kim [Phys. Rev. Lett. 95,040501(2005)] is still insecure with coherent states by a type of beamsplitting attack. We then further revise the KKKP protocol so that it is secure under…

Quantum Physics · Physics 2007-05-23 Xiang-Bin Wang , Qiang Zhang , Yu-Ao Chen , Wong-Young Hwang , Myungshik Kim , Jian-Wei Pan

Recently, an image encryption scheme based on chaotic standard and logistic maps was proposed by Patidar et al. It was later reported by Rhouma et al. that an equivalent secret key can be reconstructed with only one known/chosen-plaintext…

Cryptography and Security · Computer Science 2009-12-21 Chengqing Li , Shujun Li , Kwok-Tung Lo

Randomness plays a key role in the design of attacks on cryptographic systems and cyber security algorithms in general. Random walks and quantum walks are powerful tools for mastering random phenomena. In this article, I propose a…

Quantum Physics · Physics 2023-09-22 Ahmed Drissi

We define cheat sensitive cryptographic protocols between mistrustful parties as protocols which guarantee that, if either cheats, the other has some nonzero probability of detecting the cheating. We give an example of an unconditionally…

Quantum Physics · Physics 2009-10-31 Lucien Hardy , Adrian Kent

In this paper, we propose to improve the security performance of a recently proposed color image encryption algorithm which is based on multi-chaotic systems. The existing cryptosystem employed a pixel-chaotic-shuffle mechanism to encrypt…

Cryptography and Security · Computer Science 2014-03-27 Musheer Ahmad , Hamed D. Alsharari , Munazza Nizam

In this note, we describe a probabilistic attack on public key cryptosystems based on the word/conjugacy problems for finitely presented groups of the type proposed recently by Anshel, Anshel and Goldfeld. In such a scheme, one makes use of…

Cryptography and Security · Computer Science 2007-05-23 James Hughes , Allen Tannenbaum

This article introduces a novel cryptographic paradigm based on nonderived polyadic algebraic structures. Traditional cryptosystems rely on binary operations within groups, rings, or fields, whose well-understood properties can be exploited…

Cryptography and Security · Computer Science 2025-12-17 Steven Duplij , Na Fu , Qiang Guo

A plethora of jailbreaking attacks have been proposed to obtain harmful responses from safety-tuned LLMs. These methods largely succeed in coercing the target output in their original settings, but their attacks vary substantially in…

Machine Learning · Computer Science 2025-06-12 Valentyn Boreiko , Alexander Panfilov , Vaclav Voracek , Matthias Hein , Jonas Geiping

Security of multimedia data is a major concern due to its widespread transmission over various communication channels. Hence design and study of good image encryption schemes has become a major research topic. During the last few decades,…

Cryptography and Security · Computer Science 2018-09-27 Pratyusa Mukherjee , Krishnendu Rarhi , Abhishek Bhattacharya

A cryptographic protocol (CP) is a distributed algorithm designed to provide a secure communication in an insecure environment. CPs are used, for example, in electronic payments, electronic voting procedures, database access systems, etc.…

Cryptography and Security · Computer Science 2020-11-25 A. M. Mironov

Despite the linearity of its encoding, compressed sensing may be used to provide a limited form of data protection when random encoding matrices are used to produce sets of low-dimensional measurements (ciphertexts). In this paper we…

Information Theory · Computer Science 2016-11-15 Valerio Cambareri , Mauro Mangia , Fabio Pareschi , Riccardo Rovatti , Gianluca Setti
‹ Prev 1 3 4 5 6 7 10 Next ›