Towards efficient fully randomized message-locked encryption

DOI10.1007/978-3-319-40253-6_22MaRDI QIDQ2817475zbMATH OpenOpenAlexFDO

Authors Xiaofeng Chen, Qianhong Wu, Willy Susilo, W. J. Lou, Jian-Feng Ma, Tao Jiang

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

convergent encryptiondeduplicationinteractive protocolmessage-locked encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Message-locked encryption and secure deduplication
• Verifiable message-locked encryption
• Message-Locked Encryption for Lock-Dependent Messages
• Interactive Message-Locked Encryption and Secure Deduplication
• Message-locked encryption with file update

Cites work

• Interactive Message-Locked Encryption and Secure Deduplication
• Message-locked encryption and secure deduplication
• Message-Locked Encryption for Lock-Dependent Messages
• Nearly optimal binary search trees
• Optimum binary search trees
• The height of a random binary search tree
• Verifiable computation over large database with incremental updates

Cited in

(7)

• Message-locked encryption with file update
• Verifiable message-locked encryption
• Message-Locked Encryption for Lock-Dependent Messages
• Interactive Message-Locked Encryption and Secure Deduplication
• Efficient Implementations of MQPKS on Constrained Devices
• Message-locked encryption and secure deduplication
• Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange

This page was built for publication: Towards efficient fully randomized message-locked encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817475)