Deterministic and Efficiently Searchable Encryption
From MaRDI portal
Publication:3612569
DOI10.1007/978-3-540-74143-5_30zbMath1215.94032OpenAlexW1502927489MaRDI QIDQ3612569
Adam O'Neill, Alexandra Boldyreva, Mihir Bellare
Publication date: 10 March 2009
Published in: Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74143-5_30
Related Items (64)
Non-malleable functions and their applications ⋮ Plaintext-Checkable Encryption ⋮ Witness authenticating NIZKs and applications ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Encrypted key-value stores ⋮ A privacy-preserving multi-keyword search approach in cloud computing ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Towards Forward Security Properties for PEKS and IBE ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Efficient request-based comparable encryption scheme based on sliding window method ⋮ Public key encryption with equality test in the standard model ⋮ Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Updatable all-but-one dual projective hashing and its applications ⋮ Selective-Opening Security in the Presence of Randomness Failures ⋮ Efficient Asymmetric Index Encapsulation Scheme for Named Data ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Approximate distance-comparison-preserving symmetric encryption ⋮ How to build a trapdoor function from an encryption scheme ⋮ Efficient Boolean search over encrypted data with reduced leakage ⋮ Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption ⋮ Augmented random oracles ⋮ To label, or not to label (in generic groups) ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Privacy-preserving pattern matching on encrypted data ⋮ Full Disk Encryption: Bridging Theory and Practice ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Lossy Key Encapsulation Mechanism and Its Applications ⋮ Towards Tightly Secure Deterministic Public Key Encryption ⋮ Secure deduplication storage systems supporting keyword search ⋮ DATA STORAGE SECURITY AND FULL DISK ENCRYPTION ⋮ Incremental deterministic public-key encryption ⋮ Processing secure, verifiable and efficient SQL over outsourced database ⋮ Deterministic public-key encryption for adaptively-chosen plaintext distributions ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ A generic construction of CCA-secure deterministic encryption ⋮ Obfuscation for cryptographic purposes ⋮ Proxy re-encryption with keyword search ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Semi-generic construction of public key encryption and identity-based encryption with equality test ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Order-Preserving Symmetric Encryption ⋮ Better security for deterministic public-key encryption: the auxiliary-input setting ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ DMU-ABSE: Dynamic Multi-user Attribute-Based Searchable Encryption with File Deletion and User Revocation ⋮ Verifiable Searchable Encryption with Aggregate Keys for Data Sharing in Outsourcing Storage ⋮ Generic authenticated key exchange in the quantum random oracle model ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli ⋮ Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting ⋮ Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results ⋮ Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs ⋮ A generic scheme of plaintext-checkable database encryption ⋮ Updatable Tokenization: Formal Definitions and Provably Secure Constructions ⋮ Indifferentiability for public key cryptosystems ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model ⋮ Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting ⋮ Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
This page was built for publication: Deterministic and Efficiently Searchable Encryption
