The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
An Efficient Privacy-Preserving Outsourced Calculation Toolkit With Multiple Keys
Open accessAbstract
In this paper, we propose a toolkit for efficient and privacy-preserving outsourced calculation under multiple encrypted keys (EPOM). Using EPOM, a large scale of users can securely outsource their data to a cloud server for storage. Moreover, encrypted data belonging to multiple users can be processed without compromising on the security of the individual user's (original) data and the final computed results. To reduce the associated key management cost and private key exposure risk in EPOM, we present a distributed two-trapdoor public-key cryptosystem, the core cryptographic primitive. We also present the toolkit to ensure that the commonly used integer operations can be securely handled across different encrypted domains. We then prove that the proposed EPOM achieves the goal of secure integer number processing without resulting in privacy leakage of data to unauthorized parties. Last, we demonstrate the utility and the efficiency of EPOM using simulations.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“The privacy of divided private key is guaranteed by Shamir secret sharing scheme [29] which is information-theoretic secure.”
BackgroundA 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 · cited 1×
“Multiplicative homomorphic encryption scheme, such as unpadded RSA cryptosystem [46] and El-Gamal cryptosystem [47], allows some multiplication over the plaintext.”
MethodPublic-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 · cited 2×
“More specifically, Gentry [40] constructed the first fully homomorphic encryption scheme based on lattice-based cryptography to support an arbitrary number of addition and multiplication operations.”
MethodPassword authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
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
Owens, J. D., Houston, M., Luebke, D., Green, S., Stone, J. E., & Phillips, J. C. (2008) · Proceedings of the IEEE · doi:10.1109/jproc.2008.917757 · Cited by 1,495
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
PVM: A Users' Guide and Tutorial for Network Parallel Computing
Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., & Sunderam, V. S. (1994) · The MIT Press eBooks · doi:10.7551/mitpress/5712.001.0001 · Cited by 1,397
PVM: A framework for parallel distributed computing
Sunderam, V. S. (1990) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330020404 · Cited by 1,170
Owens, J. D., Houston, M., Luebke, D. P., Green, S., Stone, J. E., & Phillips, J. C. (2008) · Proceedings of the IEEE · Cited by 1,085
Nickolls, J., & Dally, W. J. (2010) · IEEE Micro · doi:10.1109/mm.2010.41 · Cited by 980
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Cramer, R., & Shoup, V. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_4 · Cited by 831
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
Smart, N. P., & Vercauteren, F. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_25 · Cited by 808
Cloud Computing: Distributed Internet Computing for IT and Scientific Research
Dikaiakos, M. D., Katsaros, D., Mehra, P., Pallis, G., & Vakali, A. (2009) · IEEE Internet Computing · doi:10.1109/mic.2009.103 · Cited by 795
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
Brakerski, Z., & Vaikuntanathan, V. (2014) · SIAM Journal on Computing · doi:10.1137/120868669 · Cited by 538
Scientific Cloud Computing: Early Definition and Experience
Wang, L., Tao, J., Kunze, M., Castellanos, A. C., Kramer, D., & Karl, W. (2008) · 2008 10th IEEE International Conference on High Performance Computing and Communications · doi:10.1109/hpcc.2008.38 · Cited by 532
Recommendation for key management, part 1: general (revised)
Barker, E. B., Barker, W. C., Burr, W. E., Polk, W. T., & Smid, M. E. (2007) · doi:10.6028/nist.sp.800-57p1r2007 · Cited by 456
When private set intersection meets big data: an efficient and scalable protocol
Dong, C., Chen, L., & Wen, Z. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516701 · Cited by 387
A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications
Bresson, E., Catalano, D., & Pointcheval, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-40061-5_3 · Cited by 355
Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography
Ding, C., Pei, D., & Salomaa, A. (1996) · WORLD SCIENTIFIC eBooks · doi:10.1142/3254 · Cited by 346
Toward efficient and privacy-preserving computing in big data era
Lu, R., Zhu, H., Liu, X., Liu, J. K., & Shao, J. (2014) · IEEE Network · doi:10.1109/mnet.2014.6863131 · Cited by 325
Self-citationTwo Round Multiparty Computation via Multi-key FHE
Mukherjee, P., & Wichs, D. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49896-5_26 · Cited by 308
Dense Probabilistic Encryption
Benaloh, J. (1999) · Selected Areas in Cryptography · Cited by 244
Privacy-Preserving Patient-Centric Clinical Decision Support System on Naïve Bayesian Classification
Liu, X., Lu, R., Ma, J., Chen, L., & Qin, B. (2016) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2015.2407157 · Cited by 240
Self-citatione-Health Cloud: Opportunities and Challenges
AbuKhousa, E., Mohamed, N., & Al-Jaroodi, J. (2012) · Future Internet · doi:10.3390/fi4030621 · Cited by 230
FindU: Privacy-preserving personal profile matching in mobile social networks
Li, M., Cao, N., Yu, S., & Lou, W. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5935065 · Cited by 223
Multi-identity and Multi-key Leveled FHE from Learning with Errors
Clear, M., & McGoldrick, C. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48000-7_31 · Cited by 219
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
Gentry, C., & Halevi, S. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.94 · Cited by 214
An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
Lin, H.-Y., & Tzeng, W.-G. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_31 · Cited by 206
Efficient and Privacy-Preserving Outsourced Calculation of Rational Numbers
Liu, X., Choo, K.-K. R., Deng, R. H., Lu, R., & Weng, J. (2018) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2536601 · Cited by 188
Self-citationOutsourcing Multi-Party Computation.Preprint
Kamara, S., Mohassel, P., & Raykova, M. (2011) · IACR Cryptology ePrint Archive · Cited by 172
Efficiently Outsourcing Multiparty Computation Under Multiple Keys
Peter, A., Tews, E., & Katzenbeisser, S. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2288131 · Cited by 168
Trust beyond security: an expanded trust model
Hoffman, L. J., Lawson-Jenkins, K., & Blum, J. J. (2006) · Communications of the ACM · doi:10.1145/1139922.1139924 · Cited by 153
Anderson, M., & Feil, T. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b17673-23 · Cited by 150
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
Fouque, P.-A., & Pointcheval, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_21 · Cited by 135
Distributed Oblivious RAM for Secure Two-Party Computation
Lu, S., & Ostrovsky, R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36594-2_22 · Cited by 135
(2014) · Elsevier eBooks · doi:10.1016/c2013-0-09718-6 · Cited by 127
A new efficient privacy-preserving scalar product protocol
Amirbekyan, A., & Estivill‐Castro, V. (2007) · Griffith Research Online · Cited by 86
A Forensically Sound Adversary Model for Mobile Devices
Do, Q., Martini, B., & Choo, K. R. (2015) · PLoS ONE · doi:10.1371/journal.pone.0138449 · Cited by 71
Self-citationA Distributed k-Secure Sum Protocol for Secure Multi-Party ComputationsPreprint
Sheikh, R., Kumar, B., & Mishra, D. K. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1003.4071 · Cited by 62
An efficient and probabilistic secure bit-decomposition
Samanthula, B. K., Hu, C., & Jiang, W. (2013) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/2484313.2484386 · Cited by 54
Privacy Preserving k Secure Sum ProtocolPreprint
Sheikh, R., Kumar, B., & Mishra, D. K. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.0956 · Cited by 46
Efficient and privacy-preserving skyline computation framework across domains
Liu, X., Lu, R., Ma, J., Chen, L., & Bao, H. (2015) · Future Generation Computer Systems · doi:10.1016/j.future.2015.10.005 · Cited by 45
Self-citationAn Efficient Privacy-Preserving Outsourced Computation over Public Data
Liu, X., Qin, B., Deng, R. H., & Li, Y. (2015) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2015.2511008 · Cited by 42
Self-citationBoosting Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data
Catalano, D., & Fiore, D. (2015) · Cited by 9
Cited by
ShieldFL: Mitigating Model Poisoning Attacks in Privacy-Preserving Federated Learning
Ma, Z., Ma, J., Miao, Y., Li, Y., & Deng, R. H. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3169918 · Cited by 371
Self-citationPrivacy and Security Issues in Deep Learning: A Survey
Liu, X., Xie, L., Wang, Y., Zou, J., Xiong, J., Ying, Z., & Vasilakos, A. V. (2021) · IEEE Access · doi:10.1109/access.2020.3045078 · Cited by 282
Self-citationPrivacy-Preserving Federated Learning Using Homomorphic Encryption
Park, J., & Lim, H. (2022) · Applied Sciences · doi:10.3390/app12020734 · Cited by 223
Achieving Searchable and Privacy-Preserving Data Sharing for Cloud-Assisted E-Healthcare System
Xu, C., Wang, N., Zhu, L., Sharif, K., & Zhang, C. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2917186 · Cited by 105
A privacy-preserving sensory data sharing scheme in Internet of Vehicles
Kong, Q., Lu, R., Ma, M., & Bao, H. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2017.12.003 · Cited by 85
Metadata
- Authors
- Liu, X., Deng, R. H., Choo, K.-K. R., & Weng, J.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2016-11
- Volume
- 11
- Issue
- 11
- Pages
- 2401-2414
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2405356014
- Cited by
- 264
- References
- 49
- FWCI
- 27.39
- 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.