National Institute of Standards and Technology における超伝導研究及び生活

In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.

PORs: Proofs of Retrievability for Large Files

A low-rate distributed denial of service (DDoS) attack has significant ability of concealing its traffic because it is very much like normal traffic. It has the capacity to elude the current anomaly-based detection schemes. An information metric can quantify the differences of network traffic with various probability distributions. In this paper, we innovatively propose using two new information metrics such as the generalized entropy metric and the information distance metric to detect low-rate DDoS attacks by measuring the difference between legitimate traffic and attack traffic. The proposed generalized entropy metric can detect attacks several hops earlier (three hops earlier while the order α = 10 ) than the traditional Shannon metric. The proposed information distance metric outperforms (six hops earlier while the order α = 10) the popular Kullback-Leibler divergence approach as it can clearly enlarge the adjudication distance and then obtain the optimal detection sensitivity. The experimental results show that the proposed information metrics can effectively detect low-rate DDoS attacks and clearly reduce the false positive rate. Furthermore, the proposed IP traceback algorithm can find all attacks as well as attackers from their own local area networks (LANs) and discard attack traffic.

Low-Rate DDoS Attacks Detection and Traceback by Using New Information Metrics

The rapid developments of the Internet of Things (IoT) and smart mobile devices in recent years have been dramatically incentivizing the advancement of edge computing. On the one hand, edge computing has provided a great assistance for lightweight devices to accomplish complicated tasks in an efficient way; on the other hand, its hasty development leads to the neglection of security threats to a large extent in edge computing platforms and their enabled applications. In this paper, we provide a comprehensive survey on the most influential and basic attacks as well as the corresponding defense mechanisms that have edge computing specific characteristics and can be practically applied to real-world edge computing systems. More specifically, we focus on the following four types of attacks that account for 82% of the edge computing attacks recently reported by Statista: distributed denial of service attacks, side-channel attacks, malware injection attacks, and authentication and authorization attacks. We also analyze the root causes of these attacks, present the status quo and grand challenges in edge computing security, and propose future research directions.

https://ieeexplore.ieee.org/ielaam/5/8789751/8741060-aam.pdf

Edge Computing Security: State of the Art and Challenges

Thank you very much for downloading service oriented architecture concepts technology and design. Maybe you have knowledge that, people have look hundreds times for their favorite books like this service oriented architecture concepts technology and design, but end up in malicious downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they cope with some harmful virus inside their laptop.

Service Oriented Architecture Concepts Technology And Design

The batch verification methods can relieve the bottleneck problem of vehicular authentication efficiency to accelerate the authentication speed during the group construction phase. However, in current batch verification methods, there exist some deficiencies such as the authentication methods applied in the actual scenario are sensitive to the group initialization and dynamic construction process and the intra-group communication efficiency have not been improved due to lack of effective dynamic group management. This paper proposes a fast and secure batch verification scheme based on dynamic group management and certificateless public-key cryptography. First, the two-way authentication between the proxy vehicle and the roadside unit (RSU) is established, and then the batch verification method relying on RSU-assisted are proposed based on dynamic management of the intra-group vehicles. Our method fully considers the security requirements of the group while solving certification efficiency. Theoretical analysis and simulation experiments show that compared with other existing solutions, the verification scheme in this paper reduces the computational delay and transmission overhead whilst increasing robustness in dynamic environments.

An Efficient Dynamic Group-Based Batch Verification Scheme for Vehicular Sensor Networks

Vehicular ad hoc networks (VANETs) are characterized by a dynamic topology resulting in short-term and often unreliable connectivity between vehicles. VANETs network communication can be established through dedicated short-range communication (DSRC) following the IEEE 802.11p standard. The network demonstration with intelligent transportation enables various applications such as reducing road fatalities, improving transportation efficiency, prior emergency aid facility, road event notifications to hospitals, traffic restriction, ambulance alert, nearby pharmacies, crowd-sourced traffic information, road incidents, public work, firefighters, and outback roads. This chapter provides valuable introduction to the effectiveness of emergency message dissemination in VANETs within the healthcare system. With advancements in technologies, this chapter considers the multi-domain perspective of VANETs for emergency message dissemination with current facilities and future trends. 

A Multi‐Domain Perspective of Future Directions for VANETs for Emergency Message Dissemination

With the natural characteristics of Opportunistic networks (OppNets) where delivery is delayed with frequent disconnections between mobile nodes in dynamically changing routes to destinations, malicious nodes can perform selective packet dropping attacks easily without been identified easily. This is why securing the data flow without any loss becomes challenging in OppNets. In this paper, we present a solid trust based node and path detection technique against selective packet dropping attacks. Using the trust attribute with the Merkle hashing technique, a node’s identity can be validated, and malicious nodes can be detected. We integrate our proposed technique with Epidemic routing and use simulation to show how effective the technique works against selective packet dropping attacks. We use simulation to show how the node detection accuracy increases with time, as intermediate nodes have more time to establish trust with destination nodes. We also use simulation to show that delivery rates increase with increased storage, and show how our trust model improves and secures routing compared to non-trust models.

Trust strategy implementation in OppNets

Digitally enabled service becomes very pervasive nowadays In this type of service, a functionality of a business service is supported and enriched by software services arranged in a service-oriented system Various methodologies were proposed to design and develop such service, but mostly focus only on either business side or software side Integrating these two approaches a Service Engineering Framework was proposed This paper is a report on case studies performed based on the framework After the description and examination of the case studies, a refinement of the framework is proposed The conclusion provides six modeling aspects in service engineering: Business, capability, value, service, interaction, process and software

Activities and artifacts in service engineering: Case study report of service engineering framework

The term VANETs (Vehicular AdHoc Networks) has gained so much attention from a decade. It is considered to be a crucial move for achieving safety in the field of ITS (Intelligent Transportation Systems). There are many challenges faced in this field of VANETs and data congestion is one of the foremost challenges among all. In this article, initially, detection of the data congestion is done and later few methods have been proposed to control as well as manage this detected data congestion. This paper is divided into two main units named as Congestion Detection Unit, in which two main parameters are elaborated that are being utilized for the detection of data congestion as well as Congestion Control Unit, in which three methods have been proposed to control as well as manage the data congestion. We conclude this article with wondrous additional opinions for choosing of new parameters for the detection of congestion as well as new methods or approaches that can be proposed to handle and control the data congestion in the future.

Robin Doss

Papers

An Efficient Dynamic Group-Based Batch Verification Scheme for Vehicular Sensor Networks

A Multi‐Domain Perspective of Future Directions for VANETs for Emergency Message Dissemination

Trust strategy implementation in OppNets

Activities and artifacts in service engineering: Case study report of service engineering framework

Detection and Control of Data Congestion in Vehicular Broadcast Networks