Secure Merge in Linear Time and O(log log N) Rounds. - Mark Blunk; Paul Bunn; Samuel Dittmer; Steve Lu 001; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2022)

Linear-Time Secure Merge in O(loglog n) Rounds. - Mark Blunk; Paul Bunn; Samuel Dittmer; Steve Lu 001; Rafail Ostrovsky (ITC, 2025)