Message Passing Interface (MPI) is a widely used standard for managing coarse-grained concurrency on distributed computers. Debugging parallel MPI applications, however, has always been particularly challenging task due to their high degree of concurrent execution and non-deterministic behavior. Deterministic replay potentially powerful technique addressing these challenges, with existing tools adopting either data-replay or order-replay approaches. Unfortunately, each approach its...

Prefix hijacking, a misbehavior in which misconfigured or malicious BGP router originates an IP prefix that the does not own, is becoming increasingly serious security problem on Internet. In this paper, we conduct first comprehensive study incrementally deployable mitigation solutions against hijacking. We propose novel reactive detection-assisted solution based idea of bogus route purging and valid promotion. Our simulations realistic settings show routes at 20 highest-degree ASes reduces...

Message Passing Interface (MPI) is a widely used standard for managing coarse-grained concurrency on distributed computers. Debugging parallel MPI applications, however, has always been particularly challenging task due to their high degree of concurrent execution and non-deterministic behavior. Deterministic replay potentially powerful technique addressing these challenges, with existing tools adopting either data-replay or order-replay approaches. Unfortunately, each approach its...

Wireless sensor networks are usually applied in hostile areas where nodes can easily be monitored and captured by an adversary. Designing a key distribution scheme with high security reliability, low hardware requirements, moderate communication load is crucial for wireless networks. To address the above objectives, we propose new based on ECC asymmetric encryption algorithm. The two-way authentication mechanism proposed not only prevents illegal from accessing network, but also fake base...

Mimic defense technology is put forward to solve the problem, often passive while attack active in cyber security, based on hardware and software diversity, which has been a question of heat research technology. First, core characteristics mimic including redundancy, dynamic heterogeneous redundancy model so are analyzed. Then, system described analysis formally helps security system. Moreover, state three redundant also analyzed by Markov model. Finally, relation between ability defend...

A replay tool aiming to reproduce a program's execution interposes itself at an appropriate interface between the program and environment. During recording, it logs all non-deterministic side effects passing through from environment feeds them back during replay. The is critical for correctness recording overhead of tools.

Cloud computing is a fast-growing technology which supplies scalable, innovative, and efficient business models. However, cloud not fully trusted, the security of data outsourced in storage needs to be guaranteed. One hottest issues how ensure integrity storage. Until now, many researchers have proposed lots provable possession (PDP) schemes deal with problem audition. Nevertheless, very little effort has been devoted preserve uploader’s privacy while auditing shared group. To overcome...

While many parallel applications exhibit good spatial locality, other important codes in areas like graph problem-solving or CAD do not. Often, these irregular contain small records accessed via pointers. Consequently, while the former benefit from long cache lines, latter prefer short lines. One solution is to combine lines with prefetching. In this way, each application can exploit amount of locality that it has. However, prefetching, if provided, should also work for codes. This paper...

Physical Unclonable Functions (PUFs) can be seen as kind of hardware oneway functions, who are easily fabricated but difficult to clone, duplicate or predict. Therefore, PUFs with unclonable and unpredictable properties welcome applied in designing lightweight cryptography protocols. In this paper, a Basic Key Distribution Scheme (Basic-KDS) based on is firstly proposed. Then, by employing different deployment modes, Random Deployment (RD-KDS) Grouping (GD-KDS) further proposed the Basic-KDS...

Because of the movements sensor nodes and unknown mobility pattern, how to ensure two communicating (static or mobile) authenticate share a pairwise key is important. In this paper, we propose mutual-authenticated distribution scheme based on physical unclonable functions (PUFs) for dynamic networks. Compared with traditional predistribution schemes, proposal reduces storage overhead exposure risks thereby improves resilience against node capture attacks. Mutual authentication provided by...

In this work, we present Xwin-LM, a comprehensive suite of alignment methodologies for large language models (LLMs). This encompasses several key techniques, including supervised finetuning (SFT), reward modeling (RM), rejection sampling (RS), and direct preference optimization (DPO). The components are as follows: (1) Xwin-LM-SFT, initially finetuned with high-quality instruction data; (2) Xwin-Pair, large-scale, multi-turn dataset meticulously annotated using GPT-4; (3) Xwin-RM, trained on...

Cloud storage service makes people easily to maintain and manage amounts of data with lower cost. In order ensure the cloud server honestly keeps client's data, some remote integrity checking (RDIC) schemes have been presented. However, in many original is not protected at all so that public verifier able obtain through checking. To address this issue, we propose an efficient RDIC scheme privacy-preserving. our scheme, utilize masking technique randomize before generating final proof which...

Private Set Intersection (PSI) is a fundamental building block in data analytics, which has extensive practical applications including Genome matching, Botnet detection, Social networking, etc. The continuous increase large scale datasets makes traditional PSI protocols no longer scalable and efficient enough practice. Thus, it becomes promising problem to design an private set intersection protocol over largescale privacy-preserving manner. Unfortunately, some existing solutions two-party...

While hardware-coherent scalable shared-memory multiprocessors are relatively easy to program, they still require substantial programming effort deliver high performance. Specifically, minimize remote accesses, data must be carefully laid out in memory for locality and application working sets tuned caches. It has been claimed that this is less necessary hardware COMA machines like Flat-COMA thanks automatic line-based migration. Unfortunately, complex design. Consequently, we would a...

To ensure the integrity and reliability of data on cloud servers, many public verification schemes have been presented to allow auditors remotely audit without fetching back. Recently, Zhao et al. (2021) proposed a dynamic audition scheme for computing based array multi-branch tree (MBT). In their scheme, each leaf node x stores hash value H(x) which relates all values blocks in its block array. Because is always used generate proof when any linked challenged, attacker can deceive auditor by...

In big data analytics, Jaccard similarity is a widely used block for scalable computation. It broadly applied in the Internet of Things (IoT) applications, such as credit system, social networking, epidemic tracking, and so on. However, with increasing privacy concerns user’s sensitive IoT, it intensively desirable necessary to investigate privacy‐preserving computing over two users’ datasets. To boost efficiency enhance security, we propose methods measure private sets users under...

First the previous formalization description of rule in packet classification is improved, and rules are formalized a new method, which can describe more rules. Then conversion methods researched, algorithms range match compared, their time space complexity analyzed. We present algorithm based on set NOT for matching rule. At last we test results show that amount created by far less than methodpsilas.

Region-based memory management is a popular scheme in systems software for better organization and performance. In the scheme, developer constructs hierarchy of regions different lifetimes allocates objects regions. When deletes region, runtime will recursively delete all its subregions simultaneously reclaim The must construct consistent placement regions; otherwise, if region that contains pointers to other not always deleted before pointees, an inconsistency surface cause dangling...