Structured Encryption and Controlled Disclosure
From MaRDI portal
Publication:3058680
DOI10.1007/978-3-642-17373-8_33zbMath1253.94042OpenAlexW1539859404MaRDI QIDQ3058680
Publication date: 7 December 2010
Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17373-8_33
Related Items
Structured encryption algorithm for text cryptography, Inner magic and inner antimagic graphs in cryptography, Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound, Encrypted key-value stores, A privacy-preserving multi-keyword search approach in cloud computing, LEXICOGRAPHIC LABELED GRAPHS IN CRYPTOGRAPHY, PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries, A survey on design and implementation of protected searchable data in the cloud, Practical Attacks on Relational Databases Protected via Searchable Encryption, Dynamic local searchable symmetric encryption, Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts, Approximate distance-comparison-preserving symmetric encryption, Efficient searchable symmetric encryption for join queries, Efficient Boolean search over encrypted data with reduced leakage, Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption, An efficient query recovery attack against a graph encryption scheme, Limits of breach-resistant and snapshot-oblivious RAMs, Structured encryption for knowledge graphs, Multi-user image retrieval with suppression of search pattern leakage, Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations, Searchable symmetric encryption over multiple servers, Publicly verifiable searchable symmetric encryption based on efficient cryptographic components, Constraining Pseudorandom Functions Privately, Tight tradeoffs in searchable symmetric encryption, Privacy-Preserving Subgraph Matching Protocol for Two Parties, Deniable searchable symmetric encryption, Locality-preserving oblivious RAM, Structured encryption and dynamic leakage suppression, The Feasibility of Outsourced Database Search in the Plain Model, TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption, SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates, Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model, Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity, Improved structured encryption for SQL databases via hybrid indexing
