Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme

2020 ◽  
pp. 307-322
Author(s):  
Daniel Apon ◽  
Dustin Moody ◽  
Ray Perlner ◽  
Daniel Smith-Tone ◽  
Javier Verbel
Keyword(s):  
Encryption Scheme ◽  
Simple Matrix

scholarly journals A Verifiable Fully Homomorphic Encryption Scheme for Cloud Computing Security

Technologies ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 21
Author(s):  
Ahmed EL-YAHYAOUI ◽  
Mohamed Dafir ECH-CHERIF EL KETTANI
Keyword(s):  
Cloud Computing ◽  
Homomorphic Encryption ◽  
Encryption Scheme ◽  
Fully Homomorphic Encryption ◽  
Sensitive Data ◽  
Verifiable Computation ◽  
Multiplication Operation ◽  
Matrix Operations ◽  
Encryption Schemes ◽  
Simple Matrix

Performing smart computations in a context of cloud computing and big data is highly appreciated today. It allows customers to fully benefit from cloud computing capacities (such as processing or storage) without losing confidentiality of sensitive data. Fully homomorphic encryption (FHE) is a smart category of encryption schemes that enables working with the data in its encrypted form. It permits us to preserve confidentiality of our sensible data and to benefit from cloud computing capabilities. While FHE is combined with verifiable computation, it offers efficient procedures for outsourcing computations over encrypted data to a remote, but non-trusted, cloud server. The resulting scheme is called Verifiable Fully Homomorphic Encryption (VFHE). Currently, it has been demonstrated by many existing schemes that the theory is feasible but the efficiency needs to be dramatically improved in order to make it usable for real applications. One subtle difficulty is how to efficiently handle the noise. This paper aims to introduce an efficient and symmetric verifiable FHE based on a new mathematic structure that is noise free. In our encryption scheme, the noise is constant and does not depend on homomorphic evaluation of ciphertexts. The homomorphy of our scheme is obtained from simple matrix operations (addition and multiplication). The running time of the multiplication operation of our encryption scheme in a cloud environment has an order of a few milliseconds.

The Cubic Simple Matrix Encryption Scheme

2014 ◽  
pp. 76-87 ◽  
Author(s):  
Jintai Ding ◽  
Albrecht Petzoldt ◽  
Lih-chung Wang
Keyword(s):  
Encryption Scheme ◽  
Simple Matrix

Structural Key Recovery of Simple Matrix Encryption Scheme Family

2018 ◽  
Vol 61 (12) ◽  
pp. 1880-1896 ◽  
Author(s):  
Jinhui Liu ◽  
Yong Yu ◽  
Bo Yang ◽  
Jianwei Jia ◽  
Shijia Wang ◽  
...  
Keyword(s):  
Encryption Scheme ◽  
Key Recovery ◽  
Simple Matrix

Fast Implementation of Simple Matrix Encryption Scheme on Modern x64 CPU

2016 ◽  
pp. 151-166
Author(s):  
Zhiniang Peng ◽  
Shaohua Tang ◽  
Ju Chen ◽  
Chen Wu ◽  
Xinglin Zhang
Keyword(s):  
Encryption Scheme ◽  
Fast Implementation ◽  
Simple Matrix

A CCA2-Secure Multi-Decrypter Encryption Scheme Without Random Oracles

Informatica ◽  
2015 ◽  
Vol 26 (3) ◽  
pp. 543-556
Author(s):  
Shengbao Wang ◽  
Peng Zeng ◽  
Kim-Kwang Raymond Choo ◽  
Hongbing Wang
Keyword(s):  
Encryption Scheme ◽  
Random Oracles

Cryptanalysis on an Improved Version of ElGamal-Like Public-Key Encryption Scheme for Encrypting Large Messages

Informatica ◽  
2012 ◽  
Vol 23 (4) ◽  
pp. 537-562 ◽  
Author(s):  
Ting-Yi Chang ◽  
Min-Shiang Hwang ◽  
Wei-Pang Yang
Keyword(s):  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption

Comment on the Security of an Order-Preserving Encryption Scheme Using Pseudo-Random Function

2016 ◽  
Vol E99.B (9) ◽  
pp. 2108-2111
Author(s):  
Minkyu KIM ◽  
Je HONG PARK ◽  
Dongyoung ROH
Keyword(s):  
Random Function ◽  
Encryption Scheme
Sign in / Sign up

Export Citation Format

Share Document