Abstract
With the development of smart devices like smart phones or tablets, etc., the challenging point for these devices is risen in the security problems required limited computational capacity, which attracts researchers in both academia and industrial societies. In this paper, we tackle two interesting security problems: changing a shared key between two users and privacy-preserving auditing for cloud storage. Our solution is a linear computational and one way method based on pseudoinverse matrix, a generalization concept of inverse matrix. In addition, this can be applied for devices with limited computational capacity due to its fast computation. Indeed, we conduct two experiments to show its efficiency in computation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
\(\alpha ,\beta ,\gamma ,\delta\) always exist due to the Lagrange’s Four Square Theorem.
References
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Khan, O., Kissner, L., et al. (2011). Remote data checking using provable data possession. ACM Transactions on Information and System Security (TISSEC), 14(1), 12.
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007). Provable data possession at untrusted stores. In Proceedings of the 14th ACM conference on computer and communications security (pp. 598–609). ACM.
Ben-Israel, A., & Greville, T. N. (2003). Generalized inverses. New York: Springer.
Juels, A., & Kaliski Jr. B. S. (2007). Pors: Proofs of retrievability for large files. In Proceedings of the 14th ACM conference on Computer and communications security (pp. 584–597). ACM.
Massey, J. L. (1998). Orthogonal, antiorthogonal and self-orthogonal matrices and their codes. Communications and Coding, 2, 3.
Naor, M., & Rothblum, G. N. (2005). The complexity of online memory checking. In 46th annual IEEE symposium on foundations of computer science, 2005 (FOCS 2005) (pp. 573–582). IEEE.
Nguyen, T. D., & Dang, V. H. (2013). Quasi-inverse based cryptography. In Computational science and its applications—ICCSA 2013 (pp. 629–642). Springer.
Penrose, R. (1995). A generalized inverse for matrices. In Proceedings of the Cambridge Philosophy Society (Vol. 51, pp. 406–413). Cambridge University Press.
Shacham, H., & Waters, B. (2008). Compact proofs of retrievability. In Advances in cryptology—ASIACRYPT 2008 (pp. 90–107). Springer.
Van, D. H., & Thuc, N. D. (2015). Pseudoinverse matrix over finite field and its applications. In K. J. Kim (Ed.), Information science and applications (pp. 491–498). Berlin: Springer.
Wang, C., Chow, S. S., Wang, Q., Ren, K., & Lou, W. (2013). Privacy-preserving public auditing for secure cloud storage. IEEE Transactions on Computers, 62(2), 362–375.
Wang, C., Wang, Q., Ren, K., & Lou, W. (2010). Privacy-preserving public auditing for data storage security in cloud computing. In INFOCOM, 2010 proceedings IEEE (pp. 1–9). IEEE.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dang, V.H., Nguyen, T.D. Construction of Pseudoinverse Matrix Over Finite Field and Its Applications. Wireless Pers Commun 94, 455–466 (2017). https://doi.org/10.1007/s11277-015-3095-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-015-3095-6