Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"unbalanced secure computation"”.

  1. Laconic Evaluation of Branching Programs from the Diffie-Hellman Assumption

    Secure two-party computation (2PC) enables two parties to compute a function f on their joint inputs while keeping their inputs private. Laconic cryptography is a special type of 2PC in which this is done with asymptotically optimal communication in only two rounds of communication. The party who …

    waterloo Repository record for Laconic Evaluation of Branching Programs from the Diffie-Hellman Assumption (opens in a new tab)