Data sanitization against adversarial label contamination based on data complexity

2017 ◽  
Vol 9 (6) ◽  
pp. 1039-1052 ◽  
Author(s):  
Patrick P. K. Chan ◽  
Zhi-Min He ◽  
Hongjiang Li ◽  
Chien-Chang Hsu
Author(s):  
S. Nithya ◽  
M. Sangeetha ◽  
K.N. Apinaya Prethi ◽  
S. Vellingiri

2010 ◽  
Vol 50 (1) ◽  
pp. 93-102 ◽  
Author(s):  
Der-Chiang Li ◽  
Yao-Hwei Fang ◽  
Y.M. Frank Fang

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Lin Ding ◽  
Chenhui Jin ◽  
Jie Guan ◽  
Qiuyan Wang

Loiss is a novel byte-oriented stream cipher proposed in 2011. In this paper, based on solving systems of linear equations, we propose an improved Guess and Determine attack on Loiss with a time complexity of 2231and a data complexity of 268, which reduces the time complexity of the Guess and Determine attack proposed by the designers by a factor of 216. Furthermore, a related key chosenIVattack on a scaled-down version of Loiss is presented. The attack recovers the 128-bit secret key of the scaled-down Loiss with a time complexity of 280, requiring 264chosenIVs. The related key attack is minimal in the sense that it only requires one related key. The result shows that our key recovery attack on the scaled-down Loiss is much better than an exhaustive key search in the related key setting.


2006 ◽  
Vol 13 (3) ◽  
pp. 376-402 ◽  
Author(s):  
Kevin P. Moloney ◽  
Julie A. Jacko ◽  
Brani Vidakovic ◽  
François Sainfort ◽  
V. Kathlene Leonard ◽  
...  
Keyword(s):  

2017 ◽  
Vol 107 (1) ◽  
pp. 209-246 ◽  
Author(s):  
Ana C. Lorena ◽  
Aron I. Maciel ◽  
Péricles B. C. de Miranda ◽  
Ivan G. Costa ◽  
Ricardo B. C. Prudêncio

Sign in / Sign up

Export Citation Format

Share Document