Secure Merge in Linear Time and O(log log N) Rounds.

Mark Blunk Paul Bunn Samuel Dittmer Steve Lu Rafail Ostrovsky

Published in: IACR Cryptol. ePrint Arch. (2022)

Keyphrases

worst case
log log
security issues
lower bound
security analysis
security requirements
computational complexity
sensitive data
security mechanisms
key management
digital signature