J Lavauzelle, F Levy-dit-Vehel - Journal of Mathematical Cryptology, 2019 - degruyter.com
In this paper, we show how to construct–from any linear code–a Proof of Retrievability
(𝖯𝗈𝖱) which features very low computation complexity on both the client (𝖵𝖾𝗋𝗂𝖿𝗂𝖾𝗋) and …