Book ChapterDOI
Publicly Verifiable 1-norm and 2-norm Operations over Outsourced Data Stream Under Single-Key Setting
Yudong Liu,Xu An Wang,Arun Kumar Sangaiah,Heshuai Shao +3 more
- pp 462-469
TLDR
This paper proposes two publicly verifiable schemes for 1-norm and 2-norm operations respectively, any client can publicly verify these two common norm operations under single-key setting by using these schemes.Abstract:
With the advent of the big data era, the amount of data computation is getting larger and larger, and the computational load of clients is also increasing day by day. The advent of clouds allows clients to outsource their data to the cloud for computing services. Outsourced computation has greatly reduced the computational burden of clients, but also brings the issue of trust. Because the cloud is not trustworthy, clients need to verify the correctness of the remote computation results. In this paper, we mainly study the common norm operations, and propose two publicly verifiable schemes for 1-norm and 2-norm operations respectively, any client can publicly verify these two common norm operations under single-key setting by using our schemes.read more
Citations
More filters
Journal ArticleDOI
Privacy-Preserving and Publicly Verifiable Protocol for Outsourcing Polynomials Evaluation to a Malicious Cloud
TL;DR: As cloudcomputing providesﻷ affordability and scalableﻰ�computationalﻴ resources, the may not be able to be trusted, the should should be guaranteed.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Book ChapterDOI
Identity-Based Encryption from the Weil Pairing
Dan Boneh,Matthew K. Franklin +1 more
TL;DR: This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem.
Book ChapterDOI
Non-interactive verifiable computing: outsourcing computation to untrusted workers
TL;DR: Verifiable computation as mentioned in this paper allows a computationally weak client to outsource the computation of a function F on various dynamically-chosen inputs x 1,...,xk to one or more workers.
Journal ArticleDOI
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud
TL;DR: This paper proposes a secure multi-owner data sharing scheme, named Mona, for dynamic groups in the cloud, leveraging group signature and dynamic broadcast encryption techniques, so that any cloud user can anonymously share data with others.
Proceedings ArticleDOI
Practical verified computation with streaming interactive proofs
TL;DR: In this paper, the authors present a verifiable computation prover that runs in O(S(n) log S(n)), where S is the size of an arithmetic circuit computing the function of interest; this compares favorably to the poly(S n) runtime for the prover promised in [19].