Efficient Set Membership Encryption and Applications

Matthew Green, Abhishek Jain, Gijs Van Laer · 2023

The emerging area of laconic cryptography [Cho et al., CRYPTO'17] involves the design of two-party protocols involving a sender and a receiver, where the receiver's input is large. The key efficiency requirement is that the protocol communication complexity must be independent of the receiver's input size. In recent years, many tasks have been studied under this umbrella, including laconic oblivious transfer (ℓOT).

Read the paper · More papers on PaperTik