scholarly journals On Non-Completeness and G-Equivariance

2019 ◽  
Vol 9 (21) ◽  
pp. 4692
Author(s):  
Yoo-Jin Baek

With the growing threat of the side-channel attack (SCA) to the cryptographic algorithm’s implementations, the masking method has become one of the most promising SCA countermeasures for securely implementing, for example, block ciphers. The basic principle of the masking method is that if the sensitive variable (which, by definition, depends on sensitive information) is split into some random variables and they are manipulated in a secure manner, then the relationship between the random variables and the corresponding side-channel information may look independent from the outside world. However, after the introduction of the glitch attack, there has been a lot of concern about the security of the masking method itself. And, to mitigate the threat of the glitch attack, the threshold implementation (TI) and G-equivariant gates were independently introduced as countermeasures. In this paper, we consider the main notions of two such independent glitch attack’s countermeasures, say, non-completeness and G-equivariance, and investigate their relationship. The contribution of this paper is three-fold. First, we show that the widely-circulated proof that the non-complete TI with uniform inputs guarantees the security against the 1st order DPA even in the presence of glitches is not satisfactory. Next, using the extended notion of G-equivariance to the higher-order setting, we prove that non-completeness implies G-equivariance, which, in turn, means that the non-complete TI with uniform inputs has resistance against the glitch attack. Thirdly, we prove that the set of non-complete gates is a proper subset of the set of G-equivariant gates by showing there is a gate that is G-equivariant but not non-complete.

2021 ◽  
Vol 30 (3) ◽  
pp. 1-42
Author(s):  
Pengfei Gao ◽  
Hongyi Xie ◽  
Fu Song ◽  
Taolue Chen

Side-channel attacks, which are capable of breaking secrecy via side-channel information, pose a growing threat to the implementation of cryptographic algorithms. Masking is an effective countermeasure against side-channel attacks by removing the statistical dependence between secrecy and power consumption via randomization. However, designing efficient and effective masked implementations turns out to be an error-prone task. Current techniques for verifying whether masked programs are secure are limited in their applicability and accuracy, especially when they are applied. To bridge this gap, in this article, we first propose a sound type system, equipped with an efficient type inference algorithm, for verifying masked arithmetic programs against higher-order attacks. We then give novel model-counting-based and pattern-matching-based methods that are able to precisely determine whether the potential leaky observable sets detected by the type system are genuine or simply spurious. We evaluate our approach on various implementations of arithmetic cryptographic programs. The experiments confirm that our approach outperforms the state-of-the-art baselines in terms of applicability, accuracy, and efficiency.


2013 ◽  
Vol 30 (5) ◽  
pp. 500-508
Author(s):  
Yingjian Yan ◽  
Jingchao Yu ◽  
Pengfei Guo ◽  
Jianfei Guo

2017 ◽  
Vol 14 (135) ◽  
pp. 20170484 ◽  
Author(s):  
Matthew D. B. Jackson ◽  
Salva Duran-Nebreda ◽  
George W. Bassel

Multicellularity and cellular cooperation confer novel functions on organs following a structure–function relationship. How regulated cell migration, division and differentiation events generate cellular arrangements has been investigated, providing insight into the regulation of genetically encoded patterning processes. Much less is known about the higher-order properties of cellular organization within organs, and how their functional coordination through global spatial relations shape and constrain organ function. Key questions to be addressed include: why are cells organized in the way they are? What is the significance of the patterns of cellular organization selected for by evolution? What other configurations are possible? These may be addressed through a combination of global cellular interaction mapping and network science to uncover the relationship between organ structure and function. Using this approach, global cellular organization can be discretized and analysed, providing a quantitative framework to explore developmental processes. Each of the local and global properties of integrated multicellular systems can be analysed and compared across different tissues and models in discrete terms. Advances in high-resolution microscopy and image analysis continue to make cellular interaction mapping possible in an increasing variety of biological systems and tissues, broadening the further potential application of this approach. Understanding the higher-order properties of complex cellular assemblies provides the opportunity to explore the evolution and constraints of cell organization, establishing structure–function relationships that can guide future organ design.


2007 ◽  
Vol 39 (4) ◽  
pp. 1070-1097 ◽  
Author(s):  
J. Blanchet ◽  
P. Glynn

Consider a sequence X = (Xn: n ≥ 1) of independent and identically distributed random variables, and an independent geometrically distributed random variable M with parameter p. The random variable SM = X1 + ∙ ∙ ∙ + XM is called a geometric sum. In this paper we obtain asymptotic expansions for the distribution of SM as p ↘ 0. If EX1 > 0, the asymptotic expansion is developed in powers of p and it provides higher-order correction terms to Renyi's theorem, which states that P(pSM > x) ≈ exp(-x/EX1). Conversely, if EX1 = 0 then the expansion is given in powers of √p. We apply the results to obtain corrected diffusion approximations for the M/G/1 queue. These expansions follow in a unified way as a consequence of new uniform renewal theory results that are also developed in this paper.


2015 ◽  
Vol 9 ◽  
pp. 20-33
Author(s):  
Rubiah Abu Bakar ◽  
Abdul Manam Mohamad

This study aims to analyze the acceptance of students towards the implementation of the Basic Principles of Islam (CTU 101) course curriculum which is one of the Islamic Study Courses in UiTM (MARA Institute of Technology). The focus of this study is to investigate the level and relationship between students’ acceptance in terms of content, teaching and evaluation. This survey study involved 300 students who were randomly chosen and a set of questionnaires was utilized as the instrument of study. A pilot study was conducted among 30 students to determine the reliability of instrument used by using Alpha Cronbach with value 0.960, and value 0.964. A set of questionnaire consists of part A (demography background of participants) and part B, C, D and E (questions of variables) was used to collect data for this study. Data were analyzed by using Software SPSS version 17.0 (Statistic Packages For Sosial Science) and reported by using of descriptive statistics of min, percentage and median, and also by making inferences to analyzed the relationship among the variables. The findings of study show that participants positively accepted CTU 101 course with content min average of content 4.1733 (high), teaching 4.0693 (high) and evaluation 3.9996 (high). Besides that, correlation Pearson analysis was used to analyzed the relationship among the variables and for this study, it was found that significant relationship between the acceptance of participants with the content, teaching and evaluation aspect of CTU 101 course.  The high score of each aspect or variable and the significant relationships show that students positively accepted the course. However, a few aspects of the course should be given attention and a few improvements should be done in order to give students good perception towards Islamic Study Course.   Keyword: Acceptance, student, Basic Principle of Islam (CTU 101).


2014 ◽  
Vol 513-517 ◽  
pp. 1221-1226
Author(s):  
Bo Tao Zhu ◽  
Xiao Xiao Liu ◽  
Jun Steed Huang Huang ◽  
Zu Jue Chen

This paper proposes a statistical coding methodology using covert side channel information to solve timing packet security issue, the main purpose here is to enhance the security of the timing protocol with backward compatible capability. In wireless communications, either ad-hoc military/ industrial network, or LTE/ LTE-A networks, GPS is used to provide time and location; however, the hackers often trying to spoof the signal. The alternative way of providing such signal is using protocols like IEEE1588 Precision Time Protocol (PTP); unfortunately, current timing packet is not encrypted, it can be altered by the hackers. To maintain the simplicity of such protocols, most vendors are reluctant to add encryption on top of it; nevertheless, the end customer wishes to see it. To solve this dilemma, we propose a backward compatible solution here. The basic idea is demonstrated using Matlab FFT calculation tool. The future extension using Fractional FFT is also suggested at.


Author(s):  
Weimin Cui ◽  
Wei Guo ◽  
Zhongchao Sun ◽  
Tianxiang Yu

In order to analyze the reason of failure and improve the reliability of the idler shaft, this paper studies the reliability and sensitivity for the idler shaft based on Kriging model and Variance Methods respectively. The finite element analysis (FEA) of idler shaft is studied in ABAQUS firstly. Then, combining the performance function and various random variables, the Kriging model of idler shaft is established and verified. Based on Kriging model which has been established, the relationship between random variables and the response value is studied, and the function reliability is calculated which explains why the failure of the idler shaft occurred frequently in service. Finally, the variance-based sensitivity method is used for sensitivity analysis of influence factors, the result shows that the reliability of idler shaft is sensitive to the inner diameter of body A and inner diameter of body B, which could contribute for the analysis and further improvement of idler shaft.


Sign in / Sign up

Export Citation Format

Share Document