Summary

The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)

2018

Session Number:We-AM-Poster

Session:

Number:We-AM-Poster.22

Study the Quantitative Bound of Required Samples in Attacking GACD-based FHE Schemes

Yuntao Wang,  Xiaoling Yu,  Tsuyoshi Takagi,  

pp.512-512

Publication Date:2018/10/18

Online ISSN:2188-5079

DOI:10.34385/proc.55.We-AM-Poster.22

PDF download

PayPerView

Summary:
In this work, we studied the quantitative bound of the required samples of Ding and Tao’s algorithm to solve GACD problem. We updated to a new bound using geometric series assumption and showed its success probability with some experimental data. As a future work, we consider to reevaluate the recommended parameters of the corresponding FHE scheme based on our results.