scholarly journals Isochronous Gaussian Sampling and its applying to the Falcon Signature Scheme

Author(s):  
Yaroslav Derevianko ◽  
Oleksandr Baklykov

This paper describes a block framework for generating discrete Gaussian components with arbitrary center and standard deviation. Simplicity makes it easy to implement secure, portable, effective, and time-resistant. This sampler is a good candidate for any sample analysis. Most importantly, it was recently introduced into the Falcon Signature Scheme. Gaussian sampling over integers is a central element of algebraic lattice cryptography, which is difficult to perform efficiently and safely. Given the vast number of uses of sampling processes, it is important to select Gaussian samplers that are effective provably secure, resistant to transient attacks, and generally easy to implement. Sampling with other distributions, other than Gaussian, is yet an open question.

2013 ◽  
Vol 380-384 ◽  
pp. 2435-2438 ◽  
Author(s):  
Shu Rong Feng ◽  
Jiao Mo ◽  
Hua Zhang ◽  
Zheng Ping Jin

Certificateless short signature schemes can not only have the advantage of certificateless signature, but also provide a short signature size in communication. However, all existing certificateless short signature schemes only proven secure against a normal adversary which can only obtain the valid signature for the original public key rather than a super adversary which can obtain the valid signature for the replaced public key. Recently, Fan et al. proposed a certificateless short signature scheme which is very efficient, but we found it is still cannot against super adversary. In this paper, we first analysis their scheme, and then present an improved scheme which can against super adversaries. Furthermore, our scheme can provide both the strongest security level and the shortest signature size compared the existed provably secure certificateless short signature scheme.


2011 ◽  
Vol 6 (7) ◽  
pp. 294-302
Author(s):  
Jianhong Zhang ◽  
Yuanbo Cui ◽  
Min Xu ◽  
Jiancheng Zou

2018 ◽  
Vol 450 ◽  
pp. 378-391 ◽  
Author(s):  
Arijit Karati ◽  
SK Hafizul Islam ◽  
G.P. Biswas

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Jie Cai ◽  
Han Jiang ◽  
Hao Wang ◽  
Qiuliang Xu

In this paper, we design a new lattice-based linearly homomorphic signature scheme over F 2 . The existing schemes are all constructed based on hash-and-sign lattice-based signature framework, where the implementation of preimage sampling function is Gaussian sampling, and the use of trapdoor basis needs a larger dimension m ≥ 5 n   log   q . Hence, they cannot resist potential side-channel attacks and have larger sizes of public key and signature. Under Fiat–Shamir with aborting signature framework and general SIS problem restricted condition m ≥ n   log   q , we use uniform sampling of filtering technology to design the scheme, and then, our scheme has a smaller public key size and signature size than the existing schemes and it can resist side-channel attacks.


Sign in / Sign up

Export Citation Format

Share Document