200,940 research outputs found
Use Secret-Hashing Technology to Resist Side-Channel Attacks Based on Round-Keys
No full textThe development of modern cryptography has not specifically prevented Side-Channel attacks at the outset. Today, the rapid growth in Side-Channel Attacks is a significant threat. This article proposes a Secret-Hashing method that improves the main drawback of the explicitly reversible AES key expansion function. Using an extra Secret-Hashing function based on round-keys of AES to generate new round-keys will break the reversibility between the original round-keys. Let the initial attack requires only the easiest one of the round-keys to be necessary for all round-keys to complete the cracking of AES’s encryption and decryption, increases the resistance of the AES algorithm to Side-Channel Attacks by 10 to 100 times. The method is compatible with the original AES algorithm and signal leakage countermeasures, and the AES encryption and decryption process do not increase any extra payload.</p
Using Rasch measurement to improve analytical marking keys
No full textThis article describes the use of Rasch measurement to improve criteria-based analytical marking keys. The instruments and data described result from a research project which investigated the use and assessment of digital portfolios in the Western Australian senior secondary design course. The study involved two phases and two separate data sets. A criteria-based analytical marking key was used to score the portfolios in Phase 1, and a refined and improved version was used in Phase 2. Refinement of the criteria-based analytical marking key was undertaken as a result of Rasch analysis, and this is described and illustrated. Results showed that Rasch measurement can inform the improvement of marking keys in terms of criteria, targeting, number of score points, utilisation of score points, and item discrimination
Keys to soil taxonomy /
No full textShipping list no.: 2004-0239-P."The ninth edition of the Keys to soil taxonomy incorporates all changes approved since the publication of the second edition of Soil taxonomy (1999)"--Foreword.Includes bibliographical references and index.Mode of access: Internet.1
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Probabilistics Keys
No full textProbabilistic databases address well the requirements of an increasing number of modern applications that produce large volumes of uncertain data from a variety of sources. We propose probabilistic keys as a principled tool helping organizations balance the consistency and completeness targets for their data quality. For this purpose, algorithms are established for an agile schema- and data-driven acquisition of the marginal probability by which keys should hold in a given application domain, and for reasoning about these keys. The efficiency of our acquisition framework is demonstrated theoretically and experimentally
Probabilistic Keys
No full textProbabilistic databases address well the requirements of an increasing number of modern applications that produce large volumes of uncertain data from a variety of sources. Probabilistic keys enforce the integrity of entities in order to facilitate data processing in probabilistic database systems. For this purpose, we establish algorithms for an agile schema-and data-driven elicitation of the marginal probability by which keys should hold in a given application domain, and for reasoning about these keys. The efficiency of our elicitation framework is demonstrated theoretically and experimentally.AM - Accepted Manuscrip
Biased RSA Private Keys: Origin Attribution of GCD-Factorable Keys
No full textIn 2016, Svenda et al. (USENIX 2016, The Million-key Question) reported that the implementation choices in cryptographic libraries allow for qualified guessing about the origin of public RSA keys. We extend the technique to two new scenarios when not only public but also private keys are available for the origin attribution - analysis of a source of GCD-factorable keys in IPv4-wide TLS scans and forensic investigation of an unknown source. We learn several representatives of the bias from the private keys to train a model on more than 150 million keys collected from 70 cryptographic libraries, hardware security modules and cryptographic smartcards. Our model not only doubles the number of distinguishable groups of libraries (compared to public keys from Svenda et al.) but also improves more than twice in accuracy w.r.t. random guessing when a single key is classified. For a forensic scenario where at least 10 keys from the same source are available, the correct origin library is correctly identified with average accuracy of 89% compared to 4% accuracy of a random guess. The technique was also used to identify libraries producing GCD-factorable TLS keys, showing that only three groups are the probable suspects
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
