1 % This file was created with JabRef 2.7.
4 @INPROCEEDINGS{AdelsbachKS06,
5 author = {Andr{\'e} Adelsbach and Stefan Katzenbeisser and Ahmad-Reza Sadeghi},
6 title = {A Computational Model for Watermark Robustness},
7 booktitle = {Information Hiding},
10 bibsource = {DBLP, http://dblp.uni-trier.de},
11 crossref = {DBLP:conf/ih/2006},
12 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_10},
14 timestamp = {2009.06.29}
19 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
22 author = {Guyeux, Christophe},
23 title = {Le d\'esordre des it\'erations chaotiques - Applications aux r\'eseaux de capteurs, \`a la dissimulation d'information, et aux fonctions de hachage},
24 abstract = {Les itérations chaotiques, un outil issu des mathématiques discrètes, sont pour la première fois étudiées pour obtenir de la divergence et du désordre. Après avoir utilisé les mathématiques discrètes pour en déduire des situations de non convergence, ces itérations sont modélisées sous la forme d'un système dynamique et sont étudiées topologiquement dans le cadre de la théorie mathématique du chaos. Nous prouvons que leur adjectif « chaotique » a été bien choisi : ces itérations sont du chaos aux sens de Devaney, Li-Yorke, l'expansivité, l'entropie topologique et l'exposant de Lyapunov, etc. Ces propriétés ayant été établies pour une topologie autre que la topologie de l'ordre, les conséquences de ce choix sont discutées. Nous montrons alors que ces itérations chaotiques peuvent être portées telles quelles sur ordinateur, sans perte de propriétés, et qu'il est possible de contourner le problème de la finitude des ordinateurs pour obtenir des programmes aux comportements prouvés chaotiques selon Devaney, etc. Cette manière de faire est respectée pour générer des algorithmes de tatouage numérique et des fonction de hachage chaotiques au sens le plus fort qui soit.},
25 publisher = {\'Editions Universitaires Europ\'eennes},
26 isbn = {978-3-8417-9417-8},
28 note = {ISBN 978-3-8417-9417-8. 362 pages. Publication de la thèse de doctorat.},
31 @inproceedings{bfg12a:ip,
33 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
36 author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe},
37 title = {An optimization technique on pseudorandom generators based on chaotic iterations},
38 booktitle = {INTERNET'2012, 4-th Int. Conf. on Evolving Internet},
40 address = {Venice, Italy},
47 @UNPUBLISHED{ANDREW2008,
48 author = {NIST Special Publication 800-22 rev. 1},
49 title = {A Statistical Test Suite for Random and Pseudorandom Number Generators
50 for Cryptographic Applications},
53 timestamp = {2009.01.22}
56 @Article{combined_lcg,
57 title = "Efficient and portable combined random number generators",
59 journal = "Communications of the ACM",
67 @INPROCEEDINGS{Fischlin,
68 author = {Fischlin, R. and Schnorr, C. P.},
69 title = {Stronger security proofs for RSA and rabin bits},
70 booktitle = {Proceedings of the 16th annual international conference on Theory
71 and application of cryptographic techniques},
73 series = {EUROCRYPT'97},
75 address = {Berlin, Heidelberg},
76 publisher = {Springer-Verlag},
78 isbn = {3-540-62975-0},
79 location = {Konstanz, Germany},
81 url = {http://dl.acm.org/citation.cfm?id=1754542.1754569}
84 @INPROCEEDINGS{BattiatoCGG99,
85 author = {Sebastiano Battiato and Dario Catalano and Giovanni Gallo and Rosario
87 title = {Robust Watermarking for Images Based on Color Manipulation},
88 booktitle = {Information Hiding},
91 bibsource = {DBLP, http://dblp.uni-trier.de},
92 crossref = {DBLP:conf/ih/1999},
94 timestamp = {2009.06.29}
97 @INPROCEEDINGS{ComesanaPP05,
98 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
99 title = {The Return of the Sensitivity Attack},
103 bibsource = {DBLP, http://dblp.uni-trier.de},
104 crossref = {DBLP:conf/iwdw/2005},
105 ee = {http://dx.doi.org/10.1007/11551492_20},
107 timestamp = {2009.06.29}
110 @INPROCEEDINGS{ComesanaPP05bis,
111 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
112 title = {Fundamentals of Data Hiding Security and Their Application to Spread-Spectrum
114 booktitle = {IH'05: Information Hiding Workshop},
117 publisher = {Lectures Notes in Computer Science, Springer-Verlag},
118 bibsource = {DBLP, http://dblp.uni-trier.de},
119 crossref = {DBLP:conf/ih/2005},
120 ee = {http://dx.doi.org/10.1007/11558859_12},
122 timestamp = {2009.06.30}
125 @INPROCEEDINGS{CongJQZ06,
126 author = {Jin Cong and Yan Jiang and Zhiguo Qu and Zhongmei Zhang},
127 title = {A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption},
128 booktitle = {ICCSA (1)},
131 bibsource = {DBLP, http://dblp.uni-trier.de},
132 crossref = {DBLP:conf/iccsa/2006-1},
133 ee = {http://dx.doi.org/10.1007/11751540_100}
136 @INPROCEEDINGS{DBLP:conf/focs/DziembowskiP08,
137 author = {Stefan Dziembowski and Krzysztof Pietrzak},
138 title = {Leakage-Resilient Cryptography},
142 bibsource = {DBLP, http://dblp.uni-trier.de},
143 crossref = {DBLP:conf/focs/2008},
144 ee = {http://dx.doi.org/10.1109/FOCS.2008.56}
147 @INCOLLECTION{Filiol10,
148 author = {Eric Filiol},
149 title = {Viruses and Malware},
150 booktitle = {Handbook of Information and Communication Security},
153 bibsource = {DBLP, http://dblp.uni-trier.de},
154 crossref = {DBLP:reference/icsec/2010},
155 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4_34}
158 @INPROCEEDINGS{Filiol00,
159 author = {Eric Filiol},
160 title = {Decimation Attack of Stream Ciphers},
161 booktitle = {INDOCRYPT},
164 bibsource = {DBLP, http://dblp.uni-trier.de},
165 crossref = {DBLP:conf/indocrypt/2000},
166 ee = {http://link.springer.de/link/service/series/0558/bibs/1977/19770031.htm}
169 @INPROCEEDINGS{Furon05,
170 author = {Teddy Furon},
171 title = {A Survey of Watermarking Security},
175 bibsource = {DBLP, http://dblp.uni-trier.de},
176 crossref = {DBLP:conf/iwdw/2005},
177 ee = {http://dx.doi.org/10.1007/11551492_16},
179 timestamp = {2009.06.29}
183 @INPROCEEDINGS{DBLP:conf/cec/HiggsSHS10,
184 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
185 title = {Genetic algorithm feature-based resampling for protein structure
187 booktitle = {IEEE Congress on Evolutionary Computation},
190 bibsource = {DBLP, http://dblp.uni-trier.de},
191 crossref = {DBLP:conf/cec/2010},
192 ee = {http://dx.doi.org/10.1109/CEC.2010.5586149}
195 @INPROCEEDINGS{Higgs2010,
196 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
197 title = {Genetic algorithm feature-based resampling for protein structure
199 booktitle = {IEEE Congress on Evolutionary Computation},
202 bibsource = {DBLP, http://dblp.uni-trier.de},
203 crossref = {DBLP:conf/cec/2010},
204 ee = {http://dx.doi.org/10.1109/CEC.2010.5586149}
207 @INPROCEEDINGS{DBLP:conf/cec/HorvathC10,
208 author = {Dragos Horvath and Camelia Chira},
209 title = {Simplified chain folding models as metaheuristic benchmark for tuning
210 real protein folding algorithms?},
211 booktitle = {IEEE Congress on Evolutionary Computation},
214 bibsource = {DBLP, http://dblp.uni-trier.de},
215 crossref = {DBLP:conf/cec/2010},
216 ee = {http://dx.doi.org/10.1109/CEC.2010.5585932}
219 @INPROCEEDINGS{DBLP:conf/cec/IslamC10,
220 author = {Md. Kamrul Islam and Madhu Chetty},
221 title = {Clustered memetic algorithm for protein structure prediction},
222 booktitle = {IEEE Congress on Evolutionary Computation},
225 bibsource = {DBLP, http://dblp.uni-trier.de},
226 crossref = {DBLP:conf/cec/2010},
227 ee = {http://dx.doi.org/10.1109/CEC.2010.5586187}
230 @INPROCEEDINGS{Ker06,
231 author = {Andrew D. Ker},
232 title = {Batch Steganography and Pooled Steganalysis},
233 booktitle = {Information Hiding},
236 bibsource = {DBLP, http://dblp.uni-trier.de},
237 crossref = {DBLP:conf/ih/2006},
238 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_18},
240 timestamp = {2009.06.29}
243 @INPROCEEDINGS{Lin2009,
244 author = {H.-Y. Lin and T.-C. Chiang},
245 title = {Cooperative Secure Data Aggregation in Sensor Networks Using Elliptic
246 Curve Based Cryptosystems},
250 bibsource = {DBLP, http://dblp.uni-trier.de},
251 crossref = {DBLP:conf/cdve/2009},
252 ee = {http://dx.doi.org/10.1007/978-3-642-04265-2_58}
255 @INPROCEEDINGS{DBLP:conf/cse/MaimourPH09,
256 author = {Moufida Maimour and CongDuc Pham and Doan B. Hoang},
257 title = {A Congestion Control Framework for Handling Video Surveillance Traffics
259 booktitle = {CSE (2)},
262 bibsource = {DBLP, http://dblp.uni-trier.de},
263 crossref = {DBLP:conf/cse/2009},
264 ee = {http://dx.doi.org/10.1109/CSE.2009.200}
267 @INPROCEEDINGS{DBLP:conf/icumt/MakhoulSP09,
268 author = {Abdallah Makhoul and Rachid Saadi and CongDuc Pham},
269 title = {Coverage and adaptive scheduling algorithms for criticality management
270 on video wireless sensor networks},
274 bibsource = {DBLP, http://dblp.uni-trier.de},
275 crossref = {DBLP:conf/icumt/2009},
276 ee = {http://dx.doi.org/10.1109/ICUMT.2009.5345630}
279 @INPROCEEDINGS{Mittelholzer99,
280 author = {Thomas Mittelholzer},
281 title = {An Information-Theoretic Approach to Steganography and Watermarking},
282 booktitle = {Information Hiding},
285 bibsource = {DBLP, http://dblp.uni-trier.de},
286 crossref = {DBLP:conf/ih/1999},
288 timestamp = {2009.06.29}
291 @INPROCEEDINGS{PellegriniBA10,
292 author = {Andrea Pellegrini and Valeria Bertacco and Todd M. Austin},
293 title = {Fault-based attack of RSA authentication},
297 bibsource = {DBLP, http://dblp.uni-trier.de},
298 crossref = {DBLP:conf/date/2010},
299 ee = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5456933}
302 @INPROCEEDINGS{DBLP:conf/cec/Perez-HernandezRG10,
303 author = {Luis Germ{\'a}n P{\'e}rez-Hern{\'a}ndez and Katya Rodr\'{\i}guez-V{\'a}zquez
304 and Ram{\'o}n Gardu{\~n}o-Ju{\'a}rez},
305 title = {Estimation of 3D Protein Structure by means of parallel Particle
307 booktitle = {IEEE Congress on Evolutionary Computation},
310 bibsource = {DBLP, http://dblp.uni-trier.de},
311 crossref = {DBLP:conf/cec/2010},
312 ee = {http://dx.doi.org/10.1109/CEC.2010.5586549}
315 @INPROCEEDINGS{WangNHZH07,
316 author = {Chuntao Wang and Jiangqun Ni and Jiwu Huang and Rongyue Zhang and
318 title = {Robust and High Capacity Image Watermarking Based on Jointly Coding
319 and Embedding Optimization},
320 booktitle = {Information Hiding},
323 bibsource = {DBLP, http://dblp.uni-trier.de},
324 crossref = {DBLP:conf/ih/2007},
325 ee = {http://dx.doi.org/10.1007/978-3-540-77370-2_5},
327 timestamp = {2009.06.29}
330 @INPROCEEDINGS{Zhao04,
331 author = {Jian Zhao and Mingquan Zhou and Hongmei Xie and Jinye Peng and Xin
333 title = {A Novel Wavelet Image Watermarking Scheme Combined with Chaos Sequence
335 booktitle = {ISNN (2)},
338 bibsource = {DBLP, http://dblp.uni-trier.de},
339 crossref = {DBLP:conf/isnn/2004-2},
340 ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3174{\&}spage=663}
343 @INPROCEEDINGS{Acharya05securecomparison,
344 author = {Acharya, Mithun and Girao, Joao and Westhoff, Dirk},
345 title = {Secure Comparison of Encrypted Data in Wireless Sensor Networks},
346 booktitle = {WIOPT '05: Proceedings of the Third International Symposium on Modeling
347 and Optimization in Mobile, Ad Hoc, and Wireless Networks},
350 address = {Washington, DC, USA},
351 publisher = {IEEE Computer Society},
352 doi = {http://dx.doi.org/10.1109/WIOPT.2005.44},
353 isbn = {0-7695-2267-X}
356 @INPROCEEDINGS{Acimez07onthe,
357 author = {Onur Acıi\c{c}mez and \c{C}etin Kaya Ko\c{c} and Jean-Pierre Seifert},
358 title = {On the power of simple branch prediction analysis },
359 booktitle = {2007 ACM Symposium on Information, Computer and Communications Security
363 publisher = {ACM Press}
367 author = {R. L. Adler and A. G. Konheim and M. H. McAndrew},
368 title = {Topological entropy},
369 journal = {Trans. Amer. Math. Soc.},
374 timestamp = {2008.05.29}
377 @INPROCEEDINGS{Agrawal04,
378 author = {Agrawal, Rakesh and Kiernan, Jerry and Srikant, Ramakrishnan and
380 title = {Order preserving encryption for numeric data},
381 booktitle = {SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference
382 on Management of data},
385 address = {New York, NY, USA},
387 doi = {http://doi.acm.org/10.1145/1007568.1007632},
388 isbn = {1-58113-859-8},
389 location = {Paris, France}
392 @ARTICLE{Anfinsen20071973,
393 author = {Anfinsen, Christian B.},
394 title = {Principles that Govern the Folding of Protein Chains},
400 doi = {10.1126/science.181.4096.223},
401 eprint = {http://www.sciencemag.org/content/181/4096/223.full.pdf},
402 url = {http://www.sciencemag.org/content/181/4096/223.short}
406 author = {D. G. Arques and C. J. Michel},
407 title = {Analytical expression of the purine/pyrimidine autocorrelation function
408 after and before random mutations.},
409 journal = {Math Biosci},
415 abstract = {The mutation process is a classical evolutionary genetic process.
416 The type of mutations studied here is the random substitutions of
417 a purine base R (adenine or guanine) by a pyrimidine base Y (cytosine
418 or thymine) and reciprocally (transversions). The analytical expressions
419 derived allow us to analyze in genes the occurrence probabilities
420 of motifs and d-motifs (two motifs separated by any d bases) on the
421 R/Y alphabet under transversions. These motif probabilities can be
422 obtained after transversions (in the evolutionary sense; from the
423 past to the present) and, unexpectedly, also before transversions
424 (after back transversions, in the inverse evolutionary sense, from
425 the present to the past). This theoretical part in Section 2 is a
426 first generalization of a particular formula recently derived. The
427 application in Section 3 is based on the analytical expression giving
428 the autocorrelation function (the d-motif probabilities) before transversions.
429 It allows us to study primitive genes from actual genes. This approach
430 solves a biological problem. The protein coding genes of chloroplasts
431 and mitochondria have a preferential occurrence of the 6-motif YRY(N)6YRY
432 (maximum of the autocorrelation function for d = 6, N = R or Y) with
433 a periodicity modulo 3. The YRY(N)6YRY preferential occurrence without
434 the periodicity modulo 3 is also observed in the RNA coding genes
435 (ribosomal, transfer, and small nuclear RNA genes) and in the noncoding
436 genes (introns and 5' regions of eukaryotic nuclei). However, there
437 are two exceptions to this YRY(N)6YRY rule: the protein coding genes
438 of eukaryotic nuclei, and prokaryotes, where YRY(N)6YRY has the second
439 highest value after YRY(N)0YRY (YRYYRY) with a periodicity modulo
440 3. When we go backward in time with the analytical expression, the
441 protein coding genes of both eukaryotic nuclei and prokaryotes retrieve
442 the YRY(N)6YRY preferential occurrence with a periodicity modulo
443 3 after 0.2 back transversions per base. In other words, the actual
444 protein coding genes of chloroplasts and mitochondria are similar
445 to the primitive protein coding genes of eukaryotic nuclei and prokaryotes.
446 On the other hand, this application represents the first result concerning
447 the mutation process in the model of DNA sequence evolution we recently
448 proposed. According to this model, the actual genes on the R/Y alphabet
449 derive from two successive evolutionary genetic processes: an independent
450 mixing of a few nonrandom types of oligonucleotides leading to genes
451 called primitive followed by a mutation process in these primitive
452 genes.(ABSTRACT TRUNCATED AT 400 WORDS)},
453 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
455 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Mathematics; Models,
456 Genetic; Mutation; Probability; Proteins, genetics; Purines; Pyrimidines},
458 medline-pst = {ppublish},
460 pii = {0025-5564(94)90020-5},
462 timestamp = {2011.05.05}
466 author = {D. G. Arquès and J. P. Fallot and C. J. Michel},
467 title = {An evolutionary analytical model of a complementary circular code
468 simulating the protein coding genes, the 5' and 3' regions.},
469 journal = {Bull Math Biol},
475 abstract = {The self-complementary subset T0 = X0 [symbol: see text] ¿AAA, TTT¿
476 with X0 = ¿AAC, AAT, ACC, ATC, ATT, CAG, CTC, CTG, GAA, GAC, GAG,
477 GAT, GCC, GGC, GGT, GTA, GTC, GTT, TAC, TTC¿ of 22 trinucleotides
478 has a preferential occurrence in the frame 0 (reading frame established
479 by the ATG start trinucleotide) of protein (coding) genes of both
480 prokaryotes and eukaryotes. The subsets T1 = X1 [symbol: see text]
481 ¿CCC¿ and T2 = X2 [symbol: see text] ¿GGG¿ of 21 trinucleotides have
482 a preferential occurrence in the shifted frames 1 and 2 respectively
483 (frame 0 shifted by one and two nucleotides respectively in the 5'-3'
484 direction). T1 and T2 are complementary to each other. The subset
485 T0 contains the subset X0 which has the rarity property (6 x 10(-8)
486 to be a complementary maximal circular code with two permutated maximal
487 circular codes X1 and X2 in the frames 1 and 2 respectively. X0 is
488 called a C3 code. A quantitative study of these three subsets T0,
489 T1, T2 in the three frames 0, 1, 2 of protein genes, and the 5' and
490 3' regions of eukaryotes, shows that their occurrence frequencies
491 are constant functions of the trinucleotide positions in the sequences.
492 The frequencies of T0, T1, T2 in the frame 0 of protein genes are
493 49, 28.5 and 22.5\% respectively. In contrast, the frequencies of
494 T0, T1, T2 in the 5' and 3' regions of eukaryotes, are independent
495 of the frame. Indeed, the frequency of T0 in the three frames of
496 5' (respectively 3') regions is equal to 35.5\% (respectively 38\%)
497 and is greater than the frequencies T1 and T2, both equal to 32.25\%
498 (respectively 31\%) in the three frames. Several frequency asymmetries
499 unexpectedly observed (e.g. the frequency difference between T1 and
500 T2 in the frame 0), are related to a new property of the subset T0
501 involving substitutions. An evolutionary analytical model at three
502 parameters (p, q, t) based on an independent mixing of the 22 codons
503 (trinucleotides in frame 0) of T0 with equiprobability (1/22) followed
504 by t approximately 4 substitutions per codon according to the proportions
505 p approximately 0.1, q approximately 0.1 and r = 1 - p - q approximately
506 0.8 in the three codon sites respectively, retrieves the frequencies
507 of T0, T1, T2 observed in the three frames of protein genes and explains
508 these asymmetries. Furthermore, the same model (0.1, 0.1, t) after
509 t approximately 22 substitutions per codon, retrieves the statistical
510 properties observed in the three frames of the 5' and 3' regions.
511 The complex behaviour of these analytical curves is totally unexpected
512 and a priori difficult to imagine.},
513 doi = {10.1006/bulm.1997.0033},
514 institution = {Equipe de Biologie Théorique, Université de Marne la Vallée, Institut
515 Gaspard Monge, Noisy Le Grand, France. arques@univ-mlv.fr},
516 keywords = {Animals; Biological Evolution; Codon, genetics; Genetic Code; Humans;
517 Mammals; Models, Genetic; Probability; Proteins, genetics; Rodentia;
520 medline-pst = {ppublish},
522 pii = {S0092-8240(97)90033-1},
524 timestamp = {2011.05.05},
525 url = {http://dx.doi.org/10.1006/bulm.1997.0033}
529 author = {D. G. Arquès and C. J. Michel},
530 title = {Analytical expression of the purine/pyrimidine codon probability
531 after and before random mutations.},
532 journal = {Bull Math Biol},
535 pages = {1025--1038},
538 abstract = {Recently, we proposed a new model of DNA sequence evolution (Arquès
539 and Michel. 1990b. Bull. math. Biol. 52, 741-772) according to which
540 actual genes on the purine/pyrimidine (R/Y) alphabet (R = purine
541 = adenine or guanine, Y = pyrimidine = cytosine or thymine) are the
542 result of two successive evolutionary genetic processes: (i) a mixing
543 (independent) process of non-random oligonucleotides (words of base
544 length less than 10: YRY(N)6, YRYRYR and YRYYRY are so far identified;
545 N = R or Y) leading to primitive genes (words of several hundreds
546 of base length) and followed by (ii) a random mutation process, i.e.,
547 transformations of a base R (respectively Y) into the base Y (respectively
548 R) at random sites in these primitive genes. Following this model
549 the problem investigated here is the study of the variation of the
550 8 R/Y codon probabilities RRR, ..., YYY under random mutations. Two
551 analytical expressions solved here allow analysis of this variation
552 in the classical evolutionary sense (from the past to the present,
553 i.e., after random mutations), but also in the inverted evolutionary
554 sense (from the present to the past, i.e., before random mutations).
555 Different properties are also derived from these formulae. Finally,
556 a few applications of these formulae are presented. They prove the
557 proposition in Arquès and Michel (1990b. Bull. math. Biol. 52, 741-772),
558 Section 3.3.2, with the existence of a maximal mean number of random
559 mutations per base of the order 0.3 in the protein coding genes.
560 They also confirm the mixing process of oligonucleotides by excluding
561 the purine/pyrimidine contiguous and alternating tracts from the
562 formation process of primitive genes.},
563 institution = {Université de Franche-Comté, Besançon, France.},
564 keywords = {Base Sequence; Codon; DNA, chemistry/genetics; Mathematics; Models,
565 Genetic; Mutation; Probability; Purines; Pyrimidines},
567 medline-pst = {ppublish},
570 timestamp = {2011.05.05}
573 @ARTICLE{Arques1993b,
574 author = {D. G. Arquès and C. J. Michel},
575 title = {Identification and simulation of new non-random statistical properties
576 common to different eukaryotic gene subpopulations.},
577 journal = {Biochimie},
582 abstract = {The nucleotide distribution in protein coding genes, introns and transfer
583 RNA genes of eukaryotic subpopulations (primates, rodent and mammals)
584 is studied by autocorrelation functions. The autocorrelation function
585 analysing the occurrence probability of the i-motif YRY(N)iYRY (YRY-function)
586 in protein coding genes and transfer RNA genes of these three eukaryotic
587 subpopulations retrieves the preferential occurrence of YRY(N)6YRY
588 (R = purine = adenine or guanine, Y = pyrimidine = cytosine or thymine,
589 N = R or Y). The autocorrelation functions analysing the occurrence
590 probability of the i-motifs RRR(N)iRRR (RRR-function) and YYY(N)iYYY
591 (YYY-function) identify new non-random genetic statistical properties
592 in these three eukaryotic subpopulations, mainly: i) in their protein
593 coding genes: local maxima for i identical to 6 [12] (peaks for i
594 = 6, 18, 30, 42) with the RRR-function and local maxima for i identical
595 to 8 [10] (peaks for i = 8, 18, 28) with the YYY-function; and ii)
596 in their introns: local maxima for i identical to 3 [6] (peaks for
597 i = 3, 9, 15) and a short linear decrease followed by a large exponential
598 decrease both with the RRR- and YYY-functions. The non-random properties
599 identified in eukaryotic intron subpopulations are modelised with
600 a process of random insertions and deletions of nucleotides simulating
602 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
603 d'Informatique de Besançon, France.},
604 keywords = {Animals; Base Sequence; Data Interpretation, Statistical; Genes; Introns;
605 Mammals; Models, Genetic; Primates; Probability; Proteins, genetics;
606 RNA Editing; RNA, Transfer, genetics; Rodentia; Sequence Analysis,
609 medline-pst = {ppublish},
611 pii = {0300-9084(93)90173-P},
613 timestamp = {2011.05.05}
617 author = {D. G. Arquès and C. J. Michel},
618 title = {A simulation of the genetic periodicities modulo 2 and 3 with processes
619 of nucleotide insertions and deletions.},
620 journal = {J Theor Biol},
626 abstract = {Recently, a new genetic process termed RNA editing has been identified
627 showing insertions and deletions of nucleotides in particular RNA
628 molecules. On the other hand, there are a few non-random statistical
629 properties in genes: in particular, the periodicity modulo 3 (P3)
630 associated with an open reading frame, the periodicity modulo 2 (P2)
631 associated with alternating purine/pyrimidine stretches, the YRY(N)6YRY
632 preferential occurrence (R = purine = adenine or guanine, Y = pyrimidine
633 = cytosine or thymine, N = R or Y) representing a "code" of the DNA
634 helix pitch, etc. The problem investigated here is whether a process
635 of the type RNA editing can lead to the non-random statistical properties
636 commonly observed in genes. This paper will show in particular that:
637 The process of insertions and deletions of mononucleotides in the
638 initial sequence [YRY(N)3]* [series of YRY(N)3] can lead to the periodicity
639 modulo 2 (P2). The process of insertions and deletions of trinucleotides
640 in the initial sequence [YRY(N)6]* [series of YRY(N)6] can lead to
641 the periodicity modulo 3 (P3) and the YRY(N)6YRY preferential occurrence.
642 Furthermore, these two processes lead to a strong correlation with
643 the reality, namely the mononucleotide insertion/deletion process,
644 with the 5' eukaryotic regions and the trinucleotide insertion/deletion
645 process, with the eukaryotic protein coding genes.},
646 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
647 Unité Associée CNRS No 822, France.},
648 keywords = {Chromosome Deletion; Computer Simulation; Humans; Models, Genetic;
649 Mutagenesis, genetics; RNA, genetics},
651 medline-pst = {ppublish},
654 timestamp = {2011.05.05}
658 author = {D. G. Arquès and C. J. Michel},
659 title = {Periodicities in coding and noncoding regions of the genes.},
660 journal = {J Theor Biol},
666 abstract = {Gene population statistical studies of protein coding genes and introns
667 have identified two types of periodicities on the purine/pyrimidine
668 alphabet: (i) the modulo 3 periodicity or coding periodicity (periodicity
669 P3) in protein coding genes of eukaryotes, prokaryotes, viruses,
670 chloroplasts, mitochondria, plasmids and in introns of viruses and
671 mitochondria, and (ii) the modulo 2 periodicity (periodicity P2)
672 in the eukaryotic introns. The periodicity study is herein extended
673 to the 5' and 3' regions of eukaryotes, prokaryotes and viruses and
674 shows: (i) the periodicity P3 in the 5' and 3' regions of eukaryotes.
675 Therefore, these observations suggest a unitary and dynamic concept
676 for the genes as for a given genome, the 5' and 3' regions have the
677 genetic information for protein coding genes and for introns: (1)
678 In the eukaryotic genome, the 5' (P2 and P3) and 3' (P2 and P3) regions
679 have the information for protein coding genes (P3) and for introns
680 (P2). The intensity of P3 is high in 5' regions and weak in 3' regions,
681 while the intensity of P2 is weak in 5' regions and high in 3' regions.
682 (2) In the prokaryotic genome, the 5' (P3) and 3' (P3) regions have
683 the information for protein coding genes (P3). (3) In the viral genome,
684 the 5' (P3) and 3' (P3) regions have the information for protein
685 coding genes (P3) and for introns (P3). The absence of P2 in viral
686 introns (in opposition to eukaryotic introns) may be related to the
687 absence of P2 in 5' and 3' regions of viruses.},
688 institution = {Université de Franche-Comté, Unité Associée CNRS No. 822, Besançon,
690 keywords = {Animals; Base Sequence; Eukaryotic Cells; Genes; Introns; Prokaryotic
691 Cells; Purine Nucleotides; Pyrimidine Nucleotides; Repetitive Sequences,
692 Nucleic Acid; Viruses, genetics},
694 medline-pst = {ppublish},
697 timestamp = {2011.05.05}
700 @ARTICLE{Arques1990a,
701 author = {D. G. Arquès and C. J. Michel},
702 title = {A model of DNA sequence evolution.},
703 journal = {Bull Math Biol},
708 abstract = {Statistical studies of gene populations on the purine/pyrimidine alphabet
709 have shown that the mean occurrence probability of the i-motif YRY(N)iYRY
710 (R = purine, Y = pyrimidine, N = R or Y) is not uniform by varying
711 i in the range, but presents a maximum at i = 6 in the following
712 populations: protein coding genes of eukaryotes, prokaryotes, chloroplasts
713 and mitochondria, and also viral introns, ribosomal RNA genes and
714 transfer RNA genes (Arquès and Michel, 1987b, J. theor. Biol. 128,
715 457-461). From the "universality" of this observation, we suggested
716 that the oligonucleotide YRY(N)6 is a primitive one and that it has
717 a central function in DNA sequence evolution (Arquès and Michel,
718 1987b, J. theor. Biol. 128, 457-461). Following this idea, we introduce
719 a concept of a model of DNA sequence evolution which will be validated
720 according to a schema presented in three parts. In the first part,
721 using the last version of the gene database, the YRY(N)6YRY preferential
722 occurrence (maximum at i = 6) is confirmed for the populations mentioned
723 above and is extended to some newly analysed populations: chloroplast
724 introns, chloroplast 5' regions, mitochondrial 5' regions and small
725 nuclear RNA genes. On the other hand, the YRY(N)6YRY preferential
726 occurrence and periodicities are used in order to classify 18 gene
727 populations. In the second part, we will demonstrate that several
728 statistical features characterizing different gene populations (in
729 particular the YRY(N)6YRY preferential occurrence and the periodicities)
730 can be retrieved from a simple Markov model based on the mixing of
731 the two oligonucleotides YRY(N)6 and YRY(N)3 and based on the percentages
732 of RYR and YRY in the unspecified trinucleotides (N)3 of YRY(N)6
733 and YRY(N)3. Several properties are identified and prove in particular
734 that the oligonucleotide mixing is an independent process and that
735 several different features are functions of a unique parameter. In
736 the third part, the return of the model to the reality shows a strong
737 correlation between reality and simulation concerning the presence
738 of a large alternating purine/pyrimidine stretches and of periodicities.
739 It also contributes to a greater understanding of biological reality,
740 e.g. the presence or the absence of large alternating purine/pyrimidine
741 stretches can be explained as being a simple consequence of the mixing
742 of two particular oligonucleotides. Finally, we believe that such
743 an approach is the first step toward a unified model of DNA sequence
744 evolution allowing the molecular understanding of both the origin
745 of life and the actual biological reality.},
746 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
747 Unité Associée CNRS No 822, France.},
748 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Genetics, Population;
751 medline-pst = {ppublish},
754 timestamp = {2011.05.05}
757 @ARTICLE{Arques1993a,
758 author = {D. G. Arquès and C. J. Michel and K. Orieux},
759 title = {Identification and simulation of new non-random statistical properties
760 common to different populations of eukaryotic non-coding genes.},
761 journal = {J Theor Biol},
767 abstract = {The autocorrelation function analysing the occurrence probability
768 of the i-motif YRY(N)iYRY in genes allows the identification of mainly
769 two periodicities modulo 2, 3 and the preferential occurrence of
770 the motif YRY(N)6YRY (R = purine = adenine or guanine, Y = pyrimidine
771 = cytosine or thymine, N = R or Y). These non-random genetic statistical
772 properties can be simulated by an independent mixing of the three
773 oligonucleotides YRYRYR, YRYYRY and YRY(N)6 (Arquès & Michel, 1990b).
774 The problem investigated in this study is whether new properties
775 can be identified in genes with other autocorrelation functions and
776 also simulated with an oligonucleotide mixing model. The two autocorrelation
777 functions analysing the occurrence probability of the i-motifs RRR(N)iRRR
778 and YYY(N)iYYY simultaneously identify three new non-random genetic
779 statistical properties: a short linear decrease, local maxima for
780 i identical to 3[6] (i = 3, 9, etc) and a large exponential decrease.
781 Furthermore, these properties are common to three different populations
782 of eukaryotic non-coding genes: 5' regions, introns and 3' regions
783 (see section 2). These three non-random properties can also be simulated
784 by an independent mixing of the four oligonucleotides R8, Y8, RRRYRYRRR,
785 YYYRYRYYY and large alternating R/Y series. The short linear decrease
786 is a result of R8 and Y8, the local maxima for i identical to 3[6],
787 of RRRYRYRRR and YYYRYRYYY, and the large exponential decrease, of
788 large alternating R/Y series (section 3). The biological meaning
789 of these results and their relation to the previous oligonucleotide
790 mixing model are presented in the Discussion.},
791 doi = {10.1006/jtbi.1993.1059},
792 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
793 d'Informatique de Besançon, France.},
794 keywords = {Animals; Biological Evolution; Genes, genetics; Models, Genetic; Models,
795 Statistical; Mutation, genetics; Oligonucleotides, genetics; Probability},
797 medline-pst = {ppublish},
799 pii = {S0022-5193(83)71059-3},
801 timestamp = {2011.05.05},
802 url = {http://dx.doi.org/10.1006/jtbi.1993.1059}
806 author = {David Arroyo and Gonzalo Alvarez and Veronica Fernandez},
807 title = {On the inadequacy of the logistic map for cryptographic applications},
808 journal = {X Reunión Española sobre Criptología y Seguridad de la Información
813 owner = {christophe},
814 timestamp = {2010.03.01}
817 @MISC{Backofen99algorithmicapproach,
818 author = {R. Backofen and S. Will and P. Clote},
819 title = {Algorithmic Approach To Quantifying The Hydrophobic Force Contribution
825 @inproceedings{Blum:1985:EPP:19478.19501,
826 author = {Blum, Manuel and Goldwasser, Shafi},
827 title = {An efficient probabilistic public key encryption scheme which hides all partial information},
828 booktitle = {Proceedings of CRYPTO 84 on Advances in cryptology},
830 isbn = {0-387-15658-5},
831 location = {Santa Barbara, California, United States},
834 url = {http://dl.acm.org/citation.cfm?id=19478.19501},
836 publisher = {Springer-Verlag New York, Inc.},
837 address = {New York, NY, USA},
838 keywords = {chosen cyphertext attack, integer factorization, partial information, passive adversaries, probabilistic encryption},
842 @INPROCEEDINGS{bcgr11:ip,
843 author = {Bahi, Jacques M. and Couchot, Jean-fran\c{c}ois and Guyeux, Christophe
844 and Richard, Adrien},
845 title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic
846 Boolean Discrete-Time Dynamical Systems},
847 booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory},
852 address = {Oslo, Norway},
856 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
862 author = {Bahi, Jacques M. and Guyeux, Christophe},
863 title = {Hash Functions Using Chaotic Iterations},
864 journal = {Journal of Algorithms \& Computational Technology},
870 doi = {10.1260/1748-3018.4.2.167},
871 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
876 url = {http://dx.doi.org/10.1260/1748-3018.4.2.167}
879 @INPROCEEDINGS{guyeux10ter,
880 author = {Bahi, Jacques M. and Guyeux, Christophe},
881 title = {A new chaos-based watermarking algorithm},
882 booktitle = {SECRYPT'10, Int. conf. on security and cryptography},
885 address = {Athens, Greece},
887 publisher = {SciTePress},
889 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
894 @INPROCEEDINGS{bgc11:ip,
895 author = {Bahi, Jacques M. and Guyeux, Christophe and Cote, Nathalie},
896 title = {Chaos of Protein Folding},
897 booktitle = {IJCNN 2011, Int. Joint Conf. on Neural Networks},
900 address = {San Jose, California, United States},
904 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
909 @INPROCEEDINGS{guyeux10bis,
910 author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},
911 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
913 booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications},
916 address = {Venice-Mestre, Italy},
919 doi = {10.1109/SENSORCOMM.2010.76},
920 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
923 url = {http://dx.doi.org/10.1109/SENSORCOMM.2010.76}
926 @INPROCEEDINGS{guyeuxVictoria,
927 author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},
928 title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism
929 versus Watermarking Approach},
930 booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks},
933 series = {Lecture Notes in ICST},
935 address = {Victoria, Canada},
938 doi = {10.1007/978-3-642-17994-5_23},
939 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
942 url = {http://dx.doi.org/10.1007/978-3-642-17994-5_23}
945 @INPROCEEDINGS{bgs11:ip,
946 author = {Bahi, Jacques M. and Guyeux, Christophe and Salomon, Michel},
947 title = {Building a Chaotic Proven Neural Network},
948 booktitle = {ICCANS 2011, IEEE Int. Conf. on Computer Applications and Network
952 address = {Maldives, Maldives},
955 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
960 @INPROCEEDINGS{bgw10:ip,
961 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
962 title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application
964 booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining},
969 address = {Sanya, China},
972 doi = {10.1007/978-3-642-16515-3_26},
973 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
976 url = {http://dx.doi.org/10.1007/978-3-642-16515-3_26}
979 @INPROCEEDINGS{bgw09:ip,
980 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
981 title = {A novel pseudo-random generator based on discrete chaotic iterations},
982 booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet},
985 address = {Cannes, France},
988 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
993 @INPROCEEDINGS{bmg10:onp,
994 author = {Bahi, Jacques M. and Makhoul, Abdallah and Guyeux, Christophe},
995 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
996 Networks for critical applications},
997 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
998 et Applications Critiques de Surveillance},
1000 address = {Bayonne, France},
1002 note = {Communication orale},
1004 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1009 @INPROCEEDINGS{guyeuxBayonne,
1010 author = {Bahi, Jacques M. and Makhoul, Abdallah and Guyeux, Christophe},
1011 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
1012 Networks for critical applications},
1013 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
1014 et Applications Critiques de Surveillance},
1016 address = {Bayonne, France},
1018 note = {Communication orale},
1025 author = {Bahi, Jacques M. and Salomon, Michel},
1026 title = {A Decentralized Energy-based Diffusion Algorithm to Increase the
1027 Lifetime of {MANETs}},
1028 journal = {Computer Networks Journal},
1031 note = {Accepted manuscript. To appear},
1032 classement = {ACLI},
1034 impact-factor = {1.201},
1037 publisher = {Elsevier}
1041 author = {J. M. Bahi},
1042 title = {Boolean totally asynchronous iterations},
1043 journal = {Int. Journal of Mathematical Algorithms},
1048 timestamp = {17/02/2008}
1051 @ARTICLE{Bahi2000bis,
1052 author = {Jacques M. Bahi},
1053 title = {Asynchronous iterative algorithms for nonexpansive linear systems},
1054 journal = {Journal of Parallel and Distributed Computing},
1059 timestamp = {2009.01.10}
1063 author = {J. M. Bahi},
1064 title = {Parallel synchronous chaotic iterations for singular linear systems},
1065 journal = {Parallel Algorithms and Applications},
1070 timestamp = {17/02/2008}
1074 author = {Jacques M. Bahi},
1075 title = {Algorithmes paralleles asynchrones pour les systemes singuliers},
1076 journal = {Comptes Rendus de l'Academie des Sciences},
1078 volume = {t. 326, serie 1},
1079 pages = {1421--1425},
1081 timestamp = {2009.01.18}
1085 author = {Jacques M. Bahi},
1086 title = {Méthodes itératives dans des espaces produits. Application au calcul
1088 school = {Université de Franche-Comté},
1090 type = {Habilitation à diriger des recherches},
1091 owner = {christophe},
1092 timestamp = {2010.08.24}
1096 author = {Jacques M. Bahi},
1097 title = {Algorithmes asynchrones pour des systèmes différentiels-algébriques.
1098 Simulation numérique sur des exemples de circuits électriques},
1099 school = {Université de Franche-Comté},
1101 owner = {christophe},
1102 timestamp = {2010.08.24}
1106 author = {Jacques M. Bahi and Sylvain Contassot-Vivier},
1107 title = {Basins of attraction in fully asynchronous discrete-time discrete-state
1109 journal = {IEEE Transactions on Neural Networks},
1116 timestamp = {2009.12.04}
1120 author = {J.~M. Bahi and S. Contassot-Vivier},
1121 title = {Stability of fully asynchronous discrete-time discrete state dynamic
1123 journal = {IEEE Transactions on Neural Networks},
1126 pages = {1353-1363},
1128 timestamp = {2009.02.14}
1131 @TECHREPORT{bcgg10:ir,
1132 author = {Bahi, J. M. and Couchot, J.-F. and Grasset, O. and Guyeux, C.},
1133 title = {{D}iscrete {D}ynamical {S}ystems: {N}ecessary {D}ivergence {C}onditions
1134 for {S}ynchronous {I}terations},
1135 institution = {LIFC - Laboratoire d'{I}nformatique de l'{U}niversit\'{e} de {F}ranche
1138 type = {Research Report},
1139 number = {RR2010-04},
1141 pdf = {/~publis/papers/pub/2010/RR2010-04.pdf}
1145 author = {Bahi, Jacques M. and Guyeux, Christophe},
1146 title = {Hash Functions Using Chaotic Iterations},
1147 journal = {Journal of Algorithms \& Computational Technology},
1152 classement = {ACLNI},
1153 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1155 impact-factor = {#},
1160 @INPROCEEDINGS{guyeux10,
1161 author = {Bahi, Jacques M. and Guyeux, Christophe},
1162 title = {Topological chaos and chaotic iterations, application to Hash functions},
1163 booktitle = {WCCI'10, IEEE World Congress on Computational Intelligence},
1166 address = {Barcelona, Spain},
1168 note = {Best paper award},
1169 classement = {ACTI},
1170 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1176 author = {Jacques M. Bahi and Christophe Guyeux},
1177 title = {A chaos-based approach for information hiding security.},
1178 howpublished = {arXiv},
1181 institution = {Computer Science Laboratory LIFC, University of Franche-Comte, France}
1185 author = {Jacques M. Bahi and Christophe Guyeux},
1186 title = {A watermarking algorithm satisfying topological chaos properties},
1189 volume = {abs/0810.4713},
1190 bibsource = {DBLP, http://dblp.uni-trier.de},
1191 ee = {http://arxiv.org/abs/0810.4713}
1195 author = {Jacques M. Bahi and Christophe Guyeux},
1196 title = {Chaotic iterations and topological chaos},
1198 abstract = {Chaotic iterations have been introduced on the one hand by Chazan,
1199 Miranker [5] and Miellou [9] in a numerical analysis context, and
1200 on the other hand by Robert [11] and Pellegrin [10] in the discrete
1201 dynamical systems framework. In both cases, the objective was to
1202 derive conditions of convergence of such iterations to a fixed state.
1203 In this paper, a new point of view is presented, the goal here is
1204 to derive conditions under which chaotic iterations admit a chaotic
1205 behaviour in a rigorous mathematical sense. Contrary to what has
1206 been studied in the literature, convergence is not desired. More
1207 precisely, we establish in this paper a link between the concept
1208 of chaotic iterations on a finite set and the notion of topological
1209 chaos [8], [6], [7]. We are motivated by concrete applications of
1210 our approach, such as the use of chaotic boolean iterations in the
1211 computer security field. Indeed, the concept of chaos is used in
1212 many areas of data security without real rigorous theoretical foundations,
1213 and without using the fundamental properties that allow chaos. The
1214 wish of this paper is to bring a bit more mathematical rigour in
1216 citeseerurl = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
1218 comments = {6 pages},
1219 eprint = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
1220 oai2identifier = {0810.3154},
1222 timestamp = {2008.10.23},
1223 url = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}}
1226 @ARTICLE{arxivRNNchaos,
1227 author = {Jacques M. Bahi and Christophe Guyeux and Michel Salomon},
1228 title = {Building a Chaotic Proved Neural Network},
1231 volume = {abs/1101.4351},
1232 ee = {http://arxiv.org/abs/1101.4351}
1235 @INPROCEEDINGS{guyeuxTaiwan10,
1236 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
1237 title = {Improving random number generators by chaotic iterations. Application
1239 booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling},
1241 pages = {V13-643--V13-647},
1242 address = {Taiyuan, China},
1244 classement = {ACTI},
1245 doi = {10.1109/ICCASM.2010.5622199},
1246 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1249 url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199}
1253 author = {Jacques M Bahi and Christian J Michel},
1254 title = {A stochastic model of gene evolution with time dependent pseudochaotic
1256 journal = {Bull Math Biol},
1262 abstract = {We develop here a new class of stochastic models of gene evolution
1263 in which a random subset of the 64 possible trinucleotides mutates
1264 at each evolutionary time t according to some time dependent substitution
1265 probabilities. Therefore, at each time t, the numbers and the types
1266 of mutable trinucleotides are unknown. Thus, the mutation matrix
1267 changes at each time t. This pseudochaotic model developed generalizes
1268 the standard model in which all the trinucleotides mutate at each
1269 time t. It determines the occurrence probabilities at time t of trinucleotides
1270 which pseudochaotically mutate according to 3 time dependent substitution
1271 parameters associated with the 3 trinucleotide sites. The main result
1272 proves that under suitable assumptions, this pseudochaotic model
1273 converges to a uniform probability vector identical to that of the
1274 standard model. Furthermore, an application of this pseudochaotic
1275 model allows an evolutionary study of the 3 circular codes identified
1276 in both eukaryotic and prokaryotic genes. A circular code is a particular
1277 set of trinucleotides whose main property is the retrieval of the
1278 frames in genes locally, i.e., anywhere in genes and particularly
1279 without start codons, and automatically with a window of a few nucleotides.
1280 After a certain evolutionary time and with particular time dependent
1281 functions for the 3 substitution parameters, precisely an exponential
1282 decrease in the 1st and 2nd trinucleotide sites and an exponential
1283 increase in the 3rd one, this pseudochaotic model retrieves the main
1284 statistical properties of the 3 circular codes observed in genes.
1285 Furthermore, it leads to a circular code asymmetry stronger than
1286 the standard model (nonpseudochaotic) and, therefore, to a better
1287 correlation with the genes.},
1288 doi = {10.1007/s11538-008-9376-4},
1289 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
1290 90016, Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
1291 keywords = {Evolution, Molecular; Genes; Models, Genetic; Mutation; Stochastic
1294 medline-pst = {ppublish},
1297 timestamp = {2011.05.05},
1298 url = {http://dx.doi.org/10.1007/s11538-008-9376-4}
1302 author = {Jacques M Bahi and Christian J Michel},
1303 title = {A stochastic model of gene evolution with chaotic mutations.},
1304 journal = {J Theor Biol},
1310 abstract = {We develop here a new class of stochastic models of gene evolution
1311 in which the mutations are chaotic, i.e. a random subset of the 64
1312 possible trinucleotides mutates at each evolutionary time t according
1313 to some substitution probabilities. Therefore, at each time t, the
1314 numbers and the types of mutable trinucleotides are unknown. Thus,
1315 the mutation matrix changes at each time t. The chaotic model developed
1316 generalizes the standard model in which all the trinucleotides mutate
1317 at each time t. It determines the occurrence probabilities at time
1318 t of trinucleotides which chaotically mutate according to three substitution
1319 parameters associated with the three trinucleotide sites. Two theorems
1320 prove that this chaotic model has a probability vector at each time
1321 t and that it converges to a uniform probability vector identical
1322 to that of the standard model. Furthermore, four applications of
1323 this chaotic model (with a uniform random strategy for the 64 trinucleotides
1324 and with a particular strategy for the three stop codons) allow an
1325 evolutionary study of the three circular codes identified in both
1326 eukaryotic and prokaryotic genes. A circular code is a particular
1327 set of trinucleotides whose main property is the retrieval of the
1328 frames in genes locally, i.e. anywhere in genes and particularly
1329 without start codons, and automatically with a window of a few nucleotides.
1330 After a certain evolutionary time and with particular values for
1331 the three substitution parameters, the chaotic models retrieve the
1332 main statistical properties of the three circular codes observed
1333 in genes. These applications also allow an evolutionary comparison
1334 between the standard and chaotic models.},
1335 doi = {10.1016/j.jtbi.2008.07.028},
1336 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
1337 90016 Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
1338 keywords = {Animals; Computer Simulation; DNA, Circular, genetics; Evolution,
1339 Molecular; Genetic Code; Models, Genetic; Mutation; Nonlinear Dynamics;
1340 Stochastic Processes; Time},
1342 medline-pst = {ppublish},
1344 pii = {S0022-5193(08)00395-0},
1346 timestamp = {2011.05.05},
1347 url = {http://dx.doi.org/10.1016/j.jtbi.2008.07.028}
1350 @ARTICLE{Bahi2008bis,
1351 author = {Bahi, J. M. and Michel, C. J.},
1352 title = {A stochastic model of gene evolution with chaotic mutations},
1353 journal = {Journal of Theoretical Biology},
1358 timestamp = {2009.01.10}
1362 author = {Jacques M Bahi and Christian J Michel},
1363 title = {A stochastic gene evolution model with time dependent mutations.},
1364 journal = {Bull Math Biol},
1370 abstract = {We develop here a new class of gene evolution models in which the
1371 nucleotide mutations are time dependent. These models allow to study
1372 nonlinear gene evolution by accelerating or decelerating the mutation
1373 rates at different evolutionary times. They generalize the previous
1374 ones which are based on constant mutation rates. The stochastic model
1375 developed in this class determines at some time t the occurrence
1376 probabilities of trinucleotides mutating according to 3 time dependent
1377 substitution parameters associated with the 3 trinucleotide sites.
1378 Therefore, it allows to simulate the evolution of the circular code
1379 recently observed in genes. By varying the class of function for
1380 the substitution parameters, 1 among 12 models retrieves after mutation
1381 the statistical properties of the observed circular code in the 3
1382 frames of actual genes. In this model, the mutation rate in the 3rd
1383 trinucleotide site increases during gene evolution while the mutation
1384 rates in the 1st and 2nd sites decrease. This property agrees with
1385 the actual degeneracy of the genetic code. This approach can easily
1386 be generalized to study evolution of motifs of various lengths, e.g.,
1387 dicodons, etc., with time dependent mutations.},
1388 doi = {10.1016/j.bulm.2003.10.004},
1389 institution = {LIFC - FRE CNRS 2661, IUT de Belfort, Université de Franche-Comté,
1390 BP 527, 90016 Belfort Cédex, France. bahi@iut-bm.univ-fcomte.fr},
1391 keywords = {Codon, genetics; Evolution, Molecular; Genes, genetics; Genetic Code,
1392 genetics; Models, Genetic; Mutation; Stochastic Processes},
1394 medline-pst = {ppublish},
1396 pii = {S0092824003001174},
1398 timestamp = {2011.05.05},
1399 url = {http://dx.doi.org/10.1016/j.bulm.2003.10.004}
1403 author = {J. Banks and J. Brooks and G. Cairns and P. Stacey},
1404 title = {On Devaney's Definition of Chaos},
1405 journal = {Amer. Math. Monthly},
1411 timestamp = {27/01/2008}
1415 author = {E. Barker and A. Roginsky},
1416 title = {DRAFT NIST Special Publication 800-131 Recommendation for the Transitioning
1417 of Cryptographic Algorithms and Key Sizes},
1419 owner = {christophe},
1420 timestamp = {2010.08.18}
1424 author = {Mauro Barni and Franco Bartolini and Teddy Furon},
1425 title = {A general framework for robust watermarking security},
1426 journal = {Signal Processing},
1429 pages = {2069-2084},
1431 note = {Special issue on Security of Data Hiding Technologies, invited paper},
1432 bibsource = {DBLP, http://dblp.uni-trier.de},
1433 ee = {http://dx.doi.org/10.1016/S0165-1684(03)00168-3},
1435 timestamp = {2009.06.30}
1439 author = {Baudet, G\'{e}rard M.},
1440 title = {Asynchronous Iterative Methods for Multiprocessors},
1446 address = {New York, NY, USA},
1447 doi = {http://doi.acm.org/10.1145/322063.322067},
1453 author = {Didier El Baz},
1454 title = {Contribution à l'algorithmique parallèle. Le concept d'asynchronisme
1455 : étude théorique, mise en œuvre, et application},
1456 school = {Institut national polytechnique de Toulouse},
1458 type = {Habilitation à diriger des recherches},
1459 owner = {christophe},
1460 timestamp = {2010.08.24}
1464 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
1465 title = {Contention awareness and fault-tolerant scheduling for precedence
1466 constrained tasks in heterogeneous systems},
1467 journal = {Parallel Computing},
1473 doi = {10.1016/j.parco.2008.11.001},
1476 url = {http://dx.doi.org/10.1016/j.parco.2008.11.001}
1479 @INPROCEEDINGS{bhr08b:bl,
1480 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
1481 title = {Fault tolerant scheduling of precedence task graphs on heterogeneous
1483 booktitle = {IPDPS'08},
1486 publisher = {IEEE Computer Society Press},
1492 @INPROCEEDINGS{Berger98,
1493 author = {Berger, Bonnie and Leighton, Tom},
1494 title = {Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete},
1495 booktitle = {Proceedings of the second annual international conference on Computational
1498 series = {RECOMB '98},
1500 address = {New York, NY, USA},
1503 isbn = {0-89791-976-9},
1504 location = {New York, New York, United States},
1509 title = {Parallel and distributed computation: numerical methods},
1510 publisher = {Prentice-Hall, Inc.},
1512 author = {Bertsekas, Dimitri P. and Tsitsiklis, John N.},
1513 address = {Upper Saddle River, NJ, USA},
1514 isbn = {0-13-648700-9}
1517 @MISC{Bertsekas88paralleland,
1518 author = {Dimitri P. Bertsekas and John N. Tsitsiklis},
1519 title = {Parallel and distributed iterative algorithms: a selective survey},
1524 author = {F. Blanchard and E. Glasner and S. Kolyada and A.Maass},
1525 title = {On Li-Yorke pairs},
1529 timestamp = {2008.01.02}
1533 author = {F. Blanchard and B. Host and S. Ruette},
1534 title = {Asymptotic pairs in positive-entropy systems},
1536 optannote = {to appear in Ergod. Th. Dynam. Sys.},
1539 timestamp = {2008.01.02}
1543 author = {Dan Boneh and Matt Franklin},
1544 title = {Identity-Based Encryption from the {Weil} Pairing},
1545 journal = {SIAM J. of Computing},
1550 note = {Extended abstract in Crypto'01}
1553 @INCOLLECTION{boneh,
1554 author = {Boneh, Dan and Goh, Eu-Jin and Nissim, Kobbi},
1555 title = {Evaluating 2-DNF Formulas on Ciphertexts},
1558 abstract = {Let ψ be a 2-DNF formula on boolean variables x 1,..., x n ∈ {0,1}.
1559 We present a homomorphic public key encryption scheme that allows
1560 the public evaluation of ψ given an encryption of the variables x
1561 1,..., x n. In other words, given the encryption of the bits x 1,...,
1562 x n, anyone can create the encryption of ψ( x 1,..., x n). More generally,
1563 we can evaluate quadratic multi-variate polynomials on ciphertexts
1564 provided the resulting value falls within a small set. We present
1565 a number of applications of the system: 1 In a database of size n,
1566 the total communication in the basic step of the Kushilevitz-Ostrovsky
1567 PIR protocol is reduced from to . 2 An efficient election system
1568 based on homomorphic encryption where voters do not need to include
1569 non-interactive zero knowledge proofs that their ballots are valid.
1570 The election system is proved secure without random oracles but still
1571 efficient. 3 A protocol for universally verifiable computation.},
1572 citeulike-article-id = {2719460},
1573 citeulike-linkout-0 = {http://www.springerlink.com/content/wtt5caxkr94laxkg},
1574 journal = {Theory of Cryptography},
1575 keywords = {homomorphic, pairings},
1576 posted-at = {2008-04-25 21:53:15},
1578 url = {http://www.springerlink.com/content/wtt5caxkr94laxkg}
1582 author = {Bonneau, Richard and Baker, David},
1583 title = {AB INITIO PROTEIN STRUCTURE PREDICTION: Progress and Prospects},
1584 journal = {Annual Review of Biophysics and Biomolecular Structure},
1589 doi = {10.1146/annurev.biophys.30.1.173}
1593 author = {R. Bowen},
1594 title = {Entropy for group endomorphisms and homogeneous spaces},
1595 journal = {Trans. Amer. Math. Soc.},
1600 timestamp = {15/02/2008}
1604 author = {R. Bowen},
1605 title = {Periodic points and measures for Axiom A diffeomorphisms},
1606 journal = {Trans. Amer. Math. Soc.},
1611 timestamp = {15/02/2008}
1614 @ARTICLE{Braxenthaler97,
1615 author = {Michael Braxenthaler and R. Ron Unger and Ditza Auerbach and John
1617 title = {Chaos in protein dynamics},
1618 journal = {Proteins-structure Function and Bioinformatics},
1622 doi = {10.1002/(SICI)1097-0134(199712)29:4<417::AID-PROT2>3.3.CO;2-O},
1626 @INPROCEEDINGS{Brumley03remotetiming,
1627 author = {David Brumley and Dan Boneh},
1628 title = {Remote Timing Attacks are Practical},
1629 booktitle = {Proceedings of the 12th USENIX Security Symposium},
1634 @ARTICLE{Bohm1991375,
1635 author = {Gerald Böhm},
1636 title = {Protein folding and deterministic chaos: Limits of protein folding
1637 simulations and calculations},
1638 journal = {Chaos, Solitons \& Fractals},
1641 pages = {375 - 382},
1643 doi = {DOI: 10.1016/0960-0779(91)90028-8},
1645 url = {http://www.sciencedirect.com/science/article/B6TJ4-46CBXVT-1X/2/370489c218e4c2732cd9b620ef50c696}
1648 @INCOLLECTION{Cachin2004,
1649 author = {Cachin, Christian},
1650 title = {An Information-Theoretic Model for Steganography},
1651 booktitle = {Information Hiding},
1652 publisher = {Springer Berlin / Heidelberg},
1655 series = {Lecture Notes in Computer Science},
1657 affiliation = {MIT Laboratory for Computer Science 545 Technology Square Cambridge
1662 author = {H. Cam and S. Ozdemir and P. Nair and D. Muthuavinashinappan and
1664 title = {ESPDA: Energy-efficient secure pattern based data aggregation for
1665 wireless sensor networks.},
1666 journal = {Computer Communication journal (29)},
1671 @ARTICLE{CarletCZ98,
1672 author = {Claude Carlet and Pascale Charpin and Victor Zinoviev},
1673 title = {Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems},
1674 journal = {Des. Codes Cryptography},
1679 bibsource = {DBLP, http://dblp.uni-trier.de}
1682 @INPROCEEDINGS{Castelluccia05efficientaggregation,
1683 author = {Claude Castelluccia},
1684 title = {Efficient aggregation of encrypted data in wireless sensor networks},
1685 booktitle = {MobiQuitous},
1688 publisher = {IEEE Computer Society}
1692 author = {Cayre, F. and Bas, P.},
1693 title = {Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding},
1694 journal = {IEEE Transactions on Information Forensics and Security},
1699 doi = {10.1109/TIFS.2007.916006},
1701 keywords = {cryptography, random sequences, spread spectrum communication, telecommunication
1702 security, watermarking, Kerckhoffs-based embedding security classes,
1703 WOA Data Hiding, pseudorandom sequences, spread-spectrum techniques,
1704 steganography security, watermark-only-attack, watermarking, Security,
1705 spread-spectrum (SS) watermarking},
1707 timestamp = {2009.06.29}
1711 author = {Cayre, F. and Fontaine, C. and Furon, T.},
1712 title = {Watermarking security: theory and practice},
1713 journal = {IEEE Transactions on Signal Processing},
1716 pages = {3976--3987},
1718 doi = {10.1109/TSP.2005.855418},
1720 keywords = {blind source separation, cryptography, watermarking, Fisher information
1721 matrix, blind source separation, cryptanalysis, information theory,
1722 spread spectrum techniques, substitutive scheme, watermarking security,
1723 Blind source separation, Fisher information matrix, equivocation,
1724 security, watermarking},
1726 timestamp = {2009.06.29}
1729 @ARTICLE{Chajakis91,
1730 author = {Chajakis, Emmanuel D. and Zenios, Stavros A.},
1731 title = {Synchronous and asynchronous implementations of relaxation algorithms
1732 for nonlinear network optimization},
1733 journal = {Parallel Comput.},
1738 address = {Amsterdam, The Netherlands, The Netherlands},
1739 doi = {http://dx.doi.org/10.1016/S0167-8191(05)80072-9},
1741 publisher = {Elsevier Science Publishers B. V.}
1745 author = {Chan, Haowen and Perrig, Adrian and Przydatek, Bartosz and Song,
1747 title = {SIA: Secure information aggregation in sensor networks},
1748 journal = {J. Comput. Secur.},
1753 address = {Amsterdam, The Netherlands, The Netherlands},
1755 publisher = {IOS Press}
1758 @ARTICLE{Chandramouli06,
1759 author = {R. Chandramouli and S. Bapatla and K.P. Subbalakshmi},
1760 title = {Battery power-aware encryption},
1761 journal = {ACM transactions on information and system security},
1764 owner = {christophe},
1765 timestamp = {2010.07.31}
1769 author = {Pascale Charpin},
1770 title = {A description of some extended cyclic codes with application to Reed-Solomon
1772 journal = {Discrete Mathematics},
1777 bibsource = {DBLP, http://dblp.uni-trier.de},
1778 ee = {http://dx.doi.org/10.1016/0012-365X(85)90019-6}
1782 author = {D. Chazan and W. Miranker},
1783 title = {Chaotic relaxation},
1784 journal = {Linear algebra and its applications},
1788 timestamp = {2008.05.22}
1792 author = {Cheon, Jung Hee and Kim, Woo-Hwan and Nam, Hyun Soo},
1793 title = {Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy
1794 homomorphism scheme},
1795 journal = {Inf. Process. Lett.},
1800 address = {Amsterdam, The Netherlands, The Netherlands},
1801 doi = {http://dx.doi.org/10.1016/j.ipl.2005.09.016},
1803 publisher = {Elsevier North-Holland, Inc.}
1806 @MISC{Cheon03acryptanalysis,
1807 author = {Jung Hee Cheon and Hyun Soo Nam},
1808 title = {A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy
1814 author = {R.C.C. Cheung and N.J. Telle and W. Luk and P.Y.K. Cheung},
1815 title = {Secure encrypted-data aggregation for wireless sensor networks},
1816 journal = {IEEE Trans. on Very Large Scale Integration Systems},
1819 pages = {1048-1059},
1823 @ARTICLE{Chivian2005,
1824 author = {Chivian, Dylan and Kim, David E. and Malmström, Lars and Schonbrun,
1825 Jack and Rohl, Carol A. and Baker, David},
1826 title = {Prediction of CASP6 structures using automated robetta protocols},
1827 journal = {Proteins},
1833 keywords = {Rosetta, fragment assembly, de novo modeling, homology modeling, parametric
1834 alignment ensemble},
1835 owner = {christophe},
1836 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
1837 timestamp = {2011.01.22},
1838 url = {http://dx.doi.org/10.1002/prot.20733}
1842 author = {Congxu, Zhu and Xuefeng, Liao and Zhihua, Li},
1843 title = {Chaos-based multipurpose image watermarking algorithm},
1844 journal = {Wuhan University Journal of Natural Sciences},
1847 pages = {1675-1678},
1848 note = {10.1007/BF02831848},
1849 abstract = {To achieve the goal of image content authentication and copyright
1850 protection simultaneously, this paper presents a novel image dual
1851 watermarking method based on chaotic map. Firstly, the host image
1852 was split into many nonoverlapping small blocks, and the block-wise
1853 discrete cosine transform (DCT) is computed. Secondly, the robust
1854 watermarks, shuffled by the chaotic sequences, are embedded in the
1855 DC coefficients of blocks to achieve the goal of copyright protection.
1856 The semi-fragile watermarks, generated by chaotic map, are embedded
1857 in the AC coefficients of blocks to obtain the aim of image authentication.
1858 Both of them can be extracted without the original image. Simulation
1859 results demonstrate the effectiveness of our algorithm in terms of
1860 robustness and fragility.},
1861 affiliation = {Central South University School of Information Science and Engineering
1862 410083 Changsha, Hunan China},
1865 keyword = {Mathematics, general},
1866 publisher = {Wuhan University, co-published with Springer},
1867 url = {http://dx.doi.org/10.1007/BF02831848}
1870 @ARTICLE{Conley1978,
1871 author = {C. Conley},
1872 title = {Isolated invariant sets and the Morse index},
1873 journal = {CBMS Regional Conference. AMS.},
1877 timestamp = {2008.01.02}
1881 author = {Philippe Cornu and André Smolarz},
1882 title = {Image characterization by texture},
1883 journal = {Traitement du signal},
1887 file = {:/home/guyeux/Documents/Bibliotheque/These/Watermarking/Caractérisation d'images par textures associées.pdf:PDF},
1889 timestamp = {2008.05.12}
1892 @INPROCEEDINGS{Cox99,
1893 author = {Ingemar Cox and Matt L. Miller and Andrew L. Mckellips},
1894 title = {Watermarking as Communications With Side Information},
1895 booktitle = {Proceedings of the IEEE},
1897 pages = {1127--1141},
1898 owner = {christophe},
1899 timestamp = {2010.03.06}
1902 @ARTICLE{Cox97securespread,
1903 author = {Ingemar J. Cox and Senior Member and Joe Kilian and F. Thomson Leighton
1905 title = {Secure spread spectrum watermarking for multimedia},
1906 journal = {IEEE Transactions on Image Processing},
1909 pages = {1673--1687}
1913 author = {Christopher Cramer and Erol Gelenbe and Hakan Bakircioglu},
1914 title = {Video Compression with Random Neural Networks},
1915 journal = {Neural Networks for Identification, Control, and Robotics, International
1920 address = {Los Alamitos, CA, USA},
1921 isbn = {0-8186-7456-3},
1922 publisher = {IEEE Computer Society}
1925 @INPROCEEDINGS{Crescenzi98,
1926 author = {Crescenzi, Pierluigi and Goldman, Deborah and Papadimitriou, Christos
1927 and Piccolboni, Antonio and Yannakakis, Mihalis},
1928 title = {On the complexity of protein folding (extended abstract)},
1929 booktitle = {Proceedings of the thirtieth annual ACM symposium on Theory of computing},
1931 series = {STOC '98},
1933 address = {New York, NY, USA},
1936 isbn = {0-89791-962-9},
1937 location = {Dallas, Texas, United States},
1942 author = {Zhao Dawei and Chen Guanrong and Liu Wenbo},
1943 title = {A chaos-based robust wavelet-domain watermarking algorithm},
1944 journal = {Chaos, Solitons and Fractals},
1949 timestamp = {2008.10.07}
1953 author = {Anthony Desnos and Robert Erra and Eric Filiol},
1954 title = {Processor-Dependent Malware... and codes},
1956 comment = {arXiv:1011.1638},
1957 eprint = {arXiv:1011.1638}
1961 title = {An Introduction to Chaotic Dynamical Systems},
1962 publisher = {Addison-Wesley},
1964 author = {Devaney, Robert L.},
1965 address = {Redwood City, CA},
1970 author = {Whitfield Diffie and Martin E. Hellman},
1971 title = {New Directions in Cryptography},
1972 journal = {IEEE Transactions on Information Theory},
1977 date = {November 1976},
1979 timestamp = {2009.06.30},
1980 url = {citeseer.ist.psu.edu/diffie76new.html}
1983 @INCOLLECTION{Dijk10,
1984 author = {van Dijk, Marten and Gentry, Craig and Halevi, Shai and Vaikuntanathan,
1986 title = {Fully Homomorphic Encryption over the Integers},
1987 booktitle = {Advances in Cryptology – EUROCRYPT 2010},
1988 publisher = {Springer Berlin / Heidelberg},
1990 editor = {Gilbert, Henri},
1992 series = {Lecture Notes in Computer Science},
1994 abstract = {We construct a simple fully homomorphic encryption scheme, using only
1995 elementary modular arithmetic. We use Gentry’s technique to construct
1996 a fully homomorphic scheme from a bootstrappable somewhat homomorphic
1997 scheme. However, instead of using ideal lattices over a polynomial
1998 ring, our bootstrappable encryption scheme merely uses addition and
1999 multiplication over the integers. The main appeal of our scheme is
2000 the conceptual simplicity. We reduce the security of our scheme to
2001 finding an approximate integer gcd – i.e., given a list of integers
2002 that are near-multiples of a hidden integer, output that hidden integer.
2003 We investigate the hardness of this task, building on earlier work
2004 of Howgrave-Graham.},
2005 affiliation = {MIT CSAIL}
2009 author = {Dill, KA},
2010 title = {Theory for the folding and stability of globular proteins.},
2011 journal = {Biochemistry},
2017 abstract = {Using lattice statistical mechanics, we develop theory to account
2018 for the folding of a heteropolymer molecule such as a protein to
2019 the globular and soluble state. Folding is assumed to be driven by
2020 the association of solvophobic monomers to avoid solvent and opposed
2021 by the chain configurational entropy. Theory predicts a phase transition
2022 as a function of temperature or solvent character. Molecules that
2023 are too short or too long or that have too few solvophobic residues
2024 are predicted not to fold. Globular molecules should have a largely
2025 solvophobic core, but there is an entropic tendency for some residues
2026 to be "out of place", particularly in small molecules. For long chains,
2027 molecules comprised of globular domains are predicted to be thermodynamically
2028 more stable than spherical molecules. The number of accessible conformations
2029 in the globular state is calculated to be an exceedingly small fraction
2030 of the number available to the random coil. Previous estimates of
2031 this number, which have motivated kinetic theories of folding, err
2032 by many tens of orders of magnitude.},
2033 comment = {Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't, P.H.S.,},
2034 keywords = {Mathematics, Models, Chemical, Polymers, Protein Conformation},
2035 owner = {christophe},
2036 timestamp = {2011.01.22},
2037 url = {http://ukpmc.ac.uk/abstract/MED/3986190}
2041 author = {Dill, KA and Bromberg, S and Yue, K and Fiebig, KM and Yee, DP and
2042 Thomas, PD and Chan, HS},
2043 title = {Principles of protein folding--a perspective from simple exact models.},
2044 journal = {Protein Sci},
2047 pages = {561-602--},
2050 abstract = {General principles of protein structure, stability, and folding kinetics
2051 have recently been explored in computer simulations of simple exact
2052 lattice models. These models represent protein chains at a rudimentary
2053 level, but they involve few parameters, approximations, or implicit
2054 biases, and they allow complete explorations of conformational and
2055 sequence spaces. Such simulations have resulted in testable predictions
2056 that are sometimes unanticipated: The folding code is mainly binary
2057 and delocalized throughout the amino acid sequence. The secondary
2058 and tertiary structures of a protein are specified mainly by the
2059 sequence of polar and nonpolar monomers. More specific interactions
2060 may refine the structure, rather than dominate the folding code.
2061 Simple exact models can account for the properties that characterize
2062 protein folding: two-state cooperativity, secondary and tertiary
2063 structures, and multistage folding kinetics--fast hydrophobic collapse
2064 followed by slower annealing. These studies suggest the possibility
2065 of creating "foldable" chain molecules other than proteins. The encoding
2066 of a unique compact chain conformation may not require amino acids;
2067 it may require only the ability to synthesize specific monomer sequences
2068 in which at least one monomer type is solvent-averse.},
2069 address = {Department of Pharmaceutical Chemistry, University of California,
2070 San Francisco 94143-1204, USA.},
2071 comment = {Review,Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't,
2072 Non-P.H.S.,Research Support, U.S. Gov't, P.H.S.,},
2073 keywords = {Amino Acid Sequence, Biological Evolution, Hydrogen Bonding, Models,
2074 Molecular, Molecular Sequence Data, Mutation, Protein Conformation,
2075 Protein Denaturation, Protein Folding, Temperature, Thermodynamics},
2076 owner = {christophe},
2077 timestamp = {2011.01.22},
2078 url = {http://ukpmc.ac.uk/abstract/MED/7613459}
2081 @INPROCEEDINGS{Dobbertin96,
2082 author = {Dobbertin, Hans},
2083 title = {Cryptanalysis of MD4},
2084 booktitle = {Proceedings of the Third International Workshop on Fast Software
2088 address = {London, UK},
2089 publisher = {Springer-Verlag},
2090 isbn = {3-540-60865-6}
2093 @INPROCEEDINGS{DomingoFerrer2002,
2094 author = {Domingo-Ferrer, Josep},
2095 title = {A Provably Secure Additive and Multiplicative Privacy Homomorphism},
2096 booktitle = {ISC '02: Proceedings of the 5th International Conference on Information
2100 address = {London, UK},
2101 publisher = {Springer-Verlag},
2102 isbn = {3-540-44270-7}
2105 @ARTICLE{Dubchak1995,
2106 author = {I. Dubchak and I. Muchnik and S. R. Holbrook and S. H. Kim},
2107 title = {Prediction of protein folding class using global description of amino
2109 journal = {Proc Natl Acad Sci U S A},
2112 pages = {8700--8704},
2115 __markedentry = {[guyeux]},
2116 abstract = {We present a method for predicting protein folding class based on
2117 global protein chain description and a voting process. Selection
2118 of the best descriptors was achieved by a computer-simulated neural
2119 network trained on a data base consisting of 83 folding classes.
2120 Protein-chain descriptors include overall composition, transition,
2121 and distribution of amino acid attributes, such as relative hydrophobicity,
2122 predicted secondary structure, and predicted solvent exposure. Cross-validation
2123 testing was performed on 15 of the largest classes. The test shows
2124 that proteins were assigned to the correct class (correct positive
2125 prediction) with an average accuracy of 71.7\%, whereas the inverse
2126 prediction of proteins as not belonging to a particular class (correct
2127 negative prediction) was 90-95\% accurate. When tested on 254 structures
2128 used in this study, the top two predictions contained the correct
2129 class in 91\% of the cases.},
2130 institution = {Department of Chemistry, University of California, Berkeley 94720,
2132 keywords = {Amino Acid Sequence; Amino Acids, chemistry; Computer Simulation;
2133 Databases, Factual; Models, Chemical; Neural Networks (Computer);
2134 Protein Folding; Protein Structure, Secondary; Proteins, chemistry/classification;
2135 Reproducibility of Results; Solvents},
2137 medline-pst = {ppublish},
2140 timestamp = {2011.07.18}
2144 title = {Real analysis and probability},
2145 publisher = {Cambridge University Press},
2146 author = {Richard M. Dudley},
2149 timestamp = {2008.01.02}
2153 author = {El Tarazi, Mouhamed Nabih},
2154 title = {Algorithmes mixtes asynchrones. Etude de convergence monotone},
2155 journal = {Numerische Mathematik},
2159 note = {10.1007/BF01405568},
2160 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
2164 keyword = {Mathematics and Statistics},
2165 publisher = {Springer Berlin / Heidelberg},
2166 url = {http://dx.doi.org/10.1007/BF01405568}
2170 author = {El Tarazi, Mouhamed Nabih},
2171 title = {Some convergence results for asynchronous algorithms},
2172 journal = {Numerische Mathematik},
2176 note = {10.1007/BF01407866},
2177 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
2178 Box 5969 Kuwait Kuwait},
2181 keyword = {Mathematics and Statistics},
2182 publisher = {Springer Berlin / Heidelberg},
2183 url = {http://dx.doi.org/10.1007/BF01407866}
2187 author = {Peng Fei and Qiu Shui-Sheng and Long Min},
2188 title = {A secure digital signature algorithm based on elliptic curve and
2190 journal = {Circuits Systems Signal Processing},
2192 volume = {24, No. 5},
2195 timestamp = {2009.01.16}
2198 @BOOK{Feigenbaum1908,
2199 title = {Universal behavior in nonlinear systems},
2200 publisher = {Los Alamos Science},
2202 author = {Feigenbaum},
2204 timestamp = {2008.01.02}
2207 @ARTICLE{Felsenstein1980,
2208 author = {J. Felsenstein},
2209 title = {A view of population genetics.},
2210 journal = {Science},
2216 doi = {10.1126/science.208.4449.1253},
2218 medline-pst = {ppublish},
2220 pii = {208/4449/1253},
2222 timestamp = {2011.05.05},
2223 url = {http://dx.doi.org/10.1126/science.208.4449.1253}
2227 title = {Les virus informatiques : techniques virales et antivirales avancées},
2229 editor = {Springer},
2230 author = {Eric Filiol},
2231 owner = {christophe},
2232 timestamp = {2010.10.13}
2235 @INPROCEEDINGS{FiliolBlackHat,
2236 author = {Eric Filiol},
2237 title = {Passive and Active Leakage of Secret Data from Non Networked Computer},
2238 booktitle = {Black Hat},
2240 owner = {christophe},
2241 timestamp = {2010.11.28}
2244 @PHDTHESIS{Formenti2003,
2245 author = {Enrico Formenti},
2246 title = {De l'algorithmique du chaos dans les systèmes dynamiques discrets},
2247 school = {Université de Provence},
2250 timestamp = {2008.01.02}
2253 @PHDTHESIS{Formenti1998,
2254 author = {Enrico Formenti},
2255 title = {Automates cellulaires et chaos : de la vision topologique à la vision
2257 school = {\'Ecole Normale Supérieure de Lyon},
2259 optmonth = {Octobre},
2261 timestamp = {2008.01.02}
2265 author = {Gabriel Frey and Christian J Michel},
2266 title = {Identification of circular codes in bacterial genomes and their use
2267 in a factorization method for retrieving the reading frames of genes.},
2268 journal = {Comput Biol Chem},
2274 abstract = {We developed a statistical method that allows each trinucleotide to
2275 be associated with a unique frame among the three possible ones in
2276 a (protein coding) gene. An extensive gene study in 175 complete
2277 bacterial genomes based on this statistical approach resulted in
2278 identification of 72 new circular codes. Finding a circular code
2279 enables an immediate retrieval of the reading frame locally anywhere
2280 in a gene. No knowledge of location of the start codon is required
2281 and a short window of only a few nucleotides is sufficient for automatic
2282 retrieval. We have therefore developed a factorization method (that
2283 explores previously found circular codes) for retrieving the reading
2284 frames of bacterial genes. Its principle is new and easy to understand.
2285 Neither complex treatment nor specific information on the nucleotide
2286 sequences is necessary. Moreover, the method can be used for short
2287 regions in nucleotide sequences (less than 25 nucleotides in protein
2288 coding genes). Selected additional properties of circular codes and
2289 their possible biological consequences are also discussed.},
2290 doi = {10.1016/j.compbiolchem.2005.11.001},
2291 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
2292 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
2293 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
2294 keywords = {Base Sequence; Computational Biology; Genes, Bacterial; Genome, Bacterial;
2295 Genomics, statistics /&/ numerical data; Models, Genetic; Models,
2296 Statistical; Reading Frames},
2298 medline-pst = {ppublish},
2300 pii = {S1476-9271(05)00111-8},
2302 timestamp = {2011.05.05},
2303 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.11.001}
2307 author = {Gabriel Frey and Christian J Michel},
2308 title = {An analytical model of gene evolution with six mutation parameters:
2309 an application to archaeal circular codes.},
2310 journal = {Comput Biol Chem},
2316 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
2317 mutation matrix 64 x 64 with six substitution parameters associated
2318 with the transitions and transversions in the three trinucleotide
2319 sites. It generalizes the previous models based on the nucleotide
2320 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
2321 x 64 with three parameters. It determines at some time t the exact
2322 occurrence probabilities of trinucleotides mutating randomly according
2323 to six substitution parameters. An application of this model allows
2324 an evolutionary study of the common circular code COM and the 15
2325 archaeal circular codes X which have been recently identified in
2326 several archaeal genomes. The main property of a circular code is
2327 the retrieval of the reading frames in genes, both locally, i.e.
2328 anywhere in genes and in particular without a start codon, and automatically
2329 with a window of a few nucleotides. In genes, the circular code is
2330 superimposed on the traditional genetic one. Very unexpectedly, the
2331 evolutionary model demonstrates that the archaeal circular codes
2332 can derive from the common circular code subjected to random substitutions
2333 with particular values for six substitutions parameters. It has a
2334 strong correlation with the statistical observations of three archaeal
2335 codes in actual genes. Furthermore, the properties of these substitution
2336 rates allow proposal of an evolutionary classification of the 15
2337 archaeal codes into three main classes according to this model. In
2338 almost all the cases, they agree with the actual degeneracy of the
2339 genetic code with substitutions more frequent in the third trinucleotide
2340 site and with transitions more frequent that transversions in any
2341 trinucleotide site.},
2342 doi = {10.1016/j.compbiolchem.2005.09.001},
2343 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
2344 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
2345 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
2346 keywords = {Archaea, genetics; DNA, Circular; Evolution, Molecular; Genetic Code;
2347 Genome, Archaeal; Models, Genetic; Mutation; Trinucleotide Repeats},
2349 medline-pst = {ppublish},
2351 pii = {S1476-9271(05)00083-6},
2353 timestamp = {2011.05.05},
2354 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.09.001}
2357 @INPROCEEDINGS{fgb11:ip,
2358 author = {Friot, Nicolas and Guyeux, Christophe and Bahi, Jacques},
2359 title = {Chaotic Iterations for Steganography - Stego-security and chaos-security},
2360 booktitle = {SECRYPT'2011, Int. Conf. on Security and Cryptography},
2363 address = {Sevilla, Spain},
2366 classement = {ACTI},
2367 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2373 author = {Alain Frisch},
2374 title = {Entropie topologique et définition du chaos},
2376 note = {Rapport de tipe},
2377 file = {Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:Chaos/Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:PDF},
2378 keywords = {Chaos, Entropie Topologique, Tipe},
2380 timestamp = {2008.01.02},
2381 url = {http://alain.frisch.fr/math.html}
2385 author = {Alain Frisch},
2386 title = {Entropie topologique et définition du chaos},
2388 note = {[En ligne; Page disponible le 12-août-2010]},
2389 url = {\url{http://alain.frisch.fr/math.html}}
2392 @ARTICLE{Frommer97asynchronousweighted,
2393 author = {Andreas Frommer and Hartmut Schwandt and Daniel and Daniel B. Szyld},
2394 title = {Asynchronous Weighted Additive Schwarz Methods},
2395 journal = {Electronic Transactions on Numerical Analysis},
2401 @MISC{Frommer94asynchronoustwo-stage,
2402 author = {Andreas Frommer and Daniel B. Szyld},
2403 title = {Asynchronous Two-Stage Iterative Methods},
2408 title = {Introduction to Chaos and Coherence},
2409 publisher = {IOP Publishing},
2411 author = {J. Frøyland},
2413 timestamp = {2008.01.02}
2417 author = {T. Furon},
2418 title = {Security analysis},
2420 note = {European Project IST-1999-10987 CERTIMARK, Deliverable D.5.5},
2422 timestamp = {2009.06.30}
2426 author = {Furon, Teddy and Bas, Patrick},
2427 title = {Broken arrows},
2428 journal = {EURASIP J. Inf. Secur.},
2432 address = {New York, NY, United States},
2433 doi = {http://dx.doi.org/10.1155/2008/597040},
2435 owner = {christophe},
2436 publisher = {Hindawi Publishing Corp.},
2437 timestamp = {2010.03.06}
2440 @ARTICLE{P1150442004,
2441 author = {G.S.El-Taweel and H.M. Onsi and M.Samy and M.G. Darwish},
2442 title = {Secure and Non-Blind Watermarking Scheme for Color Images Based on
2444 journal = {ICGST International Journal on Graphics, Vision and Image Processing},
2450 owner = {christophe},
2451 timestamp = {2010.03.07}
2454 @INPROCEEDINGS{Gentry09,
2455 author = {Gentry, Craig},
2456 title = {Fully homomorphic encryption using ideal lattices},
2457 booktitle = {STOC '09: Proceedings of the 41st annual ACM symposium on Theory
2461 address = {New York, NY, USA},
2463 doi = {http://doi.acm.org/10.1145/1536414.1536440},
2464 isbn = {978-1-60558-506-2},
2465 location = {Bethesda, MD, USA}
2468 @INPROCEEDINGS{Girao04,
2469 author = {J. Girao and M. Schneider and D. Westhoff},
2470 title = {CDA: Concealed data aggregation in wireless sensor networks},
2471 booktitle = {Proceedings of the ACM Workshop on Wireless Security},
2473 owner = {christophe},
2474 timestamp = {2010.07.31}
2477 @CONFERENCE{Gotsman88,
2478 author = {C. Gotsman and D. Lehmann and E. Shamir},
2479 title = {Asynchronous Dynamics of Random Boolean Networks},
2480 booktitle = {San Diego '88 Neural Networks Conference},
2483 timestamp = {30/03/2008}
2486 @ARTICLE{Guckenheimer1979,
2487 author = {J. Guckenheimer},
2488 title = {Sensitive dependence to initial conditions for one-dimensional maps},
2489 journal = {Comm. Math. Phys.},
2491 optpages = {133-160},
2493 timestamp = {2008.01.02}
2497 title = {Nonlinear oscillations, dynamical systems, and bifurcations of vector
2499 publisher = {Springer Verlag},
2501 author = {J. Guckenheimer and P. Holmes},
2503 timestamp = {2008.01.02}
2506 @ARTICLE{Guo20093201,
2507 author = {Wei Guo and Xiaoming Wang and Dake He and Yang Cao},
2508 title = {Cryptanalysis on a parallel keyed hash function based on chaotic
2510 journal = {Physics Letters A},
2513 pages = {3201 - 3206},
2515 abstract = {This Letter analyzes the security of a novel parallel keyed hash function
2516 based on chaotic maps, proposed by Xiao et al. to improve the efficiency
2517 in parallel computing environment. We show how to devise forgery
2518 attacks on Xiao's scheme with differential cryptanalysis and give
2519 the experiment results of two kinds of forgery attacks firstly. Furthermore,
2520 we discuss the problem of weak keys in the scheme and demonstrate
2521 how to utilize weak keys to construct collision.},
2523 keywords = {Cryptanalysis}
2526 @PHDTHESIS{GuyeuxThese10,
2527 author = {Christophe Guyeux},
2528 title = {Le d\'{e}sordre des it\'{e}rations chaotiques et leur utilit\'{e}
2529 en s\'{e}curit\'{e} informatique},
2530 school = {Universit\'{e} de Franche-Comt\'{e}},
2532 owner = {christophe},
2533 timestamp = {2010.12.21}
2537 author = {Guyeux, Christophe and Bahi, Jacques},
2538 title = {\'Etude topologique de l'\'etalement de spectre},
2539 howpublished = {Journ\'ees Codes et St\'eganographie, \'Ecoles Militaires de Saint-Cyr,
2544 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2549 @INPROCEEDINGS{bg10:ip,
2550 author = {Guyeux, Christophe and Bahi, Jacques},
2551 title = {An improved watermarking algorithm for Internet applications},
2552 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
2555 address = {Valencia, Spain},
2557 classement = {ACTI},
2558 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2563 @INPROCEEDINGS{gfb10:ip,
2564 author = {Guyeux, Christophe and Friot, Nicolas and Bahi, Jacques},
2565 title = {Chaotic iterations versus Spread-spectrum: chaos and stego security},
2566 booktitle = {IIH-MSP'10, 6-th Int. Conf. on Intelligent Information Hiding and
2567 Multimedia Signal Processing},
2570 address = {Darmstadt, Germany},
2572 classement = {ACTI},
2573 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2579 author = {Christophe Guyeux and Nicolas Friot and Jacques M. Bahi},
2580 title = {A more secure information hiding scheme than spread-spectrum obtained
2582 journal = {arXiv 0032565},
2585 timestamp = {2010.04.30}
2589 title = {Guide to Elliptic Curve Cryptography},
2590 publisher = {Springer Professional Computing},
2592 editor = {Springer},
2593 author = {D. Hankerson and A. Menezes and S. Vanstone},
2594 owner = {christophe},
2595 timestamp = {2010.07.31}
2598 @ARTICLE{Hasegawa1985,
2599 author = {M. Hasegawa and H. Kishino and T. Yano},
2600 title = {Dating of the human-ape splitting by a molecular clock of mitochondrial
2602 journal = {J Mol Evol},
2607 abstract = {A new statistical method for estimating divergence dates of species
2608 from DNA sequence data by a molecular clock approach is developed.
2609 This method takes into account effectively the information contained
2610 in a set of DNA sequence data. The molecular clock of mitochondrial
2611 DNA (mtDNA) was calibrated by setting the date of divergence between
2612 primates and ungulates at the Cretaceous-Tertiary boundary (65 million
2613 years ago), when the extinction of dinosaurs occurred. A generalized
2614 least-squares method was applied in fitting a model to mtDNA sequence
2615 data, and the clock gave dates of 92.3 +/- 11.7, 13.3 +/- 1.5, 10.9
2616 +/- 1.2, 3.7 +/- 0.6, and 2.7 +/- 0.6 million years ago (where the
2617 second of each pair of numbers is the standard deviation) for the
2618 separation of mouse, gibbon, orangutan, gorilla, and chimpanzee,
2619 respectively, from the line leading to humans. Although there is
2620 some uncertainty in the clock, this dating may pose a problem for
2621 the widely believed hypothesis that the pipedal creature Australopithecus
2622 afarensis, which lived some 3.7 million years ago at Laetoli in Tanzania
2623 and at Hadar in Ethiopia, was ancestral to man and evolved after
2624 the human-ape splitting. Another likelier possibility is that mtDNA
2625 was transferred through hybridization between a proto-human and a
2626 proto-chimpanzee after the former had developed bipedalism.},
2627 keywords = {Animals; Biological Evolution; DNA, Mitochondrial, genetics; Genes;
2628 Haplorhini, genetics; Humans; Mathematics; Models, Genetic; Nucleic
2629 Acid Hybridization; Primates, genetics; Proteins, genetics; Species
2632 medline-pst = {ppublish},
2635 timestamp = {2011.05.05}
2639 title = {A First Course in Discrete Dynamical Systems},
2640 publisher = {Springer-Verlag},
2642 author = {R. Homlgren},
2645 timestamp = {2008.01.02}
2648 @INCOLLECTION{Hoque09,
2649 author = {Hoque, Md. and Chetty, Madhu and Sattar, Abdul},
2650 title = {Genetic Algorithm in Ab Initio Protein Structure Prediction Using
2651 Low Resolution Model: A Review},
2652 booktitle = {Biomedical Data and Applications},
2653 publisher = {Springer Berlin Heidelberg},
2655 editor = {Sidhu, Amandeep and Dillon, Tharam},
2657 series = {Studies in Computational Intelligence},
2659 affiliation = {IIIS, Griffith University, Nathan, QLD-4111 Australia}
2662 @CONFERENCE{Houmansadr09,
2663 author = {A. Houmansadr and N. Kiyavash and N. Borisov},
2664 title = {Rainbow: A robust and invisible non-blind watermark for network flows},
2665 booktitle = {NDSS’09: 16th Annual Network and Distributed System Security Symposium},
2667 owner = {christophe},
2668 timestamp = {2010.03.07}
2672 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J.},
2673 title = {Secure encrypted-data aggregation for wireless sensor networks},
2674 journal = {Wireless Networks},
2675 abstract = {Abstract\ \ This paper proposes a secure encrypted-data
2676 aggregation scheme for wireless sensor networks. Our design for data
2677 aggregation eliminates redundant sensor readings without using encryption
2678 and maintains data secrecy and privacy during transmission. Conventional
2679 aggregation functions operate when readings are received in plaintext.
2680 If readings are encrypted, aggregation requires decryption creating
2681 extra overhead and key management issues. In contrast to conventional
2682 schemes, our proposed scheme provides security and privacy, and duplicate
2683 instances of original readings will be aggregated into a single packet.
2684 Our scheme is resilient to known-plaintext attacks, chosen-plaintext
2685 attacks, ciphertext-only attacks and man-in-the-middle attacks. Our
2686 experiments show that our proposed aggregation method significantly
2687 reduces communication overhead and can be practically implemented
2688 in on-the-shelf sensor platforms.},
2689 citeulike-article-id = {4499496},
2690 citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11276-009-0177-y},
2691 citeulike-linkout-1 = {http://www.springerlink.com/content/g573138072642u63},
2692 doi = {10.1007/s11276-009-0177-y},
2693 posted-at = {2009-05-10 09:55:44},
2694 url = {http://dx.doi.org/10.1007/s11276-009-0177-y}
2698 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J. D.},
2699 title = {Secure encrypted-data aggregation for wireless sensor networks},
2700 journal = {Wirel. Netw.},
2705 address = {Hingham, MA, USA},
2706 doi = {http://dx.doi.org/10.1007/s11276-009-0177-y},
2708 publisher = {Kluwer Academic Publishers}
2712 author = {W. Huang and X. Ye},
2713 title = {Homeomorphisms with the whole compacta being scrambled sets},
2714 journal = {Ergod. Th. Dynam. Systems},
2720 timestamp = {2008.01.02}
2723 @ARTICLE{Hurley1982,
2724 author = {M. Hurley},
2725 title = {Attractors, persistence and density of their bassin},
2726 journal = {Transactions of AMS},
2728 optpages = {247-271},
2731 timestamp = {2008.01.02}
2734 @INPROCEEDINGS{Islam:2009:NMA:1695134.1695181,
2735 author = {Islam, Md. Kamrul and Chetty, Madhu},
2736 title = {Novel Memetic Algorithm for Protein Structure Prediction},
2737 booktitle = {Proceedings of the 22nd Australasian Joint Conference on Advances
2738 in Artificial Intelligence},
2742 address = {Berlin, Heidelberg},
2743 publisher = {Springer-Verlag},
2745 isbn = {978-3-642-10438-1},
2746 keywords = {Guided search space, Memetic Algorithm, Modified fitness function,
2747 Pair-wise-interchange, Schema preservation, Tabu Search},
2748 location = {Melbourne, Australia},
2752 @PHDTHESIS{Jacquemard77,
2753 author = {C. Jacquemard},
2754 title = {Contribution à l'étude d'algorithmes à convergence monotone},
2755 school = {Université de Franche-Comté},
2757 owner = {christophe},
2758 timestamp = {2010.08.25}
2762 title = {{Evolution of Protein Molecules}},
2763 publisher = {Academy Press},
2765 editor = {Munro, H. N.},
2766 author = {Jukes, T. H. and Cantor, C. R.},
2767 booktitle = {Evolution of Protein Molecules},
2768 citeulike-article-id = {1673661},
2769 keywords = {compbio, fresco},
2770 posted-at = {2007-09-19 06:23:18},
2774 @INPROCEEDINGS{Kalker2001,
2775 author = {Kalker, T.},
2776 title = {Considerations on watermarking security},
2779 abstract = {In this paper we address the usually implicit assumption that digital
2780 watermarking has as its main target copyright and copy protection
2781 applications. From these target applications a great many conclusions
2782 are drawn about the required security of a watermarking system, and
2783 in fact, a considerably percentage of the watermarking literature
2784 has this very topic as its main focus of attention. In this paper
2785 we take a step back, and try to do a more careful analysis of the
2786 'watermarking-is-for-security-applications' paradigm. The intention
2787 of this paper is to discuss the meaning of the concept security in
2788 the context of watermarking, and try to show that one has to be careful
2789 in using analogies from the related field of cryptography},
2790 citeulike-article-id = {1226513},
2791 journal = {2001 IEEE Fourth Workshop on Multimedia Signal Processing},
2792 keywords = {security, wateramarking},
2794 posted-at = {2007-04-14 14:30:06},
2796 timestamp = {2009.06.30}
2799 @ARTICLE{Kerckhoffs83,
2800 author = {Kerckhoffs, Auguste},
2801 title = {La cryptographie militaire},
2802 journal = {Journal des sciences militaires},
2807 abstract = {pp. 161–191, Feb. 1883.},
2808 citeulike-article-id = {505508},
2809 keywords = {cryptography, master},
2811 posted-at = {2006-02-15 04:49:15},
2813 timestamp = {2009.06.30}
2817 author = {Kimura, Motoo},
2818 title = {A simple method for estimating evolutionary rates of base substitutions
2819 through comparative studies of nucleotide sequences},
2820 journal = {Journal of Molecular Evolution},
2824 note = {10.1007/BF01731581},
2825 affiliation = {National Institute of Genetics 411 Mishima Japan},
2828 keyword = {Biomedical and Life Sciences},
2829 publisher = {Springer New York},
2830 url = {http://dx.doi.org/10.1007/BF01731581}
2835 title = {Chaos Without Nonperiodicity},
2836 journal = {Amer. Math. Monthly},
2840 timestamp = {27/01/2008}
2843 @PHDTHESIS{Knudsen1994a,
2844 author = {C. Knudsen},
2845 title = {Aspects of noninvertible dynamics and chaos},
2846 school = {Technical University of Denmark},
2849 timestamp = {2008.01.02}
2853 author = {L. Kocarev and J. Szczepanski and J.M. Amigo and I. Tomovski},
2854 title = {Discrete Chaos - I: Theory},
2855 journal = {IEEE Trans. on Circuits Systems},
2858 pages = {1300-1309},
2859 owner = {christophe},
2860 timestamp = {2010.10.10}
2863 @INPROCEEDINGS{Kocher95cryptanalysisof,
2864 author = {Paul C. Kocher},
2865 title = {Cryptanalysis of Diffie-Hellman, RSA, DSS, and Other Systems Using
2866 Timing Attacks (Extended Abstract)},
2867 booktitle = {Advances in Cryptology, CRYPTO '95: 15th Annual International Cryptology
2871 publisher = {Springer-Verlag}
2874 @ARTICLE{Kullback1951,
2875 author = {Kullback, Solomon and Leibler, Richard A.},
2876 title = {On Information and Sufficiency},
2877 journal = {The Annals of Mathematical Statistics},
2882 citeulike-article-id = {3245942},
2883 keywords = {file-import-08-09-12},
2885 posted-at = {2008-09-12 14:30:37},
2887 timestamp = {2009.06.29}
2891 author = {Eshter Ledoux},
2892 title = {Introduction à la théorie du chaos},
2894 note = {[En ligne; Page disponible le 12-août-2010]},
2895 url = {\url{http://www.nux.be/eledoux/mem/node1.html}}
2899 title = {Analyse en dimension finie},
2900 publisher = {Masson},
2906 timestamp = {2008.01.02}
2910 author = {A.K. Lenstra and E.R. Verheul},
2911 title = {Selecting Cryptographic Key Sizes},
2912 journal = {Jour. of the International Association for Cryptologic Research},
2920 author = {Lettvin, J.Y. and Maturana, H.R. and McCulloch, W.S. and Pitts, W.H.},
2921 title = {What the Frog's Eye Tells the Frog's Brain},
2922 journal = {Proceedings of the IRE},
2927 owner = {christophe},
2928 timestamp = {2010.12.21}
2932 author = {T. Y. Li and J. A. Yorke},
2933 title = {Period three implies chaos},
2934 journal = {Amer. Math. Monthly},
2940 timestamp = {27/01/2008}
2944 author = {Li, Yantao and Deng, Shaojiang and Xiao, Di},
2945 title = {A novel Hash algorithm construction based on chaotic neural network},
2946 journal = {Neural Computing and Applications},
2949 affiliation = {Chongqing University College of Computer Science 400044 Chongqing
2952 keyword = {Computer Science},
2953 publisher = {Springer London}
2956 @INPROCEEDINGS{Lin09,
2957 author = {Lin, Hua-Yi and Chiang, Tzu-Chiang},
2958 title = {Cooperative secure data aggregation in sensor networks using elliptic
2959 curve based cryptosystems},
2960 booktitle = {CDVE'09: Proceedings of the 6th international conference on Cooperative
2961 design, visualization, and engineering},
2964 address = {Berlin, Heidelberg},
2965 publisher = {Springer-Verlag},
2966 isbn = {3-642-04264-3, 978-3-642-04264-5},
2967 location = {Luxembourg, Luxembourg}
2970 @INPROCEEDINGS{Liu2008,
2971 author = {Liu, An and Ning, Peng},
2972 title = {TinyECC: A Configurable Library for Elliptic Curve Cryptography in
2973 Wireless Sensor Networks},
2974 booktitle = {7th International Conference on Information Processing in Sensor
2975 Networks (IPSN 2008)},
2979 citeulike-article-id = {3041699},
2980 howpublished = {SPOTS Track},
2982 posted-at = {2008-07-25 05:25:05},
2986 @ARTICLE{Liu2007bis,
2987 author = {Shao-Hui Liu and Hong-Xun Yao and Wen Gao and Yong-Liang Liu},
2988 title = {An image fragile watermark scheme based on chaotic image pattern
2990 journal = {Applied Mathematics and Computation},
2995 timestamp = {2008.10.07}
2998 @INPROCEEDINGS{Liu07,
2999 author = {Liu, Zhen and Xi, Lifeng},
3000 title = {Image Information Hiding Encryption Using Chaotic Sequence},
3001 booktitle = {KES '07: Knowledge-Based Intelligent Information and Engineering
3002 Systems and the XVII Italian Workshop on Neural Networks on Proceedings
3003 of the 11th International Conference},
3006 address = {Berlin, Heidelberg},
3007 publisher = {Springer-Verlag},
3008 doi = {http://dx.doi.org/10.1007/978-3-540-74827-4_26},
3009 isbn = {978-3-540-74826-7},
3010 location = {Vietri sul Mare, Italy}
3014 author = {Zhen Liu and Lifeng Xi},
3015 title = {Image Information Hiding Encryption Using Chaotic Sequence},
3021 timestamp = {11/04/2008}
3024 @ARTICLE{Lubachevsky86,
3025 author = {Lubachevsky, Boris and Mitra, Debasis},
3026 title = {A chaotic asynchronous algorithm for computing the fixed point of
3027 a nonnegative matrix of unit spectral radius},
3033 address = {New York, NY, USA},
3034 doi = {http://doi.acm.org/10.1145/4904.4801},
3040 author = {{L}arger, {L}. and {D}udley, {J}.{M}.},
3041 title = { {N}onlinear dynamics {O}ptoelectronic chaos},
3042 journal = {{N}ature },
3048 abstract = {{O}ptoelectronic circuits with delayed feedback provide a convenient
3049 bench-top platform to study a wide range of nonlinear dynamic systems,
3050 from ultrastable clocks to complex chaotic devices.},
3051 affiliation = {{F}ranche-{C}omt{\'e} {\'E}lectronique {M}{\'e}canique, {T}hermique
3052 et {O}ptique - {S}ciences et {T}echnologies - {FEMTO}-{ST} - {CNRS}
3053 : {UMR}6174 - {U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {U}niversit{\'e}
3054 de {T}echnologie de {B}elfort-{M}ontbeliard - {E}cole {N}ationale
3055 {S}up{\'e}rieure de {M}{\'e}canique et des {M}icrotechniques },
3056 audience = {internationale },
3058 doi = {10.1038/465041a },
3059 hal_id = {hal-00517696},
3060 language = {{A}nglais},
3061 url = {http://hal.archives-ouvertes.fr/hal-00517696/en/}
3064 @INPROCEEDINGS{Mahoney00,
3065 author = {Mahoney, Matthew V.},
3066 title = {Fast Text Compression with Neural Networks},
3067 booktitle = {Proceedings of the Thirteenth International Florida Artificial Intelligence
3068 Research Society Conference},
3071 publisher = {AAAI Press},
3073 isbn = {1-57735-113-4},
3077 @INPROCEEDINGS{msp10:bl,
3078 author = {Makhoul, Abdallah and Saadi, Rachid and Pham, Congduc},
3079 title = {Risk Management in Intrusion Detection Applications with Wireless
3080 Video Sensor Networks},
3081 booktitle = {WCNC'10 IEEE Int. Conf.},
3084 address = {Sydney, Australia},
3093 author = {H.S. Malvar and D. Florêncio},
3094 title = {Improved Spread Spectrum: A New Modulation Technique for Robust Watermarking},
3095 journal = {IEEE Trans. Signal Proceeding},
3099 owner = {christophe},
3100 timestamp = {2010.03.07}
3103 @ARTICLE{Marsaglia2003,
3104 author = {G. Marsaglia},
3105 title = {Xorshift RNGs},
3106 journal = {Journal of Statistical Software},
3111 timestamp = {2009.10.28}
3114 @ARTICLE{Marsaglia1996,
3115 author = {G. Marsaglia},
3116 title = {DIEHARD: a battery of tests of randomness.},
3117 journal = {http://stat.fsu.edu/~geo/diehard.html},
3120 timestamp = {2009.11.09}
3123 @ARTICLE{Simard07testu01:a,
3124 author = {Richard Simard and Université De Montréal},
3125 title = {TestU01: A C library for empirical testing of random number generators},
3126 journal = {ACM Transactions on Mathematical Software},
3131 @ARTICLE{DefiningChaos,
3132 author = {M. Martelli and M. Dang and T. Seph},
3133 title = {Defining chaos},
3134 journal = {Mathematics Magazine},
3138 owner = {christophe},
3139 timestamp = {2010.08.11}
3142 @ARTICLE{Michel2007c,
3143 author = {Christian J Michel},
3144 title = {An analytical model of gene evolution with 9 mutation parameters:
3145 an application to the amino acids coded by the common circular code.},
3146 journal = {Bull Math Biol},
3152 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
3153 mutation matrix 64 x 64 with nine substitution parameters associated
3154 with the three types of substitutions in the three trinucleotide
3155 sites. It generalizes the previous models based on the nucleotide
3156 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
3157 x 64 with three and six parameters. It determines at some time t
3158 the exact occurrence probabilities of trinucleotides mutating randomly
3159 according to these nine substitution parameters. An application of
3160 this model allows an evolutionary study of the common circular code
3161 [Formula: see text] of eukaryotes and prokaryotes and its 12 coded
3162 amino acids. The main property of this code [Formula: see text] is
3163 the retrieval of the reading frames in genes, both locally, i.e.
3164 anywhere in genes and in particular without a start codon, and automatically
3165 with a window of a few nucleotides. However, since its identification
3166 in 1996, amino acid information coded by [Formula: see text] has
3167 never been studied. Very unexpectedly, this evolutionary model demonstrates
3168 that random substitutions in this code [Formula: see text] and with
3169 particular values for the nine substitutions parameters retrieve
3170 after a certain time of evolution a frequency distribution of these
3171 12 amino acids very close to the one coded by the actual genes.},
3172 doi = {10.1007/s11538-006-9147-z},
3173 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
3174 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
3175 67400 Illkirch, France. michel@dpt-info.u-strasbg.fr},
3176 keywords = {Amino Acids, genetics; Codon, genetics; Eukaryotic Cells; Evolution,
3177 Molecular; Models, Genetic; Prokaryotic Cells},
3179 medline-pst = {ppublish},
3182 timestamp = {2011.05.05},
3183 url = {http://dx.doi.org/10.1007/s11538-006-9147-z}
3187 author = {J.-C. Miellou},
3188 title = {Algorithmes de relaxation chaotique \`{a} retards},
3194 timestamp = {2008.05.22}
3197 @ARTICLE{Miellou75b,
3198 author = {Miellou, J.-C.},
3199 title = {Itérations chaotiques à retards, étude de la convergence dans le
3200 cas d'espaces partiellement ordonnés},
3201 journal = {C.R.A.S. Paris},
3205 owner = {christophe},
3206 timestamp = {2010.08.17}
3210 author = {Jean-Claude Miellou and Pierre Spitéri},
3211 title = {Un critère de convergence pour des méthodes générales de point fixe},
3212 journal = {Rairo -- Modélisation mathématique et analyse numérique},
3217 owner = {christophe},
3218 timestamp = {2010.10.13}
3222 author = {Aidan Mooney and John G. Keating and Ioannis Pitas},
3223 title = {A comparative study of chaotic and white noise signals in digital
3225 journal = {Chaos, Solitons and Fractals},
3229 owner = {christophe},
3230 timestamp = {2010.03.01}
3233 @ARTICLE{Nakashima2003,
3234 author = {Nakashima, Y. and Tachibana, R. and Babaguchi, N.},
3235 title = {Watermarked Movie Soundtrack Finds the Position of the Camcorder
3237 journal = {IEEE Transactions on Multimedia},
3239 note = {Accepted for future publication Multimedia}
3242 @INCOLLECTION{springerlink:10.1007/978-3-642-04431-1_16,
3243 author = {Nelson, Michael and Nahapetian, Ani and Koushanfar, Farinaz and Potkonjak,
3245 title = {SVD-Based Ghost Circuitry Detection},
3246 booktitle = {Information Hiding},
3247 publisher = {Springer Berlin / Heidelberg},
3249 editor = {Katzenbeisser, Stefan and Sadeghi, Ahmad-Reza},
3251 series = {Lecture Notes in Computer Science},
3253 note = {10.1007/978-3-642-04431-1_16},
3254 affiliation = {Computer Science Department, UCLA, Los Angeles, CA 90095, USA},
3255 url = {http://dx.doi.org/10.1007/978-3-642-04431-1_16}
3258 @INPROCEEDINGS{Perez-Hernandez09,
3259 author = {P\'{e}rez-Hern\'{a}ndez, Luis Germ\'{a}n and Rodr\'{\i}guez-V\'{a}zquez,
3260 Katya and Gardu\~{n}o-Ju\'{a}rez, Ram\'{o}n},
3261 title = {Parallel particle swarm optimization applied to the protein folding
3263 booktitle = {Proceedings of the 11th Annual conference on Genetic and evolutionary
3266 series = {GECCO '09},
3267 pages = {1791--1792},
3268 address = {New York, NY, USA},
3271 isbn = {978-1-60558-325-9},
3272 keywords = {bioinformatics, biology and chemistry, combinatorial optimization,
3273 parallelization, swarm intelligence},
3274 location = {Montreal, Qu\&\#233;bec, Canada},
3278 @PHDTHESIS{Pellegrin1986,
3279 author = {D. Pellegrin},
3280 title = {Algorithmique discr\`{e}te et r\'{e}seaux d'automates},
3281 school = {Grenoble},
3284 timestamp = {2008.05.22}
3288 author = {F. Peng and S.-S. Qiu and M. Long},
3289 title = {One way Hash function construction based on two-dimensional hyperchaotic
3291 journal = {Acta Phys. Sinici.},
3296 timestamp = {2009.01.16}
3299 @INPROCEEDINGS{Perez06,
3300 author = {Luis Perez-Freire and F. Pérez-gonzalez and Pedro Comesaña},
3301 title = {Secret Dither Estimation in Lattice-Quantization Data Hiding: A Set-Membership
3303 booktitle = {Security, Steganography, and Watermarking of Multimedia Contents},
3305 editor = {Edward J. Delp and Ping W. Wong},
3306 address = {San Jose, California, USA},
3308 organization = {SPIE},
3310 timestamp = {2009.06.30}
3313 @INPROCEEDINGS{Perez-Freire06,
3314 author = {Luis Perez-Freire and Pedro Comesana and Juan Ramon Troncoso-Pastoriza
3315 and Fernando Perez-Gonzalez},
3316 title = {Watermarking Security: a Survey},
3317 booktitle = {LNCS Transactions on Data Hiding and Multimedia Security},
3320 timestamp = {2009.06.29}
3323 @PROCEEDINGS{Peter07,
3324 title = {On Concealed Data Aggregation for WSNs},
3326 author = {Peter, Steffen and Piotrowski, Krzysztof and Langendoerfer, Peter},
3327 booktitle = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
3329 citeulike-article-id = {2281643},
3330 citeulike-linkout-0 = {http://dx.doi.org/10.1109/CCNC.2007.45},
3331 citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4199133},
3332 doi = {10.1109/CCNC.2007.45},
3333 journal = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
3337 posted-at = {2008-01-23 19:36:19},
3339 url = {http://dx.doi.org/10.1109/CCNC.2007.45}
3343 author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid},
3344 title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor
3345 Networks for Critical Surveillance Applications},
3346 journal = {Journal of Network and Computer Applications},
3351 note = {Accepted manuscript. To appear},
3352 classement = {ACLI},
3354 impact-factor = {1.111},
3356 isi-acro = {J NETW COMPU APPL},
3357 publisher = {Springer}
3361 author = {Edgar Alan Poe},
3362 title = {The Raven},
3365 note = {American Museum (Baltimore)},
3366 owner = {christophe},
3367 timestamp = {2010.11.23}
3370 @ARTICLE{Perez-Freire2006:Security,
3371 author = {L. P{\'e}rez-Freire and F. P{\'e}rez-González and T. Furon and P.
3373 title = {Security of lattice-based data hiding against the known message attack},
3374 journal = {IEEE Trans. on Information Forensics and Security},
3381 timestamp = {2009.12.06}
3384 @MISC{Quisquater02sidechannel,
3385 author = {J-J. Quisquater and D. Samyde and Université Catholique De Louvain
3387 title = {Side Channel Cryptanalysis},
3391 @ARTICLE{Raynal2001,
3392 author = {Frédéric Raynal and Fabien A. P. Petitcolas and Caroline Fontaine},
3393 title = {Evaluation automatique des méthodes de tatouage},
3394 journal = {Traitement du signal},
3399 timestamp = {2008.05.21}
3403 author = {Vincent Rijmen and Elisabeth Oswald},
3404 title = {Update on SHA-1},
3405 howpublished = {Cryptology ePrint Archive, Report 2005/010},
3407 note = {\url{http://eprint.iacr.org/}}
3411 title = {Discrete Iterations, a Metric Study},
3412 publisher = {Springer-Verlag},
3414 editor = {Berlin Heidelberg New-York},
3415 author = {François Robert},
3417 series = {Series in Computational Mathematics}
3421 title = {Discrete Iterations: A Metric Study},
3423 editor = {Springer-Verlag},
3424 author = {F. Robert},
3426 series = {Springer Series in Computational Mathematics},
3428 timestamp = {17/02/2008}
3432 author = {Rudenko, O. and Snytkin, M.},
3433 title = {Image compression based on the neural network art},
3434 journal = {Cybernetics and Systems Analysis},
3438 affiliation = {Kharkov National University of Radio Electronics Kharkov Ukraine},
3441 keyword = {Computer Science},
3442 publisher = {Springer New York}
3445 @PHDTHESIS{Ruette2001,
3446 author = {Sylvie Ruette},
3447 title = {Chaos en dynamique topologique, en particulier sur l'intervalle,
3448 mesures d'entropie maximale},
3449 school = {Université d'Aix-Marseille II},
3451 optmonth = {Novembre},
3453 timestamp = {2008.01.02}
3456 @MASTERSTHESIS{Saulnier02,
3457 author = {Boris Saulnier},
3458 title = {Entropie topologique},
3459 school = {DEA Sémantique, Preuves et Langages, Paris 7},
3461 owner = {christophe},
3462 timestamp = {2010.08.12}
3465 @ARTICLE{Schmitz2001,
3466 author = {Roland Schmitz},
3467 title = {Use of chaotic dynamical systems in cryptography},
3468 journal = {Journal of Franklin Institute},
3473 timestamp = {17/02/2008}
3477 title = {Analyse: topologie g\'{e}n\'{e}rale et analyse fonctionnelle},
3478 publisher = {Hermann},
3481 author = {Laurent Schwartz},
3482 owner = {christophe},
3483 timestamp = {2010.09.15}
3487 author = {Shannon, Claude E.},
3488 title = {Communication Theory of Secrecy Systems},
3489 journal = {Bell Systems Technical Journal},
3493 citeulike-article-id = {507362},
3494 keywords = {master, secrecy\_systems, teoria-informacao, theory\_communication,
3495 theory\_cryptography},
3497 posted-at = {2006-02-16 23:24:09},
3499 timestamp = {2009.06.29}
3502 @ARTICLE{Shmygelska05,
3503 author = {Shmygelska, Alena and Hoos, Holger},
3504 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
3505 polar protein folding problem},
3506 journal = {BMC Bioinformatics},
3511 abstract = {BACKGROUND:The protein folding problem is a fundamental problems in
3512 computational molecular biology and biochemical physics. Various
3513 optimisation methods have been applied to formulations of the ab-initio
3514 folding problem that are based on reduced models of protein structure,
3515 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
3516 and hybrid approaches. In our work, we have introduced an ant colony
3517 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
3518 hard (NP-hard) combinatorial problem of predicting a protein's conformation
3519 from its amino acid sequence under a widely studied, conceptually
3520 simple model - the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
3521 (HP) model.RESULTS:We present an improvement of our previous ACO
3522 algorithm for the 2D HP model and its extension to the 3D HP model.
3523 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
3524 than previous state-of-the-art algorithms on sequences whose native
3525 conformations do not contain structural nuclei (parts of the native
3526 fold that predominantly consist of local interactions) at the ends,
3527 but rather in the middle of the sequence, and that it generally finds
3528 a more diverse set of native conformations.CONCLUSIONS:The application
3529 of ACO to this bioinformatics problem compares favourably with specialised,
3530 state-of-the-art methods for the 2D and 3D HP protein folding problem;
3531 our empirical results indicate that our rather simple ACO algorithm
3532 scales worse with sequence length but usually finds a more diverse
3533 ensemble of native states. Therefore the development of ACO algorithms
3534 for more complex and realistic models of protein structure holds
3535 significant promise.},
3536 doi = {10.1186/1471-2105-6-30},
3538 pubmedid = {15710037}
3541 @OTHER{Shmygelska2005Feb,
3542 __markedentry = {[christophe]},
3543 abstract = {Abstract Background The protein folding problem is a fundamental problems
3544 in computational molecular biology and biochemical physics. Various
3545 optimisation methods have been applied to formulations of the ab-initio
3546 folding problem that are based on reduced models of protein structure,
3547 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
3548 and hybrid approaches. In our work, we have introduced an ant colony
3549 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
3550 hard (NP-hard) combinatorial problem of predicting a protein's conformation
3551 from its amino acid sequence under a widely studied, conceptually
3552 simple model – the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
3553 (HP) model. Results We present an improvement of our previous ACO
3554 algorithm for the 2D HP model and its extension to the 3D HP model.
3555 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
3556 than previous state-of-the-art algorithms on sequences whose native
3557 conformations do not contain structural nuclei (parts of the native
3558 fold that predominantly consist of local interactions) at the ends,
3559 but rather in the middle of the sequence, and that it generally finds
3560 a more diverse set of native conformations. Conclusions The application
3561 of ACO to this bioinformatics problem compares favourably with specialised,
3562 state-of-the-art methods for the 2D and 3D HP protein folding problem;
3563 our empirical results indicate that our rather simple ACO algorithm
3564 scales worse with sequence length but usually finds a more diverse
3565 ensemble of native states. Therefore the development of ACO algorithms
3566 for more complex and realistic models of protein structure holds
3567 significant promise.},
3568 author = {Shmygelska, Alena and Hoos, Holger H},
3569 journal = {BMC Bioinformatics. 2005 Feb 14},
3571 owner = {christophe},
3573 timestamp = {2011.01.24},
3574 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
3575 polar protein folding problem},
3581 author = {Li Shujun and Li Qi and Li Wenmin and Mou Xuanqin and Cai Yuanlong},
3582 title = {Statistical Properties of Digital Piecewise Linear Chaotic Maps and
3583 Their Roles in Cryptography and Pseudo-Random Coding},
3584 journal = {Proceedings of the 8th IMA International Conference on Cryptography
3589 owner = {christophe},
3590 timestamp = {2010.03.06}
3593 @INPROCEEDINGS{Simmons83,
3594 author = {Gustavus J. Simmons},
3595 title = {The Prisoners' Problem and the Subliminal Channel},
3596 booktitle = {Advances in Cryptology, Proc. CRYPTO'83},
3599 bibsource = {DBLP, http://dblp.uni-trier.de},
3601 timestamp = {2009.06.29}
3604 @ARTICLE{Solak2004389,
3605 author = {Ercan Solak},
3606 title = {On the security of a class of discrete-time chaotic cryptosystems},
3607 journal = {Physics Letters A},
3610 pages = {389 - 395},
3612 doi = {DOI: 10.1016/j.physleta.2003.11.008},
3614 keywords = {Communication using chaos},
3616 timestamp = {2009.12.12},
3617 url = {http://www.sciencedirect.com/science/article/B6TVM-4B22RC9-2/2/99a0af737c9b6ba8af47ae4d3c7a326d}
3620 @PHDTHESIS{Spiteri74,
3621 author = {Pierre Spitéri},
3622 title = {Contribution à l'étude de la stabilite au sens de liapounov de certains
3623 systemes differentiels non lineaires},
3624 school = {Université de Franche-Comté},
3626 owner = {christophe},
3627 timestamp = {2010.10.13}
3631 title = {Does God Play Dices ?: the mathematics of chaos},
3632 publisher = {Penguin},
3634 author = {Ian Stewart},
3636 timestamp = {2008.01.02}
3640 title = {Cryptography: Theory and Practice, Second Edition},
3641 publisher = {{Chapman \& Hall/CRC}},
3643 author = {Stinson, Douglas R.},
3645 abstract = {{Douglas R. Stinson's <I>Cryptography: Theory and Practice</I> is
3646 a mathematically intensive examination of cryptography, including
3647 ciphers, the Data Encryption Standard (DES), public key cryptography,
3648 one-way hash functions, and digital signatures. Stinson's explication
3649 of "zero-sum proofs"--a process by which one person lets another
3650 person know that he or she has a password without actually revealing
3651 any information--is especially good.<P> If you are new to the math
3652 behind cryptography but want to tackle it, the author covers all
3653 of the required background to understand the real mathematics here.
3654 <I>Cryptography</I> includes extensive exercises with each chapter
3655 and makes an ideal introduction for any math-literate person willing
3656 to get acquainted with this material.} {<P>Major advances over the
3657 last five years precipitated this major revision of the bestselling
3658 Cryptography: Theory and Practice. With more than 40 percent new
3659 or updated material, the second edition now provides an even more
3660 comprehensive treatment of modern cryptography. It focuses on the
3661 new Advanced Encryption Standards and features an entirely new chapter
3662 on that subject. Another new chapter explores the applications of
3663 secret sharing schemes, including ramp schemes, visual cryptography,
3664 threshold cryptography, and broadcast encryption. This is an ideal
3665 introductory text for both computer science and mathematics students
3666 and a valuable reference for professionals.</P>}},
3667 citeulike-article-id = {2401855},
3669 howpublished = {Hardcover},
3670 isbn = {1584882069},
3671 keywords = {security},
3672 posted-at = {2008-02-20 08:28:49},
3674 url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1584882069}
3677 @INPROCEEDINGS{Takana90,
3678 author = {K. Tanaka and Y. Nakamura and K. Matsui},
3679 title = {Embedding Secret Information into a Dithered Multi-level Image},
3680 booktitle = {IEEE Military Communications Conference},
3682 owner = {christophe},
3683 timestamp = {2010.08.05}
3686 @PHDTHESIS{ElTarazi81,
3687 author = {M. N. El Tarazi},
3688 title = {Contraction et ordre partiel pour l'étude d'algorithmes synchrones
3689 et asynchrones en analyse numérique},
3690 school = {Faculté des Sciences et Techniques de l'Université de Franche-Comté,
3693 owner = {christophe},
3694 timestamp = {2010.08.17}
3697 @INPROCEEDINGS{Unger93,
3698 author = {Unger, Ron and Moult, John},
3699 title = {Genetic Algorithm for 3D Protein Folding Simulations},
3700 booktitle = {Proceedings of the 5th International Conference on Genetic Algorithms},
3703 address = {San Francisco, CA, USA},
3704 publisher = {Morgan Kaufmann Publishers Inc.},
3706 isbn = {1-55860-299-2},
3710 @MISC{Van93electronicwater,
3711 author = {Tirkel Rankin Van},
3712 title = {Electronic Water Mark},
3716 @ARTICLE{Venkatesan2007397,
3717 author = {R.C. Venkatesan},
3718 title = {Encryption of covert information into multiple statistical distributions},
3719 journal = {Physics Letters A},
3722 pages = {397 - 404},
3724 doi = {DOI: 10.1016/j.physleta.2007.05.117},
3726 keywords = {Statistical encryption/decryption},
3728 timestamp = {2009.12.12},
3729 url = {http://www.sciencedirect.com/science/article/B6TVM-4P4FV2M-1/2/cd11a2ec144526e3c4552d2a7e7906cc}
3733 author = {G. Voyatzis and I. Pitas},
3734 title = {Chaotic watermarks for embedding in the spatial digital image domain},
3735 journal = {Proceedings of IEEE ICIP},
3739 owner = {christophe},
3740 timestamp = {2010.03.06}
3743 @INCOLLECTION{Wagner03,
3744 author = {Wagner, David},
3745 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
3746 booktitle = {Information Security},
3747 publisher = {Springer Berlin, Heidelberg},
3750 series = {Lecture Notes in Computer Science},
3752 abstract = {We use linear algebra to show that an algebraic privacy homomorphism
3753 proposed by Domingo-Ferrer is insecure for some parameter settings.},
3754 affiliation = {University of California, Berkeley USA}
3757 @INPROCEEDINGS{Wagner03cryptanalysisof,
3758 author = {David Wagner},
3759 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
3760 booktitle = {Proc. Sixth Information Security Conf. (ISC03},
3765 @ARTICLE{Wang_ellipticcurve,
3766 author = {Haodong Wang and Bo Sheng and Qun Li},
3767 title = {Elliptic curve cryptography-based access control in sensor networks},
3768 journal = {Int. J. Security and Networks}
3771 @INPROCEEDINGS{wbg10:ip,
3772 author = {Wang, Qianxue and Bahi, Jacques M. and Guyeux, Christophe and Fang,
3774 title = {Randomness quality of {CI} chaotic generators. Application to Internet
3776 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
3779 address = {Valencia, Spain},
3781 publisher = {IEEE Computer Society Press},
3782 note = {Best Paper award},
3783 classement = {ACTI},
3784 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
3790 author = {X. M. Wang and J. S. Zhang and W. F. Zhang},
3791 title = {One-way hash function construction based on the extended chaotic
3793 journal = {Acta Phys. Sinici.},
3795 volume = {52, No. 11},
3796 pages = {2737--2742},
3798 timestamp = {2009.01.16}
3802 author = {Westhoff, Dirk and Girao, Joao and Acharya, Mithun},
3803 title = {Concealed Data Aggregation for Reverse Multicast Traffic in Sensor
3804 Networks: Encryption, Key Distribution, and Routing Adaptation},
3805 journal = {IEEE Transactions on Mobile Computing},
3808 pages = {1417--1431},
3810 address = {Piscataway, NJ, USA},
3811 doi = {http://dx.doi.org/10.1109/TMC.2006.144},
3813 publisher = {IEEE Educational Activities Department}
3817 author = {Wikipédia},
3818 title = {Exposant de Lyapunov -- Site web d'André Lévesque},
3820 note = {[En ligne; Page disponible le 9-septembre-2010]},
3821 url = {\url{http://math.cmaisonneuve.qc.ca/alevesque/chaos_fract/Lyapunov/Exposant.html}}
3825 author = {Wikipédia},
3826 title = {Espace complet --- Wikipédia{,} l'encyclopédie libre},
3828 note = {[En ligne; Page disponible le 9-août-2010]},
3829 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Espace_complet&oldid=52734266}}
3833 author = {Wikipédia},
3834 title = {Densité (mathématiques) --- Wikipédia{,} l'encyclopédie libre},
3836 note = {[En ligne; Page disponible le 8-août-2010]},
3837 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Densit%C3%A9_(math%C3%A9matiques)&oldid=53938121}}
3841 author = {Wikipédia},
3842 title = {Information de Fisher --- Wikipédia{,} l'encyclopédie libre},
3844 note = {[En ligne; Page disponible le 5-août-2010]},
3845 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Information_de_Fisher&oldid=52877871}}
3848 @MISC{wiki:Kerkhoffs,
3849 author = {Wikipédia},
3850 title = {Principe de Kerckhoffs --- Wikipédia{,} l'encyclopédie libre},
3852 note = {[En ligne; Page disponible le 20-août-2010]},
3853 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Principe_de_Kerckhoffs&oldid=52133114}}
3856 @MISC{wiki:sarkovskii,
3857 author = {Wikipédia},
3858 title = {Théorème de Sarkovskii --- Wikipédia{,} l'encyclopédie libre},
3860 note = {[En ligne; Page disponible le 8-août-2010]},
3861 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Th%C3%A9or%C3%A8me_de_Sarkovskii&oldid=54196167}}
3864 @MISC{wiki:steganographie,
3865 author = {Wikipédia},
3866 title = {Stéganographie --- Wikipédia{,} l'encyclopédie libre},
3868 note = {[En ligne; Page disponible le 5-août-2010]},
3869 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=St%C3%A9ganographie&oldid=54724435}}
3872 @MISC{wiki:tatouage,
3873 author = {Wikipédia},
3874 title = {Tatouage numérique --- Wikipédia{,} l'encyclopédie libre},
3876 note = {[En ligne; Page disponible le 5-août-2010]},
3877 url = {https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Tatouage_num%C3%A9rique&oldid=55484940}
3880 @MISC{wiki:testsHypothese,
3881 author = {Wikipédia},
3882 title = {Test d'hypothèse --- Wikipédia{,} l'encyclopédie libre},
3884 note = {[En ligne; Page disponible le 5-août-2010]},
3885 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Test_d%27hypoth%C3%A8se&oldid=55344108}}
3889 author = {Xianyong Wu and Zhi-Hong Guan},
3890 title = {A novel digital watermark algorithm based on chaotic maps},
3891 journal = {Physics Letters A},
3894 pages = {403 - 406},
3896 doi = {DOI: 10.1016/j.physleta.2007.01.034},
3898 keywords = {Watermarking},
3899 url = {http://www.sciencedirect.com/science/article/B6TVM-4MY0MF3-8/2/0b4d1298fa84337d2e59b3fefe26f583}
3902 @INPROCEEDINGS{Wu2007,
3903 author = {Wu, Xianyong and Guan, Zhi-Hong and Wu, Zhengping},
3904 title = {A Chaos Based Robust Spatial Domain Watermarking Algorithm},
3905 booktitle = {ISNN '07: Proceedings of the 4th international symposium on Neural
3909 address = {Berlin, Heidelberg},
3910 publisher = {Springer-Verlag},
3911 doi = {http://dx.doi.org/10.1007/978-3-540-72393-6_15},
3912 isbn = {978-3-540-72392-9},
3913 location = {Nanjing, China}
3916 @ARTICLE{Xiao20092288,
3917 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
3918 title = {Parallel keyed hash function construction based on chaotic neural
3920 journal = {Neurocomputing},
3923 pages = {2288 - 2296},
3925 note = {Lattice Computing and Natural Computing (JCIS 2007) / Neural Networks
3926 in Intelligent Systems Designn (ISDA 2007)},
3927 abstract = {Recently, various hash functions based on chaos or neural networks
3928 were proposed. Nevertheless, none of them works efficiently in parallel
3929 computing environment. In this paper, an algorithm for parallel keyed
3930 hash function construction based on chaotic neural network is proposed.
3931 The mechanism of changeable-parameter and self-synchronization establishes
3932 a close relation between the hash value bit and message, and the
3933 algorithm structure ensures the uniform sensitivity of the hash value
3934 to the message blocks at different positions. The proposed algorithm
3935 can satisfy the performance requirements of hash function. These
3936 properties make it a promising choice for hashing on parallel computing
3939 keywords = {Chaotic neural network}
3942 @ARTICLE{Xiao20094346,
3943 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
3944 title = {Improving the security of a parallel keyed hash function based on
3946 journal = {Physics Letters A},
3949 pages = {4346 - 4353},
3952 keywords = {Hash function},
3954 timestamp = {2009.12.12}
3957 @ARTICLE{Xiao20102254,
3958 author = {Di Xiao and Frank Y. Shih and Xiaofeng Liao},
3959 title = {A chaos-based hash function with both modification detection and
3960 localization capabilities},
3961 journal = {Communications in Nonlinear Science and Numerical Simulation},
3964 pages = {2254 - 2261},
3966 abstract = {Recently, a variety of chaos-based hash functions have been proposed.
3967 Nevertheless, none of them can realize modification localization.
3968 In this paper, a hash function with both modification detection and
3969 localization capabilities is proposed, which can also support the
3970 parallel processing mode. By using the mechanism of changeable-parameter
3971 and self-synchronization, the keystream can establish a close relation
3972 with the algorithm key, the content, and the order of each message
3973 unit. Theoretical analysis and computer simulation indicate that
3974 the proposed algorithm can satisfy the performance requirements of
3977 keywords = {Hash function}
3980 @INPROCEEDINGS{Yu06,
3981 author = {Yu, Yu and Leiwo, Jussipekka and Premkumar, Benjamin},
3982 title = {A Study on the Security of Privacy Homomorphism},
3983 booktitle = {ITNG '06: Proceedings of the Third International Conference on Information
3984 Technology: New Generations},
3987 address = {Washington, DC, USA},
3988 publisher = {IEEE Computer Society},
3989 doi = {http://dx.doi.org/10.1109/ITNG.2006.19},
3990 isbn = {0-7695-2497-4}
3993 @ARTICLE{Zhang2008658,
3994 author = {Wei Zhang and Yonghe Liu and Sajal K. Das and Pradip De},
3995 title = {Secure data aggregation in wireless sensor networks: A watermark
3996 based authentication supportive approach},
3997 journal = {Pervasive and Mobile Computing},
4000 pages = {658 - 680},
4002 doi = {DOI: 10.1016/j.pmcj.2008.05.005},
4004 keywords = {Wireless sensor networks},
4005 url = {http://www.sciencedirect.com/science/article/B7MF1-4SKB3MD-1/2/b73948dcaa3eb63a2c21d09041882625}
4009 author = {Zhang, Yang and Arakaki, Adrian K. and Skolnick, Jeffrey},
4010 title = {TASSER: An automated method for the prediction of protein tertiary
4011 structures in CASP6},
4012 journal = {Proteins},
4018 keywords = {comparative modeling, threading, ab initio prediction, TASSER, PROSPECTOR_3},
4019 owner = {christophe},
4020 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
4021 timestamp = {2011.01.22},
4022 url = {http://dx.doi.org/10.1002/prot.20724}
4025 @ARTICLE{Zhou1997429,
4026 author = {Chang-song Zhou and Tian-lun Chen},
4027 title = {Extracting information masked by chaos and contaminated with noise:
4028 Some considerations on the security of communication approaches using
4030 journal = {Physics Letters A},
4033 pages = {429 - 435},
4036 keywords = {Communication},
4038 timestamp = {2009.12.12}
4042 author = {Zhou, Huai-bei and Wang, Lu},
4043 title = {Chaos in Biomolecular Dynamics},
4044 journal = {The Journal of Physical Chemistry},
4047 pages = {8101-8105},
4049 doi = {10.1021/jp953409x}
4052 @PROCEEDINGS{DBLP:conf/iwdw/2005,
4053 title = {IWDW'05: 4th International Workshop on Digital Watermarking},
4055 editor = {Mauro Barni and Ingemar J. Cox and Ton Kalker and Hyoung Joong Kim},
4057 series = {Lecture Notes in Computer Science},
4058 address = {Siena, Italy},
4059 publisher = {Springer},
4060 month = {September 15-17},
4061 bibsource = {DBLP, http://dblp.uni-trier.de},
4063 isbn = {3-540-28768-X},
4065 timestamp = {2009.06.29}
4068 @PROCEEDINGS{DBLP:conf/ih/2006,
4069 title = {IH 2006: Information Hiding, 8th International Workshop},
4071 editor = {Jan Camenisch and Christian S. Collberg and Neil F. Johnson and Phil
4074 series = {Lecture Notes in Computer Science},
4075 address = {Alexandria, VA, USA},
4076 publisher = {Springer},
4078 bibsource = {DBLP, http://dblp.uni-trier.de},
4079 booktitle = {Information Hiding},
4080 isbn = {978-3-540-74123-7},
4082 timestamp = {2009.06.29}
4085 @PROCEEDINGS{DBLP:conf/ih/2007,
4086 title = {Information Hiding, 9th International Workshop, IH 2007, Saint Malo,
4087 France, June 11-13, 2007, Revised Selected Papers},
4089 editor = {Teddy Furon and Fran\c{c}ois Cayre and Gwena{\"e}l J. Do{\"e}rr and
4092 series = {Lecture Notes in Computer Science},
4093 publisher = {Springer},
4094 bibsource = {DBLP, http://dblp.uni-trier.de},
4095 booktitle = {Information Hiding},
4096 isbn = {978-3-540-77369-6},
4098 timestamp = {2009.06.29}
4101 @PROCEEDINGS{DBLP:conf/iccsa/2006-1,
4102 title = {Computational Science and Its Applications - ICCSA 2006, International
4103 Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I},
4105 editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih
4106 Jeng Kenneth Tan and David Taniar and Antonio Lagan{\`a} and Youngsong
4107 Mun and Hyunseung Choo},
4109 series = {Lecture Notes in Computer Science},
4110 publisher = {Springer},
4111 bibsource = {DBLP, http://dblp.uni-trier.de},
4112 booktitle = {ICCSA (1)},
4113 isbn = {3-540-34070-X}
4116 @PROCEEDINGS{DBLP:conf/secrypt/2010,
4117 title = {SECRYPT 2010 - Proceedings of the International Conference on Security
4118 and Cryptography, Athens, Greece, July 26-28, 2010, SECRYPT is part
4119 of ICETE - The International Joint Conference on e-Business and Telecommunications},
4121 editor = {Sokratis K. Katsikas and Pierangela Samarati},
4122 publisher = {SciTePress},
4123 bibsource = {DBLP, http://dblp.uni-trier.de},
4124 booktitle = {SECRYPT},
4125 isbn = {978-989-8425-18-8}
4128 @BOOK{Katzenbeisser00,
4129 title = {Information Hiding Techniques for Steganography and Digital Watermarking},
4130 publisher = {Artech House, Inc.},
4132 editor = {Katzenbeisser, Stefan and Petitcolas, Fabien A.},
4133 address = {Norwood, MA, USA},
4137 @PROCEEDINGS{DBLP:conf/ih/1999,
4138 title = {IH'99: 3rd International Workshop on Information Hiding},
4140 editor = {Andreas Pfitzmann},
4142 series = {Lecture Notes in Computer Science},
4143 address = {Dresden, Germany},
4144 publisher = {Springer},
4145 month = {September 29 - October 1.},
4146 bibsource = {DBLP, http://dblp.uni-trier.de},
4147 booktitle = {Information Hiding},
4148 isbn = {3-540-67182-X},
4150 timestamp = {2009.06.29}
4153 @PROCEEDINGS{DBLP:conf/indocrypt/2000,
4154 title = {Progress in Cryptology - INDOCRYPT 2000, First International Conference
4155 in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings},
4157 editor = {Bimal K. Roy and Eiji Okamoto},
4159 series = {Lecture Notes in Computer Science},
4160 publisher = {Springer},
4161 bibsource = {DBLP, http://dblp.uni-trier.de},
4162 booktitle = {INDOCRYPT},
4163 isbn = {3-540-41452-5}
4166 @BOOK{DBLP:reference/icsec/2010,
4167 title = {Handbook of Information and Communication Security},
4168 publisher = {Springer},
4170 editor = {Peter P. Stavroulakis and Mark Stamp},
4171 bibsource = {DBLP, http://dblp.uni-trier.de},
4172 booktitle = {Handbook of Information and Communication Security},
4173 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4},
4174 isbn = {978-3-642-04116-7}
4177 @PROCEEDINGS{DBLP:conf/isnn/2004-2,
4178 title = {Advances in Neural Networks - ISNN 2004, International Symposium
4179 on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings,
4182 editor = {Fuliang Yin and Jun Wang and Chengan Guo},
4184 series = {Lecture Notes in Computer Science},
4185 publisher = {Springer},
4186 bibsource = {DBLP, http://dblp.uni-trier.de},
4187 booktitle = {ISNN (2)},
4188 isbn = {3-540-22843-8}
4191 @PROCEEDINGS{DBLP:conf/adhocnets/2010,
4192 title = {Ad Hoc Networks - Second International Conference, ADHOCNETS 2010,
4193 Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers},
4195 editor = {Jun Zheng and David Simplot-Ryl and Victor C. M. Leung},
4197 series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics
4198 and Telecommunications Engineering},
4199 publisher = {Springer},
4200 bibsource = {DBLP, http://dblp.uni-trier.de},
4201 booktitle = {ADHOCNETS},
4202 ee = {http://dx.doi.org/10.1007/978-3-642-17994-5},
4203 isbn = {978-3-642-17993-8}
4208 timestamp = {2011.03.29}
4212 title = {Delicious social bookmarking, http://delicious.com/},
4213 comment = {http://delicious.com/},
4215 url = {http://delicious.com/}
4219 title = {The Frick Collection, http://www.frick.org/},
4220 comment = {http://www.frick.org/},
4222 url = {http://www.frick.org/}
4226 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
4227 2010, Barcelona, Spain, 18-23 July 2010},
4230 bibsource = {DBLP, http://dblp.uni-trier.de},
4231 booktitle = {IEEE Congress on Evolutionary Computation}
4234 @PROCEEDINGS{DBLP:conf/cec/2010,
4235 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
4236 2010, Barcelona, Spain, 18-23 July 2010},
4239 bibsource = {DBLP, http://dblp.uni-trier.de},
4240 booktitle = {IEEE Congress on Evolutionary Computation}
4243 @PROCEEDINGS{DBLP:conf/date/2010,
4244 title = {Design, Automation and Test in Europe, DATE 2010, Dresden, Germany,
4248 bibsource = {DBLP, http://dblp.uni-trier.de},
4252 @PROCEEDINGS{DBLP:conf/cse/2009,
4253 title = {Proceedings IEEE CSE'09, 12th IEEE International Conference on Computational
4254 Science and Engineering, August 29-31, 2009, Vancouver, BC, Canada},
4256 publisher = {IEEE Computer Society},
4257 bibsource = {DBLP, http://dblp.uni-trier.de},
4261 @PROCEEDINGS{DBLP:conf/icumt/2009,
4262 title = {Proceedings of the International Conference on Ultra Modern Telecommunications,
4263 ICUMT 2009, 12-14 October 2009, St. Petersburg, Russia},
4266 bibsource = {DBLP, http://dblp.uni-trier.de},
4270 @PROCEEDINGS{DBLP:conf/focs/2008,
4271 title = {49th Annual IEEE Symposium on Foundations of Computer Science, FOCS
4272 2008, October 25-28, 2008, Philadelphia, PA, USA},
4274 publisher = {IEEE Computer Society},
4275 bibsource = {DBLP, http://dblp.uni-trier.de},
4279 @comment{jabref-meta: selector_publisher:}
4281 @comment{jabref-meta: selector_author:}
4283 @comment{jabref-meta: selector_journal:}
4285 @comment{jabref-meta: selector_keywords:Chaos;Entropie Topologique;Tip
4290 @InProceedings{Pang:2008:cec,
4291 author = "Wai-Man Pang and Tien-Tsin Wong and Pheng-Ann Heng",
4292 title = "Generating Massive High-Quality Random Numbers using
4294 booktitle = "2008 IEEE World Congress on Computational
4297 editor = "Jun Wang",
4298 address = "Hong Kong",
4299 organization = "IEEE Computational Intelligence Society",
4300 publisher = "IEEE Press",
4304 @Article{LEcuyerS07,
4305 title = "Test{U01}: {A} {C} library for empirical testing of
4306 random number generators",
4307 author = "Pierre L'Ecuyer and Richard J. Simard",
4308 journal = "ACM Trans. Math. Softw",
4312 bibdate = "2007-11-06",
4314 http://dblp.uni-trier.de/db/journals/toms/toms33.html#LEcuyerS07",
4315 URL = "http://doi.acm.org/10.1145/1268776.1268777",
4319 author = {A. Zhmurov and K. Rybnikov and Y. Kholodov and V. Barsegov},
4320 title = {Generation of Random Numbers on Graphics Processors: Forced Indentation In Silico of the Bacteriophage HK97},
4321 journal = {J. Phys. Chem. B},
4325 pages = {5278--5288},
4330 @comment {regarder : Pseudo-Random Number Generation for Brownian Dynamics and Dissipative Particle Dynamics Simulations on GPU Devices}
4331 @comment {CL Phillips, JA Anderson… - Journal of Computational Physics, 2011 - Elsevier}
4333 @InProceedings{conf/fpga/ThomasHL09,
4334 title = "A comparison of {CPU}s, {GPU}s, {FPGA}s, and massively
4335 parallel processor arrays for random number
4337 author = "David B. Thomas and Lee W. Howes and Wayne Luk",
4338 booktitle = "Proceedings of the {ACM}/{SIGDA} 17th International
4339 Symposium on Field Programmable Gate Arrays, {FPGA}
4340 2009, Monterey, California, {USA}, February 22-24,
4342 bibdate = "2010-06-29",
4345 editor = "Paul Chow and Peter Y. K. Cheung",
4346 ISBN = "978-1-60558-410-2",
4348 URL = "http://doi.acm.org/10.1145/1508128.1508139",
4353 @InProceedings{Jenkins96,
4356 booktitle = "IWFSE: International Workshop on Fast Software
4363 title = {Cuda cublas library},
4365 Note = {Version 4.0},
4370 title = {Curand library},
4372 Note = {Version 4.0},
4378 author = {Lenore Blum and Manuel Blum and Michael Shub},
4379 title = {A Simple Unpredictable Pseudo-Random Number Generator},
4380 journal = {SIAM Journal on Computing},
4387 author = {Oded Goldreich},
4389 title = {Foundations of Cryptography: Basic Tools},
4390 publisher = {Cambridge University Press},