Securing accessible systems using dynamic data mangling

TL;DR: In this paper, a non-transitory machine-readable storage medium encoded with instructions for a keyed cryptographic operation having a first and second portion for execution by a cryptographic system mapping an input message to an output message, including: instructions for outputting first cryptographic data from a first portion the cryptographic operation to a secure hardware device implementing a secure function on the data; instructions for receiving output data from the secure hardware devices; and instructions for performing a second portion of the cryptographic operations on the inverted output data, wherein the instructions for implementing an inverse of the secure functions on the output data

TL;DR: Wang et al. as discussed by the authors proposed a data link method based on privacy protection and secure multi-party computing, where local data is partitioned by adopting an improved k-means classification method, so that the comparison frequency among data records is reduced, the method has relatively good expandability for a large database, and the execution efficiency of privacy protection recordlinks is also improved.

TL;DR: In this article, a point-wise protection is generated based on a selection input for the vulnerability solution recommendation, where the point wise protection is capable of being implemented using a runtime agent.

TL;DR: In this paper, an upper triangular part storage device of a self-conjugate matrix and a parallel reading method is presented, and the device comprises a storage module selection circuit which is used for selecting the storage module corresponding to each element of the upper triangular parts of the self conjugate matrix to be accessed.

TL;DR: To achieve high throughput rates today's computers perform several operations simultaneously; not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently.

TL;DR: In this article, the authors present new algorithms that efficiently compute static single assignment forms and control dependence graphs for arbitrary control flow graphs using the concept of {\em dominance frontiers} and give analytical and experimental evidence that these data structures are usually linear in the size of the original program.

TL;DR: The 'Caesar' Cypher shows how old encryption is and how simple old ciphers now are for us to break.

TL;DR: In this paper, the authors describe obfuscation, tamper-resistance, and watermarking techniques for protecting a computer program from unauthorized analysis and modification. But they do not discuss how to detect tampering.