#### Filter Results:

#### Publication Year

1997

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

#### Organism

Learn More

We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the " learning with errors " (LWE) problem. Our main contributions are: (1) a new lattice attack on LWE that combines basis reduction with an enumeration algorithm admitting a time/success tradeoff, which performs better than the simple… (More)

In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar's code-based solution to use the short integer solution (SIS) problem as security assumption, instead of the syndrome decoding (SD) problem. By applying the CLRS identification scheme, we are also able to have a performance gain as result of the reduction in… (More)

At SAC 2009, Misoczki and Barreto proposed a new class of codes, which have parity-check matrices that are quasi-dyadic. A special subclass of these codes were shown to coincide with Goppa codes and those were recommended for cryptosystems based on error-correcting codes. Quasi-dyadic codes have both very compact representations and allow for efficient… (More)

The security of many efficient cryptographic constructions, e.g. collision-resistant hash functions, digital signatures, identification schemes, and more recently public-key encryption has been proven assuming the hardness of worst-case computational problems in ideal lattices. These lattices correspond to ideals in the ring Z[ζ], where ζ is some fixed… (More)

Building upon a famous result due to Ajtai, we propose a sequence of lattice bases with growing dimension, which can be expected to be hard instances of the shortest vector problem (SVP) and which can therefore be used to benchmark lattice reduction algorithms. The SVP is the basis of security for potentially post-quantum cryptosys-tems. We use our sequence… (More)

Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any additional information that might be used by an impersonator. In this paper we propose a scheme whose security relies on the existence of a commitment scheme and on the hardness of worst-case lattice problems. We… (More)

This survey provides a comparative overview of lattice-based signature schemes with respect to security and performance. Furthermore, we explicitly show how to construct a competitive and provably secure Merkle-tree signature scheme solely based on worst-case lattice problems.

—We propose a new, efficient non-deterministic decoding algorithm for square-free Goppa codes over F p for any prime p. If the code in question has degree t and the average distance to the closest codeword is at least (4/p)t+1, the proposed decoder can uniquely correct up to (2/p)t errors with high probability. The correction capability is higher if the… (More)

- R. Aaij, C. Abellan Beteta, B. Adeva, M. Adinolfi, C. Adrover, A. Affolder +494 others
- 2012

Measurement of ψ(2S) meson production in pp collisions at √ s = 7 TeV Abstract The differential cross-section for the inclusive production of ψ(2S) mesons in pp collisions at √ s = 7 TeV has been measured with the LHCb detector. The data sample corresponds to an integrated luminosity of 36 pb −1. The ψ(2S) mesons are reconstructed in the decay channels… (More)