We present a study of the concrete complexity of solving instances of the unique shortest vector problem (uSVP). In particular, we study the complexity of solving the Learning with Errors (LWE) problem by reducing the Bounded-Distance Decoding (BDD) problem to uSVP and attempting to solve such instances using the ‘embedding’ approach. We experimentally derive a model for the success of the appr...

In this work, we study a class of randomized weak pseudorandom functions, which we call weak PRFs with hidden auxiliary input (HIwPRF). Compared to Learning Parity with Noise (LPN) or Learning with Errors (LWE) based randomized weak PRFs, it provides less algebraic structure such that many known techniques and constructions do not translate to this class. We investigate the potential of HIwPRFs...

In this paper we present the (to the best of our knowledge) first LWE-based encryption scheme that removes the need of Gaussian sampling for the error, i.e. the discrete Gaussian distribution is replaced by the uniform distribution on a (small) set, which at the same time preserves the underlying worst-case hardness. This shows that provable security and efficiency do not necessarily have to mu...

Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic constructions. Attractive features of lattice cryptography include: apparent resistance to quantum attacks (in contrast with most number-theoretic cryptography), high asymptotic efficiency and parallelism, security under worst-case intractability assumptions, and...

In this paper we introduce NewHope-Simple, a variant of the NewHope RingLWE-based key exchange that is using a straight-forward transformation from Ring-LWE encryption to a passively secure KEM (or key-exchange scheme). The main advantage of NewHopeSimple over NewHope is simplicity. In particular, it avoids the error-reconciliation mechanism originally proposed by Ding. The explanation of his m...

We propose a new zero-knowledge protocol for proving knowledge of short preimages under additively homomorphic functions that map integer vectors to an Abelian group. The protocol achieves amortized efficiency in that it only needs to send O(n) auxiliary function values to prove knowledge of n preimages. Furthermore we significantly improve previous bounds on how short a secret we can extract f...

Lattice-based encryption schemes still su er from a low message throughput per ciphertext and ine cient solutions towards realizing enhanced security characteristics such as CCA1or CCA2-security. This is mainly due to the fact that the underlying schemes still follow a traditional design concept and do not tap the full potentials of LWE. In particular, many constructions still encrypt data in a...

In distributed pseudorandom functions (DPRFs), a PRF secret key SK is shared among N servers so that each server can locally compute partial evaluation of the on some input X. A combiner collects t evaluations then reconstruct F(SK, X) under initial key. So far, all non-interactive constructions in standard model are based lattice assumptions. One caveat they only known to be secure static corr...

The aim of the work was determination of functional and rheological properties of liquid whole egg (LWE) after pulsed electric field (PEF) treatment. LWE was obtained from eggs of 27 weeks old layer hens Tetra SL. Parameters of PEF treatment were chosen according earlier experiment results where significant reduction of microflora was observed (32,89 kV/cm and 20, 60, 100 pulses). It was conclu...