On “Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs” from IEEE IoT journal

dc.contributor.authorRamalingam, J.
dc.date.accessioned2026-02-05T09:26:38Z
dc.date.issued2021
dc.description.abstractSecure outsourced computation enables IoT devices to offload resource-intensive computations to a more resourceful server while keeping the inputs secret to the server. Recently, Zhang et al. put forth two outsourcing algorithms for solving quadratic congruences (Zhang et al., 2020). We observe that both the algorithms do not achieve the claimed security guarantees: a polynomial-time attack reveals the secret inputs to a passive adversary. As a consequence of the insecure outsourcing, the factorization of the RSA modulus is also revealed and hence leads to the total compromise of the security of the underlying scheme which makes use of the Zhang et al. outsourcing algorithms for solving quadratic congruences. Interestingly, we propose corrective measures for the Zhang et al. algorithm and prove that the resulting algorithm enables secure and verifiable delegation of solving quadratic congruences in IoTs. © 2021 Elsevier B.V.
dc.identifier.citationDiscrete Applied Mathematics, 2021, 302, , pp. 139-146
dc.identifier.issn0166218X
dc.identifier.urihttps://doi.org/10.1016/j.dam.2021.06.013
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/23024
dc.publisherElsevier B.V.
dc.subjectCryptography
dc.subjectOutsourcing
dc.subjectPolynomial approximation
dc.subjectAlgorithm for solving
dc.subjectCloud/edge computing
dc.subjectCorrective measures
dc.subjectPassive adversary
dc.subjectPolynomial-time attacks
dc.subjectQuadratic congruences
dc.subjectRabin cryptosystem
dc.subjectRSA moduli
dc.subjectSecure outsourcing
dc.subjectServer-aided computation
dc.subjectInternet of things
dc.titleOn “Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs” from IEEE IoT journal

Files

Collections