Randomized data partitioning with efficient search, retrieval and privacy-preservation

DOI10.1007/978-3-031-49190-0_22MaRDI QIDQ6591482

M. Oğuzhan Külekci

Publication date: 22 August 2024

zbMATH Keywords

randomizationdata partitioningcloud storagedata representationdistributed data storageprivacy-preserving data representation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Complexity aspects of guessing prefix codes
• Intelligent cryptography approach for secure distributed big data storage in cloud computing
• Secret-Sharing Schemes: A Survey
• CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
• On breaking a Huffman code
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Practical Entropy-Compressed Rank/Select Dictionary
• Lightweight compression with encryption based on asymmetric numeral systems

This page was built for publication: Randomized data partitioning with efficient search, retrieval and privacy-preservation

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