Related papers: Bridges connecting Encryption Schemes
By analogy to classical cryptography, we develop a "quantum public key" based cryptographic scheme in which the two public and private keys consist in each of two entangled beams of squeezed light. An analog message is encrypted by…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…
A new scheme of probabilistic subgroup-related encryption is introduced. Some applications of this scheme based on the RSA, Diffie-Hellman and ElGamal encryption algorithms are described. Security assumptions and main advantages of this…
This paper discloses a simple algorithm for encrypting text messages, based on the NP-completeness of the subset sum problem, such that the similarity between encryptions is roughly proportional to the semantic similarity between their…
This paper discusses the application of known techniques, knowledge and technology in a novel way for encryption. Two distinct and separate methods are presented. Method 1: Alter the symbol set of the language by adding additional redundant…
Recently, Lu et al. have proposed two image search schemes based on additive homomorphic encryption [IEEE Access, 2 (2014), 125-141]. We remark that both two schemes are flawed because: (1) the first scheme does not make use of the additive…
Cryptographic access control has been studied for over 30 years and is now a mature research topic. When symmetric cryptographic primitives are used, each protected resource is encrypted and only authorized users should have access to the…
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…
We propose a multi-bit leveled fully homomorphic encryption scheme using multivariate polynomial evaluations. The security of the scheme depends on the hardness of the Learning with Errors (LWE) problem. For homomorphic multiplication, the…
Homomorphic encryption is a very useful gradient protection technique used in privacy preserving federated learning. However, existing encrypted federated learning systems need a trusted third party to generate and distribute key pairs to…
We introduce bridge trisections of knotted surfaces in the four-sphere. This description is inspired by the work of Gay and Kirby on trisections of four-manifolds and extends the classical concept of bridge splittings of links in the…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
Image applications have been increasing in recent years.Encryption is used to provide the security needed for image applications. In this paper, we classify various image encryption schemes and analyze them with respect to various…
The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user. A user derives a suitable decryption key from the secret and publicly available…
The safety of a quantum key distribution system relies on the fact that any eavesdropping attempt on the quantum channel creates errors in the transmission. For a given error rate, the amount of information that may have leaked to the…
Constructing cryptographic schemes with tight or almost-tight security has long been one of the central problems in theoretical cryptography. At ASIACRYPT 2016, Boyen and Li posed an open problem: whether it is possible to construct a…
Brakerski showed that linearly decryptable fully homomorphic encryption (FHE) schemes cannot be secure in the chosen plaintext attack (CPA) model. In this paper, we show that linearly decryptable FHE schemes cannot be secure even in the…
This paper proposes a generic approach for providing enhanced security to communication systems which encode their data for reliability before encrypting it through a stream cipher for security. We call this counter-intuitive technique the…
We describe an algorithm for computing boundary slopes of 2-bridge links. As an example, we work out the slopes of the links obtained by 1/k surgery on one component of the Borromean rings. A table of all boundary slopes of all 2-bridge…
We define what we call morphisms of Cartan connections. We generalize the main theorems on Cartan connections to theorems on morphisms. Many of the known constructions involving Cartan connections turn out to be examples of morphisms. We…