Journal ArticleDOI
New Algorithms for Secure Outsourcing of Large-Scale Systems of Linear Equations
Reads0
Chats0
TLDR
This paper utilizes the sparse matrix to propose a new secure outsourcing algorithm of large-scale linear equations in the fully malicious model and shows that the proposed algorithm is superior in both efficiency and checkability.Abstract:
With the rapid development in availability of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attentions in the scientific community. In this paper, we investigate secure outsourcing for large-scale systems of linear equations, which are the most popular problems in various engineering disciplines. For the first time, we utilize the sparse matrix to propose a new secure outsourcing algorithm of large-scale linear equations in the fully malicious model. Compared with the state-of-the-art algorithm, the proposed algorithm only requires ( optimal ) one round communication (while the algorithm requires $L$ rounds of interactions between the client and cloud server, where $L$ denotes the number of iteration in iterative methods). Furthermore, the client in our algorithm can detect the misbehavior of cloud server with the ( optimal ) probability 1. Therefore, our proposed algorithm is superior in both efficiency and checkability. We also provide the experimental evaluation that demonstrates the efficiency and effectiveness of our algorithm.read more
Citations
More filters
Book ChapterDOI
The knowledge complexity of interactive proof-systems
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage.
Journal ArticleDOI
Cloud-aided lightweight certificateless authentication protocol with anonymity for wireless body area networks
TL;DR: This paper proposes a cloud-aided lightweight certificateless authentication protocol with anonymity for wireless body area networks that can provide stronger security protection of private information than most of existing schemes in insecure channel.
Journal ArticleDOI
Secure Multi-Party Computation: Theory, practice and applications
TL;DR: This paper presents a comprehensive survey on the theoretical and practical aspects of SMPC protocols, including its security requirements and basic construction techniques, and summarizes the concrete application-oriented protocols that are currently available.
Journal ArticleDOI
Enabling Efficient and Geometric Range Query With Access Control Over Encrypted Spatial Data
TL;DR: This paper proposes an efficient and geometric range query scheme (EGRQ) supporting searching and data access control over encrypted spatial data, and employs secure KNN computation, polynomial fitting technique, and order-preserving encryption to achieve secure, efficient, and accurate geometricrange query over cloud data.
Journal ArticleDOI
An Efficient and Provably Secure Authenticated Key Agreement Protocol for Fog-Based Vehicular Ad-Hoc Networks
TL;DR: A new authenticated key agreement protocol without bilinear pairing is designed that achieves mutual authentication, generates a securely agreed session key for secret communication, and supports privacy protection in fog-based VANETs.
References
More filters
Book
Matrix Analysis
Roger A. Horn,Charles R. Johnson +1 more
TL;DR: In this article, the authors present results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrate their importance in a variety of applications, such as linear algebra and matrix theory.
Book
Iterative Methods for Sparse Linear Systems
TL;DR: This chapter discusses methods related to the normal equations of linear algebra, and some of the techniques used in this chapter were derived from previous chapters of this book.
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Journal ArticleDOI
The knowledge complexity of interactive proof systems
TL;DR: A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.