Efficient Laconic Cryptography from Learning With Errors

ePrint Report: Efficient Laconic Cryptography from Learning With Errors

Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai, Chuanwei Lin, Giulio Malavolta, Ahmadreza Rahimi

Laconic cryptography is an emerging paradigm that enables cryptographic primitives with sublinear communication complexity in just two messages. In particular, a two-message protocol between Alice and Bob is called laconic if its communication and computation complexity are essentially independent of the size of Alice's input. This can be thought of as a dual notion of fully-homomorphic encryption, …

alice called communication complexity computation cryptography emerging eprint report errors input message messages paradigm protocol report size thought