Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
From MaRDI portal
Publication:5451027
DOI10.1007/11535218_13zbMath1145.94430OpenAlexW2120976781WikidataQ59163782 ScholiaQ59163782MaRDI QIDQ5451027
Haixia Shi, Gregory Neven, John Malone-Lee, Dario Catalano, Michel Abdalla, Tanja Lange, Eike Kiltz, Pascal Paillier, Tadayoshi Kohno, Mihir Bellare
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_13
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items
An efficient IBE scheme with tight security reduction in the random oracle model, Verifiable Inner Product Encryption Scheme, Hierarchical Identity-Based Encryption with Tight Multi-challenge Security, An efficient and secure searchable public key encryption scheme with privacy protection for cloud storage, Efficient subtree-based encryption for fuzzy-entity data sharing, Short Integrated PKE+PEKS in Standard Model, Implementing secure reporting of sexual misconduct -- revisiting WhoToo, A New General Framework for Secure Public Key Encryption with Keyword Search, Anonymous, robust post-quantum public key encryption, Anonymity of NIST PQC round 3 KEMs, Public-key authenticated encryption with keyword search revisited: security model and constructions, Lattice trapdoors and IBE from middle-product LWE, Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness, On the Anonymization of Cocks IBE Scheme, Efficient and universally composable single secret leader election from pairings, Oblivious Keyword Search with Authorization, Encapsulated search index: public-key, sub-linear, distributed, and delegatable, Public key authenticated searchable encryption against frequency analysis attacks, Key-oblivious encryption from isogenies with application to accountable tracing signatures, Identity-based matchmaking encryption without random oracles, Public key encryption with hierarchical authorized keyword search, Inner-product encryption under standard assumptions, Improved hidden vector encryption with short ciphertexts and tokens, Dual trapdoor identity-based encryption with keyword search, Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme, Efficient identity-based broadcast encryption with keyword search against insider attacks for database systems, Public key encryption with keyword search secure against keyword guessing attacks without random oracle, Public-Key Encryption with Delegated Search, Mobile access and flexible search over encrypted cloud data in heterogeneous systems, Anonymous HIBE with short ciphertexts: full security in prime order groups, Practical Identity-Based Encryption Without Random Oracles, Proxy re-encryption with keyword search, Generalized Identity Based and Broadcast Encryption Schemes, Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities, Novel updatable identity-based hash proof system and its applications, Public Key Encryption with Searchable Keywords Based on Jacobi Symbols, CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption, Revocable hierarchical identity-based encryption with adaptive security, Universally Anonymous IBE Based on the Quadratic Residuosity Assumption, Public Key Encryption with Authorized Keyword Search, Generic Anonymous Identity-Based Broadcast Encryption with Chosen-Ciphertext Security, Building Key-Private Public-Key Encryption Schemes, Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions, Fully Secure Functional Encryption for Inner Products, from Standard Assumptions, Functional encryption for set intersection in the multi-client setting, New Anonymity Notions for Identity-Based Encryption, Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting, New Anonymity Notions for Identity-Based Encryption, Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting, Secure hybrid encryption in the standard model from hard learning problems