cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Multivariate control charts for monitoring process mean vector of individual observations under regularized covariance estimation
Creators: name: Omolofe, Olusola T.
name: Adegoke, Nurudeen A.
name: Adeoti, Olatunde A.
name: Fasoranbaku, Olusoga A.
name: Abbasi, Saddam Akber
Publisher: name: Taylor & Francis
Year: 2021
Subjects: subject: Space Science
subject: Genetics
subject: FOS: Biological sciences
subject: Biotechnology
subject: 59999 Environmental Sciences not elsewhere classified
subject: FOS: Earth and related environmental sciences
subject: 69999 Biological Sciences not elsewhere classified
subject: 80699 Information Systems not elsewhere classified
subject: FOS: Computer and information sciences
subject: 19999 Mathematical Sciences not elsewhere classified
subject: FOS: Mathematics

description: Multivariate control charts are generally used in industries for monitoring and diagnosing processes characterized by several process variables. The applications of charts assume that the in-control process parameters are known and the charts’ limits are obtained from the known parameters. The parameters are typically unknown in practice, and the charts’ limits are usually based on estimated parameters from some historical in-control datasets in the Phase I study. The performance of the charts for monitoring future observation depends on efficient estimates of the process parameters from the historical in-control process. When only a few historical observations are available, the performance of the charts based on the empirical estimates of the process mean vector and covariance matrix have been shown to deviate from the desired performance of the charts based on the true parameters. We investigate the performance of the multivariate Shewhart control charts based on several shrinkage estimates of the covariance matrix when only a few in-control observations are available to estimate the parameters. Simulation results show that the control charts based on the shrinkage estimators outperform the charts based on existing classical estimators. An example involving high-dimensional monitoring is provided to illustrate the performance of the proposed Shrinkage-based Shewhart chart.
Mark Tredinnick. The Little Green Grammar Book. Sydney: UNSW, 2008 [Book review]
Creators: name: Berry, Geoff
Publisher: name: Monash University
Year: 2017
Subjects: subject: 200302 English Language
subject: FOS: Languages and literature

description: Mark Tredinnick's The Little Green Grammar Book is a consciously nonformal guide to finding the most effective way to write. Tredinnick eschews any kind of encyclopaedic approach to favour instead an outline of the grammatical laws of the English language that begins with the whole rather than the parts. Thus begins the first major section of the book, "A Natural History of the Sentence": the inner life of its word order, how it makes meaning as more than the sum of its parts, family relationships between phrases and clauses, basic structures.
High-speed Instruction-set Coprocessor for Lattice-based Key Encapsulation Mechanism: Saber in Hardware
Creators: name: Sinha Roy, Sujoy
name: Basso, Andrea
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: In this paper, we present an instruction set coprocessor architecture for lattice-based cryptography and implement the module lattice-based post-quantum key encapsulation mechanism (KEM) Saber as a case study. To achieve fast computation time, the architecture is fully implemented in hardware, including CCA transformations. Since polynomial multiplication plays a performance-critical role in the module and ideal lattice-based public-key cryptography, a parallel polynomial multiplier architecture is proposed that overcomes memory access bottlenecks and results in a highly parallel yet simple and easy-to-scale design. Such multipliers can compute a full multiplication in 256 cycles, but are designed to target any area/performance trade-offs. Besides optimizing polynomial multiplication, we make important design decisions and perform architectural optimizations to reduce the overall cycle counts as well as improve resource utilization. For the module dimension 3 (security comparable to AES-192), the coprocessor computes CCA key generation, encapsulation, and decapsulation in only 5,453, 6,618 and 8,034 cycles respectively, making it the fastest hardware implementation of Saber to our knowledge. On a Xilinx UltraScale+ XCZU9EG-2FFVB1156 FPGA, the entire instruction set coprocessor architecture runs at 250 MHz clock frequency and consumes 23,686 LUTs, 9,805 FFs, and 2 BRAM tiles (including 5,113 LUTs and 3,068 FFs for the Keccak core).
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Unrolled Cryptography on Silicon
Creators: name: Moos, Thorben
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: Cryptographic primitives with low-latency performance have gained momentum lately due to an increased demand for real-time applications. Block ciphers such as PRINCE enable data encryption (resp. decryption) within a single clock cycle at a moderately high operating frequency when implemented in a fully-unrolled fashion. Unsurprisingly, many typical environments for unrolled ciphers require protection against physical adversaries as well. Yet, recent works suggest that most common SCA countermeasures are hard to apply to low-latency circuits. Hardware masking, for example, requires register stages to offer resistance, thus adding delay and defeating the purpose of unrolling. On another note, it has been indicated that unrolled primitives without any additional means of protection offer an intrinsic resistance to SCA attacks due to their parallelism, asynchronicity and speed of execution. In this work, we take a closer look at the physical security properties provided by unrolled cryptographic IC implementations. We are able to confirm that the nature of unrolling indeed bears the potential to decrease the susceptibility of cipher implementations significantly when reset methods are applied. With respect to certain adversarial models, e.g., ciphertext-only access, an amazingly high level of protection can be achieved. While this seems to be a great result for cryptographic hardware engineers, there is an attack vector hidden in plain sight which still threatens the security of unrolled implementations remarkably – namely the static power consumption of CMOS-based circuits. We point out that essentially all reasons which make it hard to extract meaningful information from the dynamic behavior of unrolled primitives are not an issue when exploiting the static currents for key recovery. Our evaluation is based on real-silicon measurements of an unrolled PRINCE core in a custom 40nm ASIC. The presented results serve as a neat educational case study to demonstrate the broad differences between dynamic and static power information leakage in the light of technological advancement.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
MOESM6 of Plastid genome and composition analysis of two medical ferns: Dryopteris crassirhizoma Nakai and Osmunda japonica Thunb.
Creators: name: Xu, Liang
name: Xing, Yanping
name: Wang, Bing
name: Liu, Chunsheng
name: Wang, Wenquan
name: Kang, Tingguo
Publisher: name: figshare
Year: 2019
Subjects: subject: Medicine
subject: Genetics
subject: FOS: Biological sciences
subject: Pharmacology
subject: Evolutionary Biology
subject: Ecology
subject: Sociology
subject: FOS: Sociology
subject: Biological Sciences not elsewhere classified
subject: Plant Biology

description: Additional file 6: Table S5. Long repeat sequences in DryopterisÂ crassirhizoma Nakai plastid genome.
Remove Some Noise: On Pre-processing of Side-channel Measurements with Autoencoders
Creators: name: Wu, Lichao
name: Picek, Stjepan
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: In the profiled side-channel analysis, deep learning-based techniques proved to be very successful even when attacking targets protected with countermeasures. Still, there is no guarantee that deep learning attacks will always succeed. Various countermeasures make attacks significantly more complex, and such countermeasures can be further combined to make the attacks even more challenging. An intuitive solution to improve the performance of attacks would be to reduce the effect of countermeasures. This paper investigates whether we can consider certain types of hiding countermeasures as noise and then use a deep learning technique called the denoising autoencoder to remove that noise. We conduct a detailed analysis of six different types of noise and countermeasures separately or combined and show that denoising autoencoder improves the attack performance significantly.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Retrofitting Leakage Resilient Authenticated Encryption to Microcontrollers
Creators: name: Unterstein, Florian
name: Schink, Marc
name: Schamberger, Thomas
name: Tebelmann, Lars
name: Ilg, Manuel
name: Heyszl, Johann
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: The security of Internet of Things (IoT) devices relies on fundamental concepts such as cryptographically protected firmware updates. In this context attackers usually have physical access to a device and therefore side-channel attacks have to be considered. This makes the protection of required cryptographic keys and implementations challenging, especially for commercial off-the-shelf (COTS) microcontrollers that typically have no hardware countermeasures. In this work, we demonstrate how unprotected hardware AES engines of COTS microcontrollers can be efficiently protected against side-channel attacks by constructing a leakage resilient pseudo random function (LR-PRF). Using this side-channel protected building block, we implement a leakage resilient authenticated encryption with associated data (AEAD) scheme that enables secured firmware updates. We use concepts from leakage resilience to retrofit side-channel protection on unprotected hardware AES engines by means of software-only modifications. The LR-PRF construction leverages frequent key changes and low data complexity together with key dependent noise from parallel hardware to protect against side-channel attacks. Contrary to most other protection mechanisms such as time-based hiding, no additional true randomness is required. Our concept relies on parallel S-boxes in the AES hardware implementation, a feature that is fortunately present in many microcontrollers as a measure to increase performance. In a case study, we implement the protected AEAD scheme for two popular ARM Cortex-M microcontrollers with differing parallelism. We evaluate the protection capabilities in realistic IoT attack scenarios, where non-invasive EM probes or power consumption measurements are employed by the attacker. We show that the concept provides the side-channel hardening that is required for the long-term security of IoT devices.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Strength in Numbers: Improving Generalization with Ensembles in Machine Learning-based Profiled Side-channel Analysis
Creators: name: Perin, Guilherme
name: Chmielewski, Łukasz
name: Picek, Stjepan
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: The adoption of deep neural networks for profiled side-channel attacks provides powerful options for leakage detection and key retrieval of secure products. When training a neural network for side-channel analysis, it is expected that the trained model can implement an approximation function that can detect leaking side-channel samples and, at the same time, be insensible to noisy (or non-leaking) samples. This outlines a generalization situation where the model can identify the main representations learned from the training set in a separate test set. This paper discusses how output class probabilities represent a strong metric when conducting the side-channel analysis. Further, we observe that these output probabilities are sensitive to small changes, like selecting specific test traces or weight initialization for a neural network. Next, we discuss the hyperparameter tuning, where one commonly uses only a single out of dozens of trained models, where each of those models will result in different output probabilities. We show how ensembles of machine learning models based on averaged class probabilities can improve generalization. Our results emphasize that ensembles increase a profiled side-channel attack’s performance and reduce the variance of results stemming from different hyperparameters, regardless of the selected dataset or leakage model.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Fragments of Parmenides
Creators: name: Ajvazi, Irfan
Publisher: name: figshare
Year: 2022
Subjects: subject: Philosophy
subject: FOS: Philosophy, ethics and religion
subject: 220210 History of Philosophy
subject: 220208 History and Philosophy of the Social Sciences

description: Putting all of his faith in the power of abstract reason, Parmenides argues in his poem that genuine knowledge can only involve being, and that non-being is literally unspeakable and unthinkable. Using only the premise that "what is" is and what "is not" is not, he proceeds to deduce the nature of reality. The reality he arrives at bears no resemblance at all to the world we experience around us through our senses.

 When starting out on a rational inquiry, according to Parmenides, there are only two logically coherent possibilities: either you begin your inquiry with the premise that the subject of your inquiry exists or you begin with the premise that it does not exist.
DANA Universal Dataflow Analysis for Gate-Level Netlist Reverse Engineering
Creators: name: Albartus, Nils
name: Hoffmann, Max
name: Temme, Sebastian
name: Azriel, Leonid
name: Paar, Christof
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: Reverse engineering of integrated circuits, i.e., understanding the internals of Integrated Circuits (ICs), is required for many benign and malicious applications. Examples of the former are detection of patent infringements, hardware Trojans or Intellectual Property (IP)-theft, as well as interface recovery and defect analysis, while malicious applications include IP-theft and finding insertion points for hardware Trojans. However, regardless of the application, the reverse engineer initially starts with a large unstructured netlist, forming an incomprehensible sea of gates. This work presents DANA, a generic, technology-agnostic, and fully automated dataflow analysis methodology for flattened gate-level netlists. By analyzing the flow of data between individual Flip Flops (FFs), DANA recovers high-level registers. The key idea behind DANA is to combine independent metrics based on structural and control information with a powerful automated architecture. Notably, DANA works without any thresholds, scenario-dependent parameters, or other “magic” values that the user must choose. We evaluate DANA on nine modern hardware designs, ranging from cryptographic co-processors, over CPUs, to the OpenTitan, a stateof- the-art System-on-Chip (SoC), which is maintained by the lowRISC initiative with supporting industry partners like Google and Western Digital. Our results demonstrate almost perfect recovery of registers for all case studies, regardless whether they were synthesized as FPGA or ASIC netlists. Furthermore, we explore two applications for dataflow analysis: we show that the raw output of DANA often already allows to identify crucial components and high-level architecture features and also demonstrate its applicability for detecting simple hardware Trojans. Hence, DANA can be applied universally as the first step when investigating unknown netlists and provides major guidance for human analysts by structuring and condensing the otherwise incomprehensible sea of gates. Our implementation of DANA and all synthesized netlists are available as open source on GitHub.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Minerva: The curse of ECDSA nonces
Creators: name: Jancar, Jan
name: Sedlacek, Vladimir
name: Svenda, Petr
name: Sys, Marek
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: We present our discovery of a group of side-channel vulnerabilities in implementations of the ECDSA signature algorithm in a widely used Atmel AT90SC FIPS 140-2 certified smartcard chip and five cryptographic libraries (libgcrypt, wolfSSL, MatrixSSL, SunEC/OpenJDK/Oracle JDK, Crypto++). Vulnerable implementations leak the bit-length of the scalar used in scalar multiplication via timing. Using leaked bit-length, we mount a lattice attack on a 256-bit curve, after observing enough signing operations. We propose two new methods to recover the full private key requiring just 500 signatures for simulated leakage data, 1200 for real cryptographic library data, and 2100 for smartcard data. The number of signatures needed for a successful attack depends on the chosen method and its parameters as well as on the noise profile, influenced by the type of leakage and used computation platform. We use the set of vulnerabilities reported in this paper, together with the recently published TPM-FAIL vulnerability [MSE+20] as a basis for real-world benchmark datasets to systematically compare our newly proposed methods and all previously published applicable lattice-based key recovery methods. The resulting exhaustive comparison highlights the methods’ sensitivity to its proper parametrization and demonstrates that our methods are more efficient in most cases. For the TPM-FAIL dataset, we decreased the number of required signatures from approximately 40 000 to mere 900.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
RISQ-V: Tightly Coupled RISC-V Accelerators for Post-Quantum Cryptography
Creators: name: Fritzmann, Tim
name: Sigl, Georg
name: Sepúlveda, Johanna
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: Empowering electronic devices to support Post-Quantum Cryptography (PQC) is a challenging task. PQC introduces new mathematical elements and operations which are usually not easy to implement on standard processors. Especially for low cost and resource constraint devices, hardware acceleration is usually required. In addition, as the standardization process of PQC is still ongoing, a focus on maintaining flexibility is mandatory. To cope with such requirements, hardware/software co-design techniques have been recently used for developing complex and highly customized PQC solutions. However, while most of the previous works have developed loosely coupled PQC accelerators, the design of tightly coupled accelerators and Instruction Set Architecture (ISA) extensions for PQC have been barely explored. To this end, we present RISQ-V, an enhanced RISC-V architecture that integrates a set of powerful tightly coupled accelerators to speed up lattice-based PQC. RISQ-V efficiently reuses processor resources and reduces the amount of memory accesses. This significantly increases the performance while keeping the silicon area overhead low. We present three contributions. First, we propose a set of powerful hardware accelerators deeply integrated into the RISC-V pipeline. Second, we extended the RISC-V ISA with 29 new instructions to efficiently perform operations for lattice-based cryptography. Third, we implemented our RISQ-V in ASIC technology and on FPGA. We evaluated the performance of NewHope, Kyber, and Saber on RISQ-V. Compared to the pure software implementation on RISC-V, our co-design implementations show a speedup factor of up to 11.4 for NewHope, 9.6 for Kyber, and 2.7 for Saber. For the ASIC implementation, the energy consumption was reduced by factors of up to 9.5 for NewHope, 7.7 for Kyber, and 2.1 for Saber. The cell count of the CPU was increased by a factor of 1.6 compared to the original RISC-V design, which can be considered as a moderate increase for the achieved performance gain.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Modeling Soft Analytical Side-Channel Attacks from a Coding Theory Viewpoint
Creators: name: Guo, Qian
name: Grosso, Vincent
name: Standaert, François-Xavier
name: Bronchain, Olivier
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: One important open question in side-channel analysis is to find out whether all the leakage samples in an implementation can be exploited by an adversary, as suggested by masking security proofs. For attacks exploiting a divide-and-conquer strategy, the answer is negative: only the leakages corresponding to the first/last rounds of a block cipher can be exploited. Soft Analytical Side-Channel Attacks (SASCA) have been introduced as a powerful solution to mitigate this limitation. They represent the target implementation and its leakages as a code (similar to a Low Density Parity Check code) that is decoded thanks to belief propagation. Previous works have shown the low data complexities that SASCA can reach in practice. In this paper, we revisit these attacks by modeling them with a variation of the Random Probing Model used in masking security proofs, that we denote as the Local Random Probing Model (LRPM). Our study establishes interesting connections between this model and the erasure channel used in coding theory, leading to the following benefits. First, the LRPM allows bounding the security of concrete implementations against SASCA in a fast and intuitive manner. We use it in order to confirm that the leakage of any operation in a block cipher can be exploited, although the leakages of external operations dominate in known-plaintext/ciphertext attack scenarios. Second, we show that the LRPM is a tool of choice for the (nearly worst-case) analysis of masked implementations in the noisy leakage model, taking advantage of all the operations performed, and leading to new tradeoffs between their amount of randomness and physical noise level. Third, we show that it can considerably speed up the evaluation of other countermeasures such as shuffling.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Faster Montgomery and double-add ladders for short Weierstrass curves
Creators: name: Hamburg, Mike
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: The Montgomery ladder and Joye ladder are well-known algorithms for elliptic curve scalar multiplication with a regular structure. The Montgomery ladder is best known for its implementation on Montgomery curves, which requires 5M+4S+1m+8A per scalar bit, and 6 field registers. Here (M, S,m,A) represent respectively field Multiplications, Squarings, multiplications by a curve constant, and Additions or subtractions. This ladder is also complete, meaning that it works on all input points and all scalars. Many protocols do not use Montgomery curves, but instead use prime-order curves in short Weierstrass form. These have historically been much slower, with ladders costing at least 14 multiplications or squarings per bit: 8M + 6S + 27A for the Montgomery ladder and 8M+ 6S + 30A for the Joye ladder. In 2017, Kim et al. improved the Montgomery ladder to 8M+ 4S + 12A + 1H per bit using 9 registers, where the H represents a halving. Hamburg simplified Kim et al.’s formulas to 8M+ 4S + 8A + 1H per bit using 6 registers. Here we present improved formulas which compute the Montgomery ladder on short Weierstrass curves using 8M+ 3S + 7A per bit, and requiring 6 registers. We also give formulas for the Joye ladder that use 9M+3S+7A per bit, requiring 5 registers. One of our new formulas supports very efficient 4-way vectorization. We also discuss curve invariants, exceptional points, side-channel protection and how to set up and finish these ladder operations. Finally, we show a novel technique to make these ladders complete when the curve order is not divisible by 2 or 3, at a modest increase in cost. A sample implementation of these techniques is given in the supplementary material, also posted at https://github.com/bitwiseshiftleft/ladder_formulas
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Additional file 1 of Rural-urban differences in food insecurity and associated cognitive impairment among older adults: findings from a nationally representative survey
Creators: name: Srivastava, Shobhit
name: Muhammad, T.
Publisher: name: figshare
Year: 2022
Subjects: subject: Medicine
subject: Neuroscience
subject: 59999 Environmental Sciences not elsewhere classified
subject: FOS: Earth and related environmental sciences
subject: Sociology
subject: FOS: Sociology
subject: 69999 Biological Sciences not elsewhere classified
subject: FOS: Biological sciences
subject: Science Policy
subject: 111714 Mental Health
subject: FOS: Health sciences

description: Additional file 1.
Improving the Performance of the Picnic Signature Scheme
Creators: name: Kales, Daniel
name: Zaverucha, Greg
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: Picnic is a digital signature algorithm designed to provide security against attacks by quantum computers. The design uses only symmetric-key primitives, and is an efficient instantiation of the MPC-in-the-head paradigm. In this work, we explore the Picnic design in great detail. We investigate and benchmark different parameter choices and show that there exist better parameter choices than those in the current specification. We also present improvements to the MPC protocol that shorten signatures and reduce signing time. The proposed MPC changes tailor the protocol to the circuit of interest in Picnic, but may also be of independent interest. Taken together, these changes give a new instantiation of Picnic that signs messages 7.9 to 13.9 times faster, and verifies signatures 4.5 to 5.5 times faster than the existing “Picnic2” design, while having nearly the same signature sizes.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
MOESM7 of Plastid genome and composition analysis of two medical ferns: Dryopteris crassirhizoma Nakai and Osmunda japonica Thunb.
Creators: name: Xu, Liang
name: Xing, Yanping
name: Wang, Bing
name: Liu, Chunsheng
name: Wang, Wenquan
name: Kang, Tingguo
Publisher: name: figshare
Year: 2019
Subjects: subject: Medicine
subject: Genetics
subject: FOS: Biological sciences
subject: Biological Sciences not elsewhere classified
subject: Information Systems not elsewhere classified
subject: Inorganic Chemistry
subject: FOS: Chemical sciences
subject: Plant Biology
subject: Computational Biology

description: Additional file 7: Table S6. The Pi value of coding regions and no-coding regions of Dryopteris.
Second-Order Masked Lookup Table Compression Scheme
Creators: name: Valiveti, Annapurna
name: Vivek, Srinivas
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: Masking by lookup table randomisation is a well-known technique used to achieve side-channel attack resistance for software implementations, particularly, against DPA attacks. The randomised table technique for first- and second-order security requires about m•2n bits of RAM to store an (n,m)-bit masked S-box lookup table. Table compression helps in reducing the amount of memory required, and this is useful for highly resource-constrained IoT devices. Recently, Vadnala (CT-RSA 2017) proposed a randomised table compression scheme for first- and second-order security in the probing leakage model. This scheme reduces the RAM memory required by about a factor of 2l, where l is a compression parameter. Vivek (Indocrypt 2017) demonstrated an attack against the second-order scheme of Vadnala. Hence achieving table compression at second and higher orders is an open problem. In this work, we propose a second-order secure randomised table compression scheme which works for any (n,m)-bit S-box. Our proposal is a variant of Vadnala’s scheme that is not only secure but also significantly improves the time-memory trade-off. Specifically, we improve the online execution time by a factor of 2n−l. Our proposed scheme is proved 2-SNI secure in the probing leakage model. We have implemented our method for AES-128 on a 32-bit ARM Cortex processor. We are able to reduce the memory required to store a randomised S-box table for second-order AES-128 implementation to 59 bytes.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Rejection Sampling Schemes for Extracting Uniform Distribution from Biased PUFs
Creators: name: Ueno, Rei
name: Kazumori, Kohei
name: Homma, Naofumi
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: This paper presents an efficient fuzzy extractor (FE) construction for secure cryptographic key generation from physically unclonable functions (PUFs). The proposed FE, named acceptance-or-rejection (AR)-based FE, utilizes a new debiasing scheme to extract a uniform distribution from a biased PUF response. The proposed debiasing scheme employs the principle of rejection sampling, and can extract a longer debiased bit string compared to those of conventional debiasing schemes. In addition, the proposed AR-based FE is extended to ternary PUF responses (i.e., ternary encoding of a PUF response). These responses can be derived according to cell-wise reliability of the PUF and are promising for extraction of stable and high-entropy responses from common PUFs. The performance of the AR-based Fes is evaluated through an experimental simulation of PUF-based key generation and compared with conventional FEs. We confirm that the proposed AR-based FE can achieve the highest efficiency in terms of PUF and nonvolatile memory (NVM) sizes for various PUF conditions among the conventional counterparts. More precisely, the AR-based FE can realize a 128-bit key generation with up-to 55% smaller PUF size or up-to 72% smaller NVM size than other conventional FEs. In addition, the ternary AR-based FE is up to 55% more efficient than the binary version, and can also achieve up-to 63% higher efficiency than conventional counterparts. Furthermore, we show that the AR-based FE can be applied to PUFs with local biases (e.g., biases depending on cell location in SRAM PUFs), unlike all the conventional schemes, for which only global (or identical) biases are assumed.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Plaintext: A Missing Feature for Enhancing the Power of Deep Learning in Side-Channel Analysis?
Creators: name: Hoang, Anh-Tuan
name: Hanley, Neil
name: O’Neill, Maire
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: Deep learning (DL) has proven to be very effective for image recognition tasks, with a large body of research on various model architectures for object classification. Straight-forward application of DL to side-channel analysis (SCA) has already shown promising success, with experimentation on open-source variable key datasets showing that secret keys can be revealed with 100s traces even in the presence of countermeasures. This paper aims to further improve the application of DL for SCA, by enhancing the power of DL when targeting the secret key of cryptographic algorithms when protected with SCA countermeasures. We propose a new model, CNN-based model with Plaintext feature extension (CNNP) together with multiple convolutional filter kernel sizes and structures with deeper and narrower neural networks, which has empirically proven its effectiveness by outperforming reference profiling attack methods such as template attacks (TAs), convolutional neural networks (CNNs) and multilayer perceptron (MLP) models. Our model generates state-of-the art results when attacking the ASCAD variable-key database, which has a restricted number of training traces per key, recovering the key within 40 attack traces in comparison with order of 100s traces required by straightforward machine learning (ML) application. During the profiling stage an attacker needs no additional knowledge on the implementation, such as the masking scheme or random mask values, only the ability to record the power consumption or electromagnetic field traces, plaintext/ciphertext and the key. Additionally, no heuristic pre-processing is required in order to break the high-order masking countermeasures of the target implementation.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
Additional file 1: of Predicting protein residue-residue contacts using random forests and deep networks
Creators: name: Luttrell, Joseph
name: Liu, Tong
name: Zhang, Chaoyang
name: Wang, Zheng
Publisher: name: figshare
Year: 2019
Subjects: subject: Biochemistry
subject: Genetics
subject: FOS: Biological sciences
subject: Molecular Biology
subject: Biological Sciences not elsewhere classified
subject: Information Systems not elsewhere classified
subject: Infectious Diseases
subject: FOS: Health sciences

description: Supplementary Information. This document provides more details regarding the feature generation and feature selection process used in this study. It also discusses our model optimization process and explicitly describes each type of feature and how they are combined to create a single example (data point). (DOCX 171 kb)
On the spectral features of robust probing security
Creators: name: Molteni, Maria Chiara
name: Zaccaria, Vittorio
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: In this work we provide a spectral formalization of non-interference in the presence of glitches. Our goal is to present new theoretical and practical tools to reason about robust-d-probing security. We show that the current understanding of extended probes lends itself to probes that participate, during gadget composition, to the creation of additional extended probes. In turn, this enables a natural extension of non-interference definitions into robust ones to build a new reasoning framework that can formally explain some semi-formal results already appeared in the past and be used to synthesize new robust-d-SNI gadgets.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
title: Cognizing Chinese Historic Urban Space by Integrating Morphology and Narrativity. Taking the Mendong Area  in Nanjing as an Example
Creators: name: Liu, Yiran
name: Pezzetti, Laura Anna
name: Zhao, Chen
Publisher: name: Conference Proceedings XXIX International Seminar on Urban Form ISUF 2022 Urban Redevelopment and Revitalisation A Multidisciplinary Perspective/Lodz University of Technology Press
Year: 2023
Subjects: Historic Urban Space, Morphological Evolution, Narrativity, Nanjing.

description: Considering the rising theoretical trend in cultural heritage preservation has been turning towards also focusing on the intangible dimension, the discussion in the Chinese context could contribute to this issue in that ancient Chinese culture emphasises less tangibility, which results in the impermanence of physical object in architecture. Therefore, a crucial issue in the conservation of the historic city would be how to cognize historic urban space in the condition of physical absence. The Puyu Tang plot in the Mendong Area in Nanjing could be an example to illustrate this issue because the Jiangning Puyu Tang, as the absence in this plot, existed in the late Qing Dynasty then vanished and the buildings of Nanjing Yarn-dyed Fabric Mill in the 1980s was established in the plot as the industrial heritage instead. This paper tries to explore the morphological evolution of the Puyu Tang plot and unfolds the investigation of the cognition of the historical urban space by integrating morphology and narrativity.
A Hybrid-CPU-FPGA-based Solution to the Recovery of Sha256crypt-hashed Passwords
Creators: name: Zhang, Zhendong
name: Liu, Peng
Publisher: name: IACR Transactions on Cryptographic Hardware and Embedded Systems
Year: 2020

description: This paper presents an accelerator design for the password recovery of sha256crypt based on hybrid CPU-FPGA devices. By applying the brute-force attack computation model proposed in this paper, we decompose the sha256crypt function into two types of operations, namely the data dispatching and the block transforming. The data dispatching operation generates message blocks and the block transforming operation transforms message blocks into digests. These two operations are efficiently accelerated by the customized data dispatch unit and the pipelined block transform unit, respectively. Difficulties of adopting the pipeline technique are addressed also with the following techniques. The group scheduling is used to solve the data dependency that stalls the pipeline. The look-ahead execution eliminates the uncertainty of the execution path. The data path pruning and spatial-temporal multiplexing reduce the resource overhead of non-computing units. The proposed accelerator design is implemented and evaluated on the Xilinx Zynq-7000 XC7Z030-3 SoC. Our experimental results show that the proposed accelerator can improve energy efficiency by 2.54x over the state-of-the-art password recovery tool Hashcat running on an NVIDIA GTX1080Ti GPU. Compared with the pure FPGA-based implementation in John-the-Ripper, the proposed accelerator improves energy efficiency by 1.64x and improves resource efficiency by 1.69x.
description: IACR Transactions on Cryptographic Hardware and Embedded Systems, Volume 2020, Issue 4
MOESM8 of Plastid genome and composition analysis of two medical ferns: Dryopteris crassirhizoma Nakai and Osmunda japonica Thunb.
Creators: name: Xu, Liang
name: Xing, Yanping
name: Wang, Bing
name: Liu, Chunsheng
name: Wang, Wenquan
name: Kang, Tingguo
Publisher: name: figshare
Year: 2019
Subjects: subject: Medicine
subject: Genetics
subject: FOS: Biological sciences
subject: Biological Sciences not elsewhere classified
subject: Information Systems not elsewhere classified
subject: Inorganic Chemistry
subject: FOS: Chemical sciences
subject: Computational Biology

description: Additional file 8: Table S7. The Pi value of coding region and no-coding region of Osmunda.
Additional file 1 of ‘Living in a shrinking world’—The experience of loneliness among community-dwelling older people with reduced mobility: a qualitative grounded theory approach
Creators: name: Moeyersons, Marika
name: De Vliegher, Kristel
name: Huyghe, Brooke
name: De Groof, Sacha
name: Milisen, Koen
name: de Casterlé, Bernadette Dierckx
Publisher: name: figshare
Year: 2022
Subjects: subject: 59999 Environmental Sciences not elsewhere classified
subject: FOS: Earth and related environmental sciences
subject: Sociology
subject: FOS: Sociology
subject: 69999 Biological Sciences not elsewhere classified
subject: FOS: Biological sciences
subject: Science Policy
subject: 111714 Mental Health
subject: FOS: Health sciences

description: Additional file 1. Interview Guide.
title: Inefficient Cooperation under Stochastic and Strategic Uncertainty
Creators: name: Bruttel, Lisa
name: Güth, Werner
name: Nithammer, Juri
name: Orland, Andreas
Publisher: name: Universität Potsdam
Year: 2020

description: Stochastic uncertainty can cause difficult coordination problems that may hinder mutually beneficial cooperation. We propose a mechanism of ex-post voluntary transfers designed to circumvent these coordination problems and ask whether it can do so. To test this, we implement a controlled laboratory experiment based on a repeatedly played Ultimatum Game with a stochastic endowment. Contrary to our hypothesis, we find that allowing voluntary transfers does not entail an efficiency increase. We suggest and analyze two main reasons for this finding: First, the stochastic uncertainty forces proposers to accept high strategic uncertainty if they intend to cooperate by claiming a low amount (which many proposers do not). Second, many responders behave only incompletely conditionally cooperative by transferring too little (which hinders cooperation in future periods).
description: CEPA Discussion Papers, 20
Additional file 2 of The development and feasibility of a group-based household-level intervention to improve preconception nutrition in Nawalparasi district of Nepal
Creators: name: Diamond-Smith, Nadia
name: Mitchell, Ashley
name: Cornell, Alia
name: Dahal, Minakshi
name: Gopalakrishnan, Lakshmi
name: Johnson, Mallory
name: Weiser, Sheri
name: Puri, Mahesh
Publisher: name: figshare
Year: 2022
Subjects: Medicine
Biotechnology
Cancer
Science Policy

description: Additional file 2. Post-intervention interview with participants:semistructured qualitative interview guide.
title: Analyses of Recent Sediment Surface Dynamic of a Namibian Kalahari Salt Pan Based on Multitemporal Landsat and Hyperspectral Hyperion Data
Creators: name: Milewski, Robert
name: Chabrillat, Sabine
name: Behling, Robert
Publisher: name: Universität Potsdam
Year: 2020

description: This study combines spaceborne multitemporal and hyperspectral data to analyze the spatial distribution of surface evaporite minerals and changes in a semi-arid depositional environment associated with episodic flooding events, the Omongwa salt pan (Kalahari, Namibia). The dynamic of the surface crust is evaluated by a change-detection approach using the Iterative-reweighted Multivariate Alteration Detection (IR-MAD) based on the Landsat archive imagery from 1984 to 2015. The results show that the salt pan is a highly dynamic and heterogeneous landform. A change gradient is observed from very stable pan border to a highly dynamic central pan. On the basis of hyperspectral EO-1 Hyperion images, the current distribution of surface evaporite minerals is characterized using Spectral Mixture Analysis (SMA). Assessment of field and image endmembers revealed that the pan surface can be categorized into three major crust types based on diagnostic absorption features and mineralogical ground truth data. The mineralogical crust types are related to different zones of surface change as well as pan morphology that influences brine flow during the pan inundation and desiccation cycles. These combined information are used to spatially map depositional environments where the more dynamic halite crust concentrates in lower areas although stable gypsum and calcite/sepiolite crusts appear in higher elevated areas.
description: Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe, 987
Additional file 1: of Sofosbuvir-based regimen is safe and effective for hepatitis C infected patients with stage 4â 5 chronic kidney disease: a systematic review and meta-analysis
Creators: name: Li, Mingshu
name: Chen, Jun
name: Fang, Zhixiong
name: Li, Yi
name: Lin, Qian
Publisher: name: figshare
Year: 2019
Subjects: Space Science
Medicine
Biological Sciences not elsewhere classified
Mathematical Sciences not elsewhere classified
Marine Biology
Science Policy

description: Figure S1. Forest plots showing the results of subgroup analysis result of SVR12/24 in dialysis-dependent patients and patients not receiving dialysis. (PDF 6 kb)
Editorial and front matter: Colloquy, Issue 14, December 2007 - The Futures of Utopia, guest edited by Robert Savage
Creators: name: Colloquy
Publisher: name: Monash University
Year: 2017
Subjects: subject: 200599 Literary Studies not elsewhere classified
subject: FOS: Languages and literature

description: This special issue on utopianism, dystopianism and science fiction emerged from "Imagining the Future," a conference organised by the Centre for Comparative Literature and Cultural Studies, Monash University, with generous financial assistance from the Australian Research Council. Some of the contributions to that conference have already appeared in Imagining the Future: Utopia and Dystopia, edited by Andrew Milner, Matthew Ryan and Robert Savage (Melbourne: Arena Publications, 2006). This special issue combines other papers from the conference with fresh contributions addressing the same themes. The vibrancy and diversity of recent utopian thought is reflected in the papers themselves, which range across the fields of philosophy, literary criticism, film studies, and architectural theory.
Additional file 1 of The UK Coronavirus Job Retention Scheme and diet, physical activity, and sleep during the COVID-19 pandemic: evidence from eight longitudinal population surveys
Creators: name: Wielgoszewska, Bożena
name: Maddock, Jane
name: Green, Michael J.
name: Di Gessa, Giorgio
name: Parsons, Sam
name: Griffith, Gareth J.
name: Croft, Jazz
name: Stevenson, Anna J.
name: Booth, Charlotte
name: Silverwood, Richard J.
name: Bann, David
name: Patalay, Praveetha
name: Hughes, Alun D.
name: Chaturvedi, Nishi
name: Howe, Laura D.
name: Fitzsimons, Emla
name: Katikireddi, Srinivasa Vittal
name: Ploubidis, George B.
Publisher: name: figshare
Year: 2022
Subjects: subject: Medicine
subject: Sociology
subject: FOS: Sociology

description: Additional file 1: Table S1. Description of Studies. Table S2. Ethics and data access statements for each study. Table S3. Sample characteristics by study. Table S4. Employment status change by gender, education, and age-group. Table S5. Meta-analysed risk ratios and heterogeneity estimates for associations between changes in employment status and fruit and vegetable consumption: unadjusted, basic & full adjustment results. Table S6. Meta-analysed risk ratios and heterogeneity estimates for associations between changes in employment status and physical activity: unadjusted, basic & full adjustment results. Table S7. Meta-analysed risk ratios and heterogeneity estimates for associations between changes in employment status and sleep: unadjusted, basic & full adjustment results. Figure S8. Causal pathways blocked under differing levels of adjustment.
A vulnerabilidade como lugar ético: sobre De Profundis, Valsa Lenta, de José Cardoso Pires Teresa Toldy – Rui
Creators: name: Toldy, Teresa
name: Estrada, Rui
Publisher: name: Didaskalia
Year: 2017

description: Neste artigo, partindo do livro De Profundis, Valsa Lenta, do escritor português José Cardoso Pires, procuramos explicar em que medida a vulnerabilidade é a condição inescapável do paciente que passa por um procedimento médico em sentido geral. Daí chegamos à questão ética: a forma como os profissionais de saúde lidam com este estado de permanente vulnerabilidade característico daqueles com que se deparam.
description: Didaskalia, v. 47 n. 2 (2017): Os anjos: presença, linguagens e mediações; Fátima 1917-2017
Clinically silent, right and left ventricular outflow tract obstructions in an adult patient
Creators: name: Gierba, Mariusz
name: Kwiecień, Ewa
name: Drabik, Leszek
name: Paweł Heród
name: Dzieciuch‑Rojek, Monika
name: Paweł Iwaszczuk
name: Płazak, Wojciech
Publisher: name: figshare
Year: 2017
Subjects: Cardiology

description: Right ventricular outflow tract obstruction is a narrowing of the way that conducts blood from the right ventricle to the pulmonary ar‑ tery. Left ventricular outflow tract obstruction is a stenosis of the path that leads blood from the left ventricle to the aorta. Combination of right and left ventricular outflow tract obstruction is a very rare finding. We report a case of a 67‑year‑old male with asymptomatic bi‑ ventricular outflow tract obstruction. We discuss the clinical presentation, diagnostic procedures, treatment opportunities for the patient based on review of literature and actual recommendations.