Gotowa bibliografia na temat „Infrastructures à clés publiques – Certification”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Infrastructures à clés publiques – Certification”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Infrastructures à clés publiques – Certification"
Demmouche, Ousama, i Joumana Boustany. "Bibliothèques publiques en Algérie : soixante ans de construction et de développement". I2D - Information, données & documents 2, nr 2 (30.11.2023): 84–100. http://dx.doi.org/10.3917/i2d.232.0084.
Pełny tekst źródłaDe Sant’Ana Júnior, Horácio Antunes. "COMPLEXO PORTUÁRIO, RESERVA EXTRATIVISTA E DESENVOLVIMENTO NO MARANHÃO". Caderno CRH 29, nr 77 (18.04.2017): 281–94. http://dx.doi.org/10.9771/ccrh.v29i77.20003.
Pełny tekst źródłaSampaio Carneiro, Marcelo Domingos. "ENTRE O ESTADO, A SOCIEDADE E O MERCADO: análise dos dispositivos de governança da indústria florestal na Amazônia". Caderno CRH 25, nr 64 (29.10.2012). http://dx.doi.org/10.9771/ccrh.v25i64.19332.
Pełny tekst źródłaGarcia, Ana, i Karina Kato. "Políticas públicas e interesses privados: uma análise a partir do Corredor de Nacala em Moçambique". Caderno CRH 29, nr 76 (21.07.2016). http://dx.doi.org/10.9771/ccrh.v29i76.20074.
Pełny tekst źródłaRozprawy doktorskie na temat "Infrastructures à clés publiques – Certification"
Wazan, Ahmad Samer. "Gestion de la confiance dans les infrastructures à clés publiques". Toulouse 3, 2011. http://thesesups.ups-tlse.fr/1450/.
Pełny tekst źródłaToday, the Internet has become a universal community, where the openness to diverse application areas, has been accompanied by a natural change in the profile of users. However, in this environment, the maturity of the services and applications is suffering from a problem of trust. The establishment of trust in the Internet requires the intervention of several elements. We refer to these elements by the term: trust chain. In all chains of trust, public key infrastructure (PKI) is a central element. It serves to establish a link between a public key and a physical entity whose certificate signed by a central entity called a certification authority (CA). Thus, PKIs provide means for the management and the distribution of keys and certificates. All elements of the trust chain create a trust management problem. We have dedicated our work, however, to PKIs, and more precisely in trust management of CAs. We have performed the following steps: • We have proposed a formal definition of trust in CAs. • We have defined an architecture that operates a validation service deployed by an entity independent of CAs, and recognized by a community of interest. • We have defined a calculation model that enables us to obtain a score between 0 and 1 representing the quality of a certificate (QoCER). Finally, we have implemented a prototype that demonstrates our ideas. In particular, we have presented how end users can interact with the validation service to make informed decisions about certificates
Lesueur, François. "Autorité de certification distribuée pour des réseaux Pair-à-Pair structurés : modèle, mise en œuvre et exemples d'applications". Rennes 1, 2009. https://tel.archives-ouvertes.fr/tel-00443852.
Pełny tekst źródłaPeer-to-peer networks allow to design low cost and high availability large systems. Contrary to clients in client-server systems, peers of a peer-to-peer network play an active role in the network and give some bandwidth, computation power and storage to the network : the presence of attackers or misbehaving peers can break the proposed service. Guaranteeing security properties in peer-to-peer networks yields new problems since, contrary to current systems where, most of the times, a central authority allows or not asked operations, no peer should have a critical role for the whole network. The main contribution of this thesis is a distributed certification authority which allows the distributed signature of certificates. Contrary to currently used centralized certification authorities, even in peer-to-peer networks, the authority we propose is fully distributed in the peer-to-peer network and the peers themselves take the decisions, through the cooperation of a fixed percentage of them. We present in this thesis the cryptographic mechanisms used as well as two applications of this authority, in order to limit the sybil attack and to securely name users
Ben, Mbarka Moez. "Signatures électroniques avancées : modélisation de la validation à long terme et sécurité des autorités de certification". Thesis, Bordeaux 1, 2011. http://www.theses.fr/2011BOR14247/document.
Pełny tekst źródłaNowadays digital signature schemes and infrastructures have time limitations. This situation is disturbing considering that there are many cases, such as government records, where the signatures are required to be kept valid for a long period of time. In this thesis, we address this issue by modeling signature validation in the scope of a dispute between a verifier and a signer. The model is accompanied with a formal calculus to formalize several important concepts in the scope of long-term validation, such as judgment proof, proof expiration and renewal. Certificate revocation is one of the main issues considered by the model. Revocation is particularly critical for a Certification Authority (CA). We investigate this issue in the scope of the revocation settings allowed in X.509 and we show that some settings permit efficient countermeasures to prevent the revocation of the CA. For the same objective, we investigate approaches allowing to combine hardware protection with fine-tuned control on the usage of the CA's key. We propose a general solution which allows the execution of the of CA's certification policies at a processor which runs in an insecure environment under the control of the CA's secure module
Adja, Elloh. "Définition et conception d'un système optimal de la révocation de certificats". Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT012.
Pełny tekst źródłaThe Public Key Infrastructure (PKI) is a public key infrastructure whose objective is to meet needs such as public key authentication, access control and authorization functions. The support for these services determines the attributes contained in, as well as auxiliary control information such as policy and certification path constraints. The validation of the certificate goes through the verification of these attributes. A certificate is supposed to be used throughout its validity period. However, various circumstances may interrupt this validity. These circumstances include a name change, an association change, etc. Under such circumstances, the CA must revoke the certificate. Certificate revocation validation and verification services are expected or necessary in several contexts, we can cite some among many others: vehicular communications, (WWW), user authentication, etc. Vehicle communications are at the center of the vehicles of tomorrow and, more generally, of smart cities. Securing these communications is a critical element given the services in perspective. The security of inter-vehicle exchanges is based on the digital signature. This signature requires a key exchange infrastructure (PKI).RFC 5280 defines different revocation methods. Among these, we have a revocation method, which requires the periodic publication by the CA of a signed data structure called CRL (Certificate revocation list). This approach, which is the most widely used, is mature but expensive in terms of time and volume, and vehicular communications bring new constraints. This work relates to the verification of the revocation of X509 certificates and pseudonym certificates used in vehicular communications. Our goal is to reduce latency due to revocation checking of X509 and pseudonyms certificates. In this context, we have proposed a method of revocation, which implies the publication of the revocation lists in a public Blockchain. We then proposed a revocation method able to face the new constraints introduced by the vehicular environment. Our contributions have been validated by an implementation
Guette, Gilles. "Gestion de clés dans les extensions de sécurité DNS". Rennes 1, 2005. http://www.theses.fr/2005REN1S108.
Pełny tekst źródłaMasereel, Jean-Michel. "Analyse de la sécurité de protocoles cryptographiques de chiffrement et de signature à base de polynômes multivariables". Versailles-St Quentin en Yvelines, 2010. http://www.theses.fr/2010VERS0056.
Pełny tekst źródłaThe multivariate cryptography began in the early 1980s. It aimed to propose a new kind of protocols that are both reliable and efficient. In the mid-1990s however, it has grown and prospered with the emergence of algebraic cryptanalysis. This thesis focuses on the cryptanalysis of different multivariate protocols from various cryptographic fields. Initially, we are interested in obfuscation. Starting from an algebraic analysis of the obfuscation of DES (Data Encryption Standard), we mount an attack that can recover the secret key in a few seconds. In a second step, we study the links that may exist between a search of collisions on a multivariate system and solving a multivariate system. This work aims to provide avenues to prove the NP-completeness or non NP-Completeness of a search of collisions on a multivariate system. In a third step, we study the multivariate traitor tracing. We analyze how a traitor alone or with an accomplice, may succeed in forging an equivalent key while hiding his identity. Finally, we focus on stream ciphers and more particularly to Trivium. We use the coding theory and Walsh transforms to propose an improvement of an existing attack
Siad, Amar. "Protocoles de génération des clés pour le chiffrement basé sur de l'identité". Paris 8, 2012. http://www.theses.fr/2012PA083660.
Pełny tekst źródłaIdentity-Based Encryption suffers from the problem of trust in the key generation authority PKG (Private Key Generator), which results in the ability of this authority to produce and distribute, without the knowledge a genuine user, multiple private-keys or multiple copies of a single key. This problem makes the deployment of these systems limited to areas where trust in the PKG must have a fairly high level. An important and natural question is to ask how can we reduce the trust one should have in the PKG. In this thesis, after conducting a development of the state of the art on the subject, we answer this question by studying this problem in its theoretical and practical aspects. On the theoretical stage, we present constructions of distributed cryptographic protocols that reduce the trust to its lowest level never reached before. We develop protocols for private-key generation in different security models while presenting real-world applications using these new protocols in the setting of searchable encryption. Furthermore, we develop necessary infrastructures needed for the deployment of our protocols. In practical terms, we implement KGLib: the first complete, efficient and modular library which brings together the most known techniques for private-key generation for identity-based cryptosystems. This library aims at providing robust tools designed in a modular and reusable way to allow easy implementation and rapid prototyping of the latest results coming from theoretical cryptography
Duclos, Mathilde. "Méthodes pour la vérification des protocoles cryptographiques dans le modèle calculatoire". Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM002/document.
Pełny tekst źródłaCritical and private information are exchanged on public environment. To protect it from dishonest users, we use cryptographic tools. Unfortunately, bad conception, poorly written security properties and required security hypothesis lead to attacks, and it may take years before one discover the attack and fix the security schemes involved. In this context, provable security provides formal definitions for security objectives and implied mathematical proofs that these objectives are fullfilled. On another hand, complexity and variety of cryptographic systems are increasing, and proofs by hand are too complicated to write and to verify (Bellare& Rogaway 2004, Shoup 2004, Halevi 2005). Thus, we need computer-assisted verification methods for cryptographic systems. The aim of this thesis is to progress in this direction. More precisely we want significant progress over formal proofs on cryptographic protocols. To verify cryptographic protocols we need to develop a theoritical framework providing: - a precise modelisation for cryptographic protocols and security properties we want to prove in the computationnal model, - designing tactics to automate proofs, - taking into account realistic models for adversary (side-channels...). By the end of the thesis we have enhanced a theoretical framework and computing tools helping verifying cryptographic protocols
Kunz-Jacques, Sébastien. "Preuves de sécurité et problèmes difficiles en cryptologie : études de cas". Paris 7, 2007. http://www.theses.fr/2007PA077068.
Pełny tekst źródłaProvable security enables to formalize what is expected from a cryptographic primitive, and to prove that some mechanisms actually meet these expectations. Security proofs neverthe-less rely on the hypothesis that some reference algorithmic problems are hard to solve. These hardness hypotheses are primarily justified by the lack of efficient algorithms to solve the corre-sponding problems. In the first part of this thesis, we study some authenticated key exchange protocols. After a close look to the security model involved, we prove the security of two classical protocols, MTI/CO and MQV, which was up to now only studied empirically. Then, we show how to extend the adversarial model to include active compromises. Neither MQV, nor HMQV, which is a proved variant of MQV, withstand these attacks. We propose a new protocol that solves this problem with a round and computational complexity similar to the one of MQV. In the second part of this thesis, we turn our attention to solving Systems of multivariate equations on a finite field. Several public key cryptosystems rely on the difficulty of this problem, for different families of Systems of equations. On the one hand, we cryptanalyze such a cryptosystem, TRMC. On the other hand, we improve a generic resolution algorithm, XL. The performance of the resulting algorithm is on par with the best currently known methods
Delaunay, Pascal. "Attaques physiques sur des algorithmes de chiffrement par flot". Versailles-St Quentin en Yvelines, 2011. http://www.theses.fr/2011VERS0006.
Pełny tekst źródłaSince 1999 and Paul Kocher's initial publication, several side-channel attacks have been published. Most of these attacks target public-key cryptosystems and bloc ciphers but only a few of them target stream ciphers, despite being widely used on daily applications. After some remids on side-channel attacks, linear and non-linear feedback shift registers and fast correlation attacks, we propose at first three fast correlation attacks targetting linear feedback shift registers and using side-channel information to improve their accuracy. Next, we present two flaws in non-linear feedback shift registers which allow full recovery of the internal state using well-chosen side-channel attacks. We finally use these vulnerabilities to mount two side-channel attacks against VEST, an eSTREAM candidate, to recover partial information from the internal state
Raporty organizacyjne na temat "Infrastructures à clés publiques – Certification"
Dudoit, Alain. Les espaces européens communs de données : une initiative structurante nécessaire et adaptable au Canada. CIRANO, październik 2023. http://dx.doi.org/10.54932/ryht5065.
Pełny tekst źródła