We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Reseach Article

A Review Report on Time Domain-Attribute-based Access Control for Video substance distribution: A Cryptographic Approach

by Kumar Gaurav, Sanjeev Gupta
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 3
Year of Publication: 2017
Authors: Kumar Gaurav, Sanjeev Gupta
10.5120/ijca2017915857

Kumar Gaurav, Sanjeev Gupta . A Review Report on Time Domain-Attribute-based Access Control for Video substance distribution: A Cryptographic Approach. International Journal of Computer Applications. 179, 3 ( Dec 2017), 9-13. DOI=10.5120/ijca2017915857

@article{ 10.5120/ijca2017915857,
author = { Kumar Gaurav, Sanjeev Gupta },
title = { A Review Report on Time Domain-Attribute-based Access Control for Video substance distribution: A Cryptographic Approach },
journal = { International Journal of Computer Applications },
issue_date = { Dec 2017 },
volume = { 179 },
number = { 3 },
month = { Dec },
year = { 2017 },
issn = { 0975-8887 },
pages = { 9-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number3/28715-2017915857/ },
doi = { 10.5120/ijca2017915857 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:54:19.511314+05:30
%A Kumar Gaurav
%A Sanjeev Gupta
%T A Review Report on Time Domain-Attribute-based Access Control for Video substance distribution: A Cryptographic Approach
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 3
%P 9-13
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Visual cryptography encodes a secret binary image (SI) keen on share of unsystematic binary sample. If the share is xeroxed against transparencies, the key figure is often visually decrypted by means that of superimposing a skilled subset of transparencies, however no secret data is obtained from the superposition of a forbidden subset. The binary model of the N allocates, although, contain no visual consequence and hinder the objectives of visual cryptography. The perfect security condition of VC scheme needs the strict demand where any t-1 or fewer transparencies cannot extract much knowledge regarding the key. The secret image is at the same time embedded into color halftone shares. Visual cryptography (VC) could be a secret sharing method of decay a secret picture into n transparencies, and consequently the stack of any t out of n transparencies disclose the key content. A HVC generate procedure is projected that can make an option for secret halftone image into color half-tone shares. In [1], authors centre of attention how to securely distribute video contents to an assured collection of persons for the period of a testing time period in cloud-based multimedia systems, and propose a cryptographic come within reach of, a provably secure time domain attribute-based access control (TAAC) scheme, to secure the cloud-based video content sharing.

References
  1. Y. Kan, et al. “Time-domain attribute-based access control for cloud-based video content sharing: A cryptographic approach” IEEE Trans. on Multi. 18.5 (2016): 940-950.
  2. P. Vilma, et al. “Dynamic visual cryptography for optical assessment of chaotic oscillations” Opt. & Laser Tech. 57 (2014): 129-135.
  3. Bahrami, Zhila, and Fardin Akhlaghian Tab. “A new robust video watermarking algorithm based on SURF features and block classification” Mult. Tools and App. (2016): 1-19.
  4. P. Paulius, and M.Ragulskis. “Image communication scheme based on dynamic visual cryptography and computer generated holography” Opt. Comm. 335 (2015): 161-167.
  5. Pandey, Anjney, and Subhranil Som. “Applications and usage of visual cryptography: A review” Reliability, Infocom Technologies and Optimization (Trends and Future Directions)(ICRITO), 2016 5th International Conference on. IEEE, 2016.
  6. Yuan, Lifeng, et al. “Secret Image Sharing Scheme with Threshold Changeable Capability” Mathematical Problems in Engineering 2016 (2016).
  7. Ma, Zhaofeng, et al. “A Novel Image Digital Rights Management Scheme with High-Level Security, Usage Control and Traceability” Chinese Journal of Electronics 25.3 (2016): 481-494.
  8. Chai, Xiuli, Kang Yang, and Zhihua Gan. “A new chaos-based image encryption algorithm with dynamic key selection mechanisms” Multimedia Tools and Applications (2016): 1-21.
  9. Hofmeister T., Krause M., and Simon H. U. “Contrast-optimal out of secret sharing schemes in visual cryptography” Comput. Sci., vol. 240, no. 2, pp. 471–485, Jun. 2000.
  10. P. A. Eisen and D. R. Stinson “Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels” Designs Cryptography, vol. 25, no. 1, pp. 15–61, 2002.
  11. M. Nakajima and Y. Yamaguchi, “Extended visual cryptography for natural images” WSCG J., vol. 10, no. 2, pp. 303–310, 2002.
  12. H. Koga “A general formula of the -threshold visual secret sharing scheme” in Proc. Int. Theory and Application of Cryptology and Information Security: Advances in Cryptology, Dec. 2002, pp. 328–345.
  13. S. Cimato, R. De Prisco, and A. De Santis, “Probabilistic visual cryptography schemes” Computer J., vol. 49, no. 1, pp. 97–107, Jan. 2006.
  14. G. B. Horng, T. G. Chen, and D. S. Tsai, “Cheating in visual cryptography” Designs, Codes, Cryptography, vol. 38, no. 2, pp. 219–236, Feb. 2006.
  15. N. Macon and A. Spitzbart, “Inverses of Vandermonde matrices” Amer. Math. Monthly, vol. 65, no. 2, pp. 95–100, Feb. 1958.
  16. O. Kafri and E. Kerens, “Encryption of pictures and shapes by random grids” Letter of , vol. 12, no. 6, pp. 377–379, Jun. 1987.
  17. M. Naor and Shamir A. “Visual cryptography” in Advances Proc. in Cryptography 1995, vol. 950, LNCS, pp. 1–12.
  18. Ateniese G. Blundo C. A. De Santis, and D. R. Stinson, “Visual cryptography for general access structures” Inf. Computat., vol. 129, no. 2, pp. 86–106, Sep. 1996.
  19. E. R. Verheul and H. C. A. Van Tilborg, “Constructions and properties of out of visual secret sharing schemes” Designs Cryptography, vol. 11, no. 2, pp. 179–196, May 1997.
  20. C.C. Wu, L.H. Chen, “A Study on Visual Cryptography” National Chiao Tung University, Taiwan, R.O.C., 1998.
  21. C. Blundo, A. De Santis, and D. R. Stinson, “On the contrast in visual cryptography schemes” J. Cryptology, vol. 12, no. 4, pp. 261–289, 1999.
  22. R. Ito, H. Kuwakado, and H. Tanaka, “Image size invariant visual cryptography” IEICE Trans. Fundam. Electron. Commun. & Comput. Sci., vol. 82, pp. 2172–2177, Oct. 1999.
  23. Weir, Jonathan, and WeiQi Yan. "Sharing multiple secrets using visual cryptography." Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on. IEEE, 2009.
  24. Lee, Kai-Hui, and Pei-Ling Chiu. "An extended visual cryptography algorithm for general access structures." ieee transactions on information forensics and security 7.1 (2012): 219-229.
  25. Yan, Xuehu, et al. "Halftone visual cryptography with minimum auxiliary black pixels and uniform image quality." Digital Signal Processing 38 (2015): 53-65.
Index Terms

Computer Science
Information Sciences

Keywords

Cloud computing multimedia time-domain TAAC (time-domain attribute-based access control) content video sharing.