Publicly Auditable Inner Product Evaluation from Different Data Sources under On-time generated Multiple Keys
Suganya.S 1
*,
D.Sharmila
- 1Anna University Chennai, III MCA, Lord Jegannath College of Engineering & Technology, US
Uploading data streams to a resource-rich Moreover, the experimental result also shows cloud server for inner product estimation, an necessary building block in many popular stream applications (e.g., statistical monitoring), is appealing to many companies and individuals. On the other hand, verifying the result of the remote computation plays a crucial role in addressing the issue of trust. My project is meeting point on the multi-key scenario where data streams are uploaded by multiple data sources with distinct keys. We first present a novel homomorphism verifiable tag technique to publicly verify the outsourced inner product computation on the dynamic data streams, and then extend it to support the verification of matrix product computation.
Conclusion
In this paper, launch a novel homomorphism verifiable tag technique, and drawing an efficient and publicly provable inner product calculation scheme on the dynamic outsourced data streams under multiple keys. I am also extended the inner product scheme to support matrix product. Compared with the existing works under the single-key setting, our scheme aims at the more demanding multi-key scenario, i.e., it allows several data sources with dissimilar secret keys to upload their nonstop data streams and entrust the same computation to a third party server, while the traceability can still be offer on demand.
Furthermore, any keyless client is able to widely verify the validity of the return calculation result. Protection study shows that our scheme is verifiable secure under the CDH assumption in the arbitrary oracle model. Experimental results display that our protocol is practically well-organized in terms of both communication and calculation cost.
References
- C. Gentry. Fully homomorphic encryption using ideal lattices. In M. Mitzenmacher, editor, 41stACM STOC, pages 169{178. ACM Press, May / June 2009.
- D. Boneh and D. M. Freeman. Homomorphic signatures for polynomial functions. In K. G. Paterson, editor, EUROCRYPT 2011, volume 6632 of LNCS, pages 149{168. Springer, May 2011.
- D. Catalano and D. Fiore, “Practical homomorphic macs for arithmetic circuits,” in Advances in Cryptology–EUROCRYPT. Springer, 2013, pp. 336–352.
- R. Gennaro and D. Wichs, “Fully homomorphic message authenticators,” in Advances in Cryptology-ASIACRYPT. Springer, 2013, pp. 301–320.
- M. Bakes, D. Fiore, and R. M. Reischuk, “Verifiable delegation of computation on outsourced data,” in ACM conference on Computer and communications security. ACM, 2013, pp. 863–874.
- D. Boneh and D. M. Freeman, “Homomorphic signatures for polynomial functions,” in Advances in Cryptology–EUROCRYPT. Springer, 2011, pp. 149–168.
- S. G. Choi, J. Katz, R. Kumaresan, and C. Cid, “Multi-client non-interactive verifiable computation,” in Theory of Cryptography. Springer, 2013, pp. 499–518.
- S. D. Gordon, J. Katz, F.-H. Liu, E. Shi, and H.-S. Zhou, “Multi-client verifiable computation with stronger security guarantees,” in Theory of Cryptography. Springer, 2015, pp. 144–168.
- C. Gentry and S. Halevi, “Implementing gentry’s fully homomorphic encryption scheme,” in Advances in Cryptology–EUROCRYPT. Springer, 2011, pp. 129–148.
- A. De Caro and V. Iovino, “jpbc: Java pairing based cryptography,” in IEEE Symposium on Computers and Communications. IEEE, 2011, pp. 850–855.
Keywords: Communication, novel homomorphism, product calculation scheme
Citation: Suganya.S *, Suganya.S ( 2017), Publicly Auditable Inner Product Evaluation from Different Data Sources under On-time generated Multiple Keys. , 5(2): 1-4
Received: 09/06/2024; Accepted: 09/06/2024;
Published: 09/06/2024
Edited by:
Mr.ERES JOURNALS