Filtrer vos résultats
- 22
- 5
- 18
- 6
- 1
- 1
- 1
- 1
- 27
- 11
- 1
- 1
- 4
- 3
- 3
- 1
- 1
- 2
- 3
- 1
- 5
- 2
- 24
- 3
- 19
- 10
- 9
- 4
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 27
- 7
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
27 résultats
|
|
triés par
|
|
Placement optimization of IoT security solutions for edge computing based on graph theory38th IEEE International Performance Computing and Communications Conference (IPCCC 2019), Oct 2019, London, United Kingdom
Communication dans un congrès
hal-02314892v1
|
||
|
On the computation of the Möbius transformTheoretical Computer Science, 2019, Theoretical Computer Science, 809, pp.171-188
Article dans une revue
hal-01178356v3
|
||
|
On the decoding of quasi-BCH codesWCC - International Workshop on Coding and Cryptography, Apr 2013, Bergen, Norway
Communication dans un congrès
hal-00768566v1
|
||
|
Tatouage d'images avec des données biométriques révocables pour la preuve de propriétéConférence sur la Sécurité des Architectures Réseaux et des Systèmes d'Information (SAR SSI), May 2014, Lyon, France
Communication dans un congrès
hal-00990791v1
|
||
|
List-decoding of binary Goppa codes up to the binary Johnson bound[Research Report] RR-7490, INRIA. 2010, pp.23
Rapport
inria-00547106v1
|
||
|
IoT : Vers un contrôle des fonctionnalités au vu des menaces liéesRendez-Vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, May 2018, La Bresse, France
Communication dans un congrès
hal-02055681v1
|
||
Introduction au décodage en listeArCoCrypt, Nov 2017, Caen, France
Communication dans un congrès
hal-02559247v1
|
|||
|
Re-encoding reformulation and application to Welch-Berlekamp algorithmRe-encoding reformulation and application to Welch-Berlekamp algorithm, Jun 2014, Hawai'i, United States. pp.1782 - 1786
Communication dans un congrès
hal-00768536v2
|
||
|
New Set of Codes for the Maximum-Likelihood Decoding ProblemYet Another Conference on Cryptography, Oct 2010, Porquerolle, France
Communication dans un congrès
inria-00534726v1
|
||
|
Improving success probability and embedding efficiency in code based steganography2013
Pré-publication, Document de travail
hal-00786383v1
|
||
|
A semantic approach for comparing Fog Service Placement ProblemsInternational Symposium on Integrated Network Management, May 2021, Bordeaux, France
Communication dans un congrès
hal-03233878v1
|
||
|
Ensuring message embedding in wet paper steganographyIMACC 2011, Dec 2011, Oxford, United Kingdom. pp.244-258, ⟨10.1007/978-3-642-25516-8_15⟩
Communication dans un congrès
hal-00639551v1
|
||
|
On Quasi-Cyclic Codes as a Generalization of Cyclic CodesFinite Fields and Their Applications, 2012, 18 (5), pp.904-919. ⟨10.1016/j.ffa.2012.06.003⟩
Article dans une revue
inria-00615276v2
|
||
|
Wet paper codes and the dual distance in steganographyAdvances in Mathematics of Communications, 2011, Lecture Notes on Computer Sciences, 6 (3), pp.273-285. ⟨10.3934/amc.2012.6.273⟩
Article dans une revue
inria-00584877v1
|
||
On the Möbius TransformArCoCrypt, Nov 2019, Rouen, France
Communication dans un congrès
hal-02559271v1
|
|||
|
Image Watermarking With Biometric Data For Copyright ProtectionARES -MFSEC, Aug 2015, Toulouse, France
Communication dans un congrès
hal-01131845v1
|
||
Retrieving Dates in Smart Card Dumps is as Hard as Finding a Needle in a HaystackThe IEEE Workshop on Information Forensics and Security (WIFS), Dec 2017, Rennes, France
Communication dans un congrès
hal-01615218v1
|
|||
|
Memory Carving in Embedded Devices: Separate the Wheat from the Chaff14th International Conference on Applied Cryptography and Network Security (ACNS 2016), Jun 2016, Guilford, United Kingdom. ⟨10.1007/978-3-319-39555-5_32⟩
Communication dans un congrès
hal-01338109v2
|
||
|
Décodage en liste et application à la sécurité de l'informationCryptographie et sécurité [cs.CR]. Ecole Polytechnique X, 2011. Français. ⟨NNT : ⟩
Thèse
pastel-00677421v1
|
||
|
On Generalized Reed-Solomon Codes Over Commutative and Noncommutative RingsIEEE Transactions on Information Theory, 2013, 59 (9), pp.5882-5897. ⟨10.1109/TIT.2013.2264797⟩
Article dans une revue
hal-00670004v2
|
||
Signature Renewal for Low Entropy Data17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications (TrustCom 2018), Aug 2018, New York, United States. ⟨10.1109/TrustCom/BigDataSE.2018.00126⟩
Communication dans un congrès
hal-01882376v1
|
|||
|
List-Decoding of Binary Goppa Codes up to the Binary Johnson BoundIEEE Information Theory Workshop, Oct 2011, Paraty, Brazil. pp.229 - 233, ⟨10.1109/ITW.2011.6089384⟩
Communication dans un congrès
hal-00643794v1
|
||
Memory carving can finally unveil your embedded personal dataProceedings of the 12th International Conference on Availability, Reliability and Security (ARES), Aug 2017, Reggio di calabria, Italy
Communication dans un congrès
hal-01615205v1
|
|||
|
Key Reduction of McEliece's Cryptosystem Using List DecodingInternational Symposium of Information Theory (ISIT), Aug 2011, Saint-Peterburg, Russia. pp.2657-2661
Communication dans un congrès
inria-00565343v2
|
||
|
GREYCHashing: Combining Biometrics and Secret for Enhancing the Security of Protected TemplatesFuture Generation Computer Systems, 2019, ⟨10.1016/j.future.2019.07.022⟩
Article dans une revue
hal-02179563v1
|
||
|
Applied graph theory to security: A qualitative placement of security solutions within IoT networksJournal of information security and applications, 2020, 55, pp.102640. ⟨10.1016/j.jisa.2020.102640⟩
Article dans une revue
hal-03234135v1
|
||
|
Enhancing the Security of Transformation Based Biometric Template Protection SchemesCyberWorlds, Oct 2018, Singapour, Singapore
Communication dans un congrès
hal-01862157v1
|