Towards Efficient Fully Randomized Message-Locked Encryption

DOI10.1007/978-3-319-40253-6_22zbMath1403.94064OpenAlexW2490345588MaRDI QIDQ2817475

Willy Susilo, Xiaofeng Chen, Wenjing Lou, Qianhong Wu, Tao Jiang, Jian-Feng Ma

Publication date: 31 August 2016

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://ro.uow.edu.au/eispapers/5720

zbMATH Keywords

deduplicationinteractive protocolconvergent encryptionmessage-locked encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Nearly optimal binary search trees
• Optimum binary search trees
• Message-Locked Encryption for Lock-Dependent Messages
• Interactive Message-Locked Encryption and Secure Deduplication
• The height of a random binary search tree
• Message-Locked Encryption and Secure Deduplication
• Verifiable Computation over Large Database with Incremental Updates

This page was built for publication: Towards Efficient Fully Randomized Message-Locked Encryption