Abstract In this paper we propose a set of algorithms that can automatically detect the use AES and recover both encryption key plaintext, assuming control code flow encrypting program, e.g., when an application is performing without user’s permission. The first algorithm makes fact monitor accesses to S-Box deduce desired data from these accesses; approach suitable software-based implementatio...

Ever since the appearance of quantum computers, prime factoring and discrete logarithm-based cryptography have been questioned, giving birth to so-called post-quantum cryptography. The most prominent field in is lattice-based cryptography, protocols that are proved be as difficult break certain hard lattice problems like Learning with Errors (LWE) or Ring (R-LWE). Furthermore, application crypt...

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

One of the most important verifiability techniques for mix nets is randomized partial checking (RPC). This method employed in a number prominent secure e-voting systems, including Pret Voter, Civitas, and Scantegrity II, some which have also been used real political elections Australia.

A general technique of batch verification for equality of discrete logarithms is proposed. Examples of batching threshold decryption schemes are presented based on threshold versions of three popular cryptosystems ElGamal, RSA and Paillier. Our technique offers large computational savings when employed in schemes with a large number of ciphertexts to be decrypted, such as in e-voting or e-aucti...