The Ring-LWE (RLWE) problem is expected to be a computationally-hard problem even with quantum algorithms. The Poly-LWE (PLWE) problem is closely related to the RLWE problem, and in practice a security base for various recently-proposed cryptosystems. In 2014, Eisentraeger et al. proposed attacks against the decision-variant of the PLWE problem (and in 2015, Elias et al. precisely described and...

Wireless channels are characterized by more serious bursty and location-dependent errors. Many packet scheduling algorithms have been proposed for wireless networks to guarantee fairness and delay bounds. However, most existing schemes do not consider the difference of traffic natures among packet flows. This will cause the delay-weight coupling problem. In particular, serious queuing delays ma...

This paper studies the robustness of reinforcement learning algorithms to errors in process. Specifically, we revisit benchmark problem discrete-time linear quadratic regulation (LQR) and study long-standing open question: Under what conditions is policy iteration method robustly stable from a dynamical systems perspective? Using advanced stability results control theory, it shown that for LQR ...

Nowadays with increasing use of numerous nonlinear loads, voltage and current harmonics in power systems are one of the most important problems power engineers encounter. Many of these nonlinear loads, because of their dynamic natures, inject time-varying harmonics into power system. Common techniques applied for harmonics measurement and assessment such as FFT have significant errors in presen...

Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality. In this paper, an efficient identity-based signcryption scheme from lattice was proposed. Our scheme based on Macciancio and Piekert’s trapdoor generation method and delegate algorithm for lattice. Our main idea is that establish the identity-based system master key via trapdoor gen...

The persistent progress of quantum computing with algorithms of Shor and Proos and Zalka has put our present RSA and ECC based public key cryptosystems at peril. There is a flurry of activity in cryptographic research community to replace classical cryptography schemes with their post-quantum counterparts. The learning with errors problem introduced by Oded Regev offers a way to design secure c...

Abstract We cast the ranking problem as (1) multiple classification (“Mc”) (2) multiple ordinal classification, which lead to computationally tractable learning algorithms for relevance ranking in Web search. We consider the DCG criterion (discounted cumulative gain), a standard quality measure in information retrieval. Our approach is motivated by the fact that perfect classifications result i...

Post-quantum cryptography has attracted increased attention in the last couple of years, due to the threat of quantum computers breaking current cryptosystems. In particular, the key size and performance of post-quantum algorithms became a significant target for optimization. In this spirit, Alkim et al. have recently proposed a significant optimization for a key exchange scheme that is based o...

We consider the problem of developing robust algorithms which cope with noisy data. In the Probably Approximately Correct model of machine learning, we develop a general technique which allows nearly all PAC learning algorithms to be converted into highly e cient PAC learning algorithms which tolerate noise. In the eld of combinatorial algorithms, we develop techniques for constructing search a...