搜索结果: 1-1 共查到“密码学 lower bound on linear garbling schemes”相关记录1条 . 查询时间(0.062 秒)
How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
garbled circuits lower bound on linear garbling schemes semi-private function evaluation
font style='font-size:12px;'>
2017/2/20
At EUROCRYPT 2015, Zahur et al.\ argued that all linear, and thus, efficient, garbling schemes need at least two kk-bit elements to garble an AND gate with security parameter kk. We show how to circum...