The CRYPTO 2016 Best Paper Award went to Boyle et al [1]. The paper provides several new protocols based on a DDH assumption with applications to 2PC (2 party-computation), private information retrieval as well as function secret sharing. Even more interesting, the authors present a protocol where 2PC for branching programs is realized in a way that communication complexity depends only on the input size and the computation is linear in circuit size. The central idea develops around building eff
Crypto 2016: Breaking the Circuit Size Barrier for Secure Computation Under DDH
Unknown (noreply@blogger.com)
