|
Article information
2015 , Volume 20, ¹ 6, p.5-21
Gazaryan J.O., Kosolapov Y.V.
On the experimental estimation of the lower bound for the maximum number of messages in a scheme aimed at data protection against spoofing
Purpose: For a given protection scheme we estimate the lower bound of the maximum number of messages that may be signed by one fixed key (known for both sender and receiver). It is supposed that a channel between sender and receiver is noisy. The observer is supposed to get only the partial data from the pair (“message”, “signature”) and knows everything about message signing algorithm except of a signing key. Ģethodology: To solve this problem we apply some well-known results of the analysis for the resistance of a code noising to multiple monitoring that uses the data channel with erasures, which allowed, together with methods of mathematical statistics, a method to obtain the lower estimate of the maximum number of messages. Findings: We constructed and justified algorithms for experimental evaluation for the lower bound of maximum number of messages for two particular models of interceptions: the model of uniform random interception with fixed number for coordinates of the message-signature pairs, represented as a vector, and a model for interception of messages over channel with erasures with a fixed probability of interception for one symbol. We present the results of calculations for specific implementations of the considered protection scheme. Originality/value: The results of the current research besides the considered spoofing protection scheme can be also used in another schemes of data protection. For example, these results could be useful in experimental analysis of the strength of scheme that protects confidentiality of the data with code noising against multiple interceptions.
[full text]
Keywords: protection from spoofing messages, multiple partial interception, code noising
Author(s):
Gazaryan Jury Olegovich
Position: Student
Office: South Federal University
Address: 344006, Russia, Rostov, Bol'shaya Sadovaya st., 105/42
E-mail: yuragazaryan@gmail.com
Kosolapov Yury Vladimirovich
PhD.
Position: Associate Professor
Office: South Federal University
Address: 344006, Russia, Rostov, Bol'shaya Sadovaya st., 105/42
E-mail: itaim@mail.ru
SPIN-code: 8308-5636 References:
[1] Bukashkin, S.A. The random coding method. Radiotekhnika. 2014; 4(184):31–36. (In Russ.)
[2] Mohan, V., Gurumurthi, S., Stan, M.R. FlashPower: A detailed power model for NAND flash memory. Design, Automation & Test in Europe Conference & Exhibition (DATE), 8-12 March 2010. Dresden: IEEE; 2010:502–507. DOI:10.1109/DATE.2010.5457154
[3] Jiang, A., Bruck, J. Data representation for flash memories. Data Storage Design. Ed. Balasa, F. Rijeka, Croatia: In Tech Europe; 2010:53–74. ISBN: 978-953-307-063-6.
[4] Rivest, R.L., Shamir, A. How to reuse a write-once memory. Information and Control. 1982; 55(1-3):1–19.
[5] Tal, A. Two flash technologies compared: NOR vs NAND. White Paper, 91-SR-012-04-8L REV. 1.0; 2002: 10. Available at: https://focus.ti.com/pdfs/omap/diskonchipvsnor.pdf
[6] Yaakobi, E., Kayser, S., Siegel, P.H., Vardy, A., Wolf, J.K. Codes for write-once memories. IEEE Transactions on Information Theory. 2012; 58(9):5985–5999.
[7] Yadgar, G., Yaakobi, E., Schuster, A. Write once, get 50% free: Saving SSD erase costs using WOM codes. Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST ’15).February 16–19, 2015. •Santa Clara, CA, US; 2015: 256-271. Available at: ttps://www.usenix.org/system/files/conference/fast15/fast15-paper-yadgar.pdf
[8] Jiang, A., Bohossian, V., Bruck, J. Floating codes for joint information storage in write asymmetric memories. IEEE International Symposium on Information Theory. 2007:1166–1170.
[9] Ahlswede, R., Zhang, Z. Coding for write-efficient memory. Information and Computation. 1989; 83(1):80–97.
[10] Ahlswede, R., Cai, N. Models of multi-user write-efficient memories and general diametric theorems. Information and Computation. 1997; 135(1):37–67.
[11] Kissel, R., Scholl, M., Skolochenko, S., Li, X.. Guidelines for Media Sanitization Recommendations of the National Institute of Standards and Technology. National Institute of Standards and Technology Special Publication 800-88; 2006: 41.
[12] Wei, M., Grupp, L.M., Spada, F.E., Swanson, S. Reliably erasing data from flash-based solid state drives. Proceedings of the 9th USENIX Conf. on File and stroage Technologies, February 15–17. San Jose, California; 2011: 8.
[13] Cassuto, Y., Bandic, Z. Low-complexity wire-tap codes with security and error-correction guarantees. Proceedings of the IEEE Information Theory Workshop. Dublin; 2010: 5. Available at: http://wiki.epfl.ch/edicpublic/documents/Candidacy%20exam/paper3.pdf
[14] Qing, Li, Jiang, A. Coding for secure write-efficient memories. Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on. Sept. 30 2014-Oct. 3 2014. Monticello, IL: IEEE; 2014: 505-512. DOI: 10.1109/ALLERTON.2014.7028497
[15] Wyner, A.D. The wire-tap channel. Bell System Technical Journal. 1975; 54(8):1355–1387.
[16] Korzhik, V.I., Yakovlev, V.A. Nonasymptotic estimates for efficiency of code jamming in a wire-tap channel. Problemy peredachi informatsii. 1981; 17(4):11–18. (In Russ.)
[17] Ozarov, L.H., Wyner, A.D. Wire-tap channel II. Bell System Technical Journal. 1984; (63):2135–2157.
[18] Kosolapov, Yu.V. Codes for a generalized wire-tap channel model. Problemy peredachi informatsii. 2015; 51(1):23-28. (In Russ.)
[19] Deundyak, V.M., Kosolapov, Y.V. One method of removing the uncertainty in the channel with errors in the case of code noising. Izvestiya SFedU. Engineering Sciences. 2014; 2(151):197–208. (In Russ.)
[20] Kosolapov, Y.V., Nikulin, V.E. Way of the organization of the distributed storage resistant against a partial data leakage./ Materials of the XIII Intern. Scientific and Practical Conf. “IS-2013”. Pt I. Taganrog: SFU Publishing House; 2013:186–191. (In Russ.)
[21] Wei, V.K. Generalized hamming weights for linear codes. IEEE Transactions on Information Theory. 1991; 37(5):1412–1418.
[22] Kosolapov, Y.V., Kurchev, N.O. Computation of the measure of resistance for Code Noising in channel with random partial interception. Computational Technologies. 2014; 19(6):42– 53. (In Russ.)
[23] Huang, Q, Lin, S., Abdel-Ghaffar, K. Error-correcting codes for flash coding. IEEE Transactions on Information Theory. 2011; 57(9):6097–6108.
[24] Sunberg, C.W. Erasure and error decoding for semiconductor memories. IEEE Transactions on Computers. 1978; 27(8):696–705.
[25] Elbaz, R., Champagne, D., Gebotys, C.H., Lee, R.B., Potlapally, N.R., Torres, L. Hardware mechanisms for memory authentication: A survey of existing techniques and engines. Transactions on Computational Science. 2009; (4):1–22.
Bibliography link:
Gazaryan J.O., Kosolapov Y.V. On the experimental estimation of the lower bound for the maximum number of messages in a scheme aimed at data protection against spoofing // Computational technologies. 2015. V. 20. ¹ 6. P. 5-21
|
