Model secret sharing schemes in systems transmit video
D.A. Sagaydak, R.T. Faizullin

PDF, 640 kB

DOI: 10.18287/0134-2452-2013-37-1-105-112 .

Full text of article: Russian language.

Pages: 105-112.

Abstract:
This paper proposes two embodiments secret sharing schemes on non-equal shares with essentially a small part of the secret to securely storage and processing of video data centers, which are based on RGB-representation (abbreviation round English words Red, Blue, Green - Red , green, blue) of each video frame. For each of the proposed scheme is made software implementation in the programming environment Borland C + + Builder 6.

Key words:
data processing center (DPC), secret sharing, video sharing, representation in RGB, frame, delta code Elias, pixel representation of the image, prefix, distrust of the data center, the mafia attack.

Citation:
Sagaydak DA, Faizullin RT. Model secret sharing schemes in systems transmit video. Computer Optics 2013; 37(1):105-112. DOI: 10.18287/0134-2452-2013-37-1-105-112.

References:

  1. RFC-2205, -2209, -2210, -1990, -1889,-3550, -3551, -3989, -3952; «RTP: A Transport Protocol for Real-Time Applications», H. Schulzrinne, S. Casner, R. Frederick, V. Jacobson. URL: http://tools.ietf.org/html/rfc3550
  2. RFC 2326 «Real Time Streaming Protocol (RTSP)» H. Schulzrinne, A. Rao, R. Lanphier. URL: http://www.ietf.org/rfc/rfc2326.txt
  3. RFC 3261 «SIP: Session Initiation Protocol». J. Rosenberg, H. Schulzrinne, G. Camarillo, A. Johnston, J. Peterson, R. Sparks, M. Handley, E. Schooler. URL: http://www.ietf.org/rfc/rfc3261.txt
  4. RFC 4123 «Session Initiation Protocol (SIP)-H.323 Inter-working Requirements». H. Schulzrinne, C. Agboh. URL: http://tools.ietf.org/html/rfc4123
  5. R.T. Faizullin, I.R. Faizullin, O.T. Danilova. Secret sharing algorithm with a fundamentally small part of a secret as the key. // Bulletin of the Tyumen State University, № 7, 2011, P. 175-179.
  6. B. Schneier, Applied Cryptography, 2nd Edition: protocols, algorithms, source code in C / B. Schneier. - M: Triumph, 2002. - 610 p.
  7. Lintian Qiao and Klara Nahrstedt. Comparison of MPEG Ecryption Algorithms // International Journal on Com-puters and Graphics, Special Issue: Data Security in Image Communication and Network, 1998, vol. 22.
  8. Shamir A. How to share a secret // Communications of the ACM 22, 1979. P. 612-613.
  9. Chin-Pan Huang. Sharing the secret-dimensional images using conventional wavelets and multiveyvletov. / / Technology and Electronics, Vol 56b, № 1, P. 53-62.
  10. A.A. Svench, R.T. Faizullin. Secret sharing scheme based on the metric characteristics of data for secure transmission of video conferencing. // Computer Optics V.31, № 1, 2007, Samara IPSI RAS - P. 105-111.
  11. R.T. Faizullin, G.S. Rzhanitsyn. Building security system with video verification tasks graph isomorphism. / / Computer Optics, № 29, 2006, IPSI RAS, Samara, IPSI RAS - P. 84-93.
  12. Rahul Roy (July 28, 2008). Shard - A Database Design [electronic resource]. - Mode of access: http://technoroy.blogspot.com/2008/07/shard-database-design.html, free (date accessed 29/04/2012).
  13. I.R. Faizullin, R.T. Faizullin. Hardware-efficient encoding algorithm and data encryption, based on the special problem of the choice. // Omsk Scientific Gazette. Radio engineering and communication, № 3 (93), 2010, Omsk - P. 248-250.
  14. Elias P. Universal codeword sets and representations of the integers // IEEE Transactions on Information Theory, 1975, vol. IT-21, № 2. P. 194-203.
  15. Federal Information Processing Standards Publication. FIPS PUB 140-1. Security Requirements for Crypto-graphic Modules. - US Department of commerce / Na-tional institute of standards and technology, 1994. - 53 p.
  16. Recommendation for Block Cipher Modes of Operation. NIST Special Publication 800-38A. Technology Administration U.S.Department of Commerce. 2001 Edition.
© 2009, IPSI RAS
Institution of Russian Academy of Sciences, Image Processing Systems Institute of RAS, Russia, 443001, Samara, Molodogvardeyskaya Street 151; E-mail: ko@smr.ru; Phones: +7 (846 2) 332-56-22, Fax: +7 (846 2) 332-56-20