The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
New Algorithms for Secure Outsourcing of Modular Exponentiations
Open accessAbstract
With the rapid development of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attention in the scientific community. Exponentiations modulo a large prime have been considered the most expensive operations in discrete-logarithm-based cryptographic protocols, and they may be burdensome for the resource-limited devices such as RFID tags or smartcards. Therefore, it is important to present an efficient method to securely outsource such operations to (untrusted) cloud servers. In this paper, we propose a new secure outsourcing algorithm for (variable-exponent, variable-base) exponentiation modulo a prime in the two untrusted program model. Compared with the state-of-the-art algorithm, the proposed algorithm is superior in both efficiency and checkability. Based on this algorithm, we show how to achieve outsource-secure Cramer-Shoup encryptions and Schnorr signatures. We then propose the first efficient outsource-secure algorithm for simultaneous modular exponentiations. Finally, we provide the experimental evaluation that demonstrates the efficiency and effectiveness of the proposed outsourcing algorithms and schemes.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Wallet Databases with Observers
Chaum, D., & Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_7 · Cited by 1,292
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,145
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Security Challenges for the Public Cloud
Ren, K., Wang, C., & Wang, Q. (2012) · IEEE Internet Computing · doi:10.1109/mic.2012.14 · Cited by 845
Self-testing/correcting with applications to numerical problems
Blum, M., Luby, M., & Rubinfeld, R. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90044-w · Cited by 712
Cited by
Verifiable Computation over Large Database with Incremental Updates
Chen, X., Li, J., Weng, J., Ma, J., & Lou, W. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2512870 · Cited by 257
Self-citationAnonymous and Traceable Group Data Sharing in Cloud Computing
Shen, J., Zhou, T., Chen, X., Li, J., & Susilo, W. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2774439 · Cited by 253
Self-citationBlockchain based Efficient and Robust Fair Payment for Outsourcing Services in Cloud Computing
Zhang, Y., Deng, R. H., Liu, X., & Zheng, D. (2018) · Information Sciences · doi:10.1016/j.ins.2018.06.018 · Cited by 228
Zhang, H., Yu, J., Tian, C., Zhao, P., Xu, G., & Lin, J. (2018) · IEEE Access · doi:10.1109/access.2018.2857205 · Cited by 45
Metadata
- Authors
- Chen, X., Li, J., Ma, J., Tang, Q., & Lou, W.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2014-09
- Volume
- 25
- Issue
- 9
- Pages
- 2386-2396
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2114486350
- Cited by
- 307
- References
- 49
- FWCI
- 22.82
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: New Algorithms for Secure Outsourcing of Modular Exponentiations. https://app.cochat.ai/papers/10.1109/tpds.2013.180
- The paper
- Chen, X., Li, J., Ma, J., Tang, Q., & Lou, W. (2014). New Algorithms for Secure Outsourcing of Modular Exponentiations. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2013.180
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.