Structured encryption and controlled disclosure
From MaRDI portal
Recommendations
Cited in
(46)- SecGDB: graph encryption for exact shortest distance queries with efficient updates
- Dynamic local searchable symmetric encryption
- Approximate distance-comparison-preserving symmetric encryption
- Concurrent encrypted multimaps
- Formalization of the data encryption standard
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- Improved structured encryption for SQL databases via hybrid indexing
- Structured encryption for conceptual graphs
- Privacy-preserving subgraph matching protocol for two parties
- Efficient keyword search on encrypted dynamic cloud data
- Verifiable structured encryption
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- Publicly verifiable searchable symmetric encryption based on efficient cryptographic components
- SQL on structurally-encrypted databases
- Efficient searchable symmetric encryption for join queries
- Constraining pseudorandom functions privately
- An efficient query recovery attack against a graph encryption scheme
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Injection-secure structured and searchable symmetric encryption
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- Tight tradeoffs in searchable symmetric encryption
- Structured encryption and distribution-aware leakage suppression
- Encrypted key-value stores
- A privacy-preserving multi-keyword search approach in cloud computing
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption
- 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
- Structured encryption algorithm for text cryptography
- Inner magic and inner antimagic graphs in cryptography
- Structured encryption and leakage suppression
- Locality-preserving oblivious RAM
- The feasibility of outsourced database search in the plain model
- Computationally volume-hiding structured encryption
- Mitigation Techniques for Attacks on 1-Dimensional Databases that Support Range Queries
- Structured encryption and dynamic leakage suppression
- Deniable searchable symmetric encryption
- LEXICOGRAPHIC LABELED GRAPHS IN CRYPTOGRAPHY
- A survey on design and implementation of protected searchable data in the cloud
- Efficient Boolean search over encrypted data with reduced leakage
- Practical Attacks on Relational Databases Protected via Searchable Encryption
- A format-preserving encryption model for sensitive information
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- Searchable symmetric encryption over multiple servers
This page was built for publication: Structured encryption and controlled disclosure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058680)
