The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Order preserving encryption for numeric data
Abstract
Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an order-preserving encryption scheme for numeric data that allows any comparison operation to be directly applied on encrypted data. Query results produced are sound (no false hits) and complete (no false drops). Our scheme handles updates gracefully and new values can be added without requiring changes in the encryption of other values. It allows standard databse indexes to be built over encrypted tables and can easily be integrated with existing database systems. The proposed scheme has been designed to be deployed in application environments in which the intruder can get access to the encrypted database, but does not have prior domain information such as the distribution of values and annot encrypt or decrypt arbitrary values of his choice. The encryption is robust against estimation of the true value in such environments.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Numerical recipes in Pascal: the art of scientific computing
(1990) · Choice Reviews Online · doi:10.5860/choice.27-5158 · Cited by 11,811
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
Cryptography: Theory and Practice
Stinson, D. R. (1995) · Cited by 2,743
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
(1978) · Cited by 1,875
Stochastic Complexity in Statistical Inquiry
Rissanen, J. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/0822 · Cited by 1,539
Executing SQL over encrypted data in the database-service-provider model
Hacigümüş, H., Iyer, B., Li, C., & Mehrotra, S. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564717 · Cited by 1,149
SLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
Self-citationAgrawal, R., Kiernan, J., Srikant, R., & Xu, Y. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50021-4 · Cited by 723
Self-citationCryptography in theory and practice
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_12 · Cited by 513
The History of Histograms (abridged)
Ioannidis, Y. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50011-2 · Cited by 502
Foundations of secure computation
DeMillo, R. A., Lipton, R. J., Dobkin, D., & Jones, A. K. (1978) · SMARTech Repository (Georgia Institute of Technology) · Cited by 462
Balancing confidentiality and efficiency in untrusted relational DBMSs
Damiani, E., Vimercati, S. D. C., Jajodia, S., Paraboschi, S., & Samarati, P. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948124 · Cited by 338
Cryptography: Theory and Practice,Second Edition
Stinson, D. R. (2002) · Cited by 263
A new privacy homomorphism and applications
Domingo‐Ferrer, J. (1996) · Information Processing Letters · doi:10.1016/s0020-0190(96)00170-6 · Cited by 164
Anti-tamper databases: querying encrypted databases
Özsoyoğlu, G., & Chung, S. S. (2006) · Cited by 79
Cited by
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
Secure kNN computation on encrypted databases
Wong, W. K., Cheung, D. W.-L., Kao, B., & Mamoulis, N. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559862 · Cited by 901
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
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
Inference Attacks on Property-Preserving Encrypted Databases
Naveed, M., Kamara, S., & Wright, C. V. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813651 · Cited by 502
Metadata
- Authors
- Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y.
- Venue
- Proceedings of the 2004 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2004-06-13
- Pages
- 563-574
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2154496743
- Cited by
- 1,206
- References
- 17
- FWCI
- 15.18
- Type
- conference paper
- Language
- en
- Open access
- closed
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.