Image Encryption Using Elliptic Curve Cryptograhy and Matrix

AbstractThe enlarged size of the internet and vast communication across it and also medical needs digital images require of security plays vital role. So different techniques are used to protect confidential image data from unauthorized access. In this paper, we propose a New encryption technique Using elliptic curve cryptography with a magic matrix operations for securing images that transmits over a public unsecured channel. There are two most important groups of image encryption algorithms: some are non chaos-based selective methods and chaos- based selective methods. The majority of these algorithms is planned for a specific image format, compressed or uncompressed

Towards a zk-SNARK compiler for Wolfram language

Zero-knowledge proofs (zk-Proofs) are communication protocols by which a prover can demonstrate to a verifier that it possesses a solution to a given public problem without revealing the content of the solution. Arbitrary computations can be transformed into an interactive zk-Proof so anyone is convinced that it was executed correctly without knowing what was executed on, having huge implications for digital currency. Despite this, interactive proofs are not suited for blockchain applications but novel protocols such as zk-SNARKs have made zero-knowledge ledgers like Zcash possible. This project builds upon Wolfram's ZeroKnowledgeProofs paclet and implements a zk-SNARK compiler based on Pinocchio protocol

A new digital signature scheme with message recovery using hybrid problems

We present a new digital signature scheme with message recovery and its authenticated encryption based on elliptic curve discrete logarithm and quadratic residue. The main idea is to provide a higher level of security than all other techniques that use signatures with single hard problem including factoring, discrete logarithm, residuosity, or elliptic curves. The proposed digital signature schemes do not involve any modular exponentiation operations that leave no gap for attackers. The security analysis demonstrates the improved performance of the proposed schemes in comparison with existing techniques in terms of the ability to resist the most common attack

Attacking (EC)DSA scheme with ephemeral keys sharing specific bits

In this paper, we present a deterministic attack on (EC)DSA signature scheme, providing that several signatures are known such that the corresponding ephemeral keys share a certain amount of bits without knowing their value. By eliminating the shared blocks of bits between the ephemeral keys, we get a lattice of dimension equal to the number of signatures having a vector containing the private key. We compute an upper bound for the distance of this vector from a target vector, and next, using Kannan's enumeration algorithm, we determine it and hence the secret key. The attack can be made highly efficient by appropriately selecting the number of shared bits and the number of signatures

Image encryption based on elliptic curve cryptosystem

Image encryption based on elliptic curve cryptosystem and reducing its complexity is still being actively researched. Generating matrix for encryption algorithm secret key together with Hilbert matrix will be involved in this study. For a first case we will need not to compute the inverse matrix for the decryption processing cause the matrix that be generated in encryption step was self invertible matrix. While for the second case, computing the inverse matrix will be required. Peak signal to noise ratio (PSNR), and unified average changing intensity (UACI) will be used to assess which case is more efficiency to encryption the grayscale image

On the Design of a Blockchain-based Fraud-prevention Performance Appraisal System

 The job recruitment process takes a lot of process and number of documents. It is very well known for applicants to exaggerated and falsify their work history data. It may put a company at legal risk and significant commercial losses. Generally, company use third-party to verify applicant’s work history data which is time-consuming and costly. It also makes companies relies on third-party which may not trustworthy and cause several other risks. Generally, experience letters is used as a proof of work history documents of employee. However, the process of publishing an experience letter may contain conflict of interest between company and employee. Yet, publishing an experience letter is not mandatory in several places. In this research, we propose a system to verify applicant’s work history data by using performance appraisal as proof of work history and utilizing Blockchain to provide secure system, tampered-proof and real-time verification. The proposed approach also minimizes trust issues and privacy of data sharing by adding encryption and digital signature schema using Elliptic Curve Cryptography (ECC) algorithm. Furthermore, we have implemented a prototype to demonstrate how the proposed system work using a Quorum-based consortium blockchain