 Previous Article
 AMC Home
 This Issue

Next Article
An extremal singly even selfdual code of length 88
Unconditionally secure chaffing and winnowing with short authentication tags
1.  David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada 
In this paper, we construct unconditionally secure chaffingandwinnowing schemes from unconditionally secure authentication codes in which the authentication tags are very short. This could be a desirable feature, because certain types of unconditionally secure authentication codes can provide perfect secrecy if the length of an authentication tag is at least as long as the length of the plaintext. The use of such a code might be prohibited if encryption schemes are made illegal, so it is of interest to construct chaffingandwinnowing schemes based on ''short'' authentication tags.
[1] 
María Chara, Ricardo A. Podestá, Ricardo Toledano. The conorm code of an AGcode. Advances in Mathematics of Communications, 2021 doi: 10.3934/amc.2021018 
[2] 
Carla Mascia, Massimiliano Sala, Irene Villa. A survey on functional encryption. Advances in Mathematics of Communications, 2021 doi: 10.3934/amc.2021049 
[3] 
Angsuman Das, Avishek Adhikari, Kouichi Sakurai. Plaintext checkable encryption with designated checker. Advances in Mathematics of Communications, 2015, 9 (1) : 3753. doi: 10.3934/amc.2015.9.37 
[4] 
Debrup Chakraborty, Sebati Ghosh, Cuauhtemoc Mancillas López, Palash Sarkar. ${\sf {FAST}}$: Disk encryption and beyond. Advances in Mathematics of Communications, 2022, 16 (1) : 185230. doi: 10.3934/amc.2020108 
[5] 
Laura Luzzi, Ghaya RekayaBen Othman, JeanClaude Belfiore. Algebraic reduction for the Golden Code. Advances in Mathematics of Communications, 2012, 6 (1) : 126. doi: 10.3934/amc.2012.6.1 
[6] 
Irene MárquezCorbella, Edgar MartínezMoro, Emilio SuárezCanedo. On the ideal associated to a linear code. Advances in Mathematics of Communications, 2016, 10 (2) : 229254. doi: 10.3934/amc.2016003 
[7] 
Serhii Dyshko. On extendability of additive code isometries. Advances in Mathematics of Communications, 2016, 10 (1) : 4552. doi: 10.3934/amc.2016.10.45 
[8] 
Claude Carlet, Juan Carlos KuCauich, Horacio TapiaRecillas. Bent functions on a Galois ring and systematic authentication codes. Advances in Mathematics of Communications, 2012, 6 (2) : 249258. doi: 10.3934/amc.2012.6.249 
[9] 
Iris Anshel, Derek Atkins, Dorian Goldfeld, Paul E. Gunnells. Ironwood meta key agreement and authentication protocol. Advances in Mathematics of Communications, 2021, 15 (3) : 397413. doi: 10.3934/amc.2020073 
[10] 
Andrea Seidl, Stefan Wrzaczek. Opening the source code: The threat of forking. Journal of Dynamics and Games, 2022 doi: 10.3934/jdg.2022010 
[11] 
Jie Xu, Lanjun Dang. An efficient RFID anonymous batch authentication protocol based on group signature. Discrete and Continuous Dynamical Systems  S, 2019, 12 (4&5) : 14891500. doi: 10.3934/dcdss.2019102 
[12] 
Yunwen Liu, Longjiang Qu, Chao Li. New constructions of systematic authentication codes from three classes of cyclic codes. Advances in Mathematics of Communications, 2018, 12 (1) : 116. doi: 10.3934/amc.2018001 
[13] 
Olof Heden. The partial order of perfect codes associated to a perfect code. Advances in Mathematics of Communications, 2007, 1 (4) : 399412. doi: 10.3934/amc.2007.1.399 
[14] 
Sascha Kurz. The $[46, 9, 20]_2$ code is unique. Advances in Mathematics of Communications, 2021, 15 (3) : 415422. doi: 10.3934/amc.2020074 
[15] 
Selim Esedoḡlu, Fadil Santosa. Error estimates for a bar code reconstruction method. Discrete and Continuous Dynamical Systems  B, 2012, 17 (6) : 18891902. doi: 10.3934/dcdsb.2012.17.1889 
[16] 
Karan Khathuria, Joachim Rosenthal, Violetta Weger. Encryption scheme based on expanded ReedSolomon codes. Advances in Mathematics of Communications, 2021, 15 (2) : 207218. doi: 10.3934/amc.2020053 
[17] 
Fei Gao. Data encryption algorithm for ecommerce platform based on blockchain technology. Discrete and Continuous Dynamical Systems  S, 2019, 12 (4&5) : 14571470. doi: 10.3934/dcdss.2019100 
[18] 
Aiwan Fan, Qiming Wang, Joyati Debnath. A high precision data encryption algorithm in wireless network mobile communication. Discrete and Continuous Dynamical Systems  S, 2019, 12 (4&5) : 13271340. doi: 10.3934/dcdss.2019091 
[19] 
Vikas Srivastava, Sumit Kumar Debnath, Pantelimon Stǎnicǎ, Saibal Kumar Pal. A multivariate identitybased broadcast encryption with applications to the internet of things. Advances in Mathematics of Communications, 2021 doi: 10.3934/amc.2021050 
[20] 
YuChi Chen. Security analysis of public key encryption with filtered equality test. Advances in Mathematics of Communications, 2021 doi: 10.3934/amc.2021053 
2020 Impact Factor: 0.935
Tools
Metrics
Other articles
by authors
[Back to Top]