Skip to content

Improving BLISS

BLISS is a lattice signature scheme published in CRYPTO 2013. The key idea of the paper is use a bimodal distribution to optimize rejection sampling. Here, we investigate using a multi-modal distribution for the same goal.

Essentially we want to keep the following quantity of BLISS small: \frac{e^x+e^{-x}}{\min_x e^x+e^{-x}}. By changing it to a four-modal distribution, it becomes \frac{e^x+e^{-x}+e^{3x}+e^{-3x}}{\min_x e^x+e^{-x}+e^{3x}+e^{-3x}}, which is however bigger. Thus it does not work.

Advertisements

Protected: Calculate SVP, SIVP, CVP with single exponential time and poly space

This content is password protected. To view it please enter your password below:

Protected: Multi-Key FHE without common parameters

This content is password protected. To view it please enter your password below:

Protected: Convex Integration with probabilistic methods

This content is password protected. To view it please enter your password below:

Protected: Bootstrap for Attributed-based Encryption (ABE)

This content is password protected. To view it please enter your password below:

Protected: Changing representation in BGV, rep: F_q -> S_r

This content is password protected. To view it please enter your password below:

Protected: NTRU problem on subfield

This content is password protected. To view it please enter your password below: