Author: "Cédric Lauradoux" / Topic: business.industry - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Cédric Lauradoux"' showing total 27 results

Start Over Author "Cédric Lauradoux" Topic business.industry

27 results on '"Cédric Lauradoux"'

1. Exploitation and Sanitization of Hidden Data in PDF Files: Do Security Agencies Sanitize Their PDF Files?

Author: Supriya Adhatarao, Cédric Lauradoux, Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), and Université Grenoble Alpes (UGA)
Subjects: 050101 languages & linguistics, Computer science, media_common.quotation_subject, 02 engineering and technology, Computer security, computer.software_genre, Systems security, Security and privacy, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 0202 electrical engineering, electronic engineering, information engineering, Information system, 0501 psychology and cognitive sciences, Quality (business), Publication, media_common, business.industry, 05 social sciences, Metadata, Information sensitivity, Hidden data, Publishing, ComputingMethodologies_DOCUMENTANDTEXTPROCESSING, 020201 artificial intelligence & image processing, business, File system security, computer
Abstract: International audience; Organizations publish and share more and more electronic documents like PDF files. Unfortunately, most organizations are unaware that these documents can compromise sensitive information like authors names, details on the information system and architecture. All these information can be exploited easily by attackers to footprint and later attack an organization. In this paper, we analyze hidden data found in the PDF files published by an organization. We gathered a corpus of 39664 PDF files published by 75 security agencies from 47 countries. We have been able to measure the quality and quantity of information exposed in these PDF files. It can be effectively used to find weak links in an organization: the employees who are running outdated software. We have also measured the adoption of PDF files sanitization by security agencies. We identified only 7 security agencies which sanitize few of their PDF files before publishing. Unfortunately, we were still able to find sensitive information within 65% of these sanitized PDF files. Some agencies are using weak sanitization techniques: it requires to remove all the hidden sensitive information from the file and not just to remove the data at the surface. Security agencies need to change their sanitization methods.
Published: 2021
Full Text: View/download PDF

2. The Pitfalls of Hashing for Privacy

Author: Cédric Lauradoux, Levent Demir, Mathieu Cunche, Amrit Kumar, Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), INCAS-ITSec, Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes
Subjects: Information privacy, Computer science, Data_MISCELLANEOUS, Hash function, 0211 other engineering and technologies, Anonymization, Cryptography, 02 engineering and technology, Computer security, computer.software_genre, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Hashing, Pseudonymization, 0202 electrical engineering, electronic engineering, information engineering, Cryptographic hash function, Index Terms-Anonymity set, Electrical and Electronic Engineering, 021110 strategic, defence & security studies, Data anonymization, Universal hashing, business.industry, Anonymity set, 020206 networking & telecommunications, Balls-into-bins, business, computer, Anonymity
Abstract: International audience; Boosted by recent legislations, data anonymizationis fast becoming a norm. However, as of yet no generic solutionhas been found to safely release data. As a consequence, datacustodians often resort to ad-hoc means to anonymize datasets.Both past and current practices indicate that hashing is oftenbelieved to be an effective way to anonymize data. Unfortunately,in practice it is only rarely effective. This paper is a tutorialto explain the limits of cryptographic hash functions as ananonymization technique. Anonymity set is the best privacymodel that can be achieved by hash functions. However, thismodel has several shortcomings. We provide three case studiesto illustrate how hashing only yields a weakly anonymized data.The case studies include MAC and email address anonymizationas well as the analysis of Google Safe Browsing.Boosted by recent legislations, data anonymizationis fast becoming a norm. However, as of yet no generic solutionhas been found to safely release data. As a consequence, datacustodians often resort to ad-hoc means to anonymize datasets.Both past and current practices indicate that hashing is oftenbelieved to be an effective way to anonymize data. Unfortunately,in practice it is only rarely effective. This paper is a tutorialto explain the limits of cryptographic hash functions as ananonymization technique. Anonymity set is the best privacymodel that can be achieved by hash functions. However, thismodel has several shortcomings. We provide three case studiesto illustrate how hashing only yields a weakly anonymized data.The case studies include MAC and email address anonymizationas well as the analysis of Google Safe Browsing.
Published: 2018
Full Text: View/download PDF

3. Security of Distance-Bounding: A Survey

Author: Aslan Tchamkerten, Muhammed Ali Bingöl, Gerhard P. Hancke, Kasper Bonne Rasmussen, Jorge Munilla, Süleyman Kardaş, Benjamin Martin, Dave Singelée, Gildas Avoine, Chong Hee Kim, Cédric Lauradoux, Rolando Trujillo-Rasua, Serge Vaudenay, Srdjan Capkun, Ioana Boureanu, Alberto Peinado, EMbedded SEcurity and Cryptography (EMSEC), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Computer Security and Industrial Cryptography [KU Leuven] (ESAT-COSIC), Department of Electrical Engineering [KU Leuven] (KU-ESAT), Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven)-Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), Télécom ParisTech, University of Luxembourg [Luxembourg], Ecole Polytechnique Fédérale de Lausanne (EPFL), Istanbul Technical University (ITÜ), University of Surrey (UNIS), University of Pretoria [South Africa], Batman University, Department of Electrical Engineering [Princeton] (EE), Princeton University, Image et Son, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)
Subjects: PROTOCOLS, Technology, General Computer Science, Computer science, media_common.quotation_subject, Access control, Cryptography, 02 engineering and technology, relay attacks, Gas meter prover, Computer security, computer.software_genre, Theoretical Computer Science, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Bounding overwatch, Computer Science, Theory & Methods, distance-bounding, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], ComputingMilieux_MISCELLANEOUS, media_common, contactless, Authentication, Science & Technology, cryptography, Information security, business.industry, MAFIA, 020206 networking & telecommunications, Payment, distance fraud, mafia fraud, Computer Science, Key (cryptography), 020201 artificial intelligence & image processing, terrorist fraud, proximity check, business, computer, ATTACKS, AUTHENTICATION
Abstract: The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link Distance-bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g., electronic payment or access control systems, which are vulnerable to distance-based frauds. This survey analyzes and compares in a unified manner many existing distance-bounding protocols with respect to several key security and complexity features.
Published: 2019
Full Text: View/download PDF

4. Duck Attack on Accountable Distributed Systems

Author: Pascal Lafourcade, Cédric Lauradoux, Amrit Kumar, National University of Singapore (NUS), Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon, Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020]), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), and Lauradoux, Cédric
Subjects: Cryptographic primitive, Exploit, Computer science, business.industry, Secure log, Distributed computing, Hash function, Duck attack, 020206 networking & telecommunications, Cryptography, Public verifiability, 02 engineering and technology, Cryptographic protocol, Data structure, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), 020201 artificial intelligence & image processing, Accountability, business, Protocol (object-oriented programming), [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract: International audience; Accountability plays a key role in dependable distributed systems.It allows to detect, isolate and churn malicious/selfish nodes thatdeviate from a prescribed protocol. To achieve these properties, sev-eral accountable systems use at their core cryptographic primitivesthat produce non-repudiable evidence of inconsistent or incorrectbehavior.In this paper, we show how selfish and colluding nodes canexploit the use of cryptographic digests in accountability protocolsto mount what we call a duck attack. In a duck attack, selfish andcolluding nodes exploit the use of cryptographic digests to alter thetransmission of messages while masquerading as honest entities.The end result is that their selfish behavior remains undetected. Thisundermines the security guarantees of the accountability protocols.We first discover the duck attack while analyzing PAG — a cus-tom cryptographic protocol to build accountable systems presentedat ICDCS 2016. We later discover that accountable distributed sys-tems based on a secure log (essentially a hash-based data structure)are also vulnerable to the duck attack and apply it on AcTinG — aprotocol presented at SRDS 2014. To defeat our attack, we modifythe underlying secure log to have high-order dependency on themessages stored in it.
Published: 2017

5. Ephemeral: Lightweight Pseudonyms for 6LowPAN Mac Addresses

Author: Jessye Dos Santos, Cédric Lauradoux, J.C. Fonbonne, Christine Hennebert, Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information (CEA-LETI), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes
Subjects: IPv6 address, business.industry, Computer science, Network packet, Routing table, 010401 analytical chemistry, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020207 software engineering, 02 engineering and technology, Pseudonym, 01 natural sciences, 0104 chemical sciences, Identifier, Information sensitivity, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 0202 electrical engineering, electronic engineering, information engineering, Routing (electronic design automation), business, 6LoWPAN, Computer network
Abstract: International audience; Privacy is a major issue for 6LoWPAN networks and the use of persistent identifiers (MAC addresses) in the core mechanism is particularly challenging. Indeed, nodes use the SLAAC protocol in RPL to auto generate their IPv6 addresses based on their MAC addresses. Persistent addresses simplify the routing in the network but allow an adversary to analyze the traffic and recover sensitive information. We propose Ephemeral a MAC pseudonym scheme compliant with SLAAC. It provides dynamic pseudonyms cryptographically generated without the need to reconstruct the routing tables when the pseudonyms change. Our simulation based on CONTIKI 3.0 and WSNET shows that Ephemeral improves MT6D a previous MAC pseudonyms scheme by 16\% in term of application packet delivery. It also reduces the overhead of control frames introduced by MT6D.
Published: 2016

6. Energy efficient authentication strategies for network coding

Author: Anya Apavatjrut, Katia Jaffrès-Runser, Antoine Fraboulet, Cédric Lauradoux, Wassim Znaidi, Claire Goursaud, Marine Minier, Smart Wireless Networking (SWING), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), Ambient Middleware Architectures: Service-Oriented, Networked, Efficient and Secured (AMAZONES), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Linear Universal Hash Functions, Computer Networks and Communications, Computer science, Distributed computing, Hash function, Throughput, 0102 computer and information sciences, 02 engineering and technology, Network topology, 01 natural sciences, Trees, Theoretical Computer Science, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Pollution Attack, 0202 electrical engineering, electronic engineering, information engineering, Message authentication code, Dissemination, Authentication, MAC, Wireless network, business.industry, 020206 networking & telecommunications, Energy consumption, Denial of Services, Computer Science Applications, Computational Theory and Mathematics, 010201 computation theory & mathematics, Linear network coding, Xor Network Coding, business, Wireless sensor network, Software, Efficient energy use, Computer network
Abstract: Recent advances in information theory and networking, e.g. aggregation, network coding or rateless codes, have significantly modified data dissemination in wireless networks. These new paradigms create new threats for security such as pollution attacks and denial of services (DoS). These attacks exploit the difficulty to authenticate data in such contexts. The particular case of xor network coding is considered herein. We investigate different strategies based on message authentication codes algorithms (MACs) to thwart these attacks. Yet, classical MAC designs are not compatible with the linear combination of network coding. Fortunately, MACs based on universal hash functions (UHFs) match nicely the needs of network coding: some of these functions are linear h(x1⊕x2) = h(x1)⊕h(x2). To demonstrate their efficiency, we consider the case of wireless sensor networks (WSNs). Although these functions can drastically reduce the energy consumption of authentication (up to 68% gain over the classical designs is observed), they increase the threat of DoS. Indeed, an adversary can disrupt all communications by polluting few messages. To overcome this problem, a group testing algorithm is introduced for authentication resulting in a complexity linear in the number of attacks. The energy consumption is analyzed for cross-point and butterfly network topologies with respect to the possible attack scenarios. The results highlight the trade-offs between energy efficiency, authentication and the effective throughput for the different MAC modes. Copyright © 2011 John Wiley & Sons, Ltd.
Published: 2011
Full Text: View/download PDF

7. Preserving Privacy in secured ZigBee Wireless Sensor Networks

Author: Jessye Dos Santos, Christine Hennebert, Cédric Lauradoux, Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information (CEA-LETI), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon
Subjects: Computer science, 02 engineering and technology, security, IDS, Computer security, computer.software_genre, privacy, ZigBee WSN, attacks, 0202 electrical engineering, electronic engineering, information engineering, ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS, [INFO]Computer Science [cs], Zigbee wireless sensor networks, Protocol (object-oriented programming), SIMPLE (military communications protocol), business.industry, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, eavesdropping, 020206 networking & telecommunications, 020207 software engineering, Eavesdropping, Information leakage, Identity (object-oriented programming), business, computer, NeuRFon, Computer network
Abstract: International audience; We expose concretely the information leakage occurring in an IEEE 802.15.4-based ZigBee meshed network. We deploy an IoT platform and used a killerbee sniffer to eavesdrop the communication between the motes. Metadata and control traffic are exploited in depth to recover protocol instances, routes, identity, capability and activity of the devices. We experiment different levels of security for the communications from none to the best available. Even when security is enforced, information leakages are not avoided. We propose simple countermeasures to prevent an outsider from monitoring a ZigBee network.
Published: 2015
Full Text: View/download PDF

8. Interleaving Cryptanalytic Time-memory Trade-offs on Non-Uniform Distributions

Author: Xavier Carpent, Cédric Lauradoux, Gildas Avoine, EMbedded SEcurity and Cryptography (EMSEC), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Université Catholique de Louvain = Catholic University of Louvain (UCL), Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes
Subjects: Password, 021110 strategic, defence & security studies, Theoretical computer science, Interleaving, Computer science, business.industry, Hash function, 0211 other engineering and technologies, 020206 networking & telecommunications, Ranging, 02 engineering and technology, Toolbox, Tree traversal, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Rainbow table, Symmetric-key algorithm, 0202 electrical engineering, electronic engineering, information engineering, business
Abstract: Cryptanalytic time-memory trade-offs TMTO are famous tools available in any security expert toolbox. They have been used to break ciphers such as A5/1, but their efficiency to crack passwords made them even more popular in the security community. While symmetric keys are generated randomly according to a uniform distribution, passwords chosen by users are in practice far from being random, as confirmed by recent leakage of databases. Unfortunately, the technique used to build TMTOs is not appropriate to deal with non-uniform distributions. In this paper, we introduce an efficient construction that consists in partitioning the search set into subsets of close densities, and a strategy to explore the TMTOs associated to the subsets based on an interleaved traversal. This approach results in a significant improvement compared to currently used TMTOs. We experimented our approach on a classical problem, namely cracking 7-character NTLM Hash passwords using an alphabet with 34 special characters. This resulted in speedups ranging from 16 to 76 depending on the input distribution over rainbow tables, which are considered as the most efficient variant of time-memory trade-offs.
Published: 2015

9. A Survey of Alerting Websites: Risks and Solutions

Author: Cédric Lauradoux, Amrit Kumar, Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon
Subjects: Password, Computer science, business.industry, Internet privacy, [SCCO.COMP]Cognitive science/Computer science, Bloom filter, Private Set Intersection, Computer security, computer.software_genre, Phishing, Data leakages, Credit card, Work (electrical), Telephone number, Cardinality (SQL statements), Private Information Retrieval, business, computer, Private information retrieval
Abstract: International audience; In the recent years an incredible amount of data has been leaked from major websites such as Adobe, Snapchat and LinkedIn. There are hundreds of millions of usernames, email addresses, passwords, telephone numbers and credit card details in the wild. The aftermath of these breaches is the rise of alerting websites such as haveibeenpwned.com, which let users verify if their accounts have been compromised. Unfortunately, these seemingly innocuous websites can be easily turned into phishing tools. In this work, we provide a comprehensive study of the most popular ones. Our study exposes the associated privacy risks and evaluates existing solutions towards designing privacy-friendly alerting websites. In particular, we study three solutions: private set intersection, private set intersection cardinality and private information retrieval adapted to membership testing. Finally, we investigate the practicality of these solutions with respect to real world database leakages.
Published: 2015
Full Text: View/download PDF

10. A Privacy Analysis of Google and Yandex Safe Browsing

Author: Amrit Kumar, Cédric Lauradoux, Thomas Gerbet, Université Joseph Fourier - Grenoble 1 (UJF), Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), INRIA, ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, and Université Grenoble Alpes [2016-2019] (UGA [2016-2019])
Subjects: Privacy analysis, Computer science, Privacy policy, Internet privacy, 02 engineering and technology, phishing, computer.software_genre, Malware, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], World Wide Web, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Server, 0202 electrical engineering, electronic engineering, information engineering, Private information retrieval, Web browser, business.industry, 020206 networking & telecommunications, Phishing, privacy-set size, Privacy, surveillance, 020201 artificial intelligence & image processing, business, computer, Google Safe browsing
Abstract: International audience; Google and Yandex Safe Browsing are popular services included in many webbrowsers to prevent users from visiting phishing or malware website links. If Safe Browsing servicesprotect their users from losing private information, they also require that their servers receivebrowsing information on the very same users. In this paper, we present an analysis of Googleand Yandex Safe Browsing services from a privacy perspective. We quantify the privacy providedby these services by analyzing the possibility of re-identifying a URL visited by a client. Wehence challenge Google’s privacy policies where they claim that Google can not recover URLsvisited by its users. Our analysis and experimental results show that Google and Yandex SafeBrowsing can potentially be used as a tool to track specific classes of individuals. Additionally, ourinvestigations on the data currently included in Yandex Safe Browsing provides a concrete set ofURLs/domains that can be re-identified without much effort
Published: 2015
Full Text: View/download PDF

11. CryptoPage : Support matériel pour cryptoprocessus

Author: Cédric Lauradoux, Guillaume Duc, and Ronan Keryell
Subjects: business.industry, CPU cache, Computer science, Hash function, Cryptography, computer.software_genre, Merkle tree, law.invention, Cipher, law, Embedded system, Strong cryptography, Operating system, Cache, Cryptanalysis, business, computer
Abstract: Computers are widely used and interconnected but are not as secure as we could expect. For example, a secure execution cannot even be achieved or proved against a software (the system administrator) or hardware attacker (a logical analyzer on the computer buses). In this article a strong cryptography-based architecture with an operating system support is presented to reach such security levels without reducing the performance. A cache line cipher and a memory verifier based on MERKLE tree hash function is added to the internal cache in order to resist to various attacks and even replay attacks. Then the impact on the operating system and some applications are described.
Published: 2005
Full Text: View/download PDF

12. Private Password Auditing

Author: Cédric Lauradoux, Amrit Kumar, Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon
Subjects: Zero-knowledge password proof, Password cracking, Computer science, Internet privacy, 02 engineering and technology, Computer security, computer.software_genre, One-time password, S/KEY, Password strength, Password, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Password psychology, Password policy, Cognitive password, business.industry, Auditing, Private set intersection cardinality, ComputingMilieux_MANAGEMENTOFCOMPUTINGANDINFORMATIONSYSTEMS, Private set intersection, 020201 artificial intelligence & image processing, business, computer
Abstract: International audience; Password is the foremost mean to achieve data and computer secu-rity. Hence, choosing a strong password which may withstand dictionary attacksis crucial in establishing the security of the underlying system. In order to en-sure that strong passwords are chosen, and that they are periodically updated,system administrators often rely on password auditors. Several tools aimed atpreventing password misuse have been designed to aid auditors in their task.We however show that the objective remains a far cry as these tools essentiallyreveal the digests corresponding to weak passwords. As a case study, we discussthe issues with Blackhash, and develop the notion of Private Password Auditing— a mechanism that does not require the system administrator to reveal pass-word digests to an external auditor and symmetrically the dictionaries remainprivate to the auditor. We further present constructions based on Private SetIntersection and its variants, and evaluate a proof-of-concept implementation.
Published: 2014

13. The entropy of wireless statistics

Author: Cédric Lauradoux, Christine Hennebert, and Hicham Hossayni
Subjects: Wi-Fi array, business.industry, Wireless network, Computer science, Network packet, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Eavesdropping, computer.software_genre, Key distribution in wireless sensor networks, Cognitive radio, Entropy (information theory), Wireless, Data mining, business, computer, Computer network
Abstract: Supply a non-deterministic random number generator with a fresh source of entropy is a challenge for wireless mobile devices with limited resources. Different works propose to use environmental measures or physical noise as entropy sources for WSN. In this paper, we aim to analyze the entropy generated by the wireless channel using the IEEE 802.15.4 standard. To achieve this goal, we focus on erroneous packets, RSSI (Received Signal Strength Indicator) and LQI (Link Quality Indicator) used to reflect respectively the signal's power and the quality of the channel. No additional hardware is needed to gather data from these sources, which make them more interesting for WSN. In order to estimate the entropy of such sources, we propose a new analytical framework using the pessimistic entropy estimators recommended by the NIST. We have lead several experiments to evaluate the entropy collected under various conditions, and to study the impact of some attacks (e.g. eavesdropping or jamming attacks) on these entropy sources. Analysis shows that the LQI indicator and the erroneous packets are the most interesting entropy sources. These data are random and independent from one node to another, and seems to resist eavesdropping attacks.
Published: 2014
Full Text: View/download PDF

14. Analysing the privacy policies of Wi-Fi trackers

Author: Levent Demir, Cédric Lauradoux, Mathieu Cunche, Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), INRIA, Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: physical analytics, MAC address, Computer science, business.industry, BitTorrent tracker, Privacy policy, Hash function, Tracking system, Tracking (particle physics), Computer security, computer.software_genre, privacy, anonymization, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Software, hash function, Wi-Fi tracking, business, computer, ACM: K.: Computing Milieux/K.4: COMPUTERS AND SOCIETY/K.4.1: Public Policy Issues/K.4.1.5: Privacy, Computer network, 802.11
Abstract: Wi-Fi-based tracking systems have recently appeared. By collecting radio signals emitted by Wi-Fi enabled devices, those systems are able to track individuals. They basically rely on the MAC address to uniquely identify each individual. If retailers and business have high expectations for physical tracking, it is also a threat for citizens privacy. We analyse the privacy policies used by the current tracking companies then we show the pitfalls of hash-based anonymization. More particularly we demonstrate that the hash-based anonymization of MAC address used in many Wi-Fi tracking systems can be easily defeated using of-the-shelf software and hardware. Finally we discuss possible solutions for MAC address anonymization in Wi-Fi tracking systems.; Les systèmes de traçages basés sur le Wi-Fi ont récemment fait leur apparition. En collectant les signaux radio émis par les terminaux équipés du Wi-Fi, ces systèmes sont capables de tracer les individus. Ils utilisent l'adresse MAC des terminaux pour identifier de manière unique les personnes. Si les acteurs du commerce physique ont de grandes attentes de ces technologies de traçage physique, elles représentent également une menace pour la vie privée. Nous analysons les politiques de vie privée des principaux acteurs du traçage Wi-Fi et nous montrons l'inefficacité des techniques d'anonymisation par fonction de hachage. Plus particulièrement, nous montrons que les techniques d'anonymisations basées sur les fonctions de hachage, communément utilisés dans les systèmes de traçage Wi-Fi, peuvent être facilement cassées en utilisant des logiciels et du matériel standard. Finalement, nous discutons des solutions alternatives pour l'anonymisation des adresses MAC dans les systèmes de traçage Wi-Fi.
Published: 2014
Full Text: View/download PDF

15. Distributed Key Certification Using Accumulators for Wireless Sensor Networks

Author: Claude Castelluccia, Jun Young Bae, Cédric Lauradoux, Franck Rousseau, Drakkar, Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), EAI, ANR-09-VERS-0017,ARESA2,Avancées en Réseaux de capteurs Efficaces, Sécurisés et Auto-Adaptatifs (ARESA2) : vers des réseaux de capteurs et actionneurs sécurisés, auto-organisants, efficaces en énergie et connectés au monde IP(2009), ANR-11-INFR-0016,IRIS,R eseaux Tout IP pour le Futur Internet d'Objets In- telligents(2011), European Project: 288879,EC:FP7:ICT,FP7-ICT-2011-7,CALIPSO(2011), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), and ANR-11-INFR-0016,IRIS,Reseaux Tout IP pour le Futur Internet d'Objets In-telligents(2011)
Subjects: business.industry, Computer science, 02 engineering and technology, Sun SPOT, Public-key cryptography, Accumulator (energy), [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Key distribution in wireless sensor networks, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), Memory footprint, 020201 artificial intelligence & image processing, Hardware_ARITHMETICANDLOGICSTRUCTURES, Elliptic curve cryptography, business, Wireless sensor network, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract: In this work, we propose a key certification protocol for wireless sensor networks that allows nodes to autonomously exchange their public keys and verify their authenticity using one-way accumulators. We examine and compare different accumulator implementations for our protocol on the Sun SPOT platform. We observe that our protocol performs best with accumulators based on Elliptic Curve Cryptography (ECC): ECC-based accumulators have roughly the same speed as Secure Bloom filters, but they have a smaller memory footprint.
Published: 2014
Full Text: View/download PDF

16. Towards stronger jamming model: Application to TH-UWB radio

Author: Benoit Miscopein, Jean-Marie Gorce, Cédric Lauradoux, Ahmed Benfarah, Orange Labs [Meylan], Orange Labs, Software and Cognitive radio for telecommunications (SOCRATE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria), and Gorce, Jean-Marie
Subjects: Near-far problem, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, Computer science, 020208 electrical & electronic engineering, Real-time computing, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, Ranging, Jamming, 02 engineering and technology, Data_CODINGANDINFORMATIONTHEORY, Communications system, Spread spectrum, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Modulation, Robustness (computer science), 0202 electrical engineering, electronic engineering, information engineering, Wireless, business, Computer network
Abstract: International audience; With the great expansion of wireless communications, jamming becomes a real threat.We propose a new model to evaluate the robustness of a communication system to jamming. The model results in more scenarios to be considered ranging from the favorable case to the worst case. The model is applied to a TH-UWB radio. The performance of such a radio in presence of the different jamming scenarios is analyzed. We introduce a mitigation solution based on stream cipher that restricts the jamming problem of the TH-UWB communication to the more favorable case while preserving confidentiality.
Published: 2012

17. Overflow of Fountain Codes in Multi-hop Wireless Sensor Networks

Author: Katia Jaffrès-Runser, Cédric Lauradoux, Anya Apavatjrut, Claire Goursaud, Smart Wireless Networking (SWING), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), IEEE, and Jaffrès-Runser, Katia
Subjects: Computer science, Acknowledgement, 02 engineering and technology, Data_CODINGANDINFORMATIONTHEORY, Hop (networking), ACM: C.: Computer Systems Organization/C.4: PERFORMANCE OF SYSTEMS/C.4.0: Design studies, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Fountain code, 0202 electrical engineering, electronic engineering, information engineering, Network performance, wireless sensor networks, Channel code, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Network packet, business.industry, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS, ACM: F.: Theory of Computation/F.0: GENERAL, Linear network coding, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.2: Network Protocols, flooding overhead, fountain codes, acknowledgement, business, Wireless sensor network, Decoding methods, Computer network
Abstract: International audience; This paper concentrates on the proper use of fountain codes for the transmission of sporadic data in a wireless sensor network (WSN). Fountain codes offer great perspectives for the self-organization of WSNs: they self adapt to the channel error rate without control packets. Deploying fountain codes in a WSN raises two problems. First, the size of the data transmitted by a sensor is small in comparison to the size usually considered with fountain codes. Second, WSNs mostly rely on multi-hop transmissions. It implies a non null transmission duration for the end-to-end acknowledgement of the reception. During this period of time, the source is still transmitting useless packets, creating a specific overhead we define as the overflow. This paper brings the overflow problem to light and analyses its impact on the network performance. Our work can be viewed as the networking counterpart of the results presented by Pakzad et al. at ISIT 2005 applied to WSNs.
Published: 2011

18. Flooding attacks against network coding and countermeasures

Author: Wassim Znaidi, Cédric Lauradoux, Yuanyuan Zhang, Marine Minier, Smart Wireless Networking (SWING), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), and IEEE
Subjects: Routing protocol, Computer science, business.industry, Quality of service, Flooding attack, network coding, multipath acknowledgment, Cryptography, Computer security, computer.software_genre, Flooding (computer networking), Key distribution in wireless sensor networks, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Linear network coding, Multipath routing, business, Wireless sensor network, computer, Computer network
Abstract: International audience; Network coding has attracted the attention of many researchers in security and cryptography. While most of the works have been dedicated to the protection of messages carrying information, nothing has been done to protect the acknowledgment messages needed in network coding. These flooding attacks are critical in resource constraint networks such as wireless sensor networks. An adversary can easily create congestion in the network and exhaust all the resources available. The degradation of the QoS (delay,energy) goes beyond the capabilities of cryptographic solutions. We investigate the security capabilities of multipath acknowledgment.
Published: 2011

19. Authentication planning for XOR network coding

Author: Katia Jaffrès-Runser, Cédric Lauradoux, Smart Wireless Networking (SWING), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)
Subjects: FOS: Computer and information sciences, Computer science, Distributed computing, Throughput, Context (language use), 02 engineering and technology, security, Network topology, message authentication codes, Computer Science - Networking and Internet Architecture, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0202 electrical engineering, electronic engineering, information engineering, Computer Science::Networking and Internet Architecture, Message authentication code, Computer Science::Cryptography and Security, Networking and Internet Architecture (cs.NI), Authentication, business.industry, 020206 networking & telecommunications, network coding, Wireless sensor networks, Linear network coding, 020201 artificial intelligence & image processing, planning, business, Wireless sensor network, optimization, Computer network, Efficient energy use
Abstract: International audience; This paper formulates the authentication planning problem when network coding is implemented in a wireless sensor network. The planning problem aims at minimizing the energy consumed by the security application which is guarantied using message authentication codes. This paper proposes a binary non-linear optimization formulation for this planning problem whose decision variables are the authentication decision of the nodes and the MAC modes of operation. It is illustrated for a butterfly topology. Results show that there is a real trade-off between energy efficiency and message throughput in this context.; Les réseaux sans-fil sont particulièrement vulnérables aux attaques par pollution dans lesquelles un attaquant externe est capable d'envoyer ces propres messages sur le réseau. Pour pouvoir détecter de telles attaques à la destination, un code d'authentification (MAC: Message Authentication Code en anglais) est rajouté à chaque paquet. Un noeud intermédiaire peut vérifier la validité d'un paquet de façon à limiter la portée de transmission d'un paquet pollué dans le réseau. Dans le cadre d'un réseau fortement contraint en énergie tel qu'un réseau de capteurs, le problème du déploiement d'une stratégie de sécurisation du réseau par MAC se pose. En effet, la consommation énergétique du réseau sera fortement influencée d'une part par le type de MAC utilisé dans le réseau et d'autre part par le choix des relais du réseau qui vérifieront le code des paquets avant de les retransmettre. Nous nous intéressons plus particulièrement au cas où le réseau de capteurs utilise une transmission par codage réseau de par sa plus grande vulnérabilité aux attaques par pollution. Ce type de réseau nécessite l'emploi de MAC dédiés (linéaires). Dans ces travaux, nous proposons une formulation combinatoire du problème de planification de la sécurité. Dans cette formulation, nous minimisons l'énergie totale consommée par le réseau sécurisé pour la transmission d'un paquet par source dans le réseau. Les variables sont les décisions d'authentification binaires des noeuds. Nous illustrons ce modèle pour un réseau papillon pour lequel différentes distributions des probabilités d'attaque sur les liens sont considérées.
Published: 2011

20. How Secret-sharing can Defeat Terrorist Fraud

Author: Gildas Avoine, Benjamin Martin, Cédric Lauradoux, Département d'Ingénierie Informatique - UCL (INGI), Université Catholique de Louvain = Catholic University of Louvain (UCL), Smart Wireless Networking (SWING), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon, ACM, Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)
Subjects: Authentication, business.industry, Computer science, 020206 networking & telecommunications, Cryptography, 02 engineering and technology, ACM: K.: Computing Milieux/K.6: MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS/K.6.5: Security and Protection/K.6.5.0: Authentication, Gas meter prover, Adversary, 16. Peace & justice, Computer security, computer.software_genre, Secret sharing, Relay attack, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Bounding overwatch, 0202 electrical engineering, electronic engineering, information engineering, ComputingMilieux_COMPUTERSANDSOCIETY, 020201 artificial intelligence & image processing, Distance-bounding protocol, business, computer, Authentication, distance-bounding, terrorist fraud, \\mafia fraud, secret sharing, threshold cryptography
Abstract: International audience; Terrorist fraud is a relay attack against distance bounding protocols where the prover conspires with an adversary to misrepresent the distance between himself and the verifier. In ideal situations, the adversary does not gain any knowledge about the prover's long-term secret. This makes designing a distance bounding protocol resistant to a such fraud tricky: the secrets of an honest prover must be protected, while those of a dishonest one should be disclosed as an incentive not to cheat. In this paper, we demonstrate that using a secret-sharing scheme, possibly based on threshold cryptography, is well suited for thwarting terrorist fraud. Although such an idea has been around since the work of Bussard and Bagga, this is the first time that secret-sharing and terrorist fraud have been systematically studied altogether. We prove that secret sharing can counter terrorist fraud, and we detail a method that can be applied directly to most existing distance bounding protocols. We illustrate our method on the protocol of Hancke and Kuhn, yielding two variants: the threshold distance bounding (TDB) protocol and the thrifty threshold distance bounding (TTDB) protocol. We define the adversarial strategies that attempt to gain some knowledge on the prover's long-term secret, evaluate the amount of information disclosed, and determine the adversary's success probability.
Published: 2011

21. Distance Bounding Protocols on TH-UWB Radios

Author: Benoit Miscopein, Cédric Lauradoux, Ahmed Benfarah, Jean-Marie Gorce, Bernard Roux, Smart Wireless Networking (SWING), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), Orange Labs [Lannion], France Télécom, Institut Camille Jordan (ICJ), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), Institut Camille Jordan [Villeurbanne] (ICJ), Université de Lyon-Université Jean Monnet [Saint-Étienne] (UJM)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), and Lauradoux, Cédric
Subjects: [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, Computer science, 050801 communication & media studies, 02 engineering and technology, Data_CODINGANDINFORMATIONTHEORY, security, law.invention, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 0508 media and communications, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, Relay, law, Bounding overwatch, distance-bounding, Computer Science::Networking and Internet Architecture, 0202 electrical engineering, electronic engineering, information engineering, Code (cryptography), Wireless, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, Computer Science::Cryptography and Security, Authentication, Sequence, business.industry, 05 social sciences, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, TH-UWB, authentication, business, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Computer network
Abstract: International audience; Relay attacks pose a real threat to the security of wireless communications. Distance bounding protocols have been designed to thwart these attacks. In this paper, we study the way to adapt distance bounding protocols to time-hopping ultra wideband (TH-UWB) radios. Two protocols are proposed which are based on the milestones of the TH-UWB radio: the time-hopping sequence and the mapping code. The security and the different merits of those protocols are analyzed.
Published: 2010

22. Energy Friendly Integrity for Network Coding in Wireless Sensor Networks

Author: Claire Goursaud, Anya Apavatjrut, Wassim Znaidi, Antoine Fraboulet, Marine Minier, Cédric Lauradoux, Smart Wireless Networking (SWING), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), Ambient Middleware Architectures: Service-Oriented, Networked, Efficient and Secured (AMAZONES), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), IEEE, and Lauradoux, Cédric
Subjects: Computer science, homomorphic MAC, Hash function, Cryptography, 02 engineering and technology, Xor network coding, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Data integrity, Computer Science::Networking and Internet Architecture, 0202 electrical engineering, electronic engineering, information engineering, Message authentication code, Computer Science::Cryptography and Security, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], pollution attack, Cryptographic primitive, business.industry, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], 020206 networking & telecommunications, universal hash functions, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], Linear network coding, Key (cryptography), 020201 artificial intelligence & image processing, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], business, Wireless sensor network, Computer network
Abstract: International audience; The recent advances in information theory and networking have significantly modified the way to disseminate data in wireless sensor networks (WSNs): aggregation, network coding or rateless codes. These new paradigms of dissemination create new threats for security such as pollution attacks. These attacks exploit the difficulty to protect data integrity in those contexts. In this paper, we consider the particular case of xor network coding. We compare the different strategies based on message authentication codes algorithms (MACs) to thwart these attacks. We emphasize the advantages of universal hash functions (UHFs) in terms of flexibility and efficiency. These schemes reduce the energy consumption by 42% and 68% (according to the used protocol) for the relaying nodes over those based on classical cryptographic primitives without any loss in security. The key feature of the UHFs considered here is their homomorphic property h(x1 ⊕ x2 ) = h(x1 ) ⊕ h(x2 ). These homomorphic MACs offer more possibilities for the relying nodes than the classical cryptographic ones: the detection time of a pollution attack can be adjusted to preserve the nodes energy. Moreover, they can be computed with the low resources of a sensor.
Published: 2010

23. When Compromised Readers Meet RFID

Author: Cédric Lauradoux, Gildas Avoine, and Tania Martin
Subjects: Authentication, Mode (computer interface), business.industry, Property (programming), Computer science, Authentication protocol, Internet privacy, Access control, business, Computer security, computer.software_genre, computer, Constraint (mathematics)
Abstract: RFID-based access control solutions for mobile environments, e.g. ticketing systems for sport events, commonly rely on readers that are not continuously connected to the back-end system. The readers must so be able to perform their tasks even in offline mode, what commonly requires the management by the readers of sensitive data. We stress in this paper the problem of compromised readers and its impact in practice. We provide a thorough review of the existing authentication protocols faced to this constraint, and extend our analysis with the privacy property. We show that none of the reviewed protocols fits the required properties in case of compromised readers. We then design a sporadically-online solution that meets our expectations in terms of both security and privacy.
Published: 2009
Full Text: View/download PDF

24. X-FCSR - a new software oriented stream cipher based upon FCSRs

Author: Thierry P. Berger, Cédric Lauradoux, Marine Minier, François Arnault, DMI, XLIM (XLIM), Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS), Architectures of networks of services (ARES), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), K. Srinathan, C. Pandu Rangan, Moti Yung, Vieceli, Yolande, and K. Srinathan, C. Pandu Rangan, Moti Yung
Subjects: Computer science, business.industry, Feedback with Carry Shift Registers, Byte, 0102 computer and information sciences, 02 engineering and technology, Parallel computing, 01 natural sciences, law.invention, Software, 010201 computation theory & mathematics, law, 0202 electrical engineering, electronic engineering, information engineering, Software design, 020201 artificial intelligence & image processing, Cryptanalysis, business, Stream cipher, Throughput (business), ComputingMilieux_MISCELLANEOUS
Abstract: Feedback with Carry Shift Registers (FCSRs) are a promising alternative to LFSRs in the design of stream ciphers. The previous constructions based on FCSRs were dedicated to hardware applications [3]. In this paper, we will describe X-FCSR a family of software oriented stream ciphers using FCSRs. The core of the system is composed of two 256-bits FCSRs. We propose two versions: X-FCSR-128 and X-FCSR- 256 which output respectively 128 and 256 bits at each iteration. We study the resistance of our design against several cryptanalyses. These stream ciphers achieve a high throughput and are suitable for software applications (6.3 cycles/byte).
Published: 2007

25. SYND: a Fast Code-Based Stream Cipher with a Security Reduction

Author: Nicolas Sendrier, Cédric Lauradoux, and Philippe Gaborit
Subjects: Reduction (complexity), Generator (computer programming), Computer science, business.industry, Code (cryptography), Cryptography, Pseudorandom generator, Parallel computing, business, Stream cipher, Linear code, Algorithm, Decoding methods
Abstract: In this note we reconsider the code-based pseudorandom generator proposed by Fischer and Stern. This generator is proven as secure as the syndrome decoding problem but has two main drawbacks: it is slow (3000 bits/s) and a large size of memory is needed (88 kiloBytes). We propose a variation on the scheme which avoid them: the use of regular words speeds the system up and the use of quasi-cyclic codes allows a decrease of the memory requirements. We eventually obtain a generator as fast as AES in counter mode using only about 8000 bits of memory. We also give a more precise security reduction.
Published: 2007
Full Text: View/download PDF

26. Performances of Cryptographic Accumulators

Author: Amrit Kumar, Pascal Lafourcade, Cédric Lauradoux, PrograMming and scheduling design fOr Applications in Interactive Simulation (MOAIS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Distributed and Complex Systems, VERIMAG (VERIMAG - IMAG), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF), Privacy Models, Architectures and Tools for the Information Society (PRIVATICS), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria), Persyval Labex grant, ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Kumar, Amrit, and Laboratoires d'excellence - Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique - - PERSYVAL-lab2011 - ANR-11-LABX-0025 - LABX - VALID
Subjects: 021110 strategic, defence & security studies, Cryptographic primitive, Computer science, business.industry, Distributed computing, 0211 other engineering and technologies, Value (computer science), [SCCO.COMP]Cognitive science/Computer science, Cryptography, 02 engineering and technology, Bloom filter, Space (commercial competition), Data structure, Set (abstract data type), [SCCO.COMP] Cognitive science/Computer science, Cryptographic accumulators, 0202 electrical engineering, electronic engineering, information engineering, Performance Analysis, 020201 artificial intelligence & image processing, Hydraulic accumulator, business
Abstract: International audience; Cryptographic accumulators are space/time efficient data structures used to verify if a value belongs to a set. They have found many applications in networking and distributed systems since their in- troduction by Benaloh and de Mare in 1993. Despite this popularity, there is currently no performance evaluation of the different existing de- signs. Symmetric and asymmetric accumulators are used likewise without any particular argument to support either of the design. We aim to es- tablish the speed of each design and their application's domains in terms of their size and the size of the values.

27. Hardware Implementation of the GPS authentication

Author: Cédric Lauradoux, Tanguy Risset, Mickaël Dardaillon, Software and Cognitive radio for telecommunications (SOCRATE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria), and Région Rhône Alpes ADR 11 01302401
Subjects: FOS: Computer and information sciences, Computer Science - Cryptography and Security, business.industry, Computer science, GPS, parallel/serial implementation, 02 engineering and technology, Gas meter prover, Cryptographic protocol, multiplication by a constant, 020202 computer hardware & architecture, NESSIE, Protocol stack, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Embedded system, Authentication protocol, 0202 electrical engineering, electronic engineering, information engineering, Global Positioning System, 020201 artificial intelligence & image processing, Multiplier (economics), business, Field-programmable gate array, Cryptography and Security (cs.CR), Computer hardware
Abstract: In this paper, we explore new area/throughput trade- offs for the Girault, Poupard and Stern authentication protocol (GPS). This authentication protocol was selected in the NESSIE competition and is even part of the standard ISO/IEC 9798. The originality of our work comes from the fact that we exploit a fixed key to increase the throughput. It leads us to implement GPS using the Chapman constant multiplier. This parallel implementation is 40 times faster but 10 times bigger than the reference serial one. We propose to serialize this multiplier to reduce its area at the cost of lower throughput. Our hybrid Chapman's multiplier is 8 times faster but only twice bigger than the reference. Results presented here allow designers to adapt the performance of GPS authentication to their hardware resources. The complete GPS prover side is also integrated in the network stack of the PowWow sensor which contains an Actel IGLOO AGL250 FPGA as a proof of concept., ReConFig - International Conference on ReConFigurable Computing and FPGAs (2012)

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources

Refine your results

27 results on '"Cédric Lauradoux"'

1. Exploitation and Sanitization of Hidden Data in PDF Files: Do Security Agencies Sanitize Their PDF Files?

2. The Pitfalls of Hashing for Privacy

3. Security of Distance-Bounding: A Survey

4. Duck Attack on Accountable Distributed Systems

5. Ephemeral: Lightweight Pseudonyms for 6LowPAN Mac Addresses

6. Energy efficient authentication strategies for network coding

7. Preserving Privacy in secured ZigBee Wireless Sensor Networks

8. Interleaving Cryptanalytic Time-memory Trade-offs on Non-Uniform Distributions

9. A Survey of Alerting Websites: Risks and Solutions

10. A Privacy Analysis of Google and Yandex Safe Browsing

11. CryptoPage : Support matériel pour cryptoprocessus

12. Private Password Auditing

13. The entropy of wireless statistics

14. Analysing the privacy policies of Wi-Fi trackers

15. Distributed Key Certification Using Accumulators for Wireless Sensor Networks

16. Towards stronger jamming model: Application to TH-UWB radio

17. Overflow of Fountain Codes in Multi-hop Wireless Sensor Networks

18. Flooding attacks against network coding and countermeasures

19. Authentication planning for XOR network coding

20. How Secret-sharing can Defeat Terrorist Fraud

21. Distance Bounding Protocols on TH-UWB Radios

22. Energy Friendly Integrity for Network Coding in Wireless Sensor Networks

23. When Compromised Readers Meet RFID

24. X-FCSR - a new software oriented stream cipher based upon FCSRs

25. SYND: a Fast Code-Based Stream Cipher with a Security Reduction

26. Performances of Cryptographic Accumulators

27. Hardware Implementation of the GPS authentication

Catalog

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

27 results on '"Cédric Lauradoux"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources