hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1002593

Protecting User Privacy for Cloud Computing by Bivariate Polynomial Based Secret Sharing

Ching-Nung Yang ; Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan
Jia-Bin Lai ; Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan
Zhangjie Fu ; School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing, China

Puni tekst: engleski, pdf (1 MB) str. 341-355 preuzimanja: 407* citiraj
APA 6th Edition
Yang, C., Lai, J. i Fu, Z. (2015). Protecting User Privacy for Cloud Computing by Bivariate Polynomial Based Secret Sharing. Journal of computing and information technology, 23 (4), 341-355. https://doi.org/10.2498/cit.1002593
MLA 8th Edition
Yang, Ching-Nung, et al. "Protecting User Privacy for Cloud Computing by Bivariate Polynomial Based Secret Sharing." Journal of computing and information technology, vol. 23, br. 4, 2015, str. 341-355. https://doi.org/10.2498/cit.1002593. Citirano 04.03.2021.
Chicago 17th Edition
Yang, Ching-Nung, Jia-Bin Lai i Zhangjie Fu. "Protecting User Privacy for Cloud Computing by Bivariate Polynomial Based Secret Sharing." Journal of computing and information technology 23, br. 4 (2015): 341-355. https://doi.org/10.2498/cit.1002593
Harvard
Yang, C., Lai, J., i Fu, Z. (2015). 'Protecting User Privacy for Cloud Computing by Bivariate Polynomial Based Secret Sharing', Journal of computing and information technology, 23(4), str. 341-355. https://doi.org/10.2498/cit.1002593
Vancouver
Yang C, Lai J, Fu Z. Protecting User Privacy for Cloud Computing by Bivariate Polynomial Based Secret Sharing. Journal of computing and information technology [Internet]. 2015 [pristupljeno 04.03.2021.];23(4):341-355. https://doi.org/10.2498/cit.1002593
IEEE
C. Yang, J. Lai i Z. Fu, "Protecting User Privacy for Cloud Computing by Bivariate Polynomial Based Secret Sharing", Journal of computing and information technology, vol.23, br. 4, str. 341-355, 2015. [Online]. https://doi.org/10.2498/cit.1002593

Sažetak
Cloud computing is an Internet-based computing. In cloud computing, the service is fully served by the provider. Users need nothing but personal devices and Internet access. Computing services, such as data, storage, software, computing, and application, can be delivered to local devices through Internet. The major security issue of cloud computing is that cloud providers must ensure that their infrastructure is secure, and prevent illegal data accesses from outsiders, other clients, or even the unauthorized cloud employees. In this paper, we deal with key agreement and authentication for cloud computing. By using Elliptic Curve Diffie Hellman (ECDH) and symmetric bivariate polynomial based secret sharing, we design a secure cloud computing (SCC). Two types of SCC are proposed. One requires a trusted third party (TTP), and the other does not need a TTP. Additionally, via the homomorphism property of polynomial based secret sharing, our SCC can be extended to multi-server SCC (MSCC) to fit an environment where a multi-server system contains multiple servers to collaborate for serving applications.

Ključne riječi
cloud computing; authentication; secret sharing; key agreement; symmetric bivariate polynomial; homomorphism

Hrčak ID: 149739

URI
https://hrcak.srce.hr/149739

Posjeta: 596 *