Description
Nowadays, connected objects play an important role in our daily lives, providing services related to our cities, cars, homes, and health. For this purpose, they often need to be accessible by external entities, such as a garage owner (for a connected car), a postman (for a connected home), or a doctor (for a connected health device). However, it is crucial for the owner of such objects to retain control over their devices. One possibility is for the owner to define and manage access policies for their resources. In this presentation, we consider and present the use case where all the resources from connected objects are centralized on a Central Server. An owner can grant a requester access to a specific connected object based on an access policy defined by the owner and managed by an Authorization Server. Based on this use case, we enhance the Identity-Based Encryption with Wildcards primitive for access control. Specifically, we replace the key generation algorithm in the primitive with an interactive protocol involving three entities (the user, Central Server, and Authorization Server), resulting in a new cryptographic primitive that protects the privacy of both the requester and the owner. To demonstrate that this extended security still leads to practical schemes, we present the results of an implementation of our new primitive using Relic and different elliptic curves.
Infos pratiques
Prochains exposés
-
Post-quantum day of the cryptography seminar
A scientific day devoted to post-quantum cryptography, held in the wake of the European Cyber Week, with talks more technical than those presented at the ECW. To register for lunch, please do so before oct 30th using this link. The event has been moved to the IRISA / Inria building, Room Aurigny (D165). You will need an ID card to enter the building. -
Chiffrement homomorphe à l'aide des groupes après Nuida
Orateur : Pierre Guillot - Ravel Technologies/Université de strasbourg
Nuida et d'autres ont montré comment on peut obtenir un protocole de chiffrement pleinement homomorphe si l'on sait chiffrer les éléments d'un groupe G convenable, tout en sachant faire l'opération de G "en homomorphe". Les exemples étaient jusqu'à présent limités au chiffrement d'un bit à la fois, avec beaucoup d'opérations à effectuer pour "simuler" les portes logiques usuelles. Je vais[…]-
Cryptography
-
-
Post-Quantum Signatures from Symmetric-Key-Friendly Techniques: From MPC-in-the-Head to VOLE-in-the-Head
Orateur : Dung Bui - Northwestern University
The MPC-in-the-Head (MPCitH) paradigm turns a secure multiparty computation protocol into a zero-knowledge proof and, via Fiat–Shamir, into a signature scheme whose security relies only on symmetric-key primitives. The framework of Katz, Kolesnikov and Wang (KKW, CCS18), which moves most of the MPC work into a committed preprocessing phase that the verifier checks by opening all-but-one of the[…] -
Distinguishing and Attacking McEliece Cryptosystems Using GRS Codes with Higher-Weight Mask
Orateur : Michael Schaller - University of Zürich, Applied Algebra group
Due to the insecurity of McEliece cryptosystems instantiated with Generalized Reed-Solomon (GRS) codes, there have been several proposals of McEliece type systems that replace the permutation matrix by a matrix $M$ with larger row and column weight. In many of them, the secret key is still a GRS code.There have been successful attacks on some of those schemes with row and column weight between $1$[…] -
Nouveaux doctorants
Exposés courts des nouveaux doctorants (Elouan, Quentin, Eliot)