The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Private and Cheating-Free Outsourcing of Algebraic Computations
Abstract
We give protocols for the secure and private outsourcing of linear algebra computations, that enable a client to securely outsource expensive algebraic computations (like the multiplication of huge matrices) to two remote servers, such that the servers learn nothing about the customer's private input or the result of the computation,and any attempted corruption of the answer by the servers is detected with high probability. The computational work done locally by the client is linear in the size of its input and does not require the client to carry out locally any expensive encryptions of such input.The computational burden on the servers is proportional to the time complexity of the current practically used algorithms for solving the algebraic problem (e.g., proportional to n3for multiplying two ntimesn matrices). If the servers were to collude against the client,then they would only find out the client's private inputs, but they would not be able to corrupt the answer without detection by the client.
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
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
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Cited by
Secure attribute-based data sharing for resource-limited users in cloud computing
Li, J., Zhang, Y., Chen, X., & Xiang, Y. (2018) · Computers & Security · doi:10.1016/j.cose.2017.08.007 · Cited by 461
Securely Outsourcing Attribute-Based Encryption with Checkability
Li, J., Huang, X., Li, J., Chen, X., & Xiang, Y. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.271 · Cited by 429
Identity-Based Encryption with Outsourced Revocation in Cloud Computing
Li, J., Li, J., Chen, X., Jia, C., & Lou, W. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2013.208 · Cited by 377
Secure and practical outsourcing of linear programming in cloud computing
Wang, C., Ren, K., & Wang, J. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5935305 · Cited by 312
New Algorithms for Secure Outsourcing of Modular Exponentiations
Chen, X., Li, J., Ma, J., Tang, Q., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.180 · Cited by 307
Metadata
- Authors
- Benjamin, D., & Atallah, M. J.
- Venue
- 2008 Sixth Annual Conference on Privacy, Security and Trust
- Publisher
- IEEE
- Published
- 2008-10
- Pages
- 240-245
- OpenAlex
- W2170444562
- Cited by
- 176
- References
- 3
- FWCI
- 1.24
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Private and Cheating-Free Outsourcing of Algebraic Computations. https://app.cochat.ai/papers/10.1109/pst.2008.12
- The paper
- Benjamin, D., & Atallah, M. J. (2008). Private and Cheating-Free Outsourcing of Algebraic Computations. 2008 Sixth Annual Conference on Privacy, Security and Trust. https://doi.org/10.1109/pst.2008.12
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.