Pages that link to "Item:Q3612569"
From MaRDI portal
The following pages link to Deterministic and Efficiently Searchable Encryption (Q3612569):
Displaying 50 items.
- Secure deduplication storage systems supporting keyword search (Q494049) (← links)
- Better security for deterministic public-key encryption: the auxiliary-input setting (Q744600) (← links)
- A generic scheme of plaintext-checkable database encryption (Q781853) (← links)
- Proxy re-encryption with keyword search (Q985079) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- Reproducible circularly secure bit encryption: applications and realizations (Q1698399) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Incremental deterministic public-key encryption (Q1747660) (← links)
- Processing secure, verifiable and efficient SQL over outsourced database (Q1991841) (← links)
- Deterministic public-key encryption for adaptively-chosen plaintext distributions (Q1994638) (← links)
- A generic construction of CCA-secure deterministic encryption (Q2011031) (← links)
- CCA-security from adaptive all-but-one lossy trapdoor functions (Q2049981) (← links)
- Generic authenticated key exchange in the quantum random oracle model (Q2055699) (← links)
- Indifferentiability for public key cryptosystems (Q2096477) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- Non-malleable functions and their applications (Q2121503) (← links)
- Witness authenticating NIZKs and applications (Q2139626) (← links)
- Encrypted key-value stores (Q2152022) (← links)
- A privacy-preserving multi-keyword search approach in cloud computing (Q2152914) (← links)
- Obfuscation for cryptographic purposes (Q2267356) (← links)
- Semi-generic construction of public key encryption and identity-based encryption with equality test (Q2293058) (← links)
- Efficient cryptosystems from \(2^k\)-th power residue symbols (Q2397448) (← links)
- Efficient request-based comparable encryption scheme based on sliding window method (Q2403279) (← links)
- Instantiability of RSA-OAEP under chosen-plaintext attack (Q2408591) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- Public key encryption with equality test in the standard model (Q2660898) (← links)
- Updatable all-but-one dual projective hashing and its applications (Q2673066) (← links)
- Improved indistinguishability for searchable symmetric encryption (Q2692318) (← links)
- Privacy-preserving pattern matching on encrypted data (Q2692382) (← links)
- Point-Function Obfuscation: A Framework and Generic Constructions (Q2799109) (← links)
- Verifiable Searchable Encryption with Aggregate Keys for Data Sharing in Outsourcing Storage (Q2817810) (← links)
- Deterministic Public-Key Encryption Under Continual Leakage (Q2822678) (← links)
- Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli (Q2829209) (← links)
- Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results (Q2835595) (← links)
- Plaintext-Checkable Encryption (Q2890016) (← links)
- Efficient Fuzzy Search on Encrypted Data (Q2946931) (← links)
- Selective-Opening Security in the Presence of Randomness Failures (Q2953780) (← links)
- Efficient Asymmetric Index Encapsulation Scheme for Named Data (Q2953858) (← links)
- Full Disk Encryption: Bridging Theory and Practice (Q2975807) (← links)
- Lossy Key Encapsulation Mechanism and Its Applications (Q2988341) (← links)
- Public-Key Encryption with Delegated Search (Q3011319) (← links)
- Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting (Q3104695) (← links)
- Approximate-Deterministic Public Key Encryption from Hard Learning Problems (Q3179474) (← links)
- Towards Forward Security Properties for PEKS and IBE (Q3194593) (← links)
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model (Q3195263) (← links)
- Towards Tightly Secure Deterministic Public Key Encryption (Q3297488) (← links)
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs (Q3408193) (← links)
- Reproducible Circularly-Secure Bit Encryption: Applications and Realizations (Q3457112) (← links)
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles (Q3600228) (← links)
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles (Q3600229) (← links)
