ENCRYPTED QUERY RESULT THROUGH MAC ADDRESS IN CLOUD
Now we are living in IT era and now everyone using IT . User host his data in remote, there remain open questions about server. This information is in encrypting form. But user perform search query for retrieve operation, kind of query operations can be performed on the encrypted data. Result appears in client machine. Client machine may be in LAN or in network. So user in same network can access information of computer from same network. In this paper, we focus on how can make safe information of computer from same network computer. When user put query to remote machine it work on IP machine. Most of the user used share IP means one IP have several machine. So in this case we can’t analysis unique address of computer, So other computer in same network can access data. Every computer has unique MAC address. With the combination of IP and MAC address we can find unique address of computer. In this paper we will work on MAC address and will encrypt data with the help of MAC address. When data come on correct MAC address then can only readable
R. Chow, P. Golle, M. Jakobsson, E. Shi, J. Staddon, R. Masuoka, and J. Molina, “Controlling data in the cloud: outsourcing computation without outsourcing control,” in CCSW. ACM, 2009, pp. 85–90.
M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “A view of cloud computing,” Communications of the ACM, vol. 53, pp. 50–58, April 2010.
B. Schoenmakers and P. Tuyls, “Efficient binary conversion for paillier encrypted values,” in Proceedings of the 24th annual international con-ference on The Theory and Applications of Cryptographic Techniques, ser. EUROCRYPT’06. Springer-Verlag, 2006, pp. 522–537.
Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, “Fuzzy extractors: How to generate strong keys from biometrics and other noisy data,” SIAM Journal of Computing, vol. 38, no. 1, pp. 97–139, Mar. 2008.
M. Murugesan, W. Jiang, C. Clifton, L. Si, and J. Vaidya, “Efficient privacy-preserving similar document detection,” The VLDB Journal, vol. 19, no. 4, pp. 457–475, Aug. 2010.
W. Jiang and B. K. Samanthula, “N-gram based secure similar document detection,” in Proceedings of the 25th annual IFIP WG 11.3 confer-ence on Data and applications security and privacy, ser. DBSec’11. Springer-Verlag, 2011, pp. 239–246.
P. Paillier, “Public key cryptosystems based on composite degree resid-uosity classes,” in Eurocrypt. Springer-Verlag, 1999, pp. 223–238.
A. C. Yao, “Protocols for secure computations,” in SFCS. IEEE Computer Society, 1982, pp. 160–164.
A. C. Yao, “How to generate and exchange secrets,” in SFCS. IEEE Computer Society, 1986, pp. 162–167.
O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game,” in proceedings of the 19th annual ACM symposium on Theory of Computing, 1987, pp. 218–229.
O. Goldreich, The Foundations of Cryptography. Cambridge University Press, 2004, vol. 2, ch. General Cryptographic Protocols.
R. Canetti, “Universally composable security: a new paradigm for cryptographic protocols,” in Proceedings of 42nd IEEE Symposium on Foundations of Computer Science (FOCS), oct. 2001, pp. 136 – 145.
D. Bogdanov, R. Jagomagis,¨ and S. Laur, “A universal toolkit for cryptographically secure privacy-preserving data mining,” in PAISI ’12. Springer-Verlag, 2012, pp. 112–126.
A. Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612–613, nov 1979.
J. Bar-Ilan and D. Beaver, “Non-cryptographic fault-tolerant computing in constant number of rounds of interaction,” in Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, ser. PODC ’89. ACM, 1989, pp. 201–209. [Online]. Available: http://doi.acm.org/10.1145/72981.72995
R. Cramer, I. Damgard,˚ and J. B. Nielsen, “Multiparty computation from threshold homomorphic encryption,” in EUROCRYPT. Springer-Verlag, 2001, pp. 280–299.
- There are currently no refbacks.