Topic
40-bit encryption
About: 40-bit encryption is a research topic. Over the lifetime, 5434 publications have been published within this topic receiving 149016 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: A differential attack on one-to-many OPE is proposed by exploiting the differences of the ordered ciphertexts to show that the cloud server can get a good estimate of the distribution of relevance scores by a differential attack.
Abstract: For ranked search in encrypted cloud data, order preserving encryption (OPE) is an efficient tool to encrypt relevance scores of the inverted index. When using deterministic OPE, the ciphertexts will reveal the distribution of relevance scores. Therefore, Wang et al. proposed a probabilistic OPE, called one-to-many OPE, for applications of searchable encryption, which can flatten the distribution of the plaintexts. In this paper, we proposed a differential attack on one-to-many OPE by exploiting the differences of the ordered ciphertexts. The experimental results show that the cloud server can get a good estimate of the distribution of relevance scores by a differential attack. Furthermore, when having some background information on the outsourced documents, the cloud server can accurately infer the encrypted keywords using the estimated distributions.
57 citations
Patent•
15 Jul 2005
TL;DR: In this article, an asymmetric encryption key is generated from the asymmetric decryption key using a one-way function, and the key is used to encrypt a symmetric key.
Abstract: A device uses a user authentication factor to generate an asymmetric decryption key for use in cryptography. An asymmetric encryption key is generated from the asymmetric decryption key using a one-way function, and the asymmetric encryption key is used to encrypt a symmetric key.
57 citations
TL;DR: An efficient chaos pseudo-random number generator is designed to generate key stream for encrypting video syntax elements of H.264/AVC and the intra-prediction mode (IPM), signs of trailing ones, signs of non-zero (NZ), and signs of motion vector difference (MVD) are chosen for selective encryption.
57 citations
Patent•
08 Jan 2005
TL;DR: In this paper, Bloom filters were used with Pohlighe-hellman encryption to convert queries that were encrypted with the key of a querier to queries that are encrypted with a key of the encrypted database without knowing the actual keys.
Abstract: Encryption with keys that form an Abelian group are used in combination with a semi-trusted party that converts queries that are encrypted with the key of a querier to queries that are encrypted with the key of the encrypted database, without knowing the actual keys. In an illustrative embodiment, encryption is done with Bloom filters that employ Pohlig-Hellman encryption. Since the querier's key is not divulged, neither the semi-trusted party nor the publisher of the database can see the original queries. Provision can be made for fourth party “warrant servers”, as well as “censorship sets” that limit the data to be shared.
57 citations
15 May 2011
TL;DR: The first sender-deniable public key encryption scheme with a single encryption algorithm and negligible detection probability was proposed in this article, which is based on the quadratic residuosity assumption.
Abstract: Deniable encryption, introduced in 1997 by Canetti, Dwork, Naor, and Ostrovsky, guarantees that the sender or the receiver of a secret message is able to "fake" the message encrypted in a specific ciphertext in the presence of a coercing adversary, without the adversary detecting that he was not given the real message. To date, constructions are only known either for weakened variants with separate "honest" and "dishonest" encryption algorithms, or for single-algorithm schemes with non-negligible detection probability.
We propose the first sender-deniable public key encryption system with a single encryption algorithm and negligible detection probability. We describe a generic interactive construction based on a public key bit encryption scheme that has certain properties, and we give two examples of encryption schemes with these properties, one based on the quadratic residuosity assumption and the other on trapdoor permutations.
57 citations