Question

In: Computer Science

what are the Vulnerabilites of honey encryption algorithm in cryptography? please give a detailed list with...

what are the Vulnerabilites of honey encryption algorithm in cryptography?
please give a detailed list with descritpions.

Solutions

Expert Solution

Before moving to answer directly let us understand what is a honey encryption algorithm.

Honey encryption is a type of data encryption that "produces a ciphertext, which, when decrypted with an incorrect key as guessed by the attacker, presents a plausible-looking yet incorrect plaintext password or encryption key."

For example- The debit card uses a 6-digit password for withdrawing money from the ATM. Honey encryption can help to protect such passwords from brute-force attacks.

Vulnerabilities of honey encryption algorithm are

1- Honey encryption is suitable for a small, not large, message space as the overhead of processing a large message space is very high. In this mechanism, the distribution-transforming encoder( DTE) needs to peruse the message space and inverse_table document line by line for encryption and decoding if the message space is bigger than the accessible framework memory. Having these records in the memory will accelerate the inquiry (e.g., by utilizing the paired pursuit technique) for decoding.

2- The message space should be carefully designed, or honey encryption cannot well address the brute-force vulnerability. Although a plaintext derived by DTE from a wrongly guessed key looks like a correctly decrypted ciphertext, attackers can use a different approach to confirm whether the guessed key is incorrect if the message space has not been carefully designed. In the cell phone number case, the attacker can dial the mobile number to check whether the number is the correct one.

3- The capacity for securing delicate private information provided by honey encryption varies for different applications. The decryption process outputs a message from the message space, no matter whether the key is correct or not. This feature could leak some valid messages and this may have a different impact on different applications. Taking the identification number, for example, a malicious user can still get some valid identification numbers from the system, but the attacker may not be able to get the corresponding name of the identification holder. So the possibility for the attacker to maliciously use the identification to commit crimes is limited.


Related Solutions

One research topic in cryptography is to create homomorphic encryption schemes. In such schemes, it is...
One research topic in cryptography is to create homomorphic encryption schemes. In such schemes, it is possible to do operations on the ciphertext without performing decryption. Give an example of where homomorphic encryption would be useful. You do not have to give a specific cryptographic method but describe a situation where you would want to do computations on ciphertext. Be specific: what is the information, what is encrypted, and what the computation is. Related concept: given an RSA scheme with...
explain what an encryption algorithm is and what it can do to provide increased computer security...
explain what an encryption algorithm is and what it can do to provide increased computer security ?
The Vigenère Cipher is an encryption algorithm that combines the use of a keyword with the...
The Vigenère Cipher is an encryption algorithm that combines the use of a keyword with the message to be encrypted. A tableau is provided that shows an encrypted character for each combination of characters in the message and the keyword. Using the Vigenère Tableau encryption scheme with a keyword of KEYWORD, encrypt the following message: IS INFORMATION SECURITY ESSENTIAL After encrypting the message, decrypt the following message, using KEYWORD as the keyword: YRJUW WWRIG JTFUW ERECE LCMKL CIWKR R For...
Finish the following java question:  Modify a Encryption program so that it uses the following encryption algorithm:...
Finish the following java question:  Modify a Encryption program so that it uses the following encryption algorithm: Every letter (both uppercase and lowercase) converted to its successor except z and Z, which are converted to 'a' and 'A' respectively (i.e., a to b, b to c, …, y to z, z to a, A to B, B to C, …, Y to Z, Z to A) Every digit converted to its predecessor except 0, which is converted to 9 (i.e., 9...
The prompt is using Python:  Write a 3 rail transposition encryption algorithm, and a corresponding decryption algorithm....
The prompt is using Python:  Write a 3 rail transposition encryption algorithm, and a corresponding decryption algorithm. Implement these two algorithms in their own function. Now write a testing function that demonstrates your algorithms work for all interesting cases!
please give a detailed summary What are the benefits of the CPI index in today’s economy...
please give a detailed summary What are the benefits of the CPI index in today’s economy and give an example of how it is used. What does the CPI measure? What is one problem with the CPI as a measure of the cost of living? What is the importance of the PPI to our economy? Provide and discuss one example of the importance of the PPI.
Topic: Encrypt-then-authenticate scheme, Cryptography Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM...
Topic: Encrypt-then-authenticate scheme, Cryptography Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM = (GenM, MacM, VrfyM) be a MAC scheme. (b) Prove that Π is unforgeable for any encryption scheme ΠE (even if not CPA-secure) and any secure MAC scheme ΠM (even if not strongly secure).
Topic: Encrypt-then-authenticate scheme, Cryptography Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM...
Topic: Encrypt-then-authenticate scheme, Cryptography Let ΠE = (GenE, EncE, DecE) be an encryption scheme and ΠM = (GenM, MacM, VrfyM) be a MAC scheme. (a) Formalize the construction of the “encrypt-then-authenticate” scheme Π = (Gen, Enc, Dec) given ΠE and ΠM
Give detailed infromation on what is Synchronous online learning and site your findings please
Give detailed infromation on what is Synchronous online learning and site your findings please
Give a recursive algorithm to compute a list of all permutations of a given set S....
Give a recursive algorithm to compute a list of all permutations of a given set S. (That is, compute a list of all possible orderings of the elements of S. For example, permutations({1, 2, 3}) should return {〈1, 2, 3〉, 〈1, 3, 2〉, 〈2, 1, 3〉, 〈2, 3, 1〉, 〈3, 1, 2〉, 〈3, 2, 1〉}, in some order.) Prove your algorithm correct by induction.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT