The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of a
Goppa code from a random matrix. The hardness of this problem is an assumption to prove …

An unresolved problem in research on authenticated key exchange (AKE) in the public-key
setting is to construct a secure protocol against advanced attacks such as key compromise …

This paper studies a variant of the McEliece cryptosystem able to ensure that the code used
as the public key is no longer permutation equivalent to the secret code. This increases the …

We initiate the study of one-wayness under correlated products. We are interested in
identifying necessary and sufficient conditions for a function f and a distribution on inputs (x …

We propose new and improved instantiations of lossy trapdoor functions (Peikert and
Waters, STOC'08), and correlation-secure trapdoor functions (Rosen and Segev, TCC'09) …

Abstract In 2003 Michael Alekhnovich (FOCS 2003) introduced a novel variant of the
learning parity with noise problem and showed that it implies IND-CPA secure public-key …

Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of
applications, in particular, as an essential building block for two-party and multi-party …

We introduce for non-uniform messages a novel hybrid universal network coding
cryptosystem (NU-HUNCC) in the finite blocklength regime that provides Post-Quantum (PQ) …

In recent years, Cloud Computing has become an emerging technology that gains wide
influence on IT systems. Cloud Computing is a distributed computing model for enabling …

This paper discusses how to realize practical post-quantum authenticated key exchange
(AKE) with strong security, ie, CK+ security (Krawczyk, CRYPTO 2005). It is known that …