Laconic Branching Programs from the Diffie-Hellman Assumption

ePrint Report: Laconic Branching Programs from the Diffie-Hellman Assumption

Sanjam Garg, Mohammad Hajiabadi, Peihan Miao, Alice Murphy

Laconic cryptography enables secure two-party computation (2PC) on unbalanced inputs with asymptotically-optimal communication in just two rounds of communication. In particular, the receiver (who sends the first-round message) holds a long input and the sender (who sends the second-round message) holds a short input, and the size of their communication to securely compute a function on their joint inputs only grows with the …

alice communication computation cryptography diffie eprint report hellman input inputs message party report