We describe an efficient and secure decryption protocol to the Norwegian Internet voting project. We first adapt Groth’s shuffledecryption from 2010 to our purpose, and we prove all security properties in the random oracle model. We then describe the complete decryption algorithm, and prove that it maintains the security of the rest of the protocol.

A generalized group-oriented cryptosystem (GGOC) based on ElGamal cryptosystem was proposed by Yang et al. in 2003. This study shows that if the authorized decryption sets of users are not properly predetermined in Yang et al.’s GGOC, an unauthorized decryption set of users can recover the encrypted message without difficulty. This study also presents an improved protocol to resist such an attack.

This paper analyzes the post decryption error probability in Counter mode operation in an error prone communications channel. A finite state stochastic model has been developed that quantifies the impact of bit errors in the ciphertext and cipher synchronization counter. Analytical results are used to compute post decryption error probabilities and are found to be in reasonable agreement with t...

We propose and analyze a multivariate encryption scheme that uses odd characteristic and an embedding in its construction. This system has a very simple core map F (X) = X, allowing for efficient decryption. We also discuss ways to make this decryption faster with specific parameter choices. We give heuristic arguments along with experimental data to show that this scheme resists all known atta...

Identity-Based Cryptosystem plays an important role in the modern cryptography world, due to the elimination of the costly certificate. However, all practical identity-based encryption schemes require pairing operation in the decryption stage. Pairing is a heavy mathematical algorithm, especially for resource-constrained devices such as smart cards or wireless sensors. In other words, decryptio...

In this paper, we describe distributed encryption and decryption algorithms. These algorithms are required in order to make a dependable distributed data storage system in which data is stored in an encrypted form resilient to a number of arbitrarily faulty nodes in the system. By execution of these algorithms, a group of n nodes is able to encrypt or decrypt data with any secret cryptographic ...

In this paper, we define the Inverse of a Finite State Transducer. The inverse and the corresponding Finite State Transducer are used for encryption and decryption of sequential data. The encryption process is designed for error detection capability during the decryption phase. Keywords-error detectiont capability;finite state transducer; Translational inverse;