Deterministic and Efficiently Searchable Encryption
From MaRDI portal
Recommendations
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Advances in Cryptology - EUROCRYPT 2004
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Public Key Encryption That Allows PIR Queries
- Deterministic Public-Key Encryption Under Continual Leakage
Cited in
(73)- To label, or not to label (in generic groups)
- Semi-generic construction of public key encryption and identity-based encryption with equality test
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Secure vault scheme in the cloud operating model
- Backdoors in pseudorandom number generators: possibility and impossibility results
- Processing secure, verifiable and efficient SQL over outsourced database
- Deterministic public-key encryption for adaptively-chosen plaintext distributions
- Approximate distance-comparison-preserving symmetric encryption
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Another step towards realizing random oracles: non-malleable point obfuscation
- Privacy-preserving pattern matching on encrypted data
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Theory of Cryptography
- Lossy key encapsulation mechanism and its applications
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Public Key Encryption That Allows PIR Queries
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Point-function obfuscation: a framework and generic constructions
- Selective-Opening Security in the Presence of Randomness Failures
- Obfuscation for cryptographic purposes
- Incremental deterministic public-key encryption
- A generic construction of CCA-secure deterministic encryption
- DATA STORAGE SECURITY AND FULL DISK ENCRYPTION
- Full disk encryption: bridging theory and practice
- Deterministic Public-Key Encryption Under Continual Leakage
- Public key encryption with equality test in the standard model
- Two is a crowd? A black-box separation of one-wayness and security under correlated inputs
- DMU-ABSE: dynamic multi-user attribute-based searchable encryption with file deletion and user revocation
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Beyond Uber: instantiating generic groups via PGGs
- Witness authenticating NIZKs and applications
- Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
- Augmented random oracles
- How to build a trapdoor function from an encryption scheme
- Multi-use deterministic public key proxy re-encryption from lattices in the auxiliary-input setting
- Better security for deterministic public-key encryption: the auxiliary-input setting
- Efficient Asymmetric Index Encapsulation Scheme for Named Data
- Encrypted key-value stores
- A privacy-preserving multi-keyword search approach in cloud computing
- Instantiability of classical random-oracle-model encryption transforms
- Towards forward security properties for PEKS and IBE
- Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Reproducible circularly-secure bit encryption: applications and realizations
- Public-Key Encryption with Delegated Search
- Towards tightly secure deterministic public key encryption
- Functional encryption: deterministic to randomized functions from simple assumptions
- Generic authenticated key exchange in the quantum random oracle model
- Verifiable searchable encryption with aggregate keys for data sharing in outsourcing storage
- CCA security and trapdoor functions via key-dependent-message security
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Updatable all-but-one dual projective hashing and its applications
- Order-Preserving Symmetric Encryption
- Mitigation Techniques for Attacks on 1-Dimensional Databases that Support Range Queries
- Secure deduplication storage systems supporting keyword search
- A generic scheme of plaintext-checkable database encryption
- Efficient Boolean search over encrypted data with reduced leakage
- Efficient request-based comparable encryption scheme based on sliding window method
- Non-Observable Quantum Random Oracle Model
- Ciphertext-policy delegatable hidden vector encryption and its application to searchable encryption in multi-user setting
- Reproducible circularly secure bit encryption: applications and realizations
- Improved indistinguishability for searchable symmetric encryption
- Proxy re-encryption with keyword search
- Approximate-deterministic public key encryption from hard learning problems
- On the impossibility of structure-preserving deterministic primitives
- Efficient Fuzzy Search on Encrypted Data
- Updatable tokenization: formal definitions and provably secure constructions
- Plaintext-checkable encryption
- Indifferentiability for public key cryptosystems
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- Non-malleable functions and their applications
This page was built for publication: Deterministic and Efficiently Searchable Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612569)
