Certificate Update Research Articles

ACSM Committee on Certification and Registry Boards Update on Recertification and Continuing Education Credit Provider Policy

ACSM Committee on Certification and Registry Boards Update on Recertification and Continuing Education Credit Provider Policy

HMD Board Certification Review Course and Update

HMD Board Certification Review Course and Update

A Data Reporting Protocol With Revocable Anonymous Authentication for Edge-Assisted Intelligent Transport Systems

Intelligent Transport Systems (ITS) have received growing attention recently driven by technical advances in Industrial Internet of Vehicles (IIoV). In IIoV, vehicles report traffic data to management infrastructures so as to achieve better ITS services. To ensure both security and privacy, many anonymous authentication-enabled data reporting protocols have been proposed. However, these protocols usually require a large number of preloaded pseudonyms or involve a costly and irrevocable group signature. Thus, they are not ready for realistic deployment due to large storage overhead, expensive computation costs, or absence of malicious users' revocation. To address these issues, we present a novel data reporting protocol for edge-assisted ITS in this paper, where the traffic data is sent to the distributed edge nodes for local processing. In particular, we propose a new anonymous authentication scheme fine-tuned to fulfill the needs of vehicular data reporting, which allows the authenticated vehicles to report unlimited unlinkable messages to edge nodes without huge pseudonyms download and storage costs. Moreover, we designed an efficient certificate update scheme based on a bivariate polynomial function. In this way, the malicious vehicles can be revoked with time complexity O(1). The security analysis demonstrates that our protocol satisfies source authentication, anonymity, unlinkability, traceability, revocability, non-frameability, and non-repudiation. Further, extensive simulation results show that the efficiency and performance of our protocol are greatly improved since the signature size is reduced by at least 8%, the computation costs in message signing and verification are reduced by at least 56% and 67%, respectively, and the packet loss rate is reduced by at least 14%.

IMF-PR: An Improved Morton-Filter-Based Pseudonym-Revocation Scheme in VANETs.

Vehicle ad hoc networks (VANETs) are special wireless networks which help vehicles to obtain continuous and stable communication. Pseudonym revocation, as a vital security mechanism, is able to protect legal vehicles in VANETs. However, existing pseudonym-revocation schemes suffer from the issues of low certificate revocation list (CRL) generation and update efficiency, along with high CRL storage and transmission costs. In order to solve the above issues, this paper proposes an improved Morton-filter-based pseudonym-revocation scheme for VANETs (IMF-PR). IMF-PR establishes a new distributed CRL management mechanism to maintain a low CRL distribution transmission delay. In addition, IMF-PR improves the Morton filter to optimize the CRL management mechanism so as to improve CRL generation and update efficiency and reduce the CRL storage overhead. Moreover, CRLs in IMF-PR store illegal vehicle information based on an improved Morton filter data structure to improve the compress ratio and the query efficiency. Performance analysis and simulation experiments showed that IMF-PR can effectively reduce storage by increasing the compression gain and reducing transmission delay. In addition, IMF-PR can also greatly improve the lookup and update throughput on CRLs.

LightCert4IoTs: Blockchain-Based Lightweight Certificates Authentication for IoT Applications

These in recent days, the proliferation of the internet of things (IoT) within the emergence of five-generation (5G) networks has received a huge attention in both industrial and academic domains. A 5G network is a cornerstone of realizing the full potential of the IoT, which interconnects billions of devices wirelessly. However, wireless communication in IoT devices reveals tremendous security risks in different dimensions and precisely in the distribution of the user certificates. The existing X.509 PKI, or the proposed decentralized PKI based on blockchain solutions have lacked practicality, and continue to have security flaws, or have not yet gained widespread acceptance owing to complexity and deployment issues. We present a lightweight certificate in size (LightCert4IoTs) that is not issued by Certification Authorities (CAs) due to the cost and complexity of the assignment of a signed certificate. In LightCert4IoTs first, an end-user (i.e., mobile and IoT devices) issues a self-signed certificate and lets Local Registration Authorities (LRAs)/EDGE nodes to verify and validate the binding identity-self signed certificate of the users through the Ethereum blockchain where The Ethereum network is used as the global notary for the IoT light certificates by saving them in the blockchain immutable ledger. The LightCert4IoTs leverages the advantages of blockchain technology and smart contracts to address the existing challenges of PKI certificates in IoT devices, which neatly achieve certificate issuance, update, and revocation more securely and efficiently. Finally, the LightCert4IoTs experimental results show that LightCert, as compared to relevant solutions/baselines, achieves reasonable overheads and is suitable for use in low- constrained IoT devices where the memory and processor power are optimized.

EASBF: An efficient authentication scheme over blockchain for fog computing-enabled internet of vehicles

The concept of the Internet of Vehicles (IoV) has attracted the attention of many sectors such as the automotive industry, academia, engineering, etc., offering a wide variety of benefits, such as reduced congestion, safer driving, and less pollution. However, since the deployment of IoT based devices is in an open field, the IoV environments can be a vital issue in the absence of security protections. In this paper, we propose an efficient authentication scheme over blockchain, named EASBF, for secure fog computing-enabled internet of vehicles. Specifically, the proposed EASBF scheme consists of five phases: initialization, registration, mutual authentication, and exchanging keys, consensus, and certificate update. Based on the elliptic curve cryptography, one-way hash function, and blockchain technology, the EASBF scheme can achieve confidentiality, integrity, authenticity, privacy, anonymity, non-repudiation, and perfect forward secrecy. The EASBF scheme is robust against cyber attacks, including, DDoS attack, replay attack, man-in-the-middle attacks, identity theft attack, traffic analysis attack, masquerading attack, and session key disclosure attack. Both the AVISPA tool and the random oracle model are used in security analysis. Finally, we demonstrate the effectiveness of the EASBF scheme in terms of two performance metrics, namely, computation overhead, communication overhead, and storage overhead.

Non-interactive certificate update protocol for efficient authentication in IoT

A non-interactive certificate update protocol (NICU) allows a certification authority (CA) to update the public key of node certificates without interacting with nodes and with the new certificate, a node can update its private signing key accordingly. In this paper, we provide constructions of efficient NICU protocols and instantiate them based on pseudo random functions, encryption schemes and the homomorphism of the signature key pairs. We thoroughly evaluate the NICU protocols and exhibit their outstanding efficiency in terms of speed of certificate update and bandwidth consumption. In addition, we provide a formal security model of NICU, which can be of independent interest, and prove that our protocols are secure.

PBCert: Privacy-Preserving Blockchain-Based Certificate Status Validation Toward Mass Storage Management

In the recent years, the vulnerabilities of conventional public key infrastructure are exposed by the real-world attacks, such as the certificate authority’s single-point-of-failure or clients’ private information leakage. Aimed at the first issue, one type of approach is that multiple entities are introduced to assist the certificate operations, including registration, update, and revocation. However, it is inefficient in computation. Another type is to make the certificate information publicly visible by bringing in the log servers. Nevertheless, the data synchronization among log servers may lead to network latency. Based on the second approach, the blockchain-based public key infrastructure schemes are proposed. Through these type of schemes, all the certificate operations are stored in the blockchain for public audit. However, the issue of revoked certificates’ status storage is worth paying attention, especially in the setting with massive certificates. In addition, the target web server that a client wants to access is exposed in the process of certificate status validation. In this paper, we propose a privacy-preserving blockchain-based certificate status validation scheme called PBCert to solve these two issues. First, we separate the revoked certificates control and storage plane. Only the minimal control information (namely, certificate hashes and related operation block height) is stored in the blockchain and it uses external data stores for the detailed information about all revoked certificates. Second, we design an obscure response to the clients’ certificate status query for the purpose of privacy preserving. Through the security analysis and experiment evaluation, our scheme is significant in practice.

Design, Analysis, and Implementation of ARPKI: An Attack-Resilient Public-Key Infrastructure

The current Transport Layer Security (TLS) Public-Key Infrastructure (PKI) is based on a weakest-link security model that depends on over a thousand trust roots. The recent history of malicious and compromised Certification Authorities has fueled the desire for alternatives. Creating a new, secure infrastructure is, however, a surprisingly challenging task due to the large number of parties involved and the many ways that they can interact. A principled approach to its design is therefore mandatory, as humans cannot feasibly consider all the cases that can occur due to the multitude of interleavings of actions by legitimate parties and attackers, such as private key compromises (e.g., domain, Certification Authority, log server, other trusted entities), key revocations, key updates, etc. We present ARPKI, a PKI architecture that ensures that certificate-related operations, such as certificate issuance, update, revocation, and validation, are transparent and accountable. ARPKI efficiently supports these operations, and gracefully handles catastrophic events such as domain key loss or compromise. Moreover ARPKI is the first PKI architecture that is co-designed with a formal model, and we verify its core security property using the TAMARIN prover. We prove that ARPKI offers extremely strong security guarantees, where compromising even n - 1 trusted signing and verifying entities is insufficient to launch a man-in-the-middle attack. Moreover, ARPKI's use deters misbehavior as all operations are publicly visible. Finally, we present a proof-of-concept implementation that provides all the features required for deployment. Our experiments indicate that ARPKI efficiently handles the certification process with low overhead. It does not incur additional latency to TLS, since no additional round trips are required.

Certification update

Crops & SoilsVolume 50, Issue 6 p. 38-39 Certification Certification update Luther Smith, Luther Smith Director of Professional Development and Business Relations lsmith@sciencesocieties.org 608-268-4977 Search for more papers by this author Luther Smith, Luther Smith Director of Professional Development and Business Relations lsmith@sciencesocieties.org 608-268-4977 Search for more papers by this author First published: 30 November 2017 https://doi.org/10.2134/cs2017.50.0611Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinkedInRedditWechat No abstract is available for this article. Volume50, Issue6November‐December 2017Pages 38-39 RelatedInformation

Certification Update: Certification Specialties for CPSS, CCA

CSA NewsVolume 61, Issue 12 p. 34-34 Certification Certification Update: Certification Specialties for CPSS, CCA Luther Smith, Luther Smith Director of Professional Development and Business Relations lsmith@sciencesocieties.org 608-268-4977 Search for more papers by this author Luther Smith, Luther Smith Director of Professional Development and Business Relations lsmith@sciencesocieties.org 608-268-4977 Search for more papers by this author First published: 16 December 2016 https://doi.org/10.2134/csa2016-61-12-17Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinkedInRedditWechat No abstract is available for this article. Volume61, Issue12December 2016Pages 34-34 RelatedInformation

Certification update: certification specialties for CCA, CPSS

Certification update: certification specialties for CCA, CPSS

A secure mutual authentication scheme with non‐repudiation for vehicular ad hoc networks

SummaryVehicular ad hoc networks (VANETs) have been a research focus in recent years. VANETs are not only used to enhance the road safety and reduce the traffic accidents earlier but also conducted more researches in network value‐added service. As a result, the security requirements of vehicle communication are given more attention. In order to prevent the security threat of VANETs, the security requirements, such as the message integrity, availability, and confidentiality are needed to be guaranteed further. Therefore, a secured and efficient verification scheme for VANETs is proposed to satisfy these requirements and reduce the computational cost by combining the asymmetric and symmetric cryptology, certificate, digital signature, and session key update mechanism. In addition, our proposed scheme can resist malicious attacks or prevent illegal users' access via security and performance analysis. In summary, the proposed scheme is proved to achieve the requirements of resist known attacks, non‐repudiation, authentication, availability, integrity, and confidentiality. Copyright © 2015 John Wiley & Sons, Ltd.

Allocation of Roadside Units for Certificate Update in Vehicular Ad Hoc Network Environments

The roadside unit (RSU) plays an important role in VANET environments for privacy preservation. In order to conserve the privacy of a vehicle, the issued certificate must be updated frequently via RSUs. If a certificate expires without being updated, the services for the vehicle will be terminated. Therefore, deploying as more as possible RSUs ensures that the certificate can be updated before it expires. However, the cost for allocating an RSU is very high. In this paper, we consider the roadside unit allocating problem such that the certificates can be updated before it expired. Previous researches focus on the roadside unit placement problem in a small city in which for any origination-destination pair the certificate is limited to update at most once. The RSU placement problem in which more than once certificate updates are required is discussed in this paper. The RSU allocation problem is formulated and the decision problem of the RSUs allocation problem is proved as an NP-complete problem. We proposed three roadside unit placement algorithms which works well for a large city. In order to reduce the number of required RSUs for certificate update, we also proposed three backward removing methods to remove the intersections found by the RSU allocation methods. Simulation results show that the proposed algorithms yields lower number of required RSUs than the simple method named the most driving routes first method. One backward removing method named the least driving routes first backward removing method was shown to be able to further reduce the number of required RSUs.

Nursing Informatics Certification Update

CIN: Computers, Informatics, Nursing: May 2009 - Volume 27 - Issue 3 - p 194-195 doi: 10.1097/01.NCN.0000336481.58361.f2

Inquest and death certification update

Inquest and death certification update

Maintenance of Certification Update

We recently introduced improvements to the American Board of Family Medicine’s Maintenance of Certification Program for Family Physicians (MC-FP). The most important new enhancement is the opportunity for Diplomates to extend their certification period from 7 to 10 years by regularly completing MC

DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks

Securing ad hoc networks is notoriously challenging, notably due to the lack of an online infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case where an ad hoc network is under the responsibility of a mother certification authority (mCA). Since the nodes can frequently be collectively isolated from the mCA (e.g., for a remote mission) but still need the access to a certification authority, the mCA preassigns a special role to several nodes (called servers) that constitute a distributed certification authority (dCA) during the isolated period. We propose a solution, called DICTATE (DIstributed CerTification Authority with probabilisTic frEshness), to manage the dCA. This solution ensures that the dCA always processes a certificate update (or query) request in a finite amount of time and that an adversary cannot forge a certificate. Moreover, it guarantees that the dCA responds to a query request with the most recent version of the queried certificate in a certain probability; this probability can be made arbitrarily close to 1, but at the expense of higher overhead. Our contribution is twofold: 1) a set of certificate management protocols that allow trading protocol overhead for certificate freshness or the other way around, and 2) a combination of threshold and identity-based cryptosystems to guarantee the security, availability, and scalability of the certification function. We describe DICTATE in detail and, by security analysis and simulations, we show that it is robust against various attacks.

Secure and efficient key management in mobile ad hoc networks

In mobile ad hoc networks, due to unreliable wireless media, host mobility and lack of infrastructure, providing secure communications is a big challenge. Usually, cryptographic techniques are used for secure communications in wired and wireless networks. Symmetric and asymmetric cryptography have their advantages and disadvantages. In fact, any cryptographic means is ineffective if its key management is weak. Key management is also a central aspect for security in mobile ad hoc networks. In mobile ad hoc networks, the computational load and complexity for key management are strongly subject to restriction by the node's available resources and the dynamic nature of network topology. We propose a secure and efficient key management (SEKM) framework for mobile ad hoc networks. SEKM builds a public key infrastructure (PKI) by applying a secret sharing scheme and using an underlying multi-cast server groups. We give detailed information on the formation and maintenance of the server groups. In SEKM, each server group creates a view of the certificate authority (CA) and provides certificate update service for all nodes, including the servers themselves. A ticket scheme is introduced for efficient certificate service. In addition, an efficient server group updating scheme is proposed. The performance of SEKM is evaluated through simulation.

TU‐E‐P‐618‐01: Maintenance of Certification Update, MOC Educational Opportunities and CARE Update

The official beginning of the ABR Maintenance of Certification program for medical physicists began this year. Many have registered and many more have questions. The purpose of this session is to present a brief review of the ABR MOC program, its current status and to delve into some of the details related to successfully fulfilling the MOC process. The physics trustees of the ABR will first present a review of the MOC program as it is currently being implemented for medical physicists. The driving forces behind MOC as well as the four essential components of the program, Professional Standing, Lifelong Learning/Self Assessment, Cognitive Expertise, Assessment of Practice Performance, will be reviewed. Examples will be provided in each case to help medical physicists understand the details of the process. The web‐based process will be outlined. Specific issues related to individuals who have less than ten years until their certificate expires and to those certified by ABMP will be addressed. The MOC presentation will be followed by presentations from the chair of the ACR Commission on Medical Physics and the Chairman of the American College of Medical Physics, both who will address opportunities and developing programs aimed at providing the essential continuing education credits necessary for each of us to maintain certification. The final portion of this session will be dedicated to an update on the CARE bill. The Alliance for Quality Medical Imaging and Radiation Therapy (of which both the AAPM and ACMP are members) met again in March 2005 to further develop, in anticipation of passage of the Care Bill, statutes designed to specify the training and experience of all medical professions performing or planning medical imaging and radiation therapy. The Bill, as written, is designed to include both Medical Physicists and Medical Dosimetrists in the proposed regulation. The CARE bill was recently reintroduced in the US congress. An opportunity to ask questions of the speakers will be provided at the end of the session.Educational Objectives:1. To review the current ABR maintenance of certification program2. To understand the process for all time limited certificate holders3. To understand mechanisms offered by ACR and ACMP to obtain MOC credits4. To review the current status and implications of the CARE Bill