The DOI matches its Crossref record; 110 of the 110 references it cites were found in a registry or an index.
A Survey of Provably Secure Searchable Encryption
Open accessAbstract
We survey the notion of provably secure searchable encryption (SE) by giving a complete and comprehensive overview of the two main SE techniques: searchable symmetric encryption (SSE) and public key encryption with keyword search (PEKS). Since the pioneering work of Song, Wagner, and Perrig (IEEE S&P '00), the field of provably secure SE has expanded to the point where we felt that taking stock would provide benefit to the community. The survey has been written primarily for the nonspecialist who has a basic information security background. Thus, we sacrifice full details and proofs of individual constructions in favor of an overview of the underlying key techniques. We categorize and compare the different SE schemes in terms of their security, efficiency, and functionality. For the experienced researcher, we point out connections between the many approaches to SE and identify open research problems. Two major conclusions can be drawn from our work. While the so-called IND-CKA2 security notion becomes prevalent in the literature and efficient (sublinear) SE schemes meeting this notion exist in the symmetric setting, achieving this strong form of security efficiently in the asymmetric setting remains an open problem. We observe that in multirecipient SE schemes, regardless of their efficiency drawbacks, there is a noticeable lack of query expressiveness that hinders deployment in practice.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Practical techniques for searches on encrypted data
Song, D. X., Wagner, D., & Perrig, A. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848445 · Cited by 3,350
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
Public Key Encryption with Keyword Search
Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_30 · Cited by 3,134
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Fully Homomorphic Encryption over the Integers
van Dijk, M., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_2 · Cited by 1,858
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
Searchable symmetric encryption: improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180417 · Cited by 1,671
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
Divertible protocols and atomic proxy cryptography
Blaze, M., Bleumer, G., & Strauss, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054122 · Cited by 1,582
Conjunctive, Subset, and Range Queries on Encrypted Data
Boneh, D., & Waters, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70936-7_29 · Cited by 1,432
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Boneh, D., Boyen, X., & Goh, E.-J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_26 · Cited by 1,334
Lewko, A., Okamoto, T., Sahai, A., Takashima, K., & Waters, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_4 · Cited by 1,313
Order preserving encryption for numeric data
Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007632 · Cited by 1,206
CryptDB: protecting confidentiality with encrypted query processing
Popa, R. A., Redfield, C. M. S., Zeldovich, N., & Balakrishnan, H. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043566 · Cited by 1,155
Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492461 · Cited by 1,116
Dynamic searchable symmetric encryption
Kamara, S., Papamanthou, C., & Roeder, T. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382298 · Cited by 1,111
An Identity Based Encryption Scheme Based on Quadratic Residues
Cocks, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45325-3_32 · Cited by 1,102
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Hierarchical ID-Based Cryptography
Gentry, C., & Silverberg, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_34 · Cited by 1,088
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Katz, J., Sahai, A., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_9 · Cited by 1,081
Privacy Preserving Keyword Searches on Remote Encrypted Data
Chang, Y.-C., & Mitzenmacher, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_30 · Cited by 1,041
Can homomorphic encryption be practical?
Naehrig, M., Lauter, K., & Vaikuntanathan, V. (2011) · Proceedings of the 3rd ACM workshop on Cloud computing security workshop · doi:10.1145/2046660.2046682 · Cited by 1,004
Bellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
The Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
Order-Preserving Symmetric Encryption
Boldyreva, A., Chenette, N., Lee, Y., & O’Neill, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_13 · Cited by 887
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., & Steiner, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_20 · Cited by 883
Probabilistic encryption & how to play mental poker keeping secret all partial information
Goldwasser, S., & Micali, S. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802212 · Cited by 883
Fuzzy Keyword Search over Encrypted Data in Cloud Computing
Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., & Lou, W. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5462196 · Cited by 861
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
Secure Conjunctive Keyword Search over Encrypted Data
Golle, P., Staddon, J., & Waters, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24852-1_3 · Cited by 773
Storing a Sparse Table with 0 (1) Worst Case Access Time
Fredman, M. L., Komlós, J., & Szemerédi, E. (1984) · Journal of the ACM · doi:10.1145/828.1884 · Cited by 748
Deterministic and Efficiently Searchable Encryption
Bellare, M., Boldyreva, A., & O’Neill, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_30 · Cited by 745
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
Camenisch, J., & Lysyanskaya, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_5 · Cited by 732
A Forward-Secure Public-Key Encryption Scheme
Canetti, R., Halevi, S., & Katz, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_16 · Cited by 701
Computing arbitrary functions of encrypted data
Gentry, C. (2010) · Communications of the ACM · doi:10.1145/1666420.1666444 · Cited by 650
Toward Hierarchical Identity-Based Encryption
Horwitz, J., & Lynn, B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_31 · Cited by 584
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Barić, N., & Pfitzmann, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_33 · Cited by 557
Multi-Dimensional Range Query over Encrypted Data
Shi, E., Bethencourt, J., Chan, T.-H. H., Song, D., & Perrig, A. (2007) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2007.29 · Cited by 552
Parallel and Dynamic Searchable Symmetric Encryption
Kamara, S., & Papamanthou, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_22 · Cited by 528
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
Bellare, M., Boldyreva, A., & Micali, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_18 · Cited by 519
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
Okamoto, T., & Takashima, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_11 · Cited by 507
Public Key Encryption with Keyword Search Revisited
Baek, J., Safavi-Naini, R., & Susilo, W. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69839-5_96 · Cited by 498
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
Boldyreva, A., Chenette, N., & O’Neill, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_33 · Cited by 498
Statistical zero knowledge protocols to prove modular polynomial relations
Fujisaki, E., & Okamoto, T. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052225 · Cited by 497
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
Boyen, X., & Waters, B. R. (2006) · Lecture notes in computer science · doi:10.1007/11818175_17 · Cited by 495
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
Predicate Privacy in Encryption Systems
Shen, E., Shi, E., & Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00457-5_27 · Cited by 436
Camenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
Hwang, Y. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73489-5_2 · Cited by 407
Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
Nishide, T., Yoneyama, K., & Ohta, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68914-0_7 · Cited by 403
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
Abdalla, M. F., Mihir Bellare, Y., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., & Shi, H. (2007) · Journal of Cryptology · doi:10.1007/s00145-007-9006-6 · Cited by 350
Signature schemes based on the strong RSA assumption
Cramer, R., & Shoup, V. (2000) · ACM Transactions on Information and System Security · doi:10.1145/357830.357847 · Cited by 325
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Hierarchical Predicate Encryption for Inner-Products
Okamoto, T., & Takashima, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_13 · Cited by 290
Trapdoor security in a searchable public-key encryption scheme with a designated tester
Rhee, H. S., Park, J. H., Susilo, W., et al. (2009) · Journal of Systems and Software · doi:10.1016/j.jss.2009.11.726 · Cited by 286
Mitsunari, S., Sakai, R., & Kasahara, M. (2002) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · Cited by 279
Efficient Similarity Search over Encrypted Data
Kuzu, M., Islam, M. S., & Kantarcioglu, M. (2012) · 2012 IEEE 28th International Conference on Data Engineering · doi:10.1109/icde.2012.23 · Cited by 266
UC-Secure Searchable Symmetric Encryption
Kurosawa, K., & Ohtaki, Y. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_21 · Cited by 255
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
Joux, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45455-1_3 · Cited by 232
Shared and searchable encrypted data for untrusted servers
Dong, C., Russello, G., & Dulay, N. (2011) · Journal of Computer Security · doi:10.3233/jcs-2010-0415 · Cited by 231
RSA-OAEP Is Secure under the RSA Assumption
Fujisaki, E., Okamoto, T., Pointcheval, D., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_16 · Cited by 206
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
Okamoto, T., & Takashima, K. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_35 · Cited by 195
Computationally Efficient Searchable Symmetric Encryption
van Liesdonk, P., Sedghi, S., Doumen, J., Hartel, P., & Jonker, W. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15546-8_7 · Cited by 194
Self-citationPublic key encryption supporting plaintext equality test and user‐specified authorization
Tang, Q. (2012) · Security and Communication Networks · doi:10.1002/sec.418 · Cited by 170
Delegating Capabilities in Predicate Encryption Systems
Shi, E., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_46 · Cited by 169
A Simple BGN-Type Cryptosystem from LWE
Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_26 · Cited by 166
Private Searching on Streaming Data
Ostrovsky, R., & Skeith, W. E. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_14 · Cited by 159
Towards Public Key Encryption Scheme Supporting Equality Test with Fine-Grained Authorization
Tang, Q. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22497-3_25 · Cited by 157
Improved searchable public key encryption with designated tester
Rhee, H. S., Park, J. H., Susilo, W., & Lee, D. H. (2009) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1533057.1533108 · Cited by 151
Public key encryption schemes supporting equality test with authorisation of different granularity
Tang, Q. (2012) · International Journal of Applied Cryptography · doi:10.1504/ijact.2012.048079 · Cited by 144
Randomness Re-use in Multi-recipient Encryption Schemeas
Bellare, M., Boldyreva, A., & Staddon, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_7 · Cited by 143
On cryptographic protocols employing asymmetric pairings — The role of Ψ revisited
Chatterjee, S., & Menezes, A. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.04.021 · Cited by 134
Security Proof of Sakai-Kasahara’s Identity-Based Encryption Scheme
Chen, L., & Cheng, Z. (2005) · Lecture notes in computer science · doi:10.1007/11586821_29 · Cited by 122
Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number.Preprint
Scott, M. (2002) · IACR Cryptology ePrint Archive · Cited by 114
Shared and Searchable Encrypted Data for Untrusted Servers
Dong, C., Russello, G., & Dulay, N. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70567-3_10 · Cited by 110
One-way Accumulators: A Decentralized Alternative to Digital Signatures (Extended Abstract)
Benaloh, J., & de Mare, M. (1993) · Cited by 98
Hidden-Vector Encryption with Groups of Prime Order
Iovino, V., & Persiano, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85538-5_5 · Cited by 97
Secure anonymous database search
Raykova, M., Vo, B. D., Bellovin, S. M., & Malkin, T. (2009) · doi:10.1145/1655008.1655025 · Cited by 89
Private Searching on Streaming Data
Ostrovsky, R., & Skeith, W. E. (2007) · Journal of Cryptology · doi:10.1007/s00145-007-0565-3 · Cited by 84
New constructions and practical applications for private stream searching
Bethencourt, J., Song, D. S., & Waters, B. R. (2006) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2006.27 · Cited by 78
New Techniques for Private Stream Searching
Bethencourt, J., Song, D. X., & Waters, B. R. (2009) · ACM Transactions on Information and System Security · doi:10.1145/1455526.1455529 · Cited by 73
Bellare, M., Boldyreva, A., Kurosawa, K., & Staddon, J. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.907471 · Cited by 71
Inner-product encryption under standard assumptions
Park, J. H. (2010) · Designs Codes and Cryptography · doi:10.1007/s10623-010-9405-9 · Cited by 70
Extended Notions of Security for Multicast Public Key Cryptosystems
Baudron, O., Pointcheval, D., & Stern, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45022-x_42 · Cited by 63
Error-Tolerant Searchable Encryption
Bringer, J., Chabanne, H., & Kindarji, B. (2009) · International Conference on Communications · doi:10.1109/icc.2009.5199004 · Cited by 58
Kiayias, A., Tsiounis, Y., & Yung, M. M. (2007) · Springer eBooks · doi:10.1007/978-3-540-76900-2_11 · Cited by 54
Efficient Conjunctive Keyword-Searchable Encryption
Ryu, E., & Takagi, T. (2007) · International Conference on Advanced Information Networking and Applications Workshops (WAINA) · doi:10.1109/ainaw.2007.166 · Cited by 50
Biometric Identification over Encrypted Data Made Feasible
Adjedj, M., Bringer, J., Chabanne, H., & Kindarji, B. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10772-6_8 · Cited by 33
Attribute-Based Encryption with Partially Hidden Ciphertext Policies
Nishide, T., Yoneyama, K., & Ohta, K. (2009) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.e92.a.22 · Cited by 19
Hattori, M., Hirano, T., Ito, T., Matsuda, N., Mori, T., Sakai, Y., & Ohta, K. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25516-8_12 · Cited by 17
Cited by
Thapa, C., & Camtepe, S. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2020.104130 · Cited by 393
Security and Privacy in Device-to-Device (D2D) Communication: A Review
Haus, M., Waqas, M., Ding, A. Y., Li, Y., Tarkoma, S., & Ott, J. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2649687 · Cited by 318
Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures
Koukaras, P., & Tjortjis, C. (2025) · Big Data and Cognitive Computing · doi:10.3390/bdcc9100258 · Cited by 3
Metadata
- Authors
- Bösch, C., Hartel, P., Jonker, W., & Peter, A.
- Venue
- ACM Computing Surveys
- Published
- 2014-08-25
- Volume
- 47
- Issue
- 2
- Pages
- 1-51
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2162567660
- Cited by
- 357
- References
- 110
- FWCI
- 31.36
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.