Updatable Tokenization: Formal Definitions and Provably Secure Constructions

2017 ◽  
pp. 59-75
Author(s):  
Christian Cachin ◽  
Jan Camenisch ◽  
Eduarda Freire-Stögbuchner ◽  
Anja Lehmann
Keyword(s):  
Formal Definitions ◽  
Provably Secure

The Development of Preliminary HiTOP Internalizing Spectrum Scales

Assessment ◽  
2021 ◽  
pp. 107319112110039
Author(s):  
David Watson ◽  
Miriam K. Forbes ◽  
Holly F. Levin-Aspenson ◽  
Camilo J. Ruggero ◽  
Yuliya Kotelnikova ◽  
...  
Keyword(s):  
Internalizing Symptoms ◽  
Self Report ◽  
General Factor ◽  
Item Pool ◽  
Factor Analyses ◽  
Item Level ◽  
Formal Definitions ◽  
Body Dysmorphia ◽  
Item Writing ◽  
Report Measure

As part of a broader project to create a comprehensive self-report measure for the Hierarchical Taxonomy of Psychopathology consortium, we developed preliminary scales to assess internalizing symptoms. The item pool was created in four steps: (a) clarifying the range of content to be assessed, (b) identifying target constructs to guide item writing, (c) developing formal definitions for each construct, and (d) writing multiple items for each construct. This yielded 430 items assessing 57 target constructs. Responses from a heterogeneous scale development sample ( N = 1,870) were subjected to item-level factor analyses based on polychoric correlations. This resulted in 39 scales representing a total of 213 items. The psychometric properties of these scales replicated well across the development sample and an independent validation sample ( N = 496 adults). Internal consistency analyses established that most scales assess relatively narrow forms of psychopathology. Structural analyses demonstrated the presence of a strong general factor. Additional analyses of the 35 nonsexual dysfunction scales revealed a replicable four-factor structure with dimensions we labeled Distress, Fear, Body Dysmorphia, and Mania. A final set of analyses established that the internalizing scales varied widely—and consistently—in the strength of their associations with neuroticism and extraversion.

scholarly journals A secure and highly efficient first-order masking scheme for AES linear operations

Cybersecurity ◽  
2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Jingdian Ming ◽  
Yongbin Zhou ◽  
Huizhong Li ◽  
Qian Zhang
Keyword(s):  
Cost Reduction ◽  
Provable Security ◽  
State Of The Art ◽  
Side Channel ◽  
First Order ◽  
Highly Efficient ◽  
Non Linear ◽  
Device Independence ◽  
Practical Implications ◽  
Provably Secure

AbstractDue to its provable security and remarkable device-independence, masking has been widely accepted as a noteworthy algorithmic-level countermeasure against side-channel attacks. However, relatively high cost of masking severely limits its applicability. Considering the high tackling complexity of non-linear operations, most masked AES implementations focus on the security and cost reduction of masked S-boxes. In this paper, we focus on linear operations, which seems to be underestimated, on the contrary. Specifically, we discover some security flaws and redundant processes in popular first-order masked AES linear operations, and pinpoint the underlying root causes. Then we propose a provably secure and highly efficient masking scheme for AES linear operations. In order to show its practical implications, we replace the linear operations of state-of-the-art first-order AES masking schemes with our proposal, while keeping their original non-linear operations unchanged. We implement four newly combined masking schemes on an Intel Core i7-4790 CPU, and the results show they are roughly 20% faster than those original ones. Then we select one masked implementation named RSMv2 due to its popularity, and investigate its security and efficiency on an AVR ATMega163 processor and four different FPGA devices. The results show that no exploitable first-order side-channel leakages are detected. Moreover, compared with original masked AES implementations, our combined approach is nearly 25% faster on the AVR processor, and at least 70% more efficient on four FPGA devices.

Leakage-Free and Provably Secure Certificateless Signcryption Scheme Using Bilinear Pairings

2015 ◽  
Vol 58 (10) ◽  
pp. 2636-2648 ◽  
Author(s):  
SK Hafizul Islam ◽  
Fagen Li
Keyword(s):  
Bilinear Pairings ◽  
Signcryption Scheme ◽  
Provably Secure

COMPLEXITY MAPS REVEAL CLUSTERS IN NEURONAL ARBORIZATIONS

Fractals ◽  
1994 ◽  
Vol 02 (02) ◽  
pp. 297-301
Author(s):  
B. DUBUC ◽  
S. W. ZUCKER ◽  
M. P. STRYKER
Keyword(s):  
Computer Vision ◽  
Fractal Dimension ◽  
Tree Growth ◽  
Local Structure ◽  
Dendritic Tree ◽  
Local Information ◽  
Growth Patterns ◽  
Rate Of Growth ◽  
Local Complexity ◽  
Formal Definitions

A central issue in characterizing neuronal growth patterns is whether their arbors form clusters. Formal definitions of clusters have been elusive, although intuitively they appear to be related to the complexity of branching. Standard notions of complexity have been developed for point sets, but neurons are specialized "curve-like" objects. Thus we consider the problem of characterizing the local complexity of a "curve-like" measurable set. We propose an index of complexity suitable for defining clusters in such objects, together with an algorithm that produces a complexity map which gives, at each point on the set, precisely this index of complexity. Our index is closely related to the classical notions of fractal dimension, since it consists in determining the rate of growth of the area of a dilated set at a given scale, but it differs in two significant ways. First, the dilation is done normal to the local structure of the set, instead of being done isotropically. Second, the rate of growth of the area of this new set, which we named "normal complexity", is taken at a fixed (given) scale instead instead of around zero. The results will be key in choosing the appropriate representation when integrating local information in low level computer vision. As an application, they lead to the quantification of axonal and dendritic tree growth in neurons.

Sign in / Sign up

Export Citation Format

Share Document