Eliminating Decryption Failures from the Simple Matrix Encryption Scheme

Albrecht Petzoldt Kyushu University, Fukuoka, Japan Jintai Ding University of Cincinnati, Ohio, USA Lih-Chung Wang National Dong Hwa University, Taiwan

TBD mathscidoc:2207.43118

IACR Cryptol. ePrint Arch., 2016.1
The SimpleMatrix encryption scheme as proposed by Tao et al. \cite{TD13} is one of the very few existing approaches to create a secure and efficient encryption scheme on the basis of multivariate polynomials. However, in its basic version, decryption failures occur with non-negligible probability. Although this problem has been addressed in several papers \cite{DP14,TX15}, a general solution to it is still missing. In this paper we propose an improved version of the SimpleMatrix scheme, which eliminates decryption failures completely and therefore solves the biggest problem of the SimpleMatrix encryption scheme. Additionally, we propose a second version of the scheme, which reduces the blow-up factor between plain and ciphertext size to a value arbitrary close to 1.
No keywords uploaded!
[ Download ] [ 2022-07-22 16:38:07 uploaded by dingjt ] [ 20 downloads ] [ 0 comments ]
@inproceedings{albrecht2016eliminating,
  title={Eliminating Decryption Failures from the Simple Matrix Encryption Scheme},
  author={Albrecht Petzoldt, Jintai Ding, and Lih-Chung Wang},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220722163807927820701},
  booktitle={IACR Cryptol. ePrint Arch.},
  year={2016},
}
Albrecht Petzoldt, Jintai Ding, and Lih-Chung Wang. Eliminating Decryption Failures from the Simple Matrix Encryption Scheme. 2016. In IACR Cryptol. ePrint Arch.. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220722163807927820701.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved