scholarly journals Rejection Sampling Revisit: How to Choose Parameters in Lattice-Based Signature

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhongxiang Zheng ◽  
Anyu Wang ◽  
Lingyue Qin

Rejection sampling technology is a core tool in the design of lattice-based signatures with ‘Fiat–Shamir with Aborts’ structure, and it is related to signing efficiency and signature, size as well as security. In the rejection sampling theorem proposed by Lyubashevsky, the masking vector of rejection sampling is chosen from discrete Gaussian distribution. However, in practical designs, the masking vector is more likely to be chosen from bounded uniform distribution due to better efficiency and simpler implementation. Besides, as one of the third-round candidate signatures in the NIST postquantum cryptography standardization process, the 3rd round version of CRYSTALS-Dilithium has proposed a new method to decrease the rejection probability in order to achieve better efficiency and smaller signature size by decreasing the number of nonzero coefficients of the challenge polynomial according to the security levels. However, it is seen that small entropies in this new method may lead to higher risk of forgery attack compared with former schemes proposed in its 2nd version. Thus, in this paper, we first analyze the complexity of forgery attack for small entropies and then introduce a new method to decrease the rejection probability without loss of security including the security against forgery attack. This method is achieved by introducing a new rejection sampling theorem with tighter bound by utilizing Rényi divergence where masking vector follows uniform distribution. By observing large gaps between the security claim and actual security bound in CRYSTALS-Dilithium, we propose two series of adapted parameters for CRYSTALS-Dilithium. The first set can improve the efficiency of the signing process in CRYSTALS-Dilithium by factors of 61.7 %  and  41.7 % , according to the security levels, and ensure the security against known attacks, including forgery attack. And, the second set can reduce the signature size by a factor of 14.09 % with small improvements in efficiency at the same security level.

2016 ◽  
Vol 25 (3) ◽  
pp. 324-351 ◽  
Author(s):  
RICHARD ARRATIA ◽  
STEPHEN DeSALVO

We propose a new method, probabilistic divide-and-conquer, for improving the success probability in rejection sampling. For the example of integer partitions, there is an ideal recursive scheme which improves the rejection cost from asymptotically order n3/4 to a constant. We show other examples for which a non-recursive, one-time application of probabilistic divide-and-conquer removes a substantial fraction of the rejection sampling cost.We also present a variation of probabilistic divide-and-conquer for generating i.i.d. samples that exploits features of the coupon collector's problem, in order to obtain a cost that is sublinear in the number of samples.


Information ◽  
2020 ◽  
Vol 11 (3) ◽  
pp. 133
Author(s):  
Arnaud Sipasseuth ◽  
Thomas Plantard ◽  
Willy Susilo

At PKC 2008, Plantard et al. published a theoretical framework for a lattice-based signature scheme, namely Plantard–Susilo–Win (PSW). Recently, after ten years, a new signature scheme dubbed the Diagonal Reduction Signature (DRS) scheme was presented in the National Institute of Standards and Technology (NIST) PQC Standardization as a concrete instantiation of the initial work. Unfortunately, the initial submission was challenged by Yu and Ducas using the structure that is present on the secret key noise. In this paper, we are proposing a new method to generate random noise in the DRS scheme to eliminate the aforementioned attack, and all subsequent potential variants. This involves sampling vectors from the n-dimensional ball with uniform distribution. We also give insight on some underlying properties which affects both security and efficiency on the PSW type schemes and beyond, and hopefully increase the understanding on this family of lattices.


Information ◽  
2020 ◽  
Vol 11 (3) ◽  
pp. 166
Author(s):  
Yuelei Xiao ◽  
Haiqi Li

Privacy preserving data publishing has received considerable attention for publishing useful information while preserving data privacy. The existing privacy preserving data publishing methods for multiple sensitive attributes do not consider the situation that different values of a sensitive attribute may have different sensitivity requirements. To solve this problem, we defined three security levels for different sensitive attribute values that have different sensitivity requirements, and given an L s l -diversity model for multiple sensitive attributes. Following this, we proposed three specific greed algorithms based on the maximal-bucket first (MBF), maximal single-dimension-capacity first (MSDCF) and maximal multi-dimension-capacity first (MMDCF) algorithms and the maximal security-level first (MSLF) greed policy, named as MBF based on MSLF (MBF-MSLF), MSDCF based on MSLF (MSDCF-MSLF) and MMDCF based on MSLF (MMDCF-MSLF), to implement the L s l -diversity model for multiple sensitive attributes. The experimental results show that the three algorithms can greatly reduce the information loss of the published microdata, but their runtime is only a small increase, and their information loss tends to be stable with the increasing of data volume. And they can solve the problem that the information loss of MBF, MSDCF and MMDCF increases greatly with the increasing of sensitive attribute number.


Abstract: This article proposes a method for increasing the level of security of a corporate network by its structure that meets the specified security requirements and distinguishes them from well-known attack type invariant structural units of the network - security domains. Hierarchy of security levels in the form of rings is represented allow more effectively protect a network that requires more security. The method allows to get output data only when the initial data allows to do this. In other words, if it is possible to improve the security level of a given network structure, then the method does this. A graph of the dependence of the security level on the ratio of the number of domains to the maximum number of objects in the domains is developed. A weighted domain allocation algorithm, which will increase the overall security on information and communication systems is proposed. For increasing the overall level of security, the splitting of the network into a larger number of security domains with as few services as possible is given. In accordance the weight of properties with modern data from the theory of information security vulnerability of a particular service is selected.


2020 ◽  
Vol 7 (2) ◽  
pp. 40-47
Author(s):  
I. D. Anikina ◽  
E. P. Kucherovа ◽  
E. S. Karevа

The paper is devoted to the study of approaches to assessing the financial security level of agricultural companies and their improvement. The methodological base of the research is a modern concept of financial security and enterprise sustainability. The methods review for assessing financial security is carried out, also industry characteristics of enterprises are studied. The result of the work is the development of a methodology for assessing the financial security level of organizations. Such methodology’s topicality is represented in the additive model, which includes four integral indicators: profitability, financial sustainability, solvency and business activity. The total of all integral indicators, taking into account the coefficients, is the final rate of an organization’s financial security. The authors distinguish three financial security levels, which are: critical, medium and high. The minimal coefficients, suggested by the legislation and minimal indicators adjusted according to the agricultural enterprises’ specificity have been given to calculate the critical level. The medium level is determined by the calculation of the agricultural producers’ financial security industry average over the last 5 years. The high financial security group includes the enterprises with the indicators exceeding the medium indicators. The theoretical and practical significance of the study lies in the fact that the proposed methodology makes it possible to assess the level of financial security of agricultural enterprises taking into account the industry specifics of their activities, including for further competitive analysis.


2018 ◽  
Vol 173 ◽  
pp. 03013
Author(s):  
Zhu Zhanfei ◽  
Han Xinwen ◽  
Li Wensheng ◽  
Yang Shutao ◽  
Wang Bingchuan

It is highly necessary to study how to analyze the reliability of simulation data under small sample circumstance when the number of times live operational test is strictly limited. Based on the analysis of existing test ideas and methods, combined with the characteristics of sequence statistics of uniform distribution, a new method of consistency verification is proposed by constructing the variable-scale differential quotient sequence statistic. The research shows that this method is not limited by the sample size, and the credibility of the simulation data can be quickly judged by MATLAB programming.


1986 ◽  
Vol 13 (3) ◽  
pp. 317-327 ◽  
Author(s):  
GARETH L. LASKY ◽  
B. CARL GORDON ◽  
DAVID J. SREBALUS

This study investigated distress and self-esteem levels of 147 federal correctional officers working in that system's six different security level institutions. The General Severity Index (GSI), a scale of the Brief Symptom Inventory (BSI), was used to measure distress; the Rosenberg Self-Esteem Scale (SES) operationalized the other dependent variable. In addition, 13 variables were used as part of a multiple regression analysis to determine a prediction equation for the two outcomes studied. Lack of participation in decision making and years of continual employment were significantly related to distress, whereas responsibility for people and role conflict were related to self-esteem. Federal correctional officers across all security levels scored in the “clinical” range on the GSI and yielded high SES scores. Differences among security levels were not significant.


Author(s):  
GAMIL R.S. QAID ◽  
SANJAY N. TALBAR

Data communication is transmission data from a point to another. Nowadays main issue in data communication is the security. It can provide a fine solution by encryption. The encryption algorithm is the mathematical process for performing encryption on data. The proposed algorithm supports for user desired security level and processing level. The algorithm provides security levels and their corresponding processing levels by generating random keys for the encryption/decryption process. This facility is achieved by using fuzzy logic. The results of the proposed encryption algorithm will be analyzed by comparing with other existing encryption algorithms. The aim of the research is to build a new algorithm using fuzzy sets requirement which will be more advanced than the existing encryption algorithms.


2019 ◽  
pp. 157-160
Author(s):  
O. H. Mykhailyk

The article reveals the social and legal conditionality for the factors of violence in correctional colonies of medium and maximum security levels. It is substantiated that violence in correctional colonies is a social and legal phenomenon, which is quite complex and ambiguous. The influence on the manifestations of violence in the correctional colonies of the following factors is proved: national-legal; socio-psychological and criminological. The opposition from the administration of the correctional colony of medium and maximum security level to violence has a great preventive value, firstly as a deterrent to other prisoners, and secondly, the reduction of crime rates in places of non-freedom. From the standpoint of our study, an interesting element of the motivation of a crime is violence, the content of which lies in the sphere of his own behavior of the convicted person and acts as its stimulator. It is noted that violence in correctional colonies of medium and maximum security levels is characterized by a high degree of social danger, importance of the object of criminal law protection, and the nature and extent of the damage caused by the special subject of the crime. The study of the social conditionality for the forms of violence in correctional colonies of the medium and maximum security levels has shown that this problem is one of the most acute among convicts, and therefore requires its immediate solution, first of all at the legal level, as well as at the level of departmental sub-legislation acts. Therefore, when developing effective forms and methods for preventing violence in correctional colonies of medium and maximum security levels, we propose to the Ministry of Justice of Ukraine to take them into account when preparing departmental legal acts and departmental instructions of the Criminal and Executive Service of Ukraine.


Sign in / Sign up

Export Citation Format

Share Document