Related papers: Secure symmetric ciphers over the real field
We present and characterize advanced attacks on an ensemble-based quantum token protocol that allows for implementing non-clonable quantum coins. Multiple differently initialized tokens of identically prepared qubit ensembles are combined…
Quantum cryptography uses techniques and ideas from physics and computer science. The combination of these ideas makes the security proofs of quantum cryptography a complicated task. To prove that a quantum-cryptography protocol is secure,…
In this note, we consider the setting of uncloneable encryption satisfying uncloneable indistinguishability, a form of symmetric key encryption that prevents the cloning of ciphertexts in a very strong sense. Our goal is to minimize the…
We present the Foundational Cryptography Framework (FCF) for developing and checking complete proofs of security for cryptographic schemes within a proof assistant. This is a general-purpose framework that is capable of modeling and…
Research in logic encryption over the last decade has resulted in various techniques to prevent different security threats such as Trojan insertion, intellectual property leakage, and reverse engineering. However, there is little agreement…
It has been widely claimed and believed that many protocols in quantum key distribution, especially the single-photon BB84 protocol, have been proved unconditionally secure at least in principle, for both asymptotic and finite protocols…
We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in…
This paper investigates compression of data encrypted with block ciphers, such as the Advanced Encryption Standard (AES). It is shown that such data can be feasibly compressed without knowledge of the secret key. Block ciphers operating in…
Recent advances in cryptography promise to enable secure statistical computation on encrypted data, whereby a limited set of operations can be carried out without the need to first decrypt. We review these homomorphic encryption schemes in…
S. S. Magliveras et al. have described symmetric and public key cryptosystems based on logarithmic signatures (also known as group bases) for finite permutation groups. In this paper we show that if $G$ is a nontrivial finite group which is…
Most currently used cryptographic tools for protecting data are based on certain computational assumptions, which makes them vulnerable with respect to technological and algorithmic developments, such as quantum computing. One existing…
We present a code-based public-key cryptosystem, in which we use Reed-Solomon codes over an extension field as secret codes and disguise it by considering its shortened expanded code over the base field. Considering shortened expanded codes…
Quantum computing had a profound impact on cryptography. Shor's discovery of an efficient quantum algorithm for factoring large integers implies that many existing classical systems based on computational assumptions can be broken, once a…
Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum…
In this article, an encryption scheme based on (-1, 1) conference matrix has been developed. The decryption key comprising of fixed number of positive integers with prime power yields the high level security of message. Some popular attacks…
Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable proofs of soundness/completeness, can be used both to identify…
Aiming at a ternary quantum logic circuit, four symmetric ternary quantum homomorphic encryption schemes, based on ternary quantum one-time protocol, were presented. First, for a one-qutrit rotation gate, a homomorphic quantum encryption…
Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information…
Quantum computer is no longer a hypothetical idea. It is the worlds most important technology and there is a race among countries to get supremacy in quantum technology. Its the technology that will reduce the computing time from years to…
Functional encryption is a powerful cryptographic primitive that enables fine-grained access to encrypted data and underlies numerous applications. Although the ideal security notion for FE (simulation security) has been shown to be…