A (t,u)threshold public key encryption (TPKE) is a public key encryption where a private key is splitted among u decryption servers (insiders) and at least t decryption servers (insiders) are required to decrypt the ciphertext but no group of t− 1 or less malicious insiders can decrypt the message. Bendlin and Damgard [1] presented first lattice based threshold public key encryption scheme base...

This paper elaborates polybit shuffling encryption and decryption algorithm based on N Dimensional encryption-decryption matrix which is an attempt to improve over the Classical Playfair Cipher. The unique feature of this algorithm is that it retains the simplicity of Classical Playfair Cipher but increases the robustness against crypto-attack by many folds. Moreover this algorithm can be used ...

During the transmission of data from sender prevents from various attacks. Public key encryption is a technique which provides encryption of data using public key. The existing technique implemented for the searching of keywords with public key encryption provides security from password Guessing attacks [1]. But the technique implemented here enables security from various attacks as fine as als...

Over the last three years, several encryption algorithms, applied to MPEG video streams, emerged. Most of the algorithms tried to optimize the encryption process with respect to the encryption speed due to the temporal properties of video retieval and display process. Permutation Algorithm, with respect to not only their encryption speed metric, but also their security level and stream size met...

Binary tree encryption (BTE), a relaxation of hierarchical identity-based encryption (HIBE), has recently emerged as a useful and intriguing primitive. On the one hand, the definition of security for BTE is sufficiently “weak” that — in contrast to HIBE — constructions of BTE in the standard model are known. On the other hand, BTE is sufficiently powerful that it yields a number of applications...

Last Time: Simulation Sound NIZKS & Connection to CCA Security. Last time we introduced Simulation-Sound NIZKs, and constructed a 1-Time Simulation Sound NIZK (1-SS NIZK). We then showed how to get CCA secure encryption from CPA encryption and NIZKs in one of two ways: using standard NIZK and n copies of a CPA encryption scheme ([DDN00]) or using 1-SS NIZK and 2 copies of a CPA encryption schem...

An image is a pertinent data because of its visual characteristics. Image should be encrypted appropriately due to sensitivity to changes as well as security perspective. But as of inherent characteristics of image, standard encryption algorithms are not appropriate for image encryption. Recently, research on image encryption using chaos theory has been emerged. In this research, work chaos bas...

We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the property of each element which is either quantum or classical, the quantum public-key encryption protocols can be divided into 64 kinds. Among 64 kinds of p...

This paper presents an overview of data encryption methods that may be used to protect data from unauthorized access. Data encryption has come to the forefront as an important method of protecting data due to legislation such as HIPAA as well as privacy concerns expressed by individuals. The authors examine the use of encryption in different situations by interviewing people in positions respon...

An approach to teaching encryption is described in which an XOR encryption algorithm is used to demonstrate simple encryption concepts for E-Business payment with credit cards. Small groups of undergraduate and postgraduate learners manually encrypt a four-character word, and then exchange the encrypted data with another group. Each group then attempts to decrypt the data as quickly as possible...