How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
type: Item
instance of: scholarly article
title: How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
zbMATH Open document ID: 1456.68016
author: Qiang Zhou
author: Chengliang Tian
author: Hanlin Zhang
author: Jia Yu
author: Fengjun Li
published in: Information Sciences
publication date: 2021-03-18T00:00:00Z
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 11A05
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 68M25
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7325067
zbMATH Keywords: cloud computing
zbMATH Keywords: computation outsourcing
zbMATH Keywords: unimodular matrix transformation
zbMATH Keywords: extended Euclidean algorithm
zbMATH Keywords: large-scale polynomials
describes a project that uses: NTRU
MaRDI profile type: Publication
full work available at URL: j.ins.2019.10.007
OpenAlex ID: W2980257992
cites work: Q4091421
cites work: Q3605192
cites work: The Probability of Relatively Prime Polynomials
cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
cites work: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
cites work: Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
cites work: Secure outsourcing of modular exponentiations under single untrusted programme model
cites work: Sanitization of FHE Ciphertexts
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
cites work: Fully homomorphic encryption using ideal lattices
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
cites work: Choosing Parameters for NTRUEncrypt
cites work: Q3840170
cites work: Theory of Cryptography
cites work: Q4398780
cites work: Q5668937
cites work: Speeding up exponentiation using an untrusted computational resource
cites work: Factoring polynomials over finite fields: A survey
cites work: Secure Optimization Computation Outsourcing in Cloud Computing: A Case Study of Linear Programming
Wikidata QID: Q127113133
DOI: 10.1016/J.INS.2019.10.007
description: scientific article; zbMATH DE number 7325067