#### Filter Results:

#### Publication Year

2009

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Motivated by a recently introduced HIMMO key distribution scheme, we consider a modification of the noisy polynomial interpolation problem of recovering an unknown polynomial f (X) ∈ Z[X] from approximate values of the residues of f (t) mod-ulo a prime p at polynomially many points t taken from a short interval.

—Lighting is a major part of energy consumption in buildings. Lighting systems will thus be one of the important component systems of a smart grid for dynamic load management services like demand response. We consider the problem of control of multiple lighting systems in a building for providing demand response service. In the scenario considered in this… (More)

—Usually a communication link is secured by means of a symmetric-key algorithm. For that, a method is required to securely establish a symmetric-key for that algorithm. This old key establishment problem is still relevant and of paramount importance both in existing computer networks and new large-scale ubiquitous systems comprising resource-constrained… (More)

We consider the problem of determining the minimum number N<sub>d</sub> of unit disks that is required to block all rays emanating from a point P in the two-dimensional space, where each disk has at least a distance d to point P and to any other disk. We study the asymptotic behavior of N<sub>d</sub>, as d tends to infinity. By deriving upper bounds and… (More)

We consider a two polynomials analogue of the polynomial interpolation problem. Namely, we consider the Mixing Modular Operations (MMO) problem of recovering two polynomials f ∈ Zp[x] and g ∈ Zq[x] of known degree, where p and q are two (un)known positive integers, from the values of f (t) mod p + g(t) mod q at polynomially many points t ∈ Z. We show that… (More)

- Oscar García-Morchón, Domingo Gómez-Pérez, Jaime Gutiérrez, Ronald Rietman, Berry Schoenmakers, Ludo Tolhuizen
- 2015

In this paper we introduce HIMMO as a truly practical and lightweight collusion-resistant key predistribution scheme. The scheme is reminiscent of Blundo et al's elegant key predistribution scheme, in which the master key is a symmetric bivariate polynomial over a finite field, and a unique common key is defined for every pair of nodes as the evaluation of… (More)

The future development of quantum-computers could turn many key agreement algorithms used in the Internet today fully insecure, endangering many applications such as online banking, e-commerce, e-health, etc. At the same time, the Internet is further evolving to enable the Internet of Things (IoT) in which billions of devices deployed in critical… (More)

- Daniel Dinu, Yann Le Corre, Dmitry Khovratovich, Léo Perrin, Johann Großschädl, Alex Biryukov +25 others
- 2015

3. A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO, 9. Algebraic Eraser: A lightweight, efficient asymmetric key agreement protocol for use in no-power, low-power, and IoT devices, Derek Atkins 10. Elliptic Curve Cryptography (ECC) for LWM2M (Light Weight Machine to Machine)… (More)

The HIMMO scheme has been introduced as a lightweight collusion-resistant key pre-distribution scheme, with excellent efficiency in terms of bandwidth, energy consumption and computation time. As its cryptanalysis relies on lattice techniques, HIMMO is also an interesting quantum-safe candidate. Unlike the schemes by Blom, by Matsumoto and Imai, and by… (More)