Filters








1,677 Hits in 12.8 sec

On Permutation Masks in Hamming Negative Selection [chapter]

Thomas Stibor, Jonathan Timmis, Claudia Eckert
2006 Lecture Notes in Computer Science  
Permutation masks were proposed for reducing the number of holes in Hamming negative selection when applying the r-contiguous or r-chunk matching rule.  ...  Here, we show that (randomly determined) permutation masks re-arrange the semantic representation of the underlying data and therefore shatter self-regions.  ...  In this paper, we focus on Hamming negative selection, i.e. the negative selection algorithm which operates on Hamming shape-space and employs the r-chunk matching rule and permutation masks.  ... 
doi:10.1007/11823940_10 fatcat:4m42pj2wbjftngyvzp5s6r5xdi

Application of the feature-detection rule to the Negative Selection Algorithm

Mario Poggiolini, Andries Engelbrecht
2013 Expert systems with applications  
the way in which permutation masks are currently being applied in artificial immune systems.  ...  The Negative Selection Algorithm developed by Forrest et al. was inspired by the way in which T-cell lymphocytes mature within the thymus before being released into the blood system.  ...  Furthermore, Stibor et al. (2006) also doubted whether permutation masks were appropriate at reducing the number of holes within negative selection algorithms by abstracting diversity.  ... 
doi:10.1016/j.eswa.2012.12.016 fatcat:ai54zt5uxjgwfifw4ivn5pf25y

A Formal Framework for Positive and Negative Detection Schemes

F. Esponda, S. Forrest, P. Helman
2004 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
For realistically sized problems, the universe of possible patterns is too large to represent exactly (in either the positive or negative scheme).  ...  A formal framework is given for analyzing the tradeoffs between positive and negative detection schemes in terms of the number of detectors needed to maximize coverage.  ...  with negative selection.  ... 
doi:10.1109/tsmcb.2003.817026 pmid:15369078 fatcat:4xuqubnivnfp3ld2vqadzartca

One-Point Geometric Crossover [chapter]

Alberto Moraglio
2010 Parallel Problem Solving from Nature, PPSN XI  
In this paper, we present an analogous characterization for one-point crossover and explicitly derive formally specific one-point crossovers for a number of well-known representations.  ...  First, the sequence s forms a path in the Hamming space as two consecutive strings in the sequence differ in exactly one bit.  ...  A mask m selects a subset of edit moves Em ⊆ E from the transcript T to apply to u and produces the offspring z. z is on a shortest path for the geometricity of homologous crossover.  ... 
doi:10.1007/978-3-642-15844-5_9 dblp:conf/ppsn/Moraglio10 fatcat:naquhjwl3zea7ensetuiqt43r4

A Statistical Analysis of IrisCode and Its Security Implications

Adams Wai Kin Kong
2015 IEEE Transactions on Pattern Analysis and Machine Intelligence  
To retain high identification speed, they use the same key to lock all IrisCodes in a database. The belief has been that if the key is not compromised, the IrisCodes are secure.  ...  Using this statistical information, the security risk associated with two patented template protection schemes that have been deployed in commercial systems for producing application-specific IrisCodes  ...  One image per iris in the testing databases is randomly selected in this analysis.  ... 
doi:10.1109/tpami.2014.2343959 pmid:26353258 fatcat:65qhqe7i6fbhbjuch3ezo5dzz4

Geometric Crossovers for Multiway Graph Partitioning

Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byung-Ro Moon
2007 Evolutionary Computation  
We design a new geometric crossover for permutations with repetitions that naturally suits partition problems and test it on the graph partitioning problem.  ...  By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation.  ...  the entries c i in cycle as follows: ci → mask(ci) obtaining a new mask mask'. (3) We perform standard mask-based crossover on the two parents using mask', obtaining the offspring as shown in Figure 1f  ... 
doi:10.1162/evco.2007.15.4.445 pmid:18021015 fatcat:jajddwjp6ndgrp6oqytesviss4

Redundant Code-based Masking Revisited

Nicolas Costes, Martijn Stam
2020 Transactions on Cryptographic Hardware and Embedded Systems  
For the Hamming weight scenario in the low-noise regime, we heuristically determine how security degrades in terms of the number of redundant shares for first and second order secure polynomial masking  ...  (CHES'18) and show that, contrary to their conclusions, said leakage can—in theory—always be exploited.  ...  G be a (d, n) CBM-suitable generator and let B be a permutation matrix on n + 1 elements, corresponding to permutation π on the set {0, . . . , n}.  ... 
doi:10.46586/tches.v2021.i1.426-450 fatcat:hhwgkutrs5bx7afbwgnkfiadz4

Security analysis of a cancelable iris recognition system based on block remapping

Stefan Jenisch, Andreas Uhl
2011 2011 18th IEEE International Conference on Image Processing  
In this paper a security survey of a cancelable iris recognition system is conducted. It uses block permutation and remapping of the iris texture as a strategy for template protection.  ...  Two adjunctive scenarios and their impact on the security of the system are examined. First off it is assumed that an attacker got a hold on a single iris template.  ...  In Table 3 test runs with integration of the bit mask turned on and off are listed below each other.  ... 
doi:10.1109/icip.2011.6116352 dblp:conf/icip/JenischU11 fatcat:5pwggir3mvbehew7l2uf6iygpu

Support Vector Machine Analysis of Functional Magnetic Resonance Imaging of Interoception Does Not Reliably Predict Individual Outcomes of Cognitive Behavioral Therapy in Panic Disorder with Agoraphobia

Benedikt Sundermann, Jens Bode, Ulrike Lueken, Dorte Westphal, Alexander L. Gerlach, Benjamin Straube, Hans-Ulrich Wittchen, Andreas Ströhle, André Wittmann, Carsten Konrad, Tilo Kircher, Volker Arolt (+1 others)
2017 Frontiers in Psychiatry  
SVM of fMRI in PD/AG Frontiers in Psychiatry | www.frontiersin.org June 2017 | Volume 8 | Article 99 conclusion: In contrast to reports on other neurofunctional probes, SVM based on an interoception paradigm  ...  Models based on C-SVC (C = 1). FS to select 20% of voxels. Statistical significance assessed by permutation testing.  ...  FS to select 20% of voxels. Statistical significance assessed by permutation testing.  ... 
doi:10.3389/fpsyt.2017.00099 pmid:28649205 pmcid:PMC5465291 fatcat:ayjsqcppwrcplitbwgnl3f7wja

Reusable Authentication from the Iris [article]

Sailesh Simhadri, James Steel, Benjamin Fuller
2017 IACR Cryptology ePrint Archive  
Our scheme is implemented in C and Python and is open-sourced. On a moderately powerful server, authentication usually completes within .30s. compromise in scope of the threat model.  ...  For many physical distributions with noise on repeated readings, the only protocols that are known to be secure run in exponential time or whose security relies on semantically secure graded encodings  ...  Acknowledgements Mariem Ouni and Tyler Cromwell contributed to some software described in this work. We thank Leonid Reyzin and Alexander Russell for helpful discussions and insights.  ... 
dblp:journals/iacr/SimhadriSF17 fatcat:enlsdsxfcjgjdf7xtoe6xqoniq

Correcting Errors in Image Encryption Based on DNA Coding

Bin Wang, Yingjie Xie, Shihua Zhou, Xuedong Zheng, Changjun Zhou
2018 Molecules  
The experimental results show our method could be used to correct errors in image encryption based on DNA coding.  ...  In this work, we propose a novel method to correct errors in image encryption, which results from the uncertainty of DNA computing.  ...  Due to some disadvantages in One-Time-Pad (OTP) algorithm, the author used logistic chaotic map as an input of OTP algorithm and proposed an interesting encryption algorithm based on a chaotic selection  ... 
doi:10.3390/molecules23081878 pmid:30060471 fatcat:aaefagmrcfdozlxuojcdkfuzoy

Selecting Time Samples for Multivariate DPA Attacks [chapter]

Oscar Reparaz, Benedikt Gierlichs, Ingrid Verbauwhede
2012 Lecture Notes in Computer Science  
Masking on the algorithm level, i.e. concealing all sensitive intermediate values with random data, is a popular countermeasure against DPA attacks.  ...  Experimental results based on power traces of a masked software implementation of the AES confirm the effectiveness of our method and show exemplary speed-ups.  ...  (Tuple selection) The adversary estimates I(L(t 1 ); L(t 2 );L(P)) for all (t 1 , t 2 ) with t 1 > t 2 in the remaining window, and keeps a list of pairs of time samples yielding negative mutual information  ... 
doi:10.1007/978-3-642-33027-8_10 fatcat:nffaddg2wbcirmizeurrvt2yv4

Differential power analysis attack on the secure bit permutation in the McEliece cryptosystem

Martin Petrvalsky, Tania Richmond, Milos Drutarovsky, Pierre-Louis Cayrel, Viktor Fischer
2016 2016 26th International Conference Radioelektronika (RADIOELEKTRONIKA)  
In this paper, we present a differential power analysis attack on the McEliece public-key cryptosystem.  ...  We attack a software implementation of a secure bit permutation that was proposed by Strenzke et al. at PQCrypto 2008. The cryptosystem is implemented on a 32-bit ARM based microcontroller.  ...  In traces (Fig. 2) , we can distinguish four patterns of rising amplitude (especially in negative half waves).  ... 
doi:10.1109/radioelek.2016.7477382 fatcat:ctxefsp4cvgqvcy2m7qyruohke

Algebraic manipulation detection codes with perfect nonlinear functions under non-uniform distribution

A.B. Levina, C. Carlet, S.V. Taranov
2017 Naučno-tehničeskij Vestnik Informacionnyh Tehnologij, Mehaniki i Optiki  
However, as shown in Figure 4 , we can select error classes with the same values of error masking probability for both functions.  ...  For a deterministic function, attacker can select one of these codewords ′, and find the corresponding input value ′.  ... 
doi:10.17586/2226-1494-2017-17-6-1052-1062 fatcat:x44gdmskjzda7pu5uxuqqpew54

Geometric particle swarm optimization for the sudoku puzzle

Alberto Moraglio, Julian Togelius
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
Also, we found that Cycle crossover [5] , another traditional crossover for permutations, is geometric under swap distance and under Hamming distance (geometricity under Hamming distance for permutations  ...  The recombination continues on the updated parents for position 3 and so on up to the last position in the mask. At this point the three  ... 
doi:10.1145/1276958.1276975 dblp:conf/gecco/MoraglioT07 fatcat:z3ruhimm6bdqtlfx5ov76m35ma
« Previous Showing results 1 — 15 out of 1,677 results