EFFICIENT AND STRONG MUTUAL AUTHENTICATION SCHEME USING CSTA FOR SECURE DATA TRANSMISSION
Author’s Name : Brinta Babu | T B Dharmaraj
Volume 01 Issue 02 Year 2014 ISSN No: 2349-3828 Page no: 15-20
Among all type of computations, the polynomial function evaluation is a fundamental, yet an important one due to its wide usage in engineering and scientific problems. In this paper, we investigate publicly verifiable outsourced computation for polynomial evaluation with the support of multiple data sources. Our proposed scheme is universally applicable to all types of polynomial computation and allows the clients to outsource new data at any time. While the existing solutions only support the verification of polynomial evaluation over a single data source, i.e, all the inputs of the polynomial function are outsourced and signed by a single entity, our solutions support polynomial evaluations over multiple different data sources, which are more common and have wider applications.,e.g., to assess the city air pollution one needs to evaluate the environmental data uploaded from the multiple environmental monitoring centers. The security issue has become an important concern of networks. To prevent the grid resources from being illegally visited, the strong mutual authentication is needed for both user and the server. In recent periods, many password based user authentication schemes are proposed for solving authentication issues. However, most of them are not ideal for networking, since they do not provide the strong mutual authentication. It is proposed to introduce an efficient user Cyclic Shift Transposition Algorithm(CSTA) scheme and model for secure routing mechanism of sharing messages between the source and the destinations in networking by adding information about sender and preserves the message content, which prevents not only known attack but also maintains the integrity of data
Polynomial Verification, Authentication, Secured Outsourcing
- M. Backes, D. Fiore, and R. M. Reischuk, “Veriable delegation of computation on outsourced data,” in Proc. of CCS’13. ACM, 2013, pp. 863–874.
- M. Naor and K. Nissim, “Certificate revocation and certificate update,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 4, pp. 561–570, 2000.
- M. T. Goodrich, R. Tamassia, N. Triandopoulos, and R. Cohen, “Authenticated data structures for graph and geometric searching,” in Proc. of RSA Conference on the Cryptographers’ Track. Springer, 2003, pp. 295–313.
- C. Martel, G. Nuckolls, P. Devanbu, M. Gertz, A. Kwong, and S.G. Stubblebine, “A general model for authenticated data structures,” Algorithmica, vol. 39, no. 1, pp. 2004.
- G. D. Battista and B. Palazzi, “Authenticated relational tables and authenticated skip lists,” in Proc. of DBSec. Springer, 2007, pp. 31–46.
- C. Papamanthou and R. Tamassia, “Time and space efficient algorithm for two-party authenticated data structures,” in Proc. of ICICS. Springer, 2007, pp. 1–15.
- C. Papamanthou, R. Tamassia, and N. Triandopoulos, “Optimal verification of operatios on dynamic sets,” in Proc. of CRYPTO. Springer, 2011, pp. 91–110.
- R. Gennaro, C. Gentry, and B. Parno, “Non-interactive verifiable computing: Outsourcing computation to untrusted workers,” in Proc. Of CRYPTO. Springer, 2010, pp. 465–482.
- B. Parno, M. Raykova, and V. Vaikuntanathan, “How to delegate and verify in public: Verifiable computation from attribute-based encryption,” in Proc. of TCC. Springer, 2012, pp. 422–439.