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}
18 title = {Seminumerical Algorithms},
19 publisher = {Addison-Wesley, Reading, MA, USA},
21 author = {D. E. Knuth},
23 edition = {Third Edition},
25 timestamp = {2012.02.15}
32 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
35 author = {Guyeux, Christophe},
36 title = {Le d\'esordre des it\'erations chaotiques - Applications aux r\'eseaux de capteurs, \`a la dissimulation d'information, et aux fonctions de hachage},
37 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.},
38 publisher = {\'Editions Universitaires Europ\'eennes},
39 isbn = {978-3-8417-9417-8},
41 note = {ISBN 978-3-8417-9417-8. 362 pages. Publication de la thèse de doctorat.},
44 @inproceedings{bfg12a:ip,
46 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
49 author = {Bahi, J. and Fang, X. and Guyeux, C.},
50 title = {An optimization technique on pseudorandom generators based on chaotic iterations},
51 booktitle = {INTERNET'2012, 4-th Int. Conf. on Evolving Internet},
53 address = {Venice, Italy},
60 @UNPUBLISHED{ANDREW2008,
61 author = {NIST Special Publication 800-22 rev. 1},
62 title = {A Statistical Test Suite for Random and Pseudorandom Number Generators
63 for Cryptographic Applications},
66 timestamp = {2009.01.22}
69 @Article{combined_lcg,
70 title = "Efficient and portable combined random number generators",
72 journal = "Communications of the ACM",
80 @INPROCEEDINGS{Fischlin,
81 author = {Fischlin, R. and Schnorr, C. P.},
82 title = {Stronger security proofs for RSA and rabin bits},
83 booktitle = {Proceedings of the 16th annual international conference on Theory
84 and application of cryptographic techniques},
86 series = {EUROCRYPT'97},
88 address = {Berlin, Heidelberg},
89 publisher = {Springer-Verlag},
91 isbn = {3-540-62975-0},
92 location = {Konstanz, Germany},
94 url = {http://dl.acm.org/citation.cfm?id=1754542.1754569}
97 @INPROCEEDINGS{BattiatoCGG99,
98 author = {Sebastiano Battiato and Dario Catalano and Giovanni Gallo and Rosario
100 title = {Robust Watermarking for Images Based on Color Manipulation},
101 booktitle = {Information Hiding},
104 bibsource = {DBLP, http://dblp.uni-trier.de},
105 crossref = {DBLP:conf/ih/1999},
107 timestamp = {2009.06.29}
110 @INPROCEEDINGS{ComesanaPP05,
111 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
112 title = {The Return of the Sensitivity Attack},
116 bibsource = {DBLP, http://dblp.uni-trier.de},
117 crossref = {DBLP:conf/iwdw/2005},
118 ee = {http://dx.doi.org/10.1007/11551492_20},
120 timestamp = {2009.06.29}
123 @INPROCEEDINGS{ComesanaPP05bis,
124 author = {Pedro Comesa{\~n}a and Luis P{\'e}rez-Freire and Fernando P{\'e}rez-Gonz{\'a}lez},
125 title = {Fundamentals of Data Hiding Security and Their Application to Spread-Spectrum
127 booktitle = {IH'05: Information Hiding Workshop},
130 publisher = {Lectures Notes in Computer Science, Springer-Verlag},
131 bibsource = {DBLP, http://dblp.uni-trier.de},
132 crossref = {DBLP:conf/ih/2005},
133 ee = {http://dx.doi.org/10.1007/11558859_12},
135 timestamp = {2009.06.30}
138 @INPROCEEDINGS{CongJQZ06,
139 author = {Jin Cong and Yan Jiang and Zhiguo Qu and Zhongmei Zhang},
140 title = {A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption},
141 booktitle = {ICCSA (1)},
144 bibsource = {DBLP, http://dblp.uni-trier.de},
145 crossref = {DBLP:conf/iccsa/2006-1},
146 ee = {http://dx.doi.org/10.1007/11751540_100}
149 @INPROCEEDINGS{DBLP:conf/focs/DziembowskiP08,
150 author = {Stefan Dziembowski and Krzysztof Pietrzak},
151 title = {Leakage-Resilient Cryptography},
155 bibsource = {DBLP, http://dblp.uni-trier.de},
156 crossref = {DBLP:conf/focs/2008},
157 ee = {http://dx.doi.org/10.1109/FOCS.2008.56}
160 @INCOLLECTION{Filiol10,
161 author = {Eric Filiol},
162 title = {Viruses and Malware},
163 booktitle = {Handbook of Information and Communication Security},
166 bibsource = {DBLP, http://dblp.uni-trier.de},
167 crossref = {DBLP:reference/icsec/2010},
168 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4_34}
171 @INPROCEEDINGS{Filiol00,
172 author = {Eric Filiol},
173 title = {Decimation Attack of Stream Ciphers},
174 booktitle = {INDOCRYPT},
177 bibsource = {DBLP, http://dblp.uni-trier.de},
178 crossref = {DBLP:conf/indocrypt/2000},
179 ee = {http://link.springer.de/link/service/series/0558/bibs/1977/19770031.htm}
182 @INPROCEEDINGS{Furon05,
183 author = {Teddy Furon},
184 title = {A Survey of Watermarking Security},
188 bibsource = {DBLP, http://dblp.uni-trier.de},
189 crossref = {DBLP:conf/iwdw/2005},
190 ee = {http://dx.doi.org/10.1007/11551492_16},
192 timestamp = {2009.06.29}
196 @INPROCEEDINGS{DBLP:conf/cec/HiggsSHS10,
197 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
198 title = {Genetic algorithm feature-based resampling for protein structure
200 booktitle = {IEEE Congress on Evolutionary Computation},
203 bibsource = {DBLP, http://dblp.uni-trier.de},
204 crossref = {DBLP:conf/cec/2010},
205 ee = {http://dx.doi.org/10.1109/CEC.2010.5586149}
208 @INPROCEEDINGS{Higgs2010,
209 author = {Trent Higgs and Bela Stantic and Tamjidul Hoque and Abdul Sattar},
210 title = {Genetic algorithm feature-based resampling for protein structure
212 booktitle = {IEEE Congress on Evolutionary Computation},
215 bibsource = {DBLP, http://dblp.uni-trier.de},
216 crossref = {DBLP:conf/cec/2010},
217 ee = {http://dx.doi.org/10.1109/CEC.2010.5586149}
220 @INPROCEEDINGS{DBLP:conf/cec/HorvathC10,
221 author = {Dragos Horvath and Camelia Chira},
222 title = {Simplified chain folding models as metaheuristic benchmark for tuning
223 real protein folding algorithms?},
224 booktitle = {IEEE Congress on Evolutionary Computation},
227 bibsource = {DBLP, http://dblp.uni-trier.de},
228 crossref = {DBLP:conf/cec/2010},
229 ee = {http://dx.doi.org/10.1109/CEC.2010.5585932}
232 @INPROCEEDINGS{DBLP:conf/cec/IslamC10,
233 author = {Md. Kamrul Islam and Madhu Chetty},
234 title = {Clustered memetic algorithm for protein structure prediction},
235 booktitle = {IEEE Congress on Evolutionary Computation},
238 bibsource = {DBLP, http://dblp.uni-trier.de},
239 crossref = {DBLP:conf/cec/2010},
240 ee = {http://dx.doi.org/10.1109/CEC.2010.5586187}
243 @INPROCEEDINGS{Ker06,
244 author = {Andrew D. Ker},
245 title = {Batch Steganography and Pooled Steganalysis},
246 booktitle = {Information Hiding},
249 bibsource = {DBLP, http://dblp.uni-trier.de},
250 crossref = {DBLP:conf/ih/2006},
251 ee = {http://dx.doi.org/10.1007/978-3-540-74124-4_18},
253 timestamp = {2009.06.29}
256 @INPROCEEDINGS{Lin2009,
257 author = {H.-Y. Lin and T.-C. Chiang},
258 title = {Cooperative Secure Data Aggregation in Sensor Networks Using Elliptic
259 Curve Based Cryptosystems},
263 bibsource = {DBLP, http://dblp.uni-trier.de},
264 crossref = {DBLP:conf/cdve/2009},
265 ee = {http://dx.doi.org/10.1007/978-3-642-04265-2_58}
268 @INPROCEEDINGS{DBLP:conf/cse/MaimourPH09,
269 author = {Moufida Maimour and CongDuc Pham and Doan B. Hoang},
270 title = {A Congestion Control Framework for Handling Video Surveillance Traffics
272 booktitle = {CSE (2)},
275 bibsource = {DBLP, http://dblp.uni-trier.de},
276 crossref = {DBLP:conf/cse/2009},
277 ee = {http://dx.doi.org/10.1109/CSE.2009.200}
280 @INPROCEEDINGS{DBLP:conf/icumt/MakhoulSP09,
281 author = {Abdallah Makhoul and Rachid Saadi and CongDuc Pham},
282 title = {Coverage and adaptive scheduling algorithms for criticality management
283 on video wireless sensor networks},
287 bibsource = {DBLP, http://dblp.uni-trier.de},
288 crossref = {DBLP:conf/icumt/2009},
289 ee = {http://dx.doi.org/10.1109/ICUMT.2009.5345630}
292 @INPROCEEDINGS{Mittelholzer99,
293 author = {Thomas Mittelholzer},
294 title = {An Information-Theoretic Approach to Steganography and Watermarking},
295 booktitle = {Information Hiding},
298 bibsource = {DBLP, http://dblp.uni-trier.de},
299 crossref = {DBLP:conf/ih/1999},
301 timestamp = {2009.06.29}
304 @INPROCEEDINGS{PellegriniBA10,
305 author = {Andrea Pellegrini and Valeria Bertacco and Todd M. Austin},
306 title = {Fault-based attack of RSA authentication},
310 bibsource = {DBLP, http://dblp.uni-trier.de},
311 crossref = {DBLP:conf/date/2010},
312 ee = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5456933}
315 @INPROCEEDINGS{DBLP:conf/cec/Perez-HernandezRG10,
316 author = {Luis Germ{\'a}n P{\'e}rez-Hern{\'a}ndez and Katya Rodr\'{\i}guez-V{\'a}zquez
317 and Ram{\'o}n Gardu{\~n}o-Ju{\'a}rez},
318 title = {Estimation of 3D Protein Structure by means of parallel Particle
320 booktitle = {IEEE Congress on Evolutionary Computation},
323 bibsource = {DBLP, http://dblp.uni-trier.de},
324 crossref = {DBLP:conf/cec/2010},
325 ee = {http://dx.doi.org/10.1109/CEC.2010.5586549}
328 @INPROCEEDINGS{WangNHZH07,
329 author = {Chuntao Wang and Jiangqun Ni and Jiwu Huang and Rongyue Zhang and
331 title = {Robust and High Capacity Image Watermarking Based on Jointly Coding
332 and Embedding Optimization},
333 booktitle = {Information Hiding},
336 bibsource = {DBLP, http://dblp.uni-trier.de},
337 crossref = {DBLP:conf/ih/2007},
338 ee = {http://dx.doi.org/10.1007/978-3-540-77370-2_5},
340 timestamp = {2009.06.29}
343 @INPROCEEDINGS{Zhao04,
344 author = {Jian Zhao and Mingquan Zhou and Hongmei Xie and Jinye Peng and Xin
346 title = {A Novel Wavelet Image Watermarking Scheme Combined with Chaos Sequence
348 booktitle = {ISNN (2)},
351 bibsource = {DBLP, http://dblp.uni-trier.de},
352 crossref = {DBLP:conf/isnn/2004-2},
353 ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3174{\&}spage=663}
356 @INPROCEEDINGS{Acharya05securecomparison,
357 author = {Acharya, Mithun and Girao, Joao and Westhoff, Dirk},
358 title = {Secure Comparison of Encrypted Data in Wireless Sensor Networks},
359 booktitle = {WIOPT '05: Proceedings of the Third International Symposium on Modeling
360 and Optimization in Mobile, Ad Hoc, and Wireless Networks},
363 address = {Washington, DC, USA},
364 publisher = {IEEE Computer Society},
365 doi = {http://dx.doi.org/10.1109/WIOPT.2005.44},
366 isbn = {0-7695-2267-X}
369 @INPROCEEDINGS{Acimez07onthe,
370 author = {Onur Acıi\c{c}mez and \c{C}etin Kaya Ko\c{c} and Jean-Pierre Seifert},
371 title = {On the power of simple branch prediction analysis },
372 booktitle = {2007 ACM Symposium on Information, Computer and Communications Security
376 publisher = {ACM Press}
380 author = {R. L. Adler and A. G. Konheim and M. H. McAndrew},
381 title = {Topological entropy},
382 journal = {Trans. Amer. Math. Soc.},
387 timestamp = {2008.05.29}
390 @INPROCEEDINGS{Agrawal04,
391 author = {Agrawal, Rakesh and Kiernan, Jerry and Srikant, Ramakrishnan and
393 title = {Order preserving encryption for numeric data},
394 booktitle = {SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference
395 on Management of data},
398 address = {New York, NY, USA},
400 doi = {http://doi.acm.org/10.1145/1007568.1007632},
401 isbn = {1-58113-859-8},
402 location = {Paris, France}
405 @ARTICLE{Anfinsen20071973,
406 author = {Anfinsen, Christian B.},
407 title = {Principles that Govern the Folding of Protein Chains},
413 doi = {10.1126/science.181.4096.223},
414 eprint = {http://www.sciencemag.org/content/181/4096/223.full.pdf},
415 url = {http://www.sciencemag.org/content/181/4096/223.short}
419 author = {D. G. Arques and C. J. Michel},
420 title = {Analytical expression of the purine/pyrimidine autocorrelation function
421 after and before random mutations.},
422 journal = {Math Biosci},
428 abstract = {The mutation process is a classical evolutionary genetic process.
429 The type of mutations studied here is the random substitutions of
430 a purine base R (adenine or guanine) by a pyrimidine base Y (cytosine
431 or thymine) and reciprocally (transversions). The analytical expressions
432 derived allow us to analyze in genes the occurrence probabilities
433 of motifs and d-motifs (two motifs separated by any d bases) on the
434 R/Y alphabet under transversions. These motif probabilities can be
435 obtained after transversions (in the evolutionary sense; from the
436 past to the present) and, unexpectedly, also before transversions
437 (after back transversions, in the inverse evolutionary sense, from
438 the present to the past). This theoretical part in Section 2 is a
439 first generalization of a particular formula recently derived. The
440 application in Section 3 is based on the analytical expression giving
441 the autocorrelation function (the d-motif probabilities) before transversions.
442 It allows us to study primitive genes from actual genes. This approach
443 solves a biological problem. The protein coding genes of chloroplasts
444 and mitochondria have a preferential occurrence of the 6-motif YRY(N)6YRY
445 (maximum of the autocorrelation function for d = 6, N = R or Y) with
446 a periodicity modulo 3. The YRY(N)6YRY preferential occurrence without
447 the periodicity modulo 3 is also observed in the RNA coding genes
448 (ribosomal, transfer, and small nuclear RNA genes) and in the noncoding
449 genes (introns and 5' regions of eukaryotic nuclei). However, there
450 are two exceptions to this YRY(N)6YRY rule: the protein coding genes
451 of eukaryotic nuclei, and prokaryotes, where YRY(N)6YRY has the second
452 highest value after YRY(N)0YRY (YRYYRY) with a periodicity modulo
453 3. When we go backward in time with the analytical expression, the
454 protein coding genes of both eukaryotic nuclei and prokaryotes retrieve
455 the YRY(N)6YRY preferential occurrence with a periodicity modulo
456 3 after 0.2 back transversions per base. In other words, the actual
457 protein coding genes of chloroplasts and mitochondria are similar
458 to the primitive protein coding genes of eukaryotic nuclei and prokaryotes.
459 On the other hand, this application represents the first result concerning
460 the mutation process in the model of DNA sequence evolution we recently
461 proposed. According to this model, the actual genes on the R/Y alphabet
462 derive from two successive evolutionary genetic processes: an independent
463 mixing of a few nonrandom types of oligonucleotides leading to genes
464 called primitive followed by a mutation process in these primitive
465 genes.(ABSTRACT TRUNCATED AT 400 WORDS)},
466 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
468 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Mathematics; Models,
469 Genetic; Mutation; Probability; Proteins, genetics; Purines; Pyrimidines},
471 medline-pst = {ppublish},
473 pii = {0025-5564(94)90020-5},
475 timestamp = {2011.05.05}
479 author = {D. G. Arquès and J. P. Fallot and C. J. Michel},
480 title = {An evolutionary analytical model of a complementary circular code
481 simulating the protein coding genes, the 5' and 3' regions.},
482 journal = {Bull Math Biol},
488 abstract = {The self-complementary subset T0 = X0 [symbol: see text] ¿AAA, TTT¿
489 with X0 = ¿AAC, AAT, ACC, ATC, ATT, CAG, CTC, CTG, GAA, GAC, GAG,
490 GAT, GCC, GGC, GGT, GTA, GTC, GTT, TAC, TTC¿ of 22 trinucleotides
491 has a preferential occurrence in the frame 0 (reading frame established
492 by the ATG start trinucleotide) of protein (coding) genes of both
493 prokaryotes and eukaryotes. The subsets T1 = X1 [symbol: see text]
494 ¿CCC¿ and T2 = X2 [symbol: see text] ¿GGG¿ of 21 trinucleotides have
495 a preferential occurrence in the shifted frames 1 and 2 respectively
496 (frame 0 shifted by one and two nucleotides respectively in the 5'-3'
497 direction). T1 and T2 are complementary to each other. The subset
498 T0 contains the subset X0 which has the rarity property (6 x 10(-8)
499 to be a complementary maximal circular code with two permutated maximal
500 circular codes X1 and X2 in the frames 1 and 2 respectively. X0 is
501 called a C3 code. A quantitative study of these three subsets T0,
502 T1, T2 in the three frames 0, 1, 2 of protein genes, and the 5' and
503 3' regions of eukaryotes, shows that their occurrence frequencies
504 are constant functions of the trinucleotide positions in the sequences.
505 The frequencies of T0, T1, T2 in the frame 0 of protein genes are
506 49, 28.5 and 22.5\% respectively. In contrast, the frequencies of
507 T0, T1, T2 in the 5' and 3' regions of eukaryotes, are independent
508 of the frame. Indeed, the frequency of T0 in the three frames of
509 5' (respectively 3') regions is equal to 35.5\% (respectively 38\%)
510 and is greater than the frequencies T1 and T2, both equal to 32.25\%
511 (respectively 31\%) in the three frames. Several frequency asymmetries
512 unexpectedly observed (e.g. the frequency difference between T1 and
513 T2 in the frame 0), are related to a new property of the subset T0
514 involving substitutions. An evolutionary analytical model at three
515 parameters (p, q, t) based on an independent mixing of the 22 codons
516 (trinucleotides in frame 0) of T0 with equiprobability (1/22) followed
517 by t approximately 4 substitutions per codon according to the proportions
518 p approximately 0.1, q approximately 0.1 and r = 1 - p - q approximately
519 0.8 in the three codon sites respectively, retrieves the frequencies
520 of T0, T1, T2 observed in the three frames of protein genes and explains
521 these asymmetries. Furthermore, the same model (0.1, 0.1, t) after
522 t approximately 22 substitutions per codon, retrieves the statistical
523 properties observed in the three frames of the 5' and 3' regions.
524 The complex behaviour of these analytical curves is totally unexpected
525 and a priori difficult to imagine.},
526 doi = {10.1006/bulm.1997.0033},
527 institution = {Equipe de Biologie Théorique, Université de Marne la Vallée, Institut
528 Gaspard Monge, Noisy Le Grand, France. arques@univ-mlv.fr},
529 keywords = {Animals; Biological Evolution; Codon, genetics; Genetic Code; Humans;
530 Mammals; Models, Genetic; Probability; Proteins, genetics; Rodentia;
533 medline-pst = {ppublish},
535 pii = {S0092-8240(97)90033-1},
537 timestamp = {2011.05.05},
538 url = {http://dx.doi.org/10.1006/bulm.1997.0033}
542 author = {D. G. Arquès and C. J. Michel},
543 title = {Analytical expression of the purine/pyrimidine codon probability
544 after and before random mutations.},
545 journal = {Bull Math Biol},
548 pages = {1025--1038},
551 abstract = {Recently, we proposed a new model of DNA sequence evolution (Arquès
552 and Michel. 1990b. Bull. math. Biol. 52, 741-772) according to which
553 actual genes on the purine/pyrimidine (R/Y) alphabet (R = purine
554 = adenine or guanine, Y = pyrimidine = cytosine or thymine) are the
555 result of two successive evolutionary genetic processes: (i) a mixing
556 (independent) process of non-random oligonucleotides (words of base
557 length less than 10: YRY(N)6, YRYRYR and YRYYRY are so far identified;
558 N = R or Y) leading to primitive genes (words of several hundreds
559 of base length) and followed by (ii) a random mutation process, i.e.,
560 transformations of a base R (respectively Y) into the base Y (respectively
561 R) at random sites in these primitive genes. Following this model
562 the problem investigated here is the study of the variation of the
563 8 R/Y codon probabilities RRR, ..., YYY under random mutations. Two
564 analytical expressions solved here allow analysis of this variation
565 in the classical evolutionary sense (from the past to the present,
566 i.e., after random mutations), but also in the inverted evolutionary
567 sense (from the present to the past, i.e., before random mutations).
568 Different properties are also derived from these formulae. Finally,
569 a few applications of these formulae are presented. They prove the
570 proposition in Arquès and Michel (1990b. Bull. math. Biol. 52, 741-772),
571 Section 3.3.2, with the existence of a maximal mean number of random
572 mutations per base of the order 0.3 in the protein coding genes.
573 They also confirm the mixing process of oligonucleotides by excluding
574 the purine/pyrimidine contiguous and alternating tracts from the
575 formation process of primitive genes.},
576 institution = {Université de Franche-Comté, Besançon, France.},
577 keywords = {Base Sequence; Codon; DNA, chemistry/genetics; Mathematics; Models,
578 Genetic; Mutation; Probability; Purines; Pyrimidines},
580 medline-pst = {ppublish},
583 timestamp = {2011.05.05}
586 @ARTICLE{Arques1993b,
587 author = {D. G. Arquès and C. J. Michel},
588 title = {Identification and simulation of new non-random statistical properties
589 common to different eukaryotic gene subpopulations.},
590 journal = {Biochimie},
595 abstract = {The nucleotide distribution in protein coding genes, introns and transfer
596 RNA genes of eukaryotic subpopulations (primates, rodent and mammals)
597 is studied by autocorrelation functions. The autocorrelation function
598 analysing the occurrence probability of the i-motif YRY(N)iYRY (YRY-function)
599 in protein coding genes and transfer RNA genes of these three eukaryotic
600 subpopulations retrieves the preferential occurrence of YRY(N)6YRY
601 (R = purine = adenine or guanine, Y = pyrimidine = cytosine or thymine,
602 N = R or Y). The autocorrelation functions analysing the occurrence
603 probability of the i-motifs RRR(N)iRRR (RRR-function) and YYY(N)iYYY
604 (YYY-function) identify new non-random genetic statistical properties
605 in these three eukaryotic subpopulations, mainly: i) in their protein
606 coding genes: local maxima for i identical to 6 [12] (peaks for i
607 = 6, 18, 30, 42) with the RRR-function and local maxima for i identical
608 to 8 [10] (peaks for i = 8, 18, 28) with the YYY-function; and ii)
609 in their introns: local maxima for i identical to 3 [6] (peaks for
610 i = 3, 9, 15) and a short linear decrease followed by a large exponential
611 decrease both with the RRR- and YYY-functions. The non-random properties
612 identified in eukaryotic intron subpopulations are modelised with
613 a process of random insertions and deletions of nucleotides simulating
615 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
616 d'Informatique de Besançon, France.},
617 keywords = {Animals; Base Sequence; Data Interpretation, Statistical; Genes; Introns;
618 Mammals; Models, Genetic; Primates; Probability; Proteins, genetics;
619 RNA Editing; RNA, Transfer, genetics; Rodentia; Sequence Analysis,
622 medline-pst = {ppublish},
624 pii = {0300-9084(93)90173-P},
626 timestamp = {2011.05.05}
630 author = {D. G. Arquès and C. J. Michel},
631 title = {A simulation of the genetic periodicities modulo 2 and 3 with processes
632 of nucleotide insertions and deletions.},
633 journal = {J Theor Biol},
639 abstract = {Recently, a new genetic process termed RNA editing has been identified
640 showing insertions and deletions of nucleotides in particular RNA
641 molecules. On the other hand, there are a few non-random statistical
642 properties in genes: in particular, the periodicity modulo 3 (P3)
643 associated with an open reading frame, the periodicity modulo 2 (P2)
644 associated with alternating purine/pyrimidine stretches, the YRY(N)6YRY
645 preferential occurrence (R = purine = adenine or guanine, Y = pyrimidine
646 = cytosine or thymine, N = R or Y) representing a "code" of the DNA
647 helix pitch, etc. The problem investigated here is whether a process
648 of the type RNA editing can lead to the non-random statistical properties
649 commonly observed in genes. This paper will show in particular that:
650 The process of insertions and deletions of mononucleotides in the
651 initial sequence [YRY(N)3]* [series of YRY(N)3] can lead to the periodicity
652 modulo 2 (P2). The process of insertions and deletions of trinucleotides
653 in the initial sequence [YRY(N)6]* [series of YRY(N)6] can lead to
654 the periodicity modulo 3 (P3) and the YRY(N)6YRY preferential occurrence.
655 Furthermore, these two processes lead to a strong correlation with
656 the reality, namely the mononucleotide insertion/deletion process,
657 with the 5' eukaryotic regions and the trinucleotide insertion/deletion
658 process, with the eukaryotic protein coding genes.},
659 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
660 Unité Associée CNRS No 822, France.},
661 keywords = {Chromosome Deletion; Computer Simulation; Humans; Models, Genetic;
662 Mutagenesis, genetics; RNA, genetics},
664 medline-pst = {ppublish},
667 timestamp = {2011.05.05}
671 author = {D. G. Arquès and C. J. Michel},
672 title = {Periodicities in coding and noncoding regions of the genes.},
673 journal = {J Theor Biol},
679 abstract = {Gene population statistical studies of protein coding genes and introns
680 have identified two types of periodicities on the purine/pyrimidine
681 alphabet: (i) the modulo 3 periodicity or coding periodicity (periodicity
682 P3) in protein coding genes of eukaryotes, prokaryotes, viruses,
683 chloroplasts, mitochondria, plasmids and in introns of viruses and
684 mitochondria, and (ii) the modulo 2 periodicity (periodicity P2)
685 in the eukaryotic introns. The periodicity study is herein extended
686 to the 5' and 3' regions of eukaryotes, prokaryotes and viruses and
687 shows: (i) the periodicity P3 in the 5' and 3' regions of eukaryotes.
688 Therefore, these observations suggest a unitary and dynamic concept
689 for the genes as for a given genome, the 5' and 3' regions have the
690 genetic information for protein coding genes and for introns: (1)
691 In the eukaryotic genome, the 5' (P2 and P3) and 3' (P2 and P3) regions
692 have the information for protein coding genes (P3) and for introns
693 (P2). The intensity of P3 is high in 5' regions and weak in 3' regions,
694 while the intensity of P2 is weak in 5' regions and high in 3' regions.
695 (2) In the prokaryotic genome, the 5' (P3) and 3' (P3) regions have
696 the information for protein coding genes (P3). (3) In the viral genome,
697 the 5' (P3) and 3' (P3) regions have the information for protein
698 coding genes (P3) and for introns (P3). The absence of P2 in viral
699 introns (in opposition to eukaryotic introns) may be related to the
700 absence of P2 in 5' and 3' regions of viruses.},
701 institution = {Université de Franche-Comté, Unité Associée CNRS No. 822, Besançon,
703 keywords = {Animals; Base Sequence; Eukaryotic Cells; Genes; Introns; Prokaryotic
704 Cells; Purine Nucleotides; Pyrimidine Nucleotides; Repetitive Sequences,
705 Nucleic Acid; Viruses, genetics},
707 medline-pst = {ppublish},
710 timestamp = {2011.05.05}
713 @ARTICLE{Arques1990a,
714 author = {D. G. Arquès and C. J. Michel},
715 title = {A model of DNA sequence evolution.},
716 journal = {Bull Math Biol},
721 abstract = {Statistical studies of gene populations on the purine/pyrimidine alphabet
722 have shown that the mean occurrence probability of the i-motif YRY(N)iYRY
723 (R = purine, Y = pyrimidine, N = R or Y) is not uniform by varying
724 i in the range, but presents a maximum at i = 6 in the following
725 populations: protein coding genes of eukaryotes, prokaryotes, chloroplasts
726 and mitochondria, and also viral introns, ribosomal RNA genes and
727 transfer RNA genes (Arquès and Michel, 1987b, J. theor. Biol. 128,
728 457-461). From the "universality" of this observation, we suggested
729 that the oligonucleotide YRY(N)6 is a primitive one and that it has
730 a central function in DNA sequence evolution (Arquès and Michel,
731 1987b, J. theor. Biol. 128, 457-461). Following this idea, we introduce
732 a concept of a model of DNA sequence evolution which will be validated
733 according to a schema presented in three parts. In the first part,
734 using the last version of the gene database, the YRY(N)6YRY preferential
735 occurrence (maximum at i = 6) is confirmed for the populations mentioned
736 above and is extended to some newly analysed populations: chloroplast
737 introns, chloroplast 5' regions, mitochondrial 5' regions and small
738 nuclear RNA genes. On the other hand, the YRY(N)6YRY preferential
739 occurrence and periodicities are used in order to classify 18 gene
740 populations. In the second part, we will demonstrate that several
741 statistical features characterizing different gene populations (in
742 particular the YRY(N)6YRY preferential occurrence and the periodicities)
743 can be retrieved from a simple Markov model based on the mixing of
744 the two oligonucleotides YRY(N)6 and YRY(N)3 and based on the percentages
745 of RYR and YRY in the unspecified trinucleotides (N)3 of YRY(N)6
746 and YRY(N)3. Several properties are identified and prove in particular
747 that the oligonucleotide mixing is an independent process and that
748 several different features are functions of a unique parameter. In
749 the third part, the return of the model to the reality shows a strong
750 correlation between reality and simulation concerning the presence
751 of a large alternating purine/pyrimidine stretches and of periodicities.
752 It also contributes to a greater understanding of biological reality,
753 e.g. the presence or the absence of large alternating purine/pyrimidine
754 stretches can be explained as being a simple consequence of the mixing
755 of two particular oligonucleotides. Finally, we believe that such
756 an approach is the first step toward a unified model of DNA sequence
757 evolution allowing the molecular understanding of both the origin
758 of life and the actual biological reality.},
759 institution = {Université de Franche-Comté, Laboratoire d'Informatique de Besançon,
760 Unité Associée CNRS No 822, France.},
761 keywords = {Base Sequence; Biological Evolution; DNA, genetics; Genetics, Population;
764 medline-pst = {ppublish},
767 timestamp = {2011.05.05}
770 @ARTICLE{Arques1993a,
771 author = {D. G. Arquès and C. J. Michel and K. Orieux},
772 title = {Identification and simulation of new non-random statistical properties
773 common to different populations of eukaryotic non-coding genes.},
774 journal = {J Theor Biol},
780 abstract = {The autocorrelation function analysing the occurrence probability
781 of the i-motif YRY(N)iYRY in genes allows the identification of mainly
782 two periodicities modulo 2, 3 and the preferential occurrence of
783 the motif YRY(N)6YRY (R = purine = adenine or guanine, Y = pyrimidine
784 = cytosine or thymine, N = R or Y). These non-random genetic statistical
785 properties can be simulated by an independent mixing of the three
786 oligonucleotides YRYRYR, YRYYRY and YRY(N)6 (Arquès & Michel, 1990b).
787 The problem investigated in this study is whether new properties
788 can be identified in genes with other autocorrelation functions and
789 also simulated with an oligonucleotide mixing model. The two autocorrelation
790 functions analysing the occurrence probability of the i-motifs RRR(N)iRRR
791 and YYY(N)iYYY simultaneously identify three new non-random genetic
792 statistical properties: a short linear decrease, local maxima for
793 i identical to 3[6] (i = 3, 9, etc) and a large exponential decrease.
794 Furthermore, these properties are common to three different populations
795 of eukaryotic non-coding genes: 5' regions, introns and 3' regions
796 (see section 2). These three non-random properties can also be simulated
797 by an independent mixing of the four oligonucleotides R8, Y8, RRRYRYRRR,
798 YYYRYRYYY and large alternating R/Y series. The short linear decrease
799 is a result of R8 and Y8, the local maxima for i identical to 3[6],
800 of RRRYRYRRR and YYYRYRYYY, and the large exponential decrease, of
801 large alternating R/Y series (section 3). The biological meaning
802 of these results and their relation to the previous oligonucleotide
803 mixing model are presented in the Discussion.},
804 doi = {10.1006/jtbi.1993.1059},
805 institution = {Equipe de Biologie Théorique, Université de Franche-Comté, Laboratoire
806 d'Informatique de Besançon, France.},
807 keywords = {Animals; Biological Evolution; Genes, genetics; Models, Genetic; Models,
808 Statistical; Mutation, genetics; Oligonucleotides, genetics; Probability},
810 medline-pst = {ppublish},
812 pii = {S0022-5193(83)71059-3},
814 timestamp = {2011.05.05},
815 url = {http://dx.doi.org/10.1006/jtbi.1993.1059}
819 author = {David Arroyo and Gonzalo Alvarez and Veronica Fernandez},
820 title = {On the inadequacy of the logistic map for cryptographic applications},
821 journal = {X Reunión Española sobre Criptología y Seguridad de la Información
826 owner = {christophe},
827 timestamp = {2010.03.01}
830 @MISC{Backofen99algorithmicapproach,
831 author = {R. Backofen and S. Will and P. Clote},
832 title = {Algorithmic Approach To Quantifying The Hydrophobic Force Contribution
838 @inproceedings{Blum:1985:EPP:19478.19501,
839 author = {Blum, M. and Goldwasser, S.},
840 title = {An efficient probabilistic public key encryption scheme which hides all partial information},
841 booktitle = {Proceedings of CRYPTO 84 on Advances in cryptology},
843 isbn = {0-387-15658-5},
844 location = {Santa Barbara, California, United States},
847 url = {http://dl.acm.org/citation.cfm?id=19478.19501},
849 publisher = {Springer-Verlag New York, Inc.},
850 address = {New York, NY, USA},
851 keywords = {chosen cyphertext attack, integer factorization, partial information, passive adversaries, probabilistic encryption},
855 @INPROCEEDINGS{bcgr11:ip,
856 author = {Bahi, J. M. and Couchot, J.-F. and Guyeux, C.
858 title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic
859 Boolean Discrete-Time Dynamical Systems},
860 booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory},
865 address = {Oslo, Norway},
869 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
875 author = {Bahi, J. M. and Guyeux, C.},
876 title = {Hash Functions Using Chaotic Iterations},
877 journal = {Journal of Algorithms \& Computational Technology},
883 doi = {10.1260/1748-3018.4.2.167},
884 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
889 url = {http://dx.doi.org/10.1260/1748-3018.4.2.167}
892 @INPROCEEDINGS{guyeux10ter,
893 author = {Bahi, Jacques M. and Guyeux, Christophe},
894 title = {A new chaos-based watermarking algorithm},
895 booktitle = {SECRYPT'10, Int. conf. on security and cryptography},
898 address = {Athens, Greece},
900 publisher = {SciTePress},
902 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
907 @INPROCEEDINGS{bgc11:ip,
908 author = {Bahi, Jacques M. and Guyeux, Christophe and Cote, Nathalie},
909 title = {Chaos of Protein Folding},
910 booktitle = {IJCNN 2011, Int. Joint Conf. on Neural Networks},
913 address = {San Jose, California, United States},
917 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
922 @INPROCEEDINGS{guyeux10bis,
923 author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},
924 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
926 booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications},
929 address = {Venice-Mestre, Italy},
932 doi = {10.1109/SENSORCOMM.2010.76},
933 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
936 url = {http://dx.doi.org/10.1109/SENSORCOMM.2010.76}
939 @INPROCEEDINGS{guyeuxVictoria,
940 author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},
941 title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism
942 versus Watermarking Approach},
943 booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks},
946 series = {Lecture Notes in ICST},
948 address = {Victoria, Canada},
951 doi = {10.1007/978-3-642-17994-5_23},
952 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
955 url = {http://dx.doi.org/10.1007/978-3-642-17994-5_23}
958 @INPROCEEDINGS{bgs11:ip,
959 author = {Bahi, Jacques M. and Guyeux, Christophe and Salomon, Michel},
960 title = {Building a Chaotic Proven Neural Network},
961 booktitle = {ICCANS 2011, IEEE Int. Conf. on Computer Applications and Network
965 address = {Maldives, Maldives},
968 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
973 @INPROCEEDINGS{bgw10:ip,
974 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
975 title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application
977 booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining},
982 address = {Sanya, China},
985 doi = {10.1007/978-3-642-16515-3_26},
986 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
989 url = {http://dx.doi.org/10.1007/978-3-642-16515-3_26}
992 @INPROCEEDINGS{bgw09:ip,
993 author = {Bahi, J. M. and Guyeux, C. and Wang, Q.},
994 title = {A novel pseudo-random generator based on discrete chaotic iterations},
995 booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet},
998 address = {Cannes, France},
1000 classement = {ACTI},
1001 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1006 @INPROCEEDINGS{bmg10:onp,
1007 author = {Bahi, Jacques M. and Makhoul, Abdallah and Guyeux, Christophe},
1008 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
1009 Networks for critical applications},
1010 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
1011 et Applications Critiques de Surveillance},
1013 address = {Bayonne, France},
1015 note = {Communication orale},
1017 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1022 @INPROCEEDINGS{guyeuxBayonne,
1023 author = {Bahi, Jacques M. and Makhoul, Abdallah and Guyeux, Christophe},
1024 title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
1025 Networks for critical applications},
1026 booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
1027 et Applications Critiques de Surveillance},
1029 address = {Bayonne, France},
1031 note = {Communication orale},
1038 author = {Bahi, Jacques M. and Salomon, Michel},
1039 title = {A Decentralized Energy-based Diffusion Algorithm to Increase the
1040 Lifetime of {MANETs}},
1041 journal = {Computer Networks Journal},
1044 note = {Accepted manuscript. To appear},
1045 classement = {ACLI},
1047 impact-factor = {1.201},
1050 publisher = {Elsevier}
1054 author = {J. M. Bahi},
1055 title = {Boolean totally asynchronous iterations},
1056 journal = {Int. Journal of Mathematical Algorithms},
1061 timestamp = {17/02/2008}
1064 @ARTICLE{Bahi2000bis,
1065 author = {Jacques M. Bahi},
1066 title = {Asynchronous iterative algorithms for nonexpansive linear systems},
1067 journal = {Journal of Parallel and Distributed Computing},
1072 timestamp = {2009.01.10}
1076 author = {J. M. Bahi},
1077 title = {Parallel synchronous chaotic iterations for singular linear systems},
1078 journal = {Parallel Algorithms and Applications},
1083 timestamp = {17/02/2008}
1087 author = {Jacques M. Bahi},
1088 title = {Algorithmes paralleles asynchrones pour les systemes singuliers},
1089 journal = {Comptes Rendus de l'Academie des Sciences},
1091 volume = {t. 326, serie 1},
1092 pages = {1421--1425},
1094 timestamp = {2009.01.18}
1098 author = {Jacques M. Bahi},
1099 title = {Méthodes itératives dans des espaces produits. Application au calcul
1101 school = {Université de Franche-Comté},
1103 type = {Habilitation à diriger des recherches},
1104 owner = {christophe},
1105 timestamp = {2010.08.24}
1109 author = {Jacques M. Bahi},
1110 title = {Algorithmes asynchrones pour des systèmes différentiels-algébriques.
1111 Simulation numérique sur des exemples de circuits électriques},
1112 school = {Université de Franche-Comté},
1114 owner = {christophe},
1115 timestamp = {2010.08.24}
1119 author = {Jacques M. Bahi and Sylvain Contassot-Vivier},
1120 title = {Basins of attraction in fully asynchronous discrete-time discrete-state
1122 journal = {IEEE Transactions on Neural Networks},
1129 timestamp = {2009.12.04}
1133 author = {J.~M. Bahi and S. Contassot-Vivier},
1134 title = {Stability of fully asynchronous discrete-time discrete state dynamic
1136 journal = {IEEE Transactions on Neural Networks},
1139 pages = {1353-1363},
1141 timestamp = {2009.02.14}
1144 @TECHREPORT{bcgg10:ir,
1145 author = {Bahi, J. M. and Couchot, J.-F. and Grasset, O. and Guyeux, C.},
1146 title = {{D}iscrete {D}ynamical {S}ystems: {N}ecessary {D}ivergence {C}onditions
1147 for {S}ynchronous {I}terations},
1148 institution = {LIFC - Laboratoire d'{I}nformatique de l'{U}niversit\'{e} de {F}ranche
1151 type = {Research Report},
1152 number = {RR2010-04},
1154 pdf = {/~publis/papers/pub/2010/RR2010-04.pdf}
1158 author = {Bahi, Jacques M. and Guyeux, Christophe},
1159 title = {Hash Functions Using Chaotic Iterations},
1160 journal = {Journal of Algorithms \& Computational Technology},
1165 classement = {ACLNI},
1166 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1168 impact-factor = {#},
1173 @INPROCEEDINGS{guyeux10,
1174 author = {Bahi, J. M. and Guyeux, C.},
1175 title = {Topological chaos and chaotic iterations, application to Hash functions},
1176 booktitle = {WCCI'10, IEEE World Congress on Computational Intelligence},
1179 address = {Barcelona, Spain},
1181 note = {Best paper award},
1182 classement = {ACTI},
1183 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1189 author = {Jacques M. Bahi and Christophe Guyeux},
1190 title = {A chaos-based approach for information hiding security.},
1191 howpublished = {arXiv},
1194 institution = {Computer Science Laboratory LIFC, University of Franche-Comte, France}
1198 author = {Jacques M. Bahi and Christophe Guyeux},
1199 title = {A watermarking algorithm satisfying topological chaos properties},
1202 volume = {abs/0810.4713},
1203 bibsource = {DBLP, http://dblp.uni-trier.de},
1204 ee = {http://arxiv.org/abs/0810.4713}
1208 author = {Jacques M. Bahi and Christophe Guyeux},
1209 title = {Chaotic iterations and topological chaos},
1211 abstract = {Chaotic iterations have been introduced on the one hand by Chazan,
1212 Miranker [5] and Miellou [9] in a numerical analysis context, and
1213 on the other hand by Robert [11] and Pellegrin [10] in the discrete
1214 dynamical systems framework. In both cases, the objective was to
1215 derive conditions of convergence of such iterations to a fixed state.
1216 In this paper, a new point of view is presented, the goal here is
1217 to derive conditions under which chaotic iterations admit a chaotic
1218 behaviour in a rigorous mathematical sense. Contrary to what has
1219 been studied in the literature, convergence is not desired. More
1220 precisely, we establish in this paper a link between the concept
1221 of chaotic iterations on a finite set and the notion of topological
1222 chaos [8], [6], [7]. We are motivated by concrete applications of
1223 our approach, such as the use of chaotic boolean iterations in the
1224 computer security field. Indeed, the concept of chaos is used in
1225 many areas of data security without real rigorous theoretical foundations,
1226 and without using the fundamental properties that allow chaos. The
1227 wish of this paper is to bring a bit more mathematical rigour in
1229 citeseerurl = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
1231 comments = {6 pages},
1232 eprint = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}},
1233 oai2identifier = {0810.3154},
1235 timestamp = {2008.10.23},
1236 url = {\href{http://arxiv.org/abs/0810.3154v1}{arXiv:0810.3154}}
1239 @ARTICLE{arxivRNNchaos,
1240 author = {Jacques M. Bahi and Christophe Guyeux and Michel Salomon},
1241 title = {Building a Chaotic Proved Neural Network},
1244 volume = {abs/1101.4351},
1245 ee = {http://arxiv.org/abs/1101.4351}
1248 @INPROCEEDINGS{guyeuxTaiwan10,
1249 author = {Bahi, J. M. and Guyeux, C. and Wang, Q.},
1250 title = {Improving random number generators by chaotic iterations. Application
1252 booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling},
1254 pages = {V13-643--V13-647},
1255 address = {Taiyuan, China},
1257 classement = {ACTI},
1258 doi = {10.1109/ICCASM.2010.5622199},
1259 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
1262 url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199}
1266 author = {Jacques M Bahi and Christian J Michel},
1267 title = {A stochastic model of gene evolution with time dependent pseudochaotic
1269 journal = {Bull Math Biol},
1275 abstract = {We develop here a new class of stochastic models of gene evolution
1276 in which a random subset of the 64 possible trinucleotides mutates
1277 at each evolutionary time t according to some time dependent substitution
1278 probabilities. Therefore, at each time t, the numbers and the types
1279 of mutable trinucleotides are unknown. Thus, the mutation matrix
1280 changes at each time t. This pseudochaotic model developed generalizes
1281 the standard model in which all the trinucleotides mutate at each
1282 time t. It determines the occurrence probabilities at time t of trinucleotides
1283 which pseudochaotically mutate according to 3 time dependent substitution
1284 parameters associated with the 3 trinucleotide sites. The main result
1285 proves that under suitable assumptions, this pseudochaotic model
1286 converges to a uniform probability vector identical to that of the
1287 standard model. Furthermore, an application of this pseudochaotic
1288 model allows an evolutionary study of the 3 circular codes identified
1289 in both eukaryotic and prokaryotic genes. A circular code is a particular
1290 set of trinucleotides whose main property is the retrieval of the
1291 frames in genes locally, i.e., anywhere in genes and particularly
1292 without start codons, and automatically with a window of a few nucleotides.
1293 After a certain evolutionary time and with particular time dependent
1294 functions for the 3 substitution parameters, precisely an exponential
1295 decrease in the 1st and 2nd trinucleotide sites and an exponential
1296 increase in the 3rd one, this pseudochaotic model retrieves the main
1297 statistical properties of the 3 circular codes observed in genes.
1298 Furthermore, it leads to a circular code asymmetry stronger than
1299 the standard model (nonpseudochaotic) and, therefore, to a better
1300 correlation with the genes.},
1301 doi = {10.1007/s11538-008-9376-4},
1302 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
1303 90016, Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
1304 keywords = {Evolution, Molecular; Genes; Models, Genetic; Mutation; Stochastic
1307 medline-pst = {ppublish},
1310 timestamp = {2011.05.05},
1311 url = {http://dx.doi.org/10.1007/s11538-008-9376-4}
1315 author = {Jacques M Bahi and Christian J Michel},
1316 title = {A stochastic model of gene evolution with chaotic mutations.},
1317 journal = {J Theor Biol},
1323 abstract = {We develop here a new class of stochastic models of gene evolution
1324 in which the mutations are chaotic, i.e. a random subset of the 64
1325 possible trinucleotides mutates at each evolutionary time t according
1326 to some substitution probabilities. Therefore, at each time t, the
1327 numbers and the types of mutable trinucleotides are unknown. Thus,
1328 the mutation matrix changes at each time t. The chaotic model developed
1329 generalizes the standard model in which all the trinucleotides mutate
1330 at each time t. It determines the occurrence probabilities at time
1331 t of trinucleotides which chaotically mutate according to three substitution
1332 parameters associated with the three trinucleotide sites. Two theorems
1333 prove that this chaotic model has a probability vector at each time
1334 t and that it converges to a uniform probability vector identical
1335 to that of the standard model. Furthermore, four applications of
1336 this chaotic model (with a uniform random strategy for the 64 trinucleotides
1337 and with a particular strategy for the three stop codons) allow an
1338 evolutionary study of the three circular codes identified in both
1339 eukaryotic and prokaryotic genes. A circular code is a particular
1340 set of trinucleotides whose main property is the retrieval of the
1341 frames in genes locally, i.e. anywhere in genes and particularly
1342 without start codons, and automatically with a window of a few nucleotides.
1343 After a certain evolutionary time and with particular values for
1344 the three substitution parameters, the chaotic models retrieve the
1345 main statistical properties of the three circular codes observed
1346 in genes. These applications also allow an evolutionary comparison
1347 between the standard and chaotic models.},
1348 doi = {10.1016/j.jtbi.2008.07.028},
1349 institution = {LIFC-EA 4157, Université de Franche-Comté, IUT de Belfort, BP 527,
1350 90016 Belfort Cedex, France. jacques.bahi@univ-fcomte.fr},
1351 keywords = {Animals; Computer Simulation; DNA, Circular, genetics; Evolution,
1352 Molecular; Genetic Code; Models, Genetic; Mutation; Nonlinear Dynamics;
1353 Stochastic Processes; Time},
1355 medline-pst = {ppublish},
1357 pii = {S0022-5193(08)00395-0},
1359 timestamp = {2011.05.05},
1360 url = {http://dx.doi.org/10.1016/j.jtbi.2008.07.028}
1363 @ARTICLE{Bahi2008bis,
1364 author = {Bahi, J. M. and Michel, C. J.},
1365 title = {A stochastic model of gene evolution with chaotic mutations},
1366 journal = {Journal of Theoretical Biology},
1371 timestamp = {2009.01.10}
1375 author = {Jacques M Bahi and Christian J Michel},
1376 title = {A stochastic gene evolution model with time dependent mutations.},
1377 journal = {Bull Math Biol},
1383 abstract = {We develop here a new class of gene evolution models in which the
1384 nucleotide mutations are time dependent. These models allow to study
1385 nonlinear gene evolution by accelerating or decelerating the mutation
1386 rates at different evolutionary times. They generalize the previous
1387 ones which are based on constant mutation rates. The stochastic model
1388 developed in this class determines at some time t the occurrence
1389 probabilities of trinucleotides mutating according to 3 time dependent
1390 substitution parameters associated with the 3 trinucleotide sites.
1391 Therefore, it allows to simulate the evolution of the circular code
1392 recently observed in genes. By varying the class of function for
1393 the substitution parameters, 1 among 12 models retrieves after mutation
1394 the statistical properties of the observed circular code in the 3
1395 frames of actual genes. In this model, the mutation rate in the 3rd
1396 trinucleotide site increases during gene evolution while the mutation
1397 rates in the 1st and 2nd sites decrease. This property agrees with
1398 the actual degeneracy of the genetic code. This approach can easily
1399 be generalized to study evolution of motifs of various lengths, e.g.,
1400 dicodons, etc., with time dependent mutations.},
1401 doi = {10.1016/j.bulm.2003.10.004},
1402 institution = {LIFC - FRE CNRS 2661, IUT de Belfort, Université de Franche-Comté,
1403 BP 527, 90016 Belfort Cédex, France. bahi@iut-bm.univ-fcomte.fr},
1404 keywords = {Codon, genetics; Evolution, Molecular; Genes, genetics; Genetic Code,
1405 genetics; Models, Genetic; Mutation; Stochastic Processes},
1407 medline-pst = {ppublish},
1409 pii = {S0092824003001174},
1411 timestamp = {2011.05.05},
1412 url = {http://dx.doi.org/10.1016/j.bulm.2003.10.004}
1416 author = {J. Banks and J. Brooks and G. Cairns and P. Stacey},
1417 title = {On Devaney's Definition of Chaos},
1418 journal = {Amer. Math. Monthly},
1424 timestamp = {27/01/2008}
1428 author = {E. Barker and A. Roginsky},
1429 title = {DRAFT NIST Special Publication 800-131 Recommendation for the Transitioning
1430 of Cryptographic Algorithms and Key Sizes},
1432 owner = {christophe},
1433 timestamp = {2010.08.18}
1437 author = {Mauro Barni and Franco Bartolini and Teddy Furon},
1438 title = {A general framework for robust watermarking security},
1439 journal = {Signal Processing},
1442 pages = {2069-2084},
1444 note = {Special issue on Security of Data Hiding Technologies, invited paper},
1445 bibsource = {DBLP, http://dblp.uni-trier.de},
1446 ee = {http://dx.doi.org/10.1016/S0165-1684(03)00168-3},
1448 timestamp = {2009.06.30}
1452 author = {Baudet, G\'{e}rard M.},
1453 title = {Asynchronous Iterative Methods for Multiprocessors},
1459 address = {New York, NY, USA},
1460 doi = {http://doi.acm.org/10.1145/322063.322067},
1466 author = {Didier El Baz},
1467 title = {Contribution à l'algorithmique parallèle. Le concept d'asynchronisme
1468 : étude théorique, mise en œuvre, et application},
1469 school = {Institut national polytechnique de Toulouse},
1471 type = {Habilitation à diriger des recherches},
1472 owner = {christophe},
1473 timestamp = {2010.08.24}
1477 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
1478 title = {Contention awareness and fault-tolerant scheduling for precedence
1479 constrained tasks in heterogeneous systems},
1480 journal = {Parallel Computing},
1486 doi = {10.1016/j.parco.2008.11.001},
1489 url = {http://dx.doi.org/10.1016/j.parco.2008.11.001}
1492 @INPROCEEDINGS{bhr08b:bl,
1493 author = {Benoit, Anne and Hakem, Mourad and Robert, Yves},
1494 title = {Fault tolerant scheduling of precedence task graphs on heterogeneous
1496 booktitle = {IPDPS'08},
1499 publisher = {IEEE Computer Society Press},
1505 @INPROCEEDINGS{Berger98,
1506 author = {Berger, Bonnie and Leighton, Tom},
1507 title = {Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete},
1508 booktitle = {Proceedings of the second annual international conference on Computational
1511 series = {RECOMB '98},
1513 address = {New York, NY, USA},
1516 isbn = {0-89791-976-9},
1517 location = {New York, New York, United States},
1522 title = {Parallel and distributed computation: numerical methods},
1523 publisher = {Prentice-Hall, Inc.},
1525 author = {Bertsekas, Dimitri P. and Tsitsiklis, John N.},
1526 address = {Upper Saddle River, NJ, USA},
1527 isbn = {0-13-648700-9}
1530 @MISC{Bertsekas88paralleland,
1531 author = {Dimitri P. Bertsekas and John N. Tsitsiklis},
1532 title = {Parallel and distributed iterative algorithms: a selective survey},
1537 author = {F. Blanchard and E. Glasner and S. Kolyada and A.Maass},
1538 title = {On Li-Yorke pairs},
1542 timestamp = {2008.01.02}
1546 author = {F. Blanchard and B. Host and S. Ruette},
1547 title = {Asymptotic pairs in positive-entropy systems},
1549 optannote = {to appear in Ergod. Th. Dynam. Sys.},
1552 timestamp = {2008.01.02}
1556 author = {Dan Boneh and Matt Franklin},
1557 title = {Identity-Based Encryption from the {Weil} Pairing},
1558 journal = {SIAM J. of Computing},
1563 note = {Extended abstract in Crypto'01}
1566 @INCOLLECTION{boneh,
1567 author = {Boneh, Dan and Goh, Eu-Jin and Nissim, Kobbi},
1568 title = {Evaluating 2-DNF Formulas on Ciphertexts},
1571 abstract = {Let ψ be a 2-DNF formula on boolean variables x 1,..., x n ∈ {0,1}.
1572 We present a homomorphic public key encryption scheme that allows
1573 the public evaluation of ψ given an encryption of the variables x
1574 1,..., x n. In other words, given the encryption of the bits x 1,...,
1575 x n, anyone can create the encryption of ψ( x 1,..., x n). More generally,
1576 we can evaluate quadratic multi-variate polynomials on ciphertexts
1577 provided the resulting value falls within a small set. We present
1578 a number of applications of the system: 1 In a database of size n,
1579 the total communication in the basic step of the Kushilevitz-Ostrovsky
1580 PIR protocol is reduced from to . 2 An efficient election system
1581 based on homomorphic encryption where voters do not need to include
1582 non-interactive zero knowledge proofs that their ballots are valid.
1583 The election system is proved secure without random oracles but still
1584 efficient. 3 A protocol for universally verifiable computation.},
1585 citeulike-article-id = {2719460},
1586 citeulike-linkout-0 = {http://www.springerlink.com/content/wtt5caxkr94laxkg},
1587 journal = {Theory of Cryptography},
1588 keywords = {homomorphic, pairings},
1589 posted-at = {2008-04-25 21:53:15},
1591 url = {http://www.springerlink.com/content/wtt5caxkr94laxkg}
1595 author = {Bonneau, Richard and Baker, David},
1596 title = {AB INITIO PROTEIN STRUCTURE PREDICTION: Progress and Prospects},
1597 journal = {Annual Review of Biophysics and Biomolecular Structure},
1602 doi = {10.1146/annurev.biophys.30.1.173}
1606 author = {R. Bowen},
1607 title = {Entropy for group endomorphisms and homogeneous spaces},
1608 journal = {Trans. Amer. Math. Soc.},
1613 timestamp = {15/02/2008}
1617 author = {R. Bowen},
1618 title = {Periodic points and measures for Axiom A diffeomorphisms},
1619 journal = {Trans. Amer. Math. Soc.},
1624 timestamp = {15/02/2008}
1627 @ARTICLE{Braxenthaler97,
1628 author = {Michael Braxenthaler and R. Ron Unger and Ditza Auerbach and John
1630 title = {Chaos in protein dynamics},
1631 journal = {Proteins-structure Function and Bioinformatics},
1635 doi = {10.1002/(SICI)1097-0134(199712)29:4<417::AID-PROT2>3.3.CO;2-O},
1639 @INPROCEEDINGS{Brumley03remotetiming,
1640 author = {David Brumley and Dan Boneh},
1641 title = {Remote Timing Attacks are Practical},
1642 booktitle = {Proceedings of the 12th USENIX Security Symposium},
1647 @ARTICLE{Bohm1991375,
1648 author = {Gerald Böhm},
1649 title = {Protein folding and deterministic chaos: Limits of protein folding
1650 simulations and calculations},
1651 journal = {Chaos, Solitons \& Fractals},
1654 pages = {375 - 382},
1656 doi = {DOI: 10.1016/0960-0779(91)90028-8},
1658 url = {http://www.sciencedirect.com/science/article/B6TJ4-46CBXVT-1X/2/370489c218e4c2732cd9b620ef50c696}
1661 @INCOLLECTION{Cachin2004,
1662 author = {Cachin, Christian},
1663 title = {An Information-Theoretic Model for Steganography},
1664 booktitle = {Information Hiding},
1665 publisher = {Springer Berlin / Heidelberg},
1668 series = {Lecture Notes in Computer Science},
1670 affiliation = {MIT Laboratory for Computer Science 545 Technology Square Cambridge
1675 author = {H. Cam and S. Ozdemir and P. Nair and D. Muthuavinashinappan and
1677 title = {ESPDA: Energy-efficient secure pattern based data aggregation for
1678 wireless sensor networks.},
1679 journal = {Computer Communication journal (29)},
1684 @ARTICLE{CarletCZ98,
1685 author = {Claude Carlet and Pascale Charpin and Victor Zinoviev},
1686 title = {Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems},
1687 journal = {Des. Codes Cryptography},
1692 bibsource = {DBLP, http://dblp.uni-trier.de}
1695 @INPROCEEDINGS{Castelluccia05efficientaggregation,
1696 author = {Claude Castelluccia},
1697 title = {Efficient aggregation of encrypted data in wireless sensor networks},
1698 booktitle = {MobiQuitous},
1701 publisher = {IEEE Computer Society}
1705 author = {Cayre, F. and Bas, P.},
1706 title = {Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding},
1707 journal = {IEEE Transactions on Information Forensics and Security},
1712 doi = {10.1109/TIFS.2007.916006},
1714 keywords = {cryptography, random sequences, spread spectrum communication, telecommunication
1715 security, watermarking, Kerckhoffs-based embedding security classes,
1716 WOA Data Hiding, pseudorandom sequences, spread-spectrum techniques,
1717 steganography security, watermark-only-attack, watermarking, Security,
1718 spread-spectrum (SS) watermarking},
1720 timestamp = {2009.06.29}
1724 author = {Cayre, F. and Fontaine, C. and Furon, T.},
1725 title = {Watermarking security: theory and practice},
1726 journal = {IEEE Transactions on Signal Processing},
1729 pages = {3976--3987},
1731 doi = {10.1109/TSP.2005.855418},
1733 keywords = {blind source separation, cryptography, watermarking, Fisher information
1734 matrix, blind source separation, cryptanalysis, information theory,
1735 spread spectrum techniques, substitutive scheme, watermarking security,
1736 Blind source separation, Fisher information matrix, equivocation,
1737 security, watermarking},
1739 timestamp = {2009.06.29}
1742 @ARTICLE{Chajakis91,
1743 author = {Chajakis, Emmanuel D. and Zenios, Stavros A.},
1744 title = {Synchronous and asynchronous implementations of relaxation algorithms
1745 for nonlinear network optimization},
1746 journal = {Parallel Comput.},
1751 address = {Amsterdam, The Netherlands, The Netherlands},
1752 doi = {http://dx.doi.org/10.1016/S0167-8191(05)80072-9},
1754 publisher = {Elsevier Science Publishers B. V.}
1758 author = {Chan, Haowen and Perrig, Adrian and Przydatek, Bartosz and Song,
1760 title = {SIA: Secure information aggregation in sensor networks},
1761 journal = {J. Comput. Secur.},
1766 address = {Amsterdam, The Netherlands, The Netherlands},
1768 publisher = {IOS Press}
1771 @ARTICLE{Chandramouli06,
1772 author = {R. Chandramouli and S. Bapatla and K.P. Subbalakshmi},
1773 title = {Battery power-aware encryption},
1774 journal = {ACM transactions on information and system security},
1777 owner = {christophe},
1778 timestamp = {2010.07.31}
1782 author = {Pascale Charpin},
1783 title = {A description of some extended cyclic codes with application to Reed-Solomon
1785 journal = {Discrete Mathematics},
1790 bibsource = {DBLP, http://dblp.uni-trier.de},
1791 ee = {http://dx.doi.org/10.1016/0012-365X(85)90019-6}
1795 author = {D. Chazan and W. Miranker},
1796 title = {Chaotic relaxation},
1797 journal = {Linear algebra and its applications},
1801 timestamp = {2008.05.22}
1805 author = {Cheon, Jung Hee and Kim, Woo-Hwan and Nam, Hyun Soo},
1806 title = {Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy
1807 homomorphism scheme},
1808 journal = {Inf. Process. Lett.},
1813 address = {Amsterdam, The Netherlands, The Netherlands},
1814 doi = {http://dx.doi.org/10.1016/j.ipl.2005.09.016},
1816 publisher = {Elsevier North-Holland, Inc.}
1819 @MISC{Cheon03acryptanalysis,
1820 author = {Jung Hee Cheon and Hyun Soo Nam},
1821 title = {A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy
1827 author = {R.C.C. Cheung and N.J. Telle and W. Luk and P.Y.K. Cheung},
1828 title = {Secure encrypted-data aggregation for wireless sensor networks},
1829 journal = {IEEE Trans. on Very Large Scale Integration Systems},
1832 pages = {1048-1059},
1836 @ARTICLE{Chivian2005,
1837 author = {Chivian, Dylan and Kim, David E. and Malmström, Lars and Schonbrun,
1838 Jack and Rohl, Carol A. and Baker, David},
1839 title = {Prediction of CASP6 structures using automated robetta protocols},
1840 journal = {Proteins},
1846 keywords = {Rosetta, fragment assembly, de novo modeling, homology modeling, parametric
1847 alignment ensemble},
1848 owner = {christophe},
1849 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
1850 timestamp = {2011.01.22},
1851 url = {http://dx.doi.org/10.1002/prot.20733}
1855 author = {Congxu, Zhu and Xuefeng, Liao and Zhihua, Li},
1856 title = {Chaos-based multipurpose image watermarking algorithm},
1857 journal = {Wuhan University Journal of Natural Sciences},
1860 pages = {1675-1678},
1861 note = {10.1007/BF02831848},
1862 abstract = {To achieve the goal of image content authentication and copyright
1863 protection simultaneously, this paper presents a novel image dual
1864 watermarking method based on chaotic map. Firstly, the host image
1865 was split into many nonoverlapping small blocks, and the block-wise
1866 discrete cosine transform (DCT) is computed. Secondly, the robust
1867 watermarks, shuffled by the chaotic sequences, are embedded in the
1868 DC coefficients of blocks to achieve the goal of copyright protection.
1869 The semi-fragile watermarks, generated by chaotic map, are embedded
1870 in the AC coefficients of blocks to obtain the aim of image authentication.
1871 Both of them can be extracted without the original image. Simulation
1872 results demonstrate the effectiveness of our algorithm in terms of
1873 robustness and fragility.},
1874 affiliation = {Central South University School of Information Science and Engineering
1875 410083 Changsha, Hunan China},
1878 keyword = {Mathematics, general},
1879 publisher = {Wuhan University, co-published with Springer},
1880 url = {http://dx.doi.org/10.1007/BF02831848}
1883 @ARTICLE{Conley1978,
1884 author = {C. Conley},
1885 title = {Isolated invariant sets and the Morse index},
1886 journal = {CBMS Regional Conference. AMS.},
1890 timestamp = {2008.01.02}
1894 author = {Philippe Cornu and André Smolarz},
1895 title = {Image characterization by texture},
1896 journal = {Traitement du signal},
1900 file = {:/home/guyeux/Documents/Bibliotheque/These/Watermarking/Caractérisation d'images par textures associées.pdf:PDF},
1902 timestamp = {2008.05.12}
1905 @INPROCEEDINGS{Cox99,
1906 author = {Ingemar Cox and Matt L. Miller and Andrew L. Mckellips},
1907 title = {Watermarking as Communications With Side Information},
1908 booktitle = {Proceedings of the IEEE},
1910 pages = {1127--1141},
1911 owner = {christophe},
1912 timestamp = {2010.03.06}
1915 @ARTICLE{Cox97securespread,
1916 author = {Ingemar J. Cox and Senior Member and Joe Kilian and F. Thomson Leighton
1918 title = {Secure spread spectrum watermarking for multimedia},
1919 journal = {IEEE Transactions on Image Processing},
1922 pages = {1673--1687}
1926 author = {Christopher Cramer and Erol Gelenbe and Hakan Bakircioglu},
1927 title = {Video Compression with Random Neural Networks},
1928 journal = {Neural Networks for Identification, Control, and Robotics, International
1933 address = {Los Alamitos, CA, USA},
1934 isbn = {0-8186-7456-3},
1935 publisher = {IEEE Computer Society}
1938 @INPROCEEDINGS{Crescenzi98,
1939 author = {Crescenzi, Pierluigi and Goldman, Deborah and Papadimitriou, Christos
1940 and Piccolboni, Antonio and Yannakakis, Mihalis},
1941 title = {On the complexity of protein folding (extended abstract)},
1942 booktitle = {Proceedings of the thirtieth annual ACM symposium on Theory of computing},
1944 series = {STOC '98},
1946 address = {New York, NY, USA},
1949 isbn = {0-89791-962-9},
1950 location = {Dallas, Texas, United States},
1955 author = {Zhao Dawei and Chen Guanrong and Liu Wenbo},
1956 title = {A chaos-based robust wavelet-domain watermarking algorithm},
1957 journal = {Chaos, Solitons and Fractals},
1962 timestamp = {2008.10.07}
1966 author = {Anthony Desnos and Robert Erra and Eric Filiol},
1967 title = {Processor-Dependent Malware... and codes},
1969 comment = {arXiv:1011.1638},
1970 eprint = {arXiv:1011.1638}
1974 title = {An Introduction to Chaotic Dynamical Systems},
1975 publisher = {Addison-Wesley},
1977 author = {Devaney, R. L.},
1978 address = {Redwood City, CA},
1983 author = {Whitfield Diffie and Martin E. Hellman},
1984 title = {New Directions in Cryptography},
1985 journal = {IEEE Transactions on Information Theory},
1990 date = {November 1976},
1992 timestamp = {2009.06.30},
1993 url = {citeseer.ist.psu.edu/diffie76new.html}
1996 @INCOLLECTION{Dijk10,
1997 author = {van Dijk, Marten and Gentry, Craig and Halevi, Shai and Vaikuntanathan,
1999 title = {Fully Homomorphic Encryption over the Integers},
2000 booktitle = {Advances in Cryptology – EUROCRYPT 2010},
2001 publisher = {Springer Berlin / Heidelberg},
2003 editor = {Gilbert, Henri},
2005 series = {Lecture Notes in Computer Science},
2007 abstract = {We construct a simple fully homomorphic encryption scheme, using only
2008 elementary modular arithmetic. We use Gentry’s technique to construct
2009 a fully homomorphic scheme from a bootstrappable somewhat homomorphic
2010 scheme. However, instead of using ideal lattices over a polynomial
2011 ring, our bootstrappable encryption scheme merely uses addition and
2012 multiplication over the integers. The main appeal of our scheme is
2013 the conceptual simplicity. We reduce the security of our scheme to
2014 finding an approximate integer gcd – i.e., given a list of integers
2015 that are near-multiples of a hidden integer, output that hidden integer.
2016 We investigate the hardness of this task, building on earlier work
2017 of Howgrave-Graham.},
2018 affiliation = {MIT CSAIL}
2022 author = {Dill, KA},
2023 title = {Theory for the folding and stability of globular proteins.},
2024 journal = {Biochemistry},
2030 abstract = {Using lattice statistical mechanics, we develop theory to account
2031 for the folding of a heteropolymer molecule such as a protein to
2032 the globular and soluble state. Folding is assumed to be driven by
2033 the association of solvophobic monomers to avoid solvent and opposed
2034 by the chain configurational entropy. Theory predicts a phase transition
2035 as a function of temperature or solvent character. Molecules that
2036 are too short or too long or that have too few solvophobic residues
2037 are predicted not to fold. Globular molecules should have a largely
2038 solvophobic core, but there is an entropic tendency for some residues
2039 to be "out of place", particularly in small molecules. For long chains,
2040 molecules comprised of globular domains are predicted to be thermodynamically
2041 more stable than spherical molecules. The number of accessible conformations
2042 in the globular state is calculated to be an exceedingly small fraction
2043 of the number available to the random coil. Previous estimates of
2044 this number, which have motivated kinetic theories of folding, err
2045 by many tens of orders of magnitude.},
2046 comment = {Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't, P.H.S.,},
2047 keywords = {Mathematics, Models, Chemical, Polymers, Protein Conformation},
2048 owner = {christophe},
2049 timestamp = {2011.01.22},
2050 url = {http://ukpmc.ac.uk/abstract/MED/3986190}
2054 author = {Dill, KA and Bromberg, S and Yue, K and Fiebig, KM and Yee, DP and
2055 Thomas, PD and Chan, HS},
2056 title = {Principles of protein folding--a perspective from simple exact models.},
2057 journal = {Protein Sci},
2060 pages = {561-602--},
2063 abstract = {General principles of protein structure, stability, and folding kinetics
2064 have recently been explored in computer simulations of simple exact
2065 lattice models. These models represent protein chains at a rudimentary
2066 level, but they involve few parameters, approximations, or implicit
2067 biases, and they allow complete explorations of conformational and
2068 sequence spaces. Such simulations have resulted in testable predictions
2069 that are sometimes unanticipated: The folding code is mainly binary
2070 and delocalized throughout the amino acid sequence. The secondary
2071 and tertiary structures of a protein are specified mainly by the
2072 sequence of polar and nonpolar monomers. More specific interactions
2073 may refine the structure, rather than dominate the folding code.
2074 Simple exact models can account for the properties that characterize
2075 protein folding: two-state cooperativity, secondary and tertiary
2076 structures, and multistage folding kinetics--fast hydrophobic collapse
2077 followed by slower annealing. These studies suggest the possibility
2078 of creating "foldable" chain molecules other than proteins. The encoding
2079 of a unique compact chain conformation may not require amino acids;
2080 it may require only the ability to synthesize specific monomer sequences
2081 in which at least one monomer type is solvent-averse.},
2082 address = {Department of Pharmaceutical Chemistry, University of California,
2083 San Francisco 94143-1204, USA.},
2084 comment = {Review,Research Support, Non-U.S. Gov't,Research Support, U.S. Gov't,
2085 Non-P.H.S.,Research Support, U.S. Gov't, P.H.S.,},
2086 keywords = {Amino Acid Sequence, Biological Evolution, Hydrogen Bonding, Models,
2087 Molecular, Molecular Sequence Data, Mutation, Protein Conformation,
2088 Protein Denaturation, Protein Folding, Temperature, Thermodynamics},
2089 owner = {christophe},
2090 timestamp = {2011.01.22},
2091 url = {http://ukpmc.ac.uk/abstract/MED/7613459}
2094 @INPROCEEDINGS{Dobbertin96,
2095 author = {Dobbertin, Hans},
2096 title = {Cryptanalysis of MD4},
2097 booktitle = {Proceedings of the Third International Workshop on Fast Software
2101 address = {London, UK},
2102 publisher = {Springer-Verlag},
2103 isbn = {3-540-60865-6}
2106 @INPROCEEDINGS{DomingoFerrer2002,
2107 author = {Domingo-Ferrer, Josep},
2108 title = {A Provably Secure Additive and Multiplicative Privacy Homomorphism},
2109 booktitle = {ISC '02: Proceedings of the 5th International Conference on Information
2113 address = {London, UK},
2114 publisher = {Springer-Verlag},
2115 isbn = {3-540-44270-7}
2118 @ARTICLE{Dubchak1995,
2119 author = {I. Dubchak and I. Muchnik and S. R. Holbrook and S. H. Kim},
2120 title = {Prediction of protein folding class using global description of amino
2122 journal = {Proc Natl Acad Sci U S A},
2125 pages = {8700--8704},
2128 __markedentry = {[guyeux]},
2129 abstract = {We present a method for predicting protein folding class based on
2130 global protein chain description and a voting process. Selection
2131 of the best descriptors was achieved by a computer-simulated neural
2132 network trained on a data base consisting of 83 folding classes.
2133 Protein-chain descriptors include overall composition, transition,
2134 and distribution of amino acid attributes, such as relative hydrophobicity,
2135 predicted secondary structure, and predicted solvent exposure. Cross-validation
2136 testing was performed on 15 of the largest classes. The test shows
2137 that proteins were assigned to the correct class (correct positive
2138 prediction) with an average accuracy of 71.7\%, whereas the inverse
2139 prediction of proteins as not belonging to a particular class (correct
2140 negative prediction) was 90-95\% accurate. When tested on 254 structures
2141 used in this study, the top two predictions contained the correct
2142 class in 91\% of the cases.},
2143 institution = {Department of Chemistry, University of California, Berkeley 94720,
2145 keywords = {Amino Acid Sequence; Amino Acids, chemistry; Computer Simulation;
2146 Databases, Factual; Models, Chemical; Neural Networks (Computer);
2147 Protein Folding; Protein Structure, Secondary; Proteins, chemistry/classification;
2148 Reproducibility of Results; Solvents},
2150 medline-pst = {ppublish},
2153 timestamp = {2011.07.18}
2157 title = {Real analysis and probability},
2158 publisher = {Cambridge University Press},
2159 author = {Richard M. Dudley},
2162 timestamp = {2008.01.02}
2166 author = {El Tarazi, Mouhamed Nabih},
2167 title = {Algorithmes mixtes asynchrones. Etude de convergence monotone},
2168 journal = {Numerische Mathematik},
2172 note = {10.1007/BF01405568},
2173 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
2177 keyword = {Mathematics and Statistics},
2178 publisher = {Springer Berlin / Heidelberg},
2179 url = {http://dx.doi.org/10.1007/BF01405568}
2183 author = {El Tarazi, Mouhamed Nabih},
2184 title = {Some convergence results for asynchronous algorithms},
2185 journal = {Numerische Mathematik},
2189 note = {10.1007/BF01407866},
2190 affiliation = {Department of Mathematics, Faculty of Science Kuwait University P.O.
2191 Box 5969 Kuwait Kuwait},
2194 keyword = {Mathematics and Statistics},
2195 publisher = {Springer Berlin / Heidelberg},
2196 url = {http://dx.doi.org/10.1007/BF01407866}
2200 author = {Peng Fei and Qiu Shui-Sheng and Long Min},
2201 title = {A secure digital signature algorithm based on elliptic curve and
2203 journal = {Circuits Systems Signal Processing},
2205 volume = {24, No. 5},
2208 timestamp = {2009.01.16}
2211 @BOOK{Feigenbaum1908,
2212 title = {Universal behavior in nonlinear systems},
2213 publisher = {Los Alamos Science},
2215 author = {Feigenbaum},
2217 timestamp = {2008.01.02}
2220 @ARTICLE{Felsenstein1980,
2221 author = {J. Felsenstein},
2222 title = {A view of population genetics.},
2223 journal = {Science},
2229 doi = {10.1126/science.208.4449.1253},
2231 medline-pst = {ppublish},
2233 pii = {208/4449/1253},
2235 timestamp = {2011.05.05},
2236 url = {http://dx.doi.org/10.1126/science.208.4449.1253}
2240 title = {Les virus informatiques : techniques virales et antivirales avancées},
2242 editor = {Springer},
2243 author = {Eric Filiol},
2244 owner = {christophe},
2245 timestamp = {2010.10.13}
2248 @INPROCEEDINGS{FiliolBlackHat,
2249 author = {Eric Filiol},
2250 title = {Passive and Active Leakage of Secret Data from Non Networked Computer},
2251 booktitle = {Black Hat},
2253 owner = {christophe},
2254 timestamp = {2010.11.28}
2257 @PHDTHESIS{Formenti2003,
2258 author = {Enrico Formenti},
2259 title = {De l'algorithmique du chaos dans les systèmes dynamiques discrets},
2260 school = {Université de Provence},
2263 timestamp = {2008.01.02}
2266 @PHDTHESIS{Formenti1998,
2267 author = {Enrico Formenti},
2268 title = {Automates cellulaires et chaos : de la vision topologique à la vision
2270 school = {\'Ecole Normale Supérieure de Lyon},
2272 optmonth = {Octobre},
2274 timestamp = {2008.01.02}
2278 author = {Gabriel Frey and Christian J Michel},
2279 title = {Identification of circular codes in bacterial genomes and their use
2280 in a factorization method for retrieving the reading frames of genes.},
2281 journal = {Comput Biol Chem},
2287 abstract = {We developed a statistical method that allows each trinucleotide to
2288 be associated with a unique frame among the three possible ones in
2289 a (protein coding) gene. An extensive gene study in 175 complete
2290 bacterial genomes based on this statistical approach resulted in
2291 identification of 72 new circular codes. Finding a circular code
2292 enables an immediate retrieval of the reading frame locally anywhere
2293 in a gene. No knowledge of location of the start codon is required
2294 and a short window of only a few nucleotides is sufficient for automatic
2295 retrieval. We have therefore developed a factorization method (that
2296 explores previously found circular codes) for retrieving the reading
2297 frames of bacterial genes. Its principle is new and easy to understand.
2298 Neither complex treatment nor specific information on the nucleotide
2299 sequences is necessary. Moreover, the method can be used for short
2300 regions in nucleotide sequences (less than 25 nucleotides in protein
2301 coding genes). Selected additional properties of circular codes and
2302 their possible biological consequences are also discussed.},
2303 doi = {10.1016/j.compbiolchem.2005.11.001},
2304 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
2305 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
2306 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
2307 keywords = {Base Sequence; Computational Biology; Genes, Bacterial; Genome, Bacterial;
2308 Genomics, statistics /&/ numerical data; Models, Genetic; Models,
2309 Statistical; Reading Frames},
2311 medline-pst = {ppublish},
2313 pii = {S1476-9271(05)00111-8},
2315 timestamp = {2011.05.05},
2316 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.11.001}
2320 author = {Gabriel Frey and Christian J Michel},
2321 title = {An analytical model of gene evolution with six mutation parameters:
2322 an application to archaeal circular codes.},
2323 journal = {Comput Biol Chem},
2329 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
2330 mutation matrix 64 x 64 with six substitution parameters associated
2331 with the transitions and transversions in the three trinucleotide
2332 sites. It generalizes the previous models based on the nucleotide
2333 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
2334 x 64 with three parameters. It determines at some time t the exact
2335 occurrence probabilities of trinucleotides mutating randomly according
2336 to six substitution parameters. An application of this model allows
2337 an evolutionary study of the common circular code COM and the 15
2338 archaeal circular codes X which have been recently identified in
2339 several archaeal genomes. The main property of a circular code is
2340 the retrieval of the reading frames in genes, both locally, i.e.
2341 anywhere in genes and in particular without a start codon, and automatically
2342 with a window of a few nucleotides. In genes, the circular code is
2343 superimposed on the traditional genetic one. Very unexpectedly, the
2344 evolutionary model demonstrates that the archaeal circular codes
2345 can derive from the common circular code subjected to random substitutions
2346 with particular values for six substitutions parameters. It has a
2347 strong correlation with the statistical observations of three archaeal
2348 codes in actual genes. Furthermore, the properties of these substitution
2349 rates allow proposal of an evolutionary classification of the 15
2350 archaeal codes into three main classes according to this model. In
2351 almost all the cases, they agree with the actual degeneracy of the
2352 genetic code with substitutions more frequent in the third trinucleotide
2353 site and with transitions more frequent that transversions in any
2354 trinucleotide site.},
2355 doi = {10.1016/j.compbiolchem.2005.09.001},
2356 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
2357 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
2358 67400 Illkirch, France. frey@dpt-info.u-strasbg.fr},
2359 keywords = {Archaea, genetics; DNA, Circular; Evolution, Molecular; Genetic Code;
2360 Genome, Archaeal; Models, Genetic; Mutation; Trinucleotide Repeats},
2362 medline-pst = {ppublish},
2364 pii = {S1476-9271(05)00083-6},
2366 timestamp = {2011.05.05},
2367 url = {http://dx.doi.org/10.1016/j.compbiolchem.2005.09.001}
2370 @INPROCEEDINGS{fgb11:ip,
2371 author = {Friot, Nicolas and Guyeux, Christophe and Bahi, Jacques},
2372 title = {Chaotic Iterations for Steganography - Stego-security and chaos-security},
2373 booktitle = {SECRYPT'2011, Int. Conf. on Security and Cryptography},
2376 address = {Sevilla, Spain},
2379 classement = {ACTI},
2380 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2386 author = {Alain Frisch},
2387 title = {Entropie topologique et définition du chaos},
2389 note = {Rapport de tipe},
2390 file = {Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:Chaos/Tipe_Entropie Topologique et Definition du Chaos (Alain Frisch).ps:PDF},
2391 keywords = {Chaos, Entropie Topologique, Tipe},
2393 timestamp = {2008.01.02},
2394 url = {http://alain.frisch.fr/math.html}
2398 author = {Alain Frisch},
2399 title = {Entropie topologique et définition du chaos},
2401 note = {[En ligne; Page disponible le 12-août-2010]},
2402 url = {\url{http://alain.frisch.fr/math.html}}
2405 @ARTICLE{Frommer97asynchronousweighted,
2406 author = {Andreas Frommer and Hartmut Schwandt and Daniel and Daniel B. Szyld},
2407 title = {Asynchronous Weighted Additive Schwarz Methods},
2408 journal = {Electronic Transactions on Numerical Analysis},
2414 @MISC{Frommer94asynchronoustwo-stage,
2415 author = {Andreas Frommer and Daniel B. Szyld},
2416 title = {Asynchronous Two-Stage Iterative Methods},
2421 title = {Introduction to Chaos and Coherence},
2422 publisher = {IOP Publishing},
2424 author = {J. Frøyland},
2426 timestamp = {2008.01.02}
2430 author = {T. Furon},
2431 title = {Security analysis},
2433 note = {European Project IST-1999-10987 CERTIMARK, Deliverable D.5.5},
2435 timestamp = {2009.06.30}
2439 author = {Furon, Teddy and Bas, Patrick},
2440 title = {Broken arrows},
2441 journal = {EURASIP J. Inf. Secur.},
2445 address = {New York, NY, United States},
2446 doi = {http://dx.doi.org/10.1155/2008/597040},
2448 owner = {christophe},
2449 publisher = {Hindawi Publishing Corp.},
2450 timestamp = {2010.03.06}
2453 @ARTICLE{P1150442004,
2454 author = {G.S.El-Taweel and H.M. Onsi and M.Samy and M.G. Darwish},
2455 title = {Secure and Non-Blind Watermarking Scheme for Color Images Based on
2457 journal = {ICGST International Journal on Graphics, Vision and Image Processing},
2463 owner = {christophe},
2464 timestamp = {2010.03.07}
2467 @INPROCEEDINGS{Gentry09,
2468 author = {Gentry, Craig},
2469 title = {Fully homomorphic encryption using ideal lattices},
2470 booktitle = {STOC '09: Proceedings of the 41st annual ACM symposium on Theory
2474 address = {New York, NY, USA},
2476 doi = {http://doi.acm.org/10.1145/1536414.1536440},
2477 isbn = {978-1-60558-506-2},
2478 location = {Bethesda, MD, USA}
2481 @INPROCEEDINGS{Girao04,
2482 author = {J. Girao and M. Schneider and D. Westhoff},
2483 title = {CDA: Concealed data aggregation in wireless sensor networks},
2484 booktitle = {Proceedings of the ACM Workshop on Wireless Security},
2486 owner = {christophe},
2487 timestamp = {2010.07.31}
2490 @CONFERENCE{Gotsman88,
2491 author = {C. Gotsman and D. Lehmann and E. Shamir},
2492 title = {Asynchronous Dynamics of Random Boolean Networks},
2493 booktitle = {San Diego '88 Neural Networks Conference},
2496 timestamp = {30/03/2008}
2499 @ARTICLE{Guckenheimer1979,
2500 author = {J. Guckenheimer},
2501 title = {Sensitive dependence to initial conditions for one-dimensional maps},
2502 journal = {Comm. Math. Phys.},
2504 optpages = {133-160},
2506 timestamp = {2008.01.02}
2510 title = {Nonlinear oscillations, dynamical systems, and bifurcations of vector
2512 publisher = {Springer Verlag},
2514 author = {J. Guckenheimer and P. Holmes},
2516 timestamp = {2008.01.02}
2519 @ARTICLE{Guo20093201,
2520 author = {Wei Guo and Xiaoming Wang and Dake He and Yang Cao},
2521 title = {Cryptanalysis on a parallel keyed hash function based on chaotic
2523 journal = {Physics Letters A},
2526 pages = {3201 - 3206},
2528 abstract = {This Letter analyzes the security of a novel parallel keyed hash function
2529 based on chaotic maps, proposed by Xiao et al. to improve the efficiency
2530 in parallel computing environment. We show how to devise forgery
2531 attacks on Xiao's scheme with differential cryptanalysis and give
2532 the experiment results of two kinds of forgery attacks firstly. Furthermore,
2533 we discuss the problem of weak keys in the scheme and demonstrate
2534 how to utilize weak keys to construct collision.},
2536 keywords = {Cryptanalysis}
2539 @PHDTHESIS{GuyeuxThese10,
2540 author = {Christophe Guyeux},
2541 title = {Le d\'{e}sordre des it\'{e}rations chaotiques et leur utilit\'{e}
2542 en s\'{e}curit\'{e} informatique},
2543 school = {Universit\'{e} de Franche-Comt\'{e}},
2545 owner = {christophe},
2546 timestamp = {2010.12.21}
2550 author = {Guyeux, Christophe and Bahi, Jacques},
2551 title = {\'Etude topologique de l'\'etalement de spectre},
2552 howpublished = {Journ\'ees Codes et St\'eganographie, \'Ecoles Militaires de Saint-Cyr,
2557 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2562 @INPROCEEDINGS{bg10:ip,
2563 author = {Guyeux, C. and Bahi, J.},
2564 title = {An improved watermarking algorithm for Internet applications},
2565 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
2568 address = {Valencia, Spain},
2570 classement = {ACTI},
2571 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2576 @INPROCEEDINGS{gfb10:ip,
2577 author = {Guyeux, Christophe and Friot, Nicolas and Bahi, Jacques},
2578 title = {Chaotic iterations versus Spread-spectrum: chaos and stego security},
2579 booktitle = {IIH-MSP'10, 6-th Int. Conf. on Intelligent Information Hiding and
2580 Multimedia Signal Processing},
2583 address = {Darmstadt, Germany},
2585 classement = {ACTI},
2586 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
2592 author = {Christophe Guyeux and Nicolas Friot and Jacques M. Bahi},
2593 title = {A more secure information hiding scheme than spread-spectrum obtained
2595 journal = {arXiv 0032565},
2598 timestamp = {2010.04.30}
2602 title = {Guide to Elliptic Curve Cryptography},
2603 publisher = {Springer Professional Computing},
2605 editor = {Springer},
2606 author = {D. Hankerson and A. Menezes and S. Vanstone},
2607 owner = {christophe},
2608 timestamp = {2010.07.31}
2611 @ARTICLE{Hasegawa1985,
2612 author = {M. Hasegawa and H. Kishino and T. Yano},
2613 title = {Dating of the human-ape splitting by a molecular clock of mitochondrial
2615 journal = {J Mol Evol},
2620 abstract = {A new statistical method for estimating divergence dates of species
2621 from DNA sequence data by a molecular clock approach is developed.
2622 This method takes into account effectively the information contained
2623 in a set of DNA sequence data. The molecular clock of mitochondrial
2624 DNA (mtDNA) was calibrated by setting the date of divergence between
2625 primates and ungulates at the Cretaceous-Tertiary boundary (65 million
2626 years ago), when the extinction of dinosaurs occurred. A generalized
2627 least-squares method was applied in fitting a model to mtDNA sequence
2628 data, and the clock gave dates of 92.3 +/- 11.7, 13.3 +/- 1.5, 10.9
2629 +/- 1.2, 3.7 +/- 0.6, and 2.7 +/- 0.6 million years ago (where the
2630 second of each pair of numbers is the standard deviation) for the
2631 separation of mouse, gibbon, orangutan, gorilla, and chimpanzee,
2632 respectively, from the line leading to humans. Although there is
2633 some uncertainty in the clock, this dating may pose a problem for
2634 the widely believed hypothesis that the pipedal creature Australopithecus
2635 afarensis, which lived some 3.7 million years ago at Laetoli in Tanzania
2636 and at Hadar in Ethiopia, was ancestral to man and evolved after
2637 the human-ape splitting. Another likelier possibility is that mtDNA
2638 was transferred through hybridization between a proto-human and a
2639 proto-chimpanzee after the former had developed bipedalism.},
2640 keywords = {Animals; Biological Evolution; DNA, Mitochondrial, genetics; Genes;
2641 Haplorhini, genetics; Humans; Mathematics; Models, Genetic; Nucleic
2642 Acid Hybridization; Primates, genetics; Proteins, genetics; Species
2645 medline-pst = {ppublish},
2648 timestamp = {2011.05.05}
2652 title = {A First Course in Discrete Dynamical Systems},
2653 publisher = {Springer-Verlag},
2655 author = {R. Homlgren},
2658 timestamp = {2008.01.02}
2661 @INCOLLECTION{Hoque09,
2662 author = {Hoque, Md. and Chetty, Madhu and Sattar, Abdul},
2663 title = {Genetic Algorithm in Ab Initio Protein Structure Prediction Using
2664 Low Resolution Model: A Review},
2665 booktitle = {Biomedical Data and Applications},
2666 publisher = {Springer Berlin Heidelberg},
2668 editor = {Sidhu, Amandeep and Dillon, Tharam},
2670 series = {Studies in Computational Intelligence},
2672 affiliation = {IIIS, Griffith University, Nathan, QLD-4111 Australia}
2675 @CONFERENCE{Houmansadr09,
2676 author = {A. Houmansadr and N. Kiyavash and N. Borisov},
2677 title = {Rainbow: A robust and invisible non-blind watermark for network flows},
2678 booktitle = {NDSS’09: 16th Annual Network and Distributed System Security Symposium},
2680 owner = {christophe},
2681 timestamp = {2010.03.07}
2685 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J.},
2686 title = {Secure encrypted-data aggregation for wireless sensor networks},
2687 journal = {Wireless Networks},
2688 abstract = {Abstract\ \ This paper proposes a secure encrypted-data
2689 aggregation scheme for wireless sensor networks. Our design for data
2690 aggregation eliminates redundant sensor readings without using encryption
2691 and maintains data secrecy and privacy during transmission. Conventional
2692 aggregation functions operate when readings are received in plaintext.
2693 If readings are encrypted, aggregation requires decryption creating
2694 extra overhead and key management issues. In contrast to conventional
2695 schemes, our proposed scheme provides security and privacy, and duplicate
2696 instances of original readings will be aggregated into a single packet.
2697 Our scheme is resilient to known-plaintext attacks, chosen-plaintext
2698 attacks, ciphertext-only attacks and man-in-the-middle attacks. Our
2699 experiments show that our proposed aggregation method significantly
2700 reduces communication overhead and can be practically implemented
2701 in on-the-shelf sensor platforms.},
2702 citeulike-article-id = {4499496},
2703 citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11276-009-0177-y},
2704 citeulike-linkout-1 = {http://www.springerlink.com/content/g573138072642u63},
2705 doi = {10.1007/s11276-009-0177-y},
2706 posted-at = {2009-05-10 09:55:44},
2707 url = {http://dx.doi.org/10.1007/s11276-009-0177-y}
2711 author = {Huang, Shih-I and Shieh, Shiuhpyng and Tygar, J. D.},
2712 title = {Secure encrypted-data aggregation for wireless sensor networks},
2713 journal = {Wirel. Netw.},
2718 address = {Hingham, MA, USA},
2719 doi = {http://dx.doi.org/10.1007/s11276-009-0177-y},
2721 publisher = {Kluwer Academic Publishers}
2725 author = {W. Huang and X. Ye},
2726 title = {Homeomorphisms with the whole compacta being scrambled sets},
2727 journal = {Ergod. Th. Dynam. Systems},
2733 timestamp = {2008.01.02}
2736 @ARTICLE{Hurley1982,
2737 author = {M. Hurley},
2738 title = {Attractors, persistence and density of their bassin},
2739 journal = {Transactions of AMS},
2741 optpages = {247-271},
2744 timestamp = {2008.01.02}
2747 @INPROCEEDINGS{Islam:2009:NMA:1695134.1695181,
2748 author = {Islam, Md. Kamrul and Chetty, Madhu},
2749 title = {Novel Memetic Algorithm for Protein Structure Prediction},
2750 booktitle = {Proceedings of the 22nd Australasian Joint Conference on Advances
2751 in Artificial Intelligence},
2755 address = {Berlin, Heidelberg},
2756 publisher = {Springer-Verlag},
2758 isbn = {978-3-642-10438-1},
2759 keywords = {Guided search space, Memetic Algorithm, Modified fitness function,
2760 Pair-wise-interchange, Schema preservation, Tabu Search},
2761 location = {Melbourne, Australia},
2765 @PHDTHESIS{Jacquemard77,
2766 author = {C. Jacquemard},
2767 title = {Contribution à l'étude d'algorithmes à convergence monotone},
2768 school = {Université de Franche-Comté},
2770 owner = {christophe},
2771 timestamp = {2010.08.25}
2775 title = {{Evolution of Protein Molecules}},
2776 publisher = {Academy Press},
2778 editor = {Munro, H. N.},
2779 author = {Jukes, T. H. and Cantor, C. R.},
2780 booktitle = {Evolution of Protein Molecules},
2781 citeulike-article-id = {1673661},
2782 keywords = {compbio, fresco},
2783 posted-at = {2007-09-19 06:23:18},
2787 @INPROCEEDINGS{Kalker2001,
2788 author = {Kalker, T.},
2789 title = {Considerations on watermarking security},
2792 abstract = {In this paper we address the usually implicit assumption that digital
2793 watermarking has as its main target copyright and copy protection
2794 applications. From these target applications a great many conclusions
2795 are drawn about the required security of a watermarking system, and
2796 in fact, a considerably percentage of the watermarking literature
2797 has this very topic as its main focus of attention. In this paper
2798 we take a step back, and try to do a more careful analysis of the
2799 'watermarking-is-for-security-applications' paradigm. The intention
2800 of this paper is to discuss the meaning of the concept security in
2801 the context of watermarking, and try to show that one has to be careful
2802 in using analogies from the related field of cryptography},
2803 citeulike-article-id = {1226513},
2804 journal = {2001 IEEE Fourth Workshop on Multimedia Signal Processing},
2805 keywords = {security, wateramarking},
2807 posted-at = {2007-04-14 14:30:06},
2809 timestamp = {2009.06.30}
2812 @ARTICLE{Kerckhoffs83,
2813 author = {Kerckhoffs, Auguste},
2814 title = {La cryptographie militaire},
2815 journal = {Journal des sciences militaires},
2820 abstract = {pp. 161–191, Feb. 1883.},
2821 citeulike-article-id = {505508},
2822 keywords = {cryptography, master},
2824 posted-at = {2006-02-15 04:49:15},
2826 timestamp = {2009.06.30}
2830 author = {Kimura, Motoo},
2831 title = {A simple method for estimating evolutionary rates of base substitutions
2832 through comparative studies of nucleotide sequences},
2833 journal = {Journal of Molecular Evolution},
2837 note = {10.1007/BF01731581},
2838 affiliation = {National Institute of Genetics 411 Mishima Japan},
2841 keyword = {Biomedical and Life Sciences},
2842 publisher = {Springer New York},
2843 url = {http://dx.doi.org/10.1007/BF01731581}
2848 title = {Chaos Without Nonperiodicity},
2849 journal = {Amer. Math. Monthly},
2853 timestamp = {27/01/2008}
2856 @PHDTHESIS{Knudsen1994a,
2857 author = {C. Knudsen},
2858 title = {Aspects of noninvertible dynamics and chaos},
2859 school = {Technical University of Denmark},
2862 timestamp = {2008.01.02}
2866 author = {L. Kocarev and J. Szczepanski and J.M. Amigo and I. Tomovski},
2867 title = {Discrete Chaos - I: Theory},
2868 journal = {IEEE Trans. on Circuits Systems},
2871 pages = {1300-1309},
2872 owner = {christophe},
2873 timestamp = {2010.10.10}
2876 @INPROCEEDINGS{Kocher95cryptanalysisof,
2877 author = {Paul C. Kocher},
2878 title = {Cryptanalysis of Diffie-Hellman, RSA, DSS, and Other Systems Using
2879 Timing Attacks (Extended Abstract)},
2880 booktitle = {Advances in Cryptology, CRYPTO '95: 15th Annual International Cryptology
2884 publisher = {Springer-Verlag}
2887 @ARTICLE{Kullback1951,
2888 author = {Kullback, Solomon and Leibler, Richard A.},
2889 title = {On Information and Sufficiency},
2890 journal = {The Annals of Mathematical Statistics},
2895 citeulike-article-id = {3245942},
2896 keywords = {file-import-08-09-12},
2898 posted-at = {2008-09-12 14:30:37},
2900 timestamp = {2009.06.29}
2904 author = {Eshter Ledoux},
2905 title = {Introduction à la théorie du chaos},
2907 note = {[En ligne; Page disponible le 12-août-2010]},
2908 url = {\url{http://www.nux.be/eledoux/mem/node1.html}}
2912 title = {Analyse en dimension finie},
2913 publisher = {Masson},
2919 timestamp = {2008.01.02}
2923 author = {A.K. Lenstra and E.R. Verheul},
2924 title = {Selecting Cryptographic Key Sizes},
2925 journal = {Jour. of the International Association for Cryptologic Research},
2933 author = {Lettvin, J.Y. and Maturana, H.R. and McCulloch, W.S. and Pitts, W.H.},
2934 title = {What the Frog's Eye Tells the Frog's Brain},
2935 journal = {Proceedings of the IRE},
2940 owner = {christophe},
2941 timestamp = {2010.12.21}
2945 author = {T. Y. Li and J. A. Yorke},
2946 title = {Period three implies chaos},
2947 journal = {Amer. Math. Monthly},
2953 timestamp = {27/01/2008}
2957 author = {Li, Yantao and Deng, Shaojiang and Xiao, Di},
2958 title = {A novel Hash algorithm construction based on chaotic neural network},
2959 journal = {Neural Computing and Applications},
2962 affiliation = {Chongqing University College of Computer Science 400044 Chongqing
2965 keyword = {Computer Science},
2966 publisher = {Springer London}
2969 @INPROCEEDINGS{Lin09,
2970 author = {Lin, Hua-Yi and Chiang, Tzu-Chiang},
2971 title = {Cooperative secure data aggregation in sensor networks using elliptic
2972 curve based cryptosystems},
2973 booktitle = {CDVE'09: Proceedings of the 6th international conference on Cooperative
2974 design, visualization, and engineering},
2977 address = {Berlin, Heidelberg},
2978 publisher = {Springer-Verlag},
2979 isbn = {3-642-04264-3, 978-3-642-04264-5},
2980 location = {Luxembourg, Luxembourg}
2983 @INPROCEEDINGS{Liu2008,
2984 author = {Liu, An and Ning, Peng},
2985 title = {TinyECC: A Configurable Library for Elliptic Curve Cryptography in
2986 Wireless Sensor Networks},
2987 booktitle = {7th International Conference on Information Processing in Sensor
2988 Networks (IPSN 2008)},
2992 citeulike-article-id = {3041699},
2993 howpublished = {SPOTS Track},
2995 posted-at = {2008-07-25 05:25:05},
2999 @ARTICLE{Liu2007bis,
3000 author = {Shao-Hui Liu and Hong-Xun Yao and Wen Gao and Yong-Liang Liu},
3001 title = {An image fragile watermark scheme based on chaotic image pattern
3003 journal = {Applied Mathematics and Computation},
3008 timestamp = {2008.10.07}
3011 @INPROCEEDINGS{Liu07,
3012 author = {Liu, Zhen and Xi, Lifeng},
3013 title = {Image Information Hiding Encryption Using Chaotic Sequence},
3014 booktitle = {KES '07: Knowledge-Based Intelligent Information and Engineering
3015 Systems and the XVII Italian Workshop on Neural Networks on Proceedings
3016 of the 11th International Conference},
3019 address = {Berlin, Heidelberg},
3020 publisher = {Springer-Verlag},
3021 doi = {http://dx.doi.org/10.1007/978-3-540-74827-4_26},
3022 isbn = {978-3-540-74826-7},
3023 location = {Vietri sul Mare, Italy}
3027 author = {Zhen Liu and Lifeng Xi},
3028 title = {Image Information Hiding Encryption Using Chaotic Sequence},
3034 timestamp = {11/04/2008}
3037 @ARTICLE{Lubachevsky86,
3038 author = {Lubachevsky, Boris and Mitra, Debasis},
3039 title = {A chaotic asynchronous algorithm for computing the fixed point of
3040 a nonnegative matrix of unit spectral radius},
3046 address = {New York, NY, USA},
3047 doi = {http://doi.acm.org/10.1145/4904.4801},
3053 author = {{L}arger, {L}. and {D}udley, {J}.{M}.},
3054 title = { {N}onlinear dynamics {O}ptoelectronic chaos},
3055 journal = {{N}ature },
3061 abstract = {{O}ptoelectronic circuits with delayed feedback provide a convenient
3062 bench-top platform to study a wide range of nonlinear dynamic systems,
3063 from ultrastable clocks to complex chaotic devices.},
3064 affiliation = {{F}ranche-{C}omt{\'e} {\'E}lectronique {M}{\'e}canique, {T}hermique
3065 et {O}ptique - {S}ciences et {T}echnologies - {FEMTO}-{ST} - {CNRS}
3066 : {UMR}6174 - {U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {U}niversit{\'e}
3067 de {T}echnologie de {B}elfort-{M}ontbeliard - {E}cole {N}ationale
3068 {S}up{\'e}rieure de {M}{\'e}canique et des {M}icrotechniques },
3069 audience = {internationale },
3071 doi = {10.1038/465041a },
3072 hal_id = {hal-00517696},
3073 language = {{A}nglais},
3074 url = {http://hal.archives-ouvertes.fr/hal-00517696/en/}
3077 @INPROCEEDINGS{Mahoney00,
3078 author = {Mahoney, Matthew V.},
3079 title = {Fast Text Compression with Neural Networks},
3080 booktitle = {Proceedings of the Thirteenth International Florida Artificial Intelligence
3081 Research Society Conference},
3084 publisher = {AAAI Press},
3086 isbn = {1-57735-113-4},
3090 @INPROCEEDINGS{msp10:bl,
3091 author = {Makhoul, Abdallah and Saadi, Rachid and Pham, Congduc},
3092 title = {Risk Management in Intrusion Detection Applications with Wireless
3093 Video Sensor Networks},
3094 booktitle = {WCNC'10 IEEE Int. Conf.},
3097 address = {Sydney, Australia},
3106 author = {H.S. Malvar and D. Florêncio},
3107 title = {Improved Spread Spectrum: A New Modulation Technique for Robust Watermarking},
3108 journal = {IEEE Trans. Signal Proceeding},
3112 owner = {christophe},
3113 timestamp = {2010.03.07}
3116 @ARTICLE{Marsaglia2003,
3117 author = {G. Marsaglia},
3118 title = {Xorshift RNGs},
3119 journal = {Journal of Statistical Software},
3124 timestamp = {2009.10.28}
3127 @ARTICLE{Marsaglia1996,
3128 author = {G. Marsaglia},
3129 title = {DIEHARD: a battery of tests of randomness.},
3130 journal = {http://stat.fsu.edu/~geo/diehard.html},
3133 timestamp = {2009.11.09}
3136 @ARTICLE{Simard07testu01:a,
3137 author = {Richard Simard and Université De Montréal},
3138 title = {TestU01: A C library for empirical testing of random number generators},
3139 journal = {ACM Transactions on Mathematical Software},
3144 @ARTICLE{DefiningChaos,
3145 author = {M. Martelli and M. Dang and T. Seph},
3146 title = {Defining chaos},
3147 journal = {Mathematics Magazine},
3151 owner = {christophe},
3152 timestamp = {2010.08.11}
3155 @ARTICLE{Michel2007c,
3156 author = {Christian J Michel},
3157 title = {An analytical model of gene evolution with 9 mutation parameters:
3158 an application to the amino acids coded by the common circular code.},
3159 journal = {Bull Math Biol},
3165 abstract = {We develop here an analytical evolutionary model based on a trinucleotide
3166 mutation matrix 64 x 64 with nine substitution parameters associated
3167 with the three types of substitutions in the three trinucleotide
3168 sites. It generalizes the previous models based on the nucleotide
3169 mutation matrices 4 x 4 and the trinucleotide mutation matrix 64
3170 x 64 with three and six parameters. It determines at some time t
3171 the exact occurrence probabilities of trinucleotides mutating randomly
3172 according to these nine substitution parameters. An application of
3173 this model allows an evolutionary study of the common circular code
3174 [Formula: see text] of eukaryotes and prokaryotes and its 12 coded
3175 amino acids. The main property of this code [Formula: see text] is
3176 the retrieval of the reading frames in genes, both locally, i.e.
3177 anywhere in genes and in particular without a start codon, and automatically
3178 with a window of a few nucleotides. However, since its identification
3179 in 1996, amino acid information coded by [Formula: see text] has
3180 never been studied. Very unexpectedly, this evolutionary model demonstrates
3181 that random substitutions in this code [Formula: see text] and with
3182 particular values for the nine substitutions parameters retrieve
3183 after a certain time of evolution a frequency distribution of these
3184 12 amino acids very close to the one coded by the actual genes.},
3185 doi = {10.1007/s11538-006-9147-z},
3186 institution = {Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS-ULP 7005), Université
3187 Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant,
3188 67400 Illkirch, France. michel@dpt-info.u-strasbg.fr},
3189 keywords = {Amino Acids, genetics; Codon, genetics; Eukaryotic Cells; Evolution,
3190 Molecular; Models, Genetic; Prokaryotic Cells},
3192 medline-pst = {ppublish},
3195 timestamp = {2011.05.05},
3196 url = {http://dx.doi.org/10.1007/s11538-006-9147-z}
3200 author = {J.-C. Miellou},
3201 title = {Algorithmes de relaxation chaotique \`{a} retards},
3207 timestamp = {2008.05.22}
3210 @ARTICLE{Miellou75b,
3211 author = {Miellou, J.-C.},
3212 title = {Itérations chaotiques à retards, étude de la convergence dans le
3213 cas d'espaces partiellement ordonnés},
3214 journal = {C.R.A.S. Paris},
3218 owner = {christophe},
3219 timestamp = {2010.08.17}
3223 author = {Jean-Claude Miellou and Pierre Spitéri},
3224 title = {Un critère de convergence pour des méthodes générales de point fixe},
3225 journal = {Rairo -- Modélisation mathématique et analyse numérique},
3230 owner = {christophe},
3231 timestamp = {2010.10.13}
3235 author = {Aidan Mooney and John G. Keating and Ioannis Pitas},
3236 title = {A comparative study of chaotic and white noise signals in digital
3238 journal = {Chaos, Solitons and Fractals},
3242 owner = {christophe},
3243 timestamp = {2010.03.01}
3246 @ARTICLE{Nakashima2003,
3247 author = {Nakashima, Y. and Tachibana, R. and Babaguchi, N.},
3248 title = {Watermarked Movie Soundtrack Finds the Position of the Camcorder
3250 journal = {IEEE Transactions on Multimedia},
3252 note = {Accepted for future publication Multimedia}
3255 @INCOLLECTION{springerlink:10.1007/978-3-642-04431-1_16,
3256 author = {Nelson, Michael and Nahapetian, Ani and Koushanfar, Farinaz and Potkonjak,
3258 title = {SVD-Based Ghost Circuitry Detection},
3259 booktitle = {Information Hiding},
3260 publisher = {Springer Berlin / Heidelberg},
3262 editor = {Katzenbeisser, Stefan and Sadeghi, Ahmad-Reza},
3264 series = {Lecture Notes in Computer Science},
3266 note = {10.1007/978-3-642-04431-1_16},
3267 affiliation = {Computer Science Department, UCLA, Los Angeles, CA 90095, USA},
3268 url = {http://dx.doi.org/10.1007/978-3-642-04431-1_16}
3271 @INPROCEEDINGS{Perez-Hernandez09,
3272 author = {P\'{e}rez-Hern\'{a}ndez, Luis Germ\'{a}n and Rodr\'{\i}guez-V\'{a}zquez,
3273 Katya and Gardu\~{n}o-Ju\'{a}rez, Ram\'{o}n},
3274 title = {Parallel particle swarm optimization applied to the protein folding
3276 booktitle = {Proceedings of the 11th Annual conference on Genetic and evolutionary
3279 series = {GECCO '09},
3280 pages = {1791--1792},
3281 address = {New York, NY, USA},
3284 isbn = {978-1-60558-325-9},
3285 keywords = {bioinformatics, biology and chemistry, combinatorial optimization,
3286 parallelization, swarm intelligence},
3287 location = {Montreal, Qu\&\#233;bec, Canada},
3291 @PHDTHESIS{Pellegrin1986,
3292 author = {D. Pellegrin},
3293 title = {Algorithmique discr\`{e}te et r\'{e}seaux d'automates},
3294 school = {Grenoble},
3297 timestamp = {2008.05.22}
3301 author = {F. Peng and S.-S. Qiu and M. Long},
3302 title = {One way Hash function construction based on two-dimensional hyperchaotic
3304 journal = {Acta Phys. Sinici.},
3309 timestamp = {2009.01.16}
3312 @INPROCEEDINGS{Perez06,
3313 author = {Luis Perez-Freire and F. Pérez-gonzalez and Pedro Comesaña},
3314 title = {Secret Dither Estimation in Lattice-Quantization Data Hiding: A Set-Membership
3316 booktitle = {Security, Steganography, and Watermarking of Multimedia Contents},
3318 editor = {Edward J. Delp and Ping W. Wong},
3319 address = {San Jose, California, USA},
3321 organization = {SPIE},
3323 timestamp = {2009.06.30}
3326 @INPROCEEDINGS{Perez-Freire06,
3327 author = {Luis Perez-Freire and Pedro Comesana and Juan Ramon Troncoso-Pastoriza
3328 and Fernando Perez-Gonzalez},
3329 title = {Watermarking Security: a Survey},
3330 booktitle = {LNCS Transactions on Data Hiding and Multimedia Security},
3333 timestamp = {2009.06.29}
3336 @PROCEEDINGS{Peter07,
3337 title = {On Concealed Data Aggregation for WSNs},
3339 author = {Peter, Steffen and Piotrowski, Krzysztof and Langendoerfer, Peter},
3340 booktitle = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
3342 citeulike-article-id = {2281643},
3343 citeulike-linkout-0 = {http://dx.doi.org/10.1109/CCNC.2007.45},
3344 citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=4199133},
3345 doi = {10.1109/CCNC.2007.45},
3346 journal = {Consumer Communications and Networking Conference, 2007. CCNC 2007.
3350 posted-at = {2008-01-23 19:36:19},
3352 url = {http://dx.doi.org/10.1109/CCNC.2007.45}
3356 author = {Pham, Congduc and Makhoul, Abdallah and Saadi, Rachid},
3357 title = {Risk-based Adaptive Scheduling in Randomly Deployed Video Sensor
3358 Networks for Critical Surveillance Applications},
3359 journal = {Journal of Network and Computer Applications},
3364 note = {Accepted manuscript. To appear},
3365 classement = {ACLI},
3367 impact-factor = {1.111},
3369 isi-acro = {J NETW COMPU APPL},
3370 publisher = {Springer}
3374 author = {Edgar Alan Poe},
3375 title = {The Raven},
3378 note = {American Museum (Baltimore)},
3379 owner = {christophe},
3380 timestamp = {2010.11.23}
3383 @ARTICLE{Perez-Freire2006:Security,
3384 author = {L. P{\'e}rez-Freire and F. P{\'e}rez-González and T. Furon and P.
3386 title = {Security of lattice-based data hiding against the known message attack},
3387 journal = {IEEE Trans. on Information Forensics and Security},
3394 timestamp = {2009.12.06}
3397 @MISC{Quisquater02sidechannel,
3398 author = {J-J. Quisquater and D. Samyde and Université Catholique De Louvain
3400 title = {Side Channel Cryptanalysis},
3404 @ARTICLE{Raynal2001,
3405 author = {Frédéric Raynal and Fabien A. P. Petitcolas and Caroline Fontaine},
3406 title = {Evaluation automatique des méthodes de tatouage},
3407 journal = {Traitement du signal},
3412 timestamp = {2008.05.21}
3416 author = {Vincent Rijmen and Elisabeth Oswald},
3417 title = {Update on SHA-1},
3418 howpublished = {Cryptology ePrint Archive, Report 2005/010},
3420 note = {\url{http://eprint.iacr.org/}}
3424 title = {Discrete Iterations, a Metric Study},
3425 publisher = {Springer-Verlag},
3427 editor = {Berlin Heidelberg New-York},
3428 author = {François Robert},
3430 series = {Series in Computational Mathematics}
3434 title = {Discrete Iterations: A Metric Study},
3436 editor = {Springer-Verlag},
3437 author = {F. Robert},
3439 series = {Springer Series in Computational Mathematics},
3441 timestamp = {17/02/2008}
3445 author = {Rudenko, O. and Snytkin, M.},
3446 title = {Image compression based on the neural network art},
3447 journal = {Cybernetics and Systems Analysis},
3451 affiliation = {Kharkov National University of Radio Electronics Kharkov Ukraine},
3454 keyword = {Computer Science},
3455 publisher = {Springer New York}
3458 @PHDTHESIS{Ruette2001,
3459 author = {Sylvie Ruette},
3460 title = {Chaos en dynamique topologique, en particulier sur l'intervalle,
3461 mesures d'entropie maximale},
3462 school = {Université d'Aix-Marseille II},
3464 optmonth = {Novembre},
3466 timestamp = {2008.01.02}
3469 @MASTERSTHESIS{Saulnier02,
3470 author = {Boris Saulnier},
3471 title = {Entropie topologique},
3472 school = {DEA Sémantique, Preuves et Langages, Paris 7},
3474 owner = {christophe},
3475 timestamp = {2010.08.12}
3478 @ARTICLE{Schmitz2001,
3479 author = {Roland Schmitz},
3480 title = {Use of chaotic dynamical systems in cryptography},
3481 journal = {Journal of Franklin Institute},
3486 timestamp = {17/02/2008}
3490 title = {Analyse: topologie g\'{e}n\'{e}rale et analyse fonctionnelle},
3491 publisher = {Hermann},
3494 author = {Laurent Schwartz},
3495 owner = {christophe},
3496 timestamp = {2010.09.15}
3500 author = {Shannon, Claude E.},
3501 title = {Communication Theory of Secrecy Systems},
3502 journal = {Bell Systems Technical Journal},
3506 citeulike-article-id = {507362},
3507 keywords = {master, secrecy\_systems, teoria-informacao, theory\_communication,
3508 theory\_cryptography},
3510 posted-at = {2006-02-16 23:24:09},
3512 timestamp = {2009.06.29}
3515 @ARTICLE{Shmygelska05,
3516 author = {Shmygelska, Alena and Hoos, Holger},
3517 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
3518 polar protein folding problem},
3519 journal = {BMC Bioinformatics},
3524 abstract = {BACKGROUND:The protein folding problem is a fundamental problems in
3525 computational molecular biology and biochemical physics. Various
3526 optimisation methods have been applied to formulations of the ab-initio
3527 folding problem that are based on reduced models of protein structure,
3528 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
3529 and hybrid approaches. In our work, we have introduced an ant colony
3530 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
3531 hard (NP-hard) combinatorial problem of predicting a protein's conformation
3532 from its amino acid sequence under a widely studied, conceptually
3533 simple model - the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
3534 (HP) model.RESULTS:We present an improvement of our previous ACO
3535 algorithm for the 2D HP model and its extension to the 3D HP model.
3536 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
3537 than previous state-of-the-art algorithms on sequences whose native
3538 conformations do not contain structural nuclei (parts of the native
3539 fold that predominantly consist of local interactions) at the ends,
3540 but rather in the middle of the sequence, and that it generally finds
3541 a more diverse set of native conformations.CONCLUSIONS:The application
3542 of ACO to this bioinformatics problem compares favourably with specialised,
3543 state-of-the-art methods for the 2D and 3D HP protein folding problem;
3544 our empirical results indicate that our rather simple ACO algorithm
3545 scales worse with sequence length but usually finds a more diverse
3546 ensemble of native states. Therefore the development of ACO algorithms
3547 for more complex and realistic models of protein structure holds
3548 significant promise.},
3549 doi = {10.1186/1471-2105-6-30},
3551 pubmedid = {15710037}
3554 @OTHER{Shmygelska2005Feb,
3555 __markedentry = {[christophe]},
3556 abstract = {Abstract Background The protein folding problem is a fundamental problems
3557 in computational molecular biology and biochemical physics. Various
3558 optimisation methods have been applied to formulations of the ab-initio
3559 folding problem that are based on reduced models of protein structure,
3560 including Monte Carlo methods, Evolutionary Algorithms, Tabu Search
3561 and hybrid approaches. In our work, we have introduced an ant colony
3562 optimisation (ACO) algorithm to address the non-deterministic polynomial-time
3563 hard (NP-hard) combinatorial problem of predicting a protein's conformation
3564 from its amino acid sequence under a widely studied, conceptually
3565 simple model – the 2-dimensional (2D) and 3-dimensional (3D) hydrophobic-polar
3566 (HP) model. Results We present an improvement of our previous ACO
3567 algorithm for the 2D HP model and its extension to the 3D HP model.
3568 We show that this new algorithm, dubbed ACO-HPPFP-3, performs better
3569 than previous state-of-the-art algorithms on sequences whose native
3570 conformations do not contain structural nuclei (parts of the native
3571 fold that predominantly consist of local interactions) at the ends,
3572 but rather in the middle of the sequence, and that it generally finds
3573 a more diverse set of native conformations. Conclusions The application
3574 of ACO to this bioinformatics problem compares favourably with specialised,
3575 state-of-the-art methods for the 2D and 3D HP protein folding problem;
3576 our empirical results indicate that our rather simple ACO algorithm
3577 scales worse with sequence length but usually finds a more diverse
3578 ensemble of native states. Therefore the development of ACO algorithms
3579 for more complex and realistic models of protein structure holds
3580 significant promise.},
3581 author = {Shmygelska, Alena and Hoos, Holger H},
3582 journal = {BMC Bioinformatics. 2005 Feb 14},
3584 owner = {christophe},
3586 timestamp = {2011.01.24},
3587 title = {An ant colony optimisation algorithm for the 2D and 3D hydrophobic
3588 polar protein folding problem},
3594 author = {Li Shujun and Li Qi and Li Wenmin and Mou Xuanqin and Cai Yuanlong},
3595 title = {Statistical Properties of Digital Piecewise Linear Chaotic Maps and
3596 Their Roles in Cryptography and Pseudo-Random Coding},
3597 journal = {Proceedings of the 8th IMA International Conference on Cryptography
3602 owner = {christophe},
3603 timestamp = {2010.03.06}
3606 @INPROCEEDINGS{Simmons83,
3607 author = {Gustavus J. Simmons},
3608 title = {The Prisoners' Problem and the Subliminal Channel},
3609 booktitle = {Advances in Cryptology, Proc. CRYPTO'83},
3612 bibsource = {DBLP, http://dblp.uni-trier.de},
3614 timestamp = {2009.06.29}
3617 @ARTICLE{Solak2004389,
3618 author = {Ercan Solak},
3619 title = {On the security of a class of discrete-time chaotic cryptosystems},
3620 journal = {Physics Letters A},
3623 pages = {389 - 395},
3625 doi = {DOI: 10.1016/j.physleta.2003.11.008},
3627 keywords = {Communication using chaos},
3629 timestamp = {2009.12.12},
3630 url = {http://www.sciencedirect.com/science/article/B6TVM-4B22RC9-2/2/99a0af737c9b6ba8af47ae4d3c7a326d}
3633 @PHDTHESIS{Spiteri74,
3634 author = {Pierre Spitéri},
3635 title = {Contribution à l'étude de la stabilite au sens de liapounov de certains
3636 systemes differentiels non lineaires},
3637 school = {Université de Franche-Comté},
3639 owner = {christophe},
3640 timestamp = {2010.10.13}
3644 title = {Does God Play Dices ?: the mathematics of chaos},
3645 publisher = {Penguin},
3647 author = {Ian Stewart},
3649 timestamp = {2008.01.02}
3653 title = {Cryptography: Theory and Practice, Second Edition},
3654 publisher = {{Chapman \& Hall/CRC}},
3656 author = {Stinson, Douglas R.},
3658 abstract = {{Douglas R. Stinson's <I>Cryptography: Theory and Practice</I> is
3659 a mathematically intensive examination of cryptography, including
3660 ciphers, the Data Encryption Standard (DES), public key cryptography,
3661 one-way hash functions, and digital signatures. Stinson's explication
3662 of "zero-sum proofs"--a process by which one person lets another
3663 person know that he or she has a password without actually revealing
3664 any information--is especially good.<P> If you are new to the math
3665 behind cryptography but want to tackle it, the author covers all
3666 of the required background to understand the real mathematics here.
3667 <I>Cryptography</I> includes extensive exercises with each chapter
3668 and makes an ideal introduction for any math-literate person willing
3669 to get acquainted with this material.} {<P>Major advances over the
3670 last five years precipitated this major revision of the bestselling
3671 Cryptography: Theory and Practice. With more than 40 percent new
3672 or updated material, the second edition now provides an even more
3673 comprehensive treatment of modern cryptography. It focuses on the
3674 new Advanced Encryption Standards and features an entirely new chapter
3675 on that subject. Another new chapter explores the applications of
3676 secret sharing schemes, including ramp schemes, visual cryptography,
3677 threshold cryptography, and broadcast encryption. This is an ideal
3678 introductory text for both computer science and mathematics students
3679 and a valuable reference for professionals.</P>}},
3680 citeulike-article-id = {2401855},
3682 howpublished = {Hardcover},
3683 isbn = {1584882069},
3684 keywords = {security},
3685 posted-at = {2008-02-20 08:28:49},
3687 url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20\&path=ASIN/1584882069}
3690 @INPROCEEDINGS{Takana90,
3691 author = {K. Tanaka and Y. Nakamura and K. Matsui},
3692 title = {Embedding Secret Information into a Dithered Multi-level Image},
3693 booktitle = {IEEE Military Communications Conference},
3695 owner = {christophe},
3696 timestamp = {2010.08.05}
3699 @PHDTHESIS{ElTarazi81,
3700 author = {M. N. El Tarazi},
3701 title = {Contraction et ordre partiel pour l'étude d'algorithmes synchrones
3702 et asynchrones en analyse numérique},
3703 school = {Faculté des Sciences et Techniques de l'Université de Franche-Comté,
3706 owner = {christophe},
3707 timestamp = {2010.08.17}
3710 @INPROCEEDINGS{Unger93,
3711 author = {Unger, Ron and Moult, John},
3712 title = {Genetic Algorithm for 3D Protein Folding Simulations},
3713 booktitle = {Proceedings of the 5th International Conference on Genetic Algorithms},
3716 address = {San Francisco, CA, USA},
3717 publisher = {Morgan Kaufmann Publishers Inc.},
3719 isbn = {1-55860-299-2},
3723 @MISC{Van93electronicwater,
3724 author = {Tirkel Rankin Van},
3725 title = {Electronic Water Mark},
3729 @ARTICLE{Venkatesan2007397,
3730 author = {R.C. Venkatesan},
3731 title = {Encryption of covert information into multiple statistical distributions},
3732 journal = {Physics Letters A},
3735 pages = {397 - 404},
3737 doi = {DOI: 10.1016/j.physleta.2007.05.117},
3739 keywords = {Statistical encryption/decryption},
3741 timestamp = {2009.12.12},
3742 url = {http://www.sciencedirect.com/science/article/B6TVM-4P4FV2M-1/2/cd11a2ec144526e3c4552d2a7e7906cc}
3746 author = {G. Voyatzis and I. Pitas},
3747 title = {Chaotic watermarks for embedding in the spatial digital image domain},
3748 journal = {Proceedings of IEEE ICIP},
3752 owner = {christophe},
3753 timestamp = {2010.03.06}
3756 @INCOLLECTION{Wagner03,
3757 author = {Wagner, David},
3758 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
3759 booktitle = {Information Security},
3760 publisher = {Springer Berlin, Heidelberg},
3763 series = {Lecture Notes in Computer Science},
3765 abstract = {We use linear algebra to show that an algebraic privacy homomorphism
3766 proposed by Domingo-Ferrer is insecure for some parameter settings.},
3767 affiliation = {University of California, Berkeley USA}
3770 @INPROCEEDINGS{Wagner03cryptanalysisof,
3771 author = {David Wagner},
3772 title = {Cryptanalysis of an Algebraic Privacy Homomorphism},
3773 booktitle = {Proc. Sixth Information Security Conf. (ISC03},
3778 @ARTICLE{Wang_ellipticcurve,
3779 author = {Haodong Wang and Bo Sheng and Qun Li},
3780 title = {Elliptic curve cryptography-based access control in sensor networks},
3781 journal = {Int. J. Security and Networks}
3784 @INPROCEEDINGS{wbg10:ip,
3785 author = {Wang, Qianxue and Bahi, Jacques M. and Guyeux, Christophe and Fang,
3787 title = {Randomness quality of {CI} chaotic generators. Application to Internet
3789 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
3792 address = {Valencia, Spain},
3794 publisher = {IEEE Computer Society Press},
3795 note = {Best Paper award},
3796 classement = {ACTI},
3797 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
3803 author = {X. M. Wang and J. S. Zhang and W. F. Zhang},
3804 title = {One-way hash function construction based on the extended chaotic
3806 journal = {Acta Phys. Sinici.},
3808 volume = {52, No. 11},
3809 pages = {2737--2742},
3811 timestamp = {2009.01.16}
3815 author = {Westhoff, Dirk and Girao, Joao and Acharya, Mithun},
3816 title = {Concealed Data Aggregation for Reverse Multicast Traffic in Sensor
3817 Networks: Encryption, Key Distribution, and Routing Adaptation},
3818 journal = {IEEE Transactions on Mobile Computing},
3821 pages = {1417--1431},
3823 address = {Piscataway, NJ, USA},
3824 doi = {http://dx.doi.org/10.1109/TMC.2006.144},
3826 publisher = {IEEE Educational Activities Department}
3830 author = {Wikipédia},
3831 title = {Exposant de Lyapunov -- Site web d'André Lévesque},
3833 note = {[En ligne; Page disponible le 9-septembre-2010]},
3834 url = {\url{http://math.cmaisonneuve.qc.ca/alevesque/chaos_fract/Lyapunov/Exposant.html}}
3838 author = {Wikipédia},
3839 title = {Espace complet --- Wikipédia{,} l'encyclopédie libre},
3841 note = {[En ligne; Page disponible le 9-août-2010]},
3842 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Espace_complet&oldid=52734266}}
3846 author = {Wikipédia},
3847 title = {Densité (mathématiques) --- Wikipédia{,} l'encyclopédie libre},
3849 note = {[En ligne; Page disponible le 8-août-2010]},
3850 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Densit%C3%A9_(math%C3%A9matiques)&oldid=53938121}}
3854 author = {Wikipédia},
3855 title = {Information de Fisher --- Wikipédia{,} l'encyclopédie libre},
3857 note = {[En ligne; Page disponible le 5-août-2010]},
3858 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Information_de_Fisher&oldid=52877871}}
3861 @MISC{wiki:Kerkhoffs,
3862 author = {Wikipédia},
3863 title = {Principe de Kerckhoffs --- Wikipédia{,} l'encyclopédie libre},
3865 note = {[En ligne; Page disponible le 20-août-2010]},
3866 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Principe_de_Kerckhoffs&oldid=52133114}}
3869 @MISC{wiki:sarkovskii,
3870 author = {Wikipédia},
3871 title = {Théorème de Sarkovskii --- Wikipédia{,} l'encyclopédie libre},
3873 note = {[En ligne; Page disponible le 8-août-2010]},
3874 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Th%C3%A9or%C3%A8me_de_Sarkovskii&oldid=54196167}}
3877 @MISC{wiki:steganographie,
3878 author = {Wikipédia},
3879 title = {Stéganographie --- Wikipédia{,} l'encyclopédie libre},
3881 note = {[En ligne; Page disponible le 5-août-2010]},
3882 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=St%C3%A9ganographie&oldid=54724435}}
3885 @MISC{wiki:tatouage,
3886 author = {Wikipédia},
3887 title = {Tatouage numérique --- Wikipédia{,} l'encyclopédie libre},
3889 note = {[En ligne; Page disponible le 5-août-2010]},
3890 url = {https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Tatouage_num%C3%A9rique&oldid=55484940}
3893 @MISC{wiki:testsHypothese,
3894 author = {Wikipédia},
3895 title = {Test d'hypothèse --- Wikipédia{,} l'encyclopédie libre},
3897 note = {[En ligne; Page disponible le 5-août-2010]},
3898 url = {\url{https://secure.wikimedia.org/wikipedia/fr/w/index.php?title=Test_d%27hypoth%C3%A8se&oldid=55344108}}
3902 author = {Xianyong Wu and Zhi-Hong Guan},
3903 title = {A novel digital watermark algorithm based on chaotic maps},
3904 journal = {Physics Letters A},
3907 pages = {403 - 406},
3909 doi = {DOI: 10.1016/j.physleta.2007.01.034},
3911 keywords = {Watermarking},
3912 url = {http://www.sciencedirect.com/science/article/B6TVM-4MY0MF3-8/2/0b4d1298fa84337d2e59b3fefe26f583}
3915 @INPROCEEDINGS{Wu2007,
3916 author = {Wu, Xianyong and Guan, Zhi-Hong and Wu, Zhengping},
3917 title = {A Chaos Based Robust Spatial Domain Watermarking Algorithm},
3918 booktitle = {ISNN '07: Proceedings of the 4th international symposium on Neural
3922 address = {Berlin, Heidelberg},
3923 publisher = {Springer-Verlag},
3924 doi = {http://dx.doi.org/10.1007/978-3-540-72393-6_15},
3925 isbn = {978-3-540-72392-9},
3926 location = {Nanjing, China}
3929 @ARTICLE{Xiao20092288,
3930 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
3931 title = {Parallel keyed hash function construction based on chaotic neural
3933 journal = {Neurocomputing},
3936 pages = {2288 - 2296},
3938 note = {Lattice Computing and Natural Computing (JCIS 2007) / Neural Networks
3939 in Intelligent Systems Designn (ISDA 2007)},
3940 abstract = {Recently, various hash functions based on chaos or neural networks
3941 were proposed. Nevertheless, none of them works efficiently in parallel
3942 computing environment. In this paper, an algorithm for parallel keyed
3943 hash function construction based on chaotic neural network is proposed.
3944 The mechanism of changeable-parameter and self-synchronization establishes
3945 a close relation between the hash value bit and message, and the
3946 algorithm structure ensures the uniform sensitivity of the hash value
3947 to the message blocks at different positions. The proposed algorithm
3948 can satisfy the performance requirements of hash function. These
3949 properties make it a promising choice for hashing on parallel computing
3952 keywords = {Chaotic neural network}
3955 @ARTICLE{Xiao20094346,
3956 author = {Di Xiao and Xiaofeng Liao and Yong Wang},
3957 title = {Improving the security of a parallel keyed hash function based on
3959 journal = {Physics Letters A},
3962 pages = {4346 - 4353},
3965 keywords = {Hash function},
3967 timestamp = {2009.12.12}
3970 @ARTICLE{Xiao20102254,
3971 author = {Di Xiao and Frank Y. Shih and Xiaofeng Liao},
3972 title = {A chaos-based hash function with both modification detection and
3973 localization capabilities},
3974 journal = {Communications in Nonlinear Science and Numerical Simulation},
3977 pages = {2254 - 2261},
3979 abstract = {Recently, a variety of chaos-based hash functions have been proposed.
3980 Nevertheless, none of them can realize modification localization.
3981 In this paper, a hash function with both modification detection and
3982 localization capabilities is proposed, which can also support the
3983 parallel processing mode. By using the mechanism of changeable-parameter
3984 and self-synchronization, the keystream can establish a close relation
3985 with the algorithm key, the content, and the order of each message
3986 unit. Theoretical analysis and computer simulation indicate that
3987 the proposed algorithm can satisfy the performance requirements of
3990 keywords = {Hash function}
3993 @INPROCEEDINGS{Yu06,
3994 author = {Yu, Yu and Leiwo, Jussipekka and Premkumar, Benjamin},
3995 title = {A Study on the Security of Privacy Homomorphism},
3996 booktitle = {ITNG '06: Proceedings of the Third International Conference on Information
3997 Technology: New Generations},
4000 address = {Washington, DC, USA},
4001 publisher = {IEEE Computer Society},
4002 doi = {http://dx.doi.org/10.1109/ITNG.2006.19},
4003 isbn = {0-7695-2497-4}
4006 @ARTICLE{Zhang2008658,
4007 author = {Wei Zhang and Yonghe Liu and Sajal K. Das and Pradip De},
4008 title = {Secure data aggregation in wireless sensor networks: A watermark
4009 based authentication supportive approach},
4010 journal = {Pervasive and Mobile Computing},
4013 pages = {658 - 680},
4015 doi = {DOI: 10.1016/j.pmcj.2008.05.005},
4017 keywords = {Wireless sensor networks},
4018 url = {http://www.sciencedirect.com/science/article/B7MF1-4SKB3MD-1/2/b73948dcaa3eb63a2c21d09041882625}
4022 author = {Zhang, Yang and Arakaki, Adrian K. and Skolnick, Jeffrey},
4023 title = {TASSER: An automated method for the prediction of protein tertiary
4024 structures in CASP6},
4025 journal = {Proteins},
4031 keywords = {comparative modeling, threading, ab initio prediction, TASSER, PROSPECTOR_3},
4032 owner = {christophe},
4033 publisher = {Wiley Subscription Services, Inc., A Wiley Company},
4034 timestamp = {2011.01.22},
4035 url = {http://dx.doi.org/10.1002/prot.20724}
4038 @ARTICLE{Zhou1997429,
4039 author = {Chang-song Zhou and Tian-lun Chen},
4040 title = {Extracting information masked by chaos and contaminated with noise:
4041 Some considerations on the security of communication approaches using
4043 journal = {Physics Letters A},
4046 pages = {429 - 435},
4049 keywords = {Communication},
4051 timestamp = {2009.12.12}
4055 author = {Zhou, Huai-bei and Wang, Lu},
4056 title = {Chaos in Biomolecular Dynamics},
4057 journal = {The Journal of Physical Chemistry},
4060 pages = {8101-8105},
4062 doi = {10.1021/jp953409x}
4065 @PROCEEDINGS{DBLP:conf/iwdw/2005,
4066 title = {IWDW'05: 4th International Workshop on Digital Watermarking},
4068 editor = {Mauro Barni and Ingemar J. Cox and Ton Kalker and Hyoung Joong Kim},
4070 series = {Lecture Notes in Computer Science},
4071 address = {Siena, Italy},
4072 publisher = {Springer},
4073 month = {September 15-17},
4074 bibsource = {DBLP, http://dblp.uni-trier.de},
4076 isbn = {3-540-28768-X},
4078 timestamp = {2009.06.29}
4081 @PROCEEDINGS{DBLP:conf/ih/2006,
4082 title = {IH 2006: Information Hiding, 8th International Workshop},
4084 editor = {Jan Camenisch and Christian S. Collberg and Neil F. Johnson and Phil
4087 series = {Lecture Notes in Computer Science},
4088 address = {Alexandria, VA, USA},
4089 publisher = {Springer},
4091 bibsource = {DBLP, http://dblp.uni-trier.de},
4092 booktitle = {Information Hiding},
4093 isbn = {978-3-540-74123-7},
4095 timestamp = {2009.06.29}
4098 @PROCEEDINGS{DBLP:conf/ih/2007,
4099 title = {Information Hiding, 9th International Workshop, IH 2007, Saint Malo,
4100 France, June 11-13, 2007, Revised Selected Papers},
4102 editor = {Teddy Furon and Fran\c{c}ois Cayre and Gwena{\"e}l J. Do{\"e}rr and
4105 series = {Lecture Notes in Computer Science},
4106 publisher = {Springer},
4107 bibsource = {DBLP, http://dblp.uni-trier.de},
4108 booktitle = {Information Hiding},
4109 isbn = {978-3-540-77369-6},
4111 timestamp = {2009.06.29}
4114 @PROCEEDINGS{DBLP:conf/iccsa/2006-1,
4115 title = {Computational Science and Its Applications - ICCSA 2006, International
4116 Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I},
4118 editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih
4119 Jeng Kenneth Tan and David Taniar and Antonio Lagan{\`a} and Youngsong
4120 Mun and Hyunseung Choo},
4122 series = {Lecture Notes in Computer Science},
4123 publisher = {Springer},
4124 bibsource = {DBLP, http://dblp.uni-trier.de},
4125 booktitle = {ICCSA (1)},
4126 isbn = {3-540-34070-X}
4129 @PROCEEDINGS{DBLP:conf/secrypt/2010,
4130 title = {SECRYPT 2010 - Proceedings of the International Conference on Security
4131 and Cryptography, Athens, Greece, July 26-28, 2010, SECRYPT is part
4132 of ICETE - The International Joint Conference on e-Business and Telecommunications},
4134 editor = {Sokratis K. Katsikas and Pierangela Samarati},
4135 publisher = {SciTePress},
4136 bibsource = {DBLP, http://dblp.uni-trier.de},
4137 booktitle = {SECRYPT},
4138 isbn = {978-989-8425-18-8}
4141 @BOOK{Katzenbeisser00,
4142 title = {Information Hiding Techniques for Steganography and Digital Watermarking},
4143 publisher = {Artech House, Inc.},
4145 editor = {Katzenbeisser, Stefan and Petitcolas, Fabien A.},
4146 address = {Norwood, MA, USA},
4150 @PROCEEDINGS{DBLP:conf/ih/1999,
4151 title = {IH'99: 3rd International Workshop on Information Hiding},
4153 editor = {Andreas Pfitzmann},
4155 series = {Lecture Notes in Computer Science},
4156 address = {Dresden, Germany},
4157 publisher = {Springer},
4158 month = {September 29 - October 1.},
4159 bibsource = {DBLP, http://dblp.uni-trier.de},
4160 booktitle = {Information Hiding},
4161 isbn = {3-540-67182-X},
4163 timestamp = {2009.06.29}
4166 @PROCEEDINGS{DBLP:conf/indocrypt/2000,
4167 title = {Progress in Cryptology - INDOCRYPT 2000, First International Conference
4168 in Cryptology in India, Calcutta, India, December 10-13, 2000, Proceedings},
4170 editor = {Bimal K. Roy and Eiji Okamoto},
4172 series = {Lecture Notes in Computer Science},
4173 publisher = {Springer},
4174 bibsource = {DBLP, http://dblp.uni-trier.de},
4175 booktitle = {INDOCRYPT},
4176 isbn = {3-540-41452-5}
4179 @BOOK{DBLP:reference/icsec/2010,
4180 title = {Handbook of Information and Communication Security},
4181 publisher = {Springer},
4183 editor = {Peter P. Stavroulakis and Mark Stamp},
4184 bibsource = {DBLP, http://dblp.uni-trier.de},
4185 booktitle = {Handbook of Information and Communication Security},
4186 ee = {http://dx.doi.org/10.1007/978-3-642-04117-4},
4187 isbn = {978-3-642-04116-7}
4190 @PROCEEDINGS{DBLP:conf/isnn/2004-2,
4191 title = {Advances in Neural Networks - ISNN 2004, International Symposium
4192 on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings,
4195 editor = {Fuliang Yin and Jun Wang and Chengan Guo},
4197 series = {Lecture Notes in Computer Science},
4198 publisher = {Springer},
4199 bibsource = {DBLP, http://dblp.uni-trier.de},
4200 booktitle = {ISNN (2)},
4201 isbn = {3-540-22843-8}
4204 @PROCEEDINGS{DBLP:conf/adhocnets/2010,
4205 title = {Ad Hoc Networks - Second International Conference, ADHOCNETS 2010,
4206 Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers},
4208 editor = {Jun Zheng and David Simplot-Ryl and Victor C. M. Leung},
4210 series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics
4211 and Telecommunications Engineering},
4212 publisher = {Springer},
4213 bibsource = {DBLP, http://dblp.uni-trier.de},
4214 booktitle = {ADHOCNETS},
4215 ee = {http://dx.doi.org/10.1007/978-3-642-17994-5},
4216 isbn = {978-3-642-17993-8}
4221 timestamp = {2011.03.29}
4225 title = {Delicious social bookmarking, http://delicious.com/},
4226 comment = {http://delicious.com/},
4228 url = {http://delicious.com/}
4232 title = {The Frick Collection, http://www.frick.org/},
4233 comment = {http://www.frick.org/},
4235 url = {http://www.frick.org/}
4239 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
4240 2010, Barcelona, Spain, 18-23 July 2010},
4243 bibsource = {DBLP, http://dblp.uni-trier.de},
4244 booktitle = {IEEE Congress on Evolutionary Computation}
4247 @PROCEEDINGS{DBLP:conf/cec/2010,
4248 title = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC
4249 2010, Barcelona, Spain, 18-23 July 2010},
4252 bibsource = {DBLP, http://dblp.uni-trier.de},
4253 booktitle = {IEEE Congress on Evolutionary Computation}
4256 @PROCEEDINGS{DBLP:conf/date/2010,
4257 title = {Design, Automation and Test in Europe, DATE 2010, Dresden, Germany,
4261 bibsource = {DBLP, http://dblp.uni-trier.de},
4265 @PROCEEDINGS{DBLP:conf/cse/2009,
4266 title = {Proceedings IEEE CSE'09, 12th IEEE International Conference on Computational
4267 Science and Engineering, August 29-31, 2009, Vancouver, BC, Canada},
4269 publisher = {IEEE Computer Society},
4270 bibsource = {DBLP, http://dblp.uni-trier.de},
4274 @PROCEEDINGS{DBLP:conf/icumt/2009,
4275 title = {Proceedings of the International Conference on Ultra Modern Telecommunications,
4276 ICUMT 2009, 12-14 October 2009, St. Petersburg, Russia},
4279 bibsource = {DBLP, http://dblp.uni-trier.de},
4283 @PROCEEDINGS{DBLP:conf/focs/2008,
4284 title = {49th Annual IEEE Symposium on Foundations of Computer Science, FOCS
4285 2008, October 25-28, 2008, Philadelphia, PA, USA},
4287 publisher = {IEEE Computer Society},
4288 bibsource = {DBLP, http://dblp.uni-trier.de},
4292 @comment{jabref-meta: selector_publisher:}
4294 @comment{jabref-meta: selector_author:}
4296 @comment{jabref-meta: selector_journal:}
4298 @comment{jabref-meta: selector_keywords:Chaos;Entropie Topologique;Tip
4303 @InProceedings{Pang:2008:cec,
4304 author = "W.-M. Pang and T.-T. Wong and P.-A. Heng",
4305 title = "Generating Massive High-Quality Random Numbers using
4307 booktitle = "2008 IEEE World Congress on Computational
4310 editor = "Jun Wang",
4311 address = "Hong Kong",
4312 organization = "IEEE Computational Intelligence Society",
4313 publisher = "IEEE Press",
4317 @Article{LEcuyerS07,
4318 title = "Test{U01}: {A} {C} library for empirical testing of
4319 random number generators",
4320 author = "P. L'Ecuyer and R. J. Simard",
4321 journal = "ACM Trans. Math. Softw",
4325 bibdate = "2007-11-06",
4327 http://dblp.uni-trier.de/db/journals/toms/toms33.html#LEcuyerS07",
4328 URL = "http://doi.acm.org/10.1145/1268776.1268777",
4332 author = {A. Zhmurov and K. Rybnikov and Y. Kholodov and V. Barsegov},
4333 title = {Generation of Random Numbers on Graphics Processors: Forced Indentation In Silico of the Bacteriophage HK97},
4334 journal = {J. Phys. Chem. B},
4338 pages = {5278--5288},
4343 @comment {regarder : Pseudo-Random Number Generation for Brownian Dynamics and Dissipative Particle Dynamics Simulations on GPU Devices}
4344 @comment {CL Phillips, JA Anderson… - Journal of Computational Physics, 2011 - Elsevier}
4346 @InProceedings{conf/fpga/ThomasHL09,
4347 title = "A comparison of {CPU}s, {GPU}s, {FPGA}s, and massively
4348 parallel processor arrays for random number
4350 author = "D. B. Thomas and L. W. Howes and W. Luk",
4351 booktitle = "Proceedings of the {ACM}/{SIGDA} 17th International
4352 Symposium on Field Programmable Gate Arrays, {FPGA}
4353 2009, Monterey, California, {USA}, February 22-24,
4355 bibdate = "2010-06-29",
4358 editor = "Paul Chow and Peter Y. K. Cheung",
4359 ISBN = "978-1-60558-410-2",
4361 URL = "http://doi.acm.org/10.1145/1508128.1508139",
4366 @InProceedings{Jenkins96,
4367 author = "R. J. Jenkins",
4369 booktitle = "IWFSE: International Workshop on Fast Software
4376 title = {Cuda cublas library},
4378 Note = {Version 4.0},
4383 title = {Curand library},
4385 Note = {Version 4.0},
4391 author = {L. Blum and M. Blum and M. Shub},
4392 title = {A Simple Unpredictable Pseudo-Random Number Generator},
4393 journal = {SIAM Journal on Computing},
4400 author = {O. Goldreich},
4402 title = {Foundations of Cryptography: Basic Tools},
4403 publisher = {Cambridge University Press},
4407 @inproceedings{Sidorenko:2005:CSB:2179218.2179250,
4408 author = {Sidorenko, Andrey and Schoenmakers, Berry},
4409 title = {Concrete Security of the Blum-blum-shub Pseudorandom Generator},
4410 booktitle = {Proceedings of the 10th International Conference on Cryptography and Coding},
4413 isbn = {3-540-30276-X, 978-3-540-30276-6},
4414 location = {Cirencester, UK},
4417 url = {http://dx.doi.org/10.1007/11586821_24},
4418 doi = {10.1007/11586821_24},
4420 publisher = {Springer-Verlag},
4421 address = {Berlin, Heidelberg},