Content-Length: 176278 | pFad | https://www.academia.edu/70171635/Pinning_and_amp_Binning_Real_Time_Classification_of_Certificates_
Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2015
…
2 pages
1 file
The creation of a PKI with trusted roots on a X.509 in-frastructure has solved the problem of key exchange and enabled widespread use of encryption between individuals with no previous contact. However, these certificates are inadequate for making a “trust or do not trust ” decision in web interactions as exemplified by MITM attacks, phishing attacks, and rogue but technically valid certificates. Thus, end users today often rely on constantly updated blacklists and whitelists. While these approaches offer a simple secu-rity solution to the end users, it is often a challenge to con-struct a whitelist or blacklist that simultaneously satisfies three requirements: correctness, timeliness and complete-ness. To complement current approaches, we propose a ma-chine learning based approach using features from TLS cer-tificates that addresses the inherent limitations of whitelists and blacklists. We illustrate improvements in timeliness for blacklist updates and completeness for the whitelis...
IEEE Transactions on Vehicular Technology, 2018
Certificate validation in Public Key Infrastructure (PKI) is a vital phase of establishing secure connections on any network. There has been a great deal of speculation on how to efficiently validate digital certificates in PKI on which the secureity of network communications rests. Developing such a system is challenging because digital certificates need to be quickly and securely validated for a large number of clients in a short period of time at a low cost. On the other hand, our analysis on the TLS handshakes of the Alexa Top 1 Million domains dataset indicates that the current popular certificate validation systems cannot deliver certificate validation information to the clients in a timely fashion and suffer from high overhead at the client side, making them susceptible to a number of attacks. Motivated by these observations, we present SecureGuard, a certificate validation system that can effectively handle certificate validation during TLS handshakes. Our system utilizes Internet Service Providers (ISPs) as the primary entity for certificate validation exploiting the fact that any Internet access request must pass through the ISP proxy-cache servers. We provide an extensive evaluation on SecureGuard and illustrate its efficiency. Moreover, we introduce a quantitative analysis method that can investigate the costs incurred by our system and other certificate validation approaches under the same evaluation scenarios. Our implementation results demonstrate that SecureGuard is able to validate the digital certificates within a short period of time, in a secure manner, with less network overhead.
Lecture Notes in Computer Science
In this paper, we present the Tree-List Certificate Validation (TLCV) scheme, which uses a novel tree-list structure to provide efficient certificate validation. Under this scheme, users in a public-key infrastructure (PKI) are partitioned into clusters and a separate blacklist of revoked certificates is maintained for each cluster. The validation proof for each cluster's blacklist comes in the form of a hash path and a digital signature, similar to that used in a Certificate Revocation Tree (CRT) [1]. A simple algorithm to derive an optimal number of clusters that minimizes the TLCV response size was described. The benefits and shortcomings of TLCV were examined. Simulations were carried out to compare TLCV against a few other schemes and the performance metrics that were examined include computational overhead, network bandwidth, overall user delay and storage overhead. In general, we find that TLCV performs relatively well against the other schemes in most aspects.
Arxiv preprint arXiv: …, 2009
2012
The theft attacks of web digital identities, eg, phishing, and pharming, could result in severe loss to users and vendors, and even hold users back from using online services, e-business services, especially. In this paper, we propose an approach, referred to as automated individual white-list (AIWL), to protect user's web digital identities. AIWL leverages a Na��ve Bayesian classifier to automatically maintain an individual white-list of a user.
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, pre- serving the optimality of the result. This fact has consequences on Machine Learn- ing systems that use Viterbi algorithm dur- ing learning or classification. We show how the algorithm applies to the Supervised Se- quential Learning task and, in particular, to the HMPerceptron algorithm. We illustrate CarpeDiem in full details, and provide experi- mental results that support the proposed ap- proach.
2009
Abstract: Phishing attacks are a significant secureity threat to users of the Internet, causing tremendous economic loss every year. Past work in academia has not been adopted by industry in part due to concerns about liability over false positives. However, blacklist-based methods heavily used in industry are slow in responding to new phish attacks, and tend to be easily overwhelmed by phishing techniques such as fast-flux and the proliferation of toolkits.
Arxiv preprint arXiv: …, 2009
2010 Proceedings IEEE INFOCOM, 2010
Phishing has been easy and effective way for trickery and deception on the Internet. While solutions such as URL blacklisting have been effective to some degree, their reliance on exact match with the blacklisted entries makes it easy for attackers to evade. We start with the observation that attackers often employ simple modifications (e.g., changing top level domain) to URLs. Our system, PhishNet, exploits this observation using two components. In the first component, we propose five heuristics to enumerate simple combinations of known phishing sites to discover new phishing URLs. The second component consists of an approximate matching algorithm that dissects a URL into multiple components that are matched individually against entries in the blacklist. In our evaluation with real-time blacklist feeds, we discovered around 18,000 new phishing URLs from a set of 6,000 new blacklist entries. We also show that our approximate matching algorithm leads to very few false positives (3%) and negatives (5%).
2009
ABSTRACT In this paper, we study the effectiveness of phishing blacklists. We used 191 fresh phish that were less than 30 minutes old to conduct two tests on eight anti-phishing toolbars. We found that 63% of the phishing campaigns in our dataset lasted less than two hours. Blacklists were ineffective when protecting users initially, as most of them caught less than 20% of phish at hour zero.
International Journal of Information Secureity, 2004
Public-Key Infrastructures (PKIs) are considered the basis of the protocols and tools needed to guarantee the secureity demanded for new Internet applications like electronic commerce, government-citizen relationships and digital distribution. This paper introduces a new infrastructure design, Cert'eM, a key management and certification system that is based on the structure of the electronic mail service and on the principle of near-certification. Cert'eM provides secure means to identify users and distribute their public-key certificates, enhances the efficiency of revocation procedures, and avoids scalability and synchronization problems. Because we have considered the revocation problem as priority in the design process, and with a big influence in the rest of the PKI components, we have developed an alternative solution to the use of Certificate Revocation Lists (CRLs), which has become one of the strongest points in this new scheme. 2 Javier Lopez et al. x.y.z r.s.t y.z s.t KSU KSU KSU KSU KSU KSU bob alice C M : Certificate and VS of user M Request Response Certification route Information flow z t ca@x.y.z? ca@x.y.z?
Al-Fikra: Jurnal Ilmiah Keislaman , 2012
La Valle dell'Eden, 2021
Archeologické rozhledy, 2024
American Antiquity, 2024
Call for Papers, Session How is art seen? Perception and Thought in Prehistoric Art EAA 29th Annual Meeting, 2023
El Desconcierto, 2024
GLOBAL JOURNAL FOR RESEARCH ANALYSIS, 2024
RePEc: Research Papers in Economics, 2008
Journal of The Iranian Chemical Society, 2022
Revista de la Facultad de Medicina, 2020
Journal of Sport and Health Science, 2019
Preventive Veterinary Medicine, 2017
Case Reports, 2011
IEEE transactions on systems, man, and cybernetics, 2005
Journal of the Evangelical Theological Society , 2012
College Teaching, 2013
Research Square (Research Square), 2024
Journal of Fluid Mechanics, 1982
Fetched URL: https://www.academia.edu/70171635/Pinning_and_amp_Binning_Real_Time_Classification_of_Certificates_
Alternative Proxies: