Person

Sonia Mihaela Bogos

This person is no longer with EPFL

Related publications (10)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Towards Efficient LPN-Based Symmetric Encryption

Serge Vaudenay, Sonia Mihaela Bogos, Dario Korolija, Thomas Locher

Due to the rapidly growing number of devices that need to communicate securely, there is still significant interest in the development of efficient encryption schemes. It is important to maintain a portfolio of different constructions in order to enable a ...

Springer International Publishing2021

LPN in Cryptography

Sonia Mihaela Bogos

The security of public-key cryptography relies on well-studied hard problems, problems for which we do not have efficient algorithms. Factorization and discrete logarithm are the two most known and used hard problems. Unfortunately, they can be easily solv ...

EPFL2017

Cryptanalysis of a Homomorphic Encryption Scheme

Serge Vaudenay, Sonia Mihaela Bogos, John Gaspoz

Homomorphic encryption allows to make specific operations on private data which stays encrypted. While applications such as cloud computing require to have a practical solution, the encryption scheme must be secure. In this article, we detail and analyze i ...

2016

Observations on the LPN Solving Algorithm from Eurocrypt'16

Serge Vaudenay, Sonia Mihaela Bogos

In this note we re-evaluate the Eurocrypt’16 paper by Zhang et al. [9] in the area of LPN solving algorithms. We present the history of LPN solving algorithms and give the general description of the algorithm from [9]. While this new algorithm claims to im ...

2016

On solving LPN using BKW and variants Implementation and Analysis

Serge Vaudenay, Sonia Mihaela Bogos, Florian Tramèr

The Learning Parity with Noise problem (LPN) is appealing in cryptography as it is considered to remain hard in the post-quantum world. It is also a good candidate for lightweight devices due to its simplicity. In this paper we provide a comprehensive anal ...

Springer2016

Optimization of LPN Solving Algorithms

Serge Vaudenay, Sonia Mihaela Bogos

In this article we focus on constructing an algorithm that automatizes the generation of LPN solving algorithms from the considered parameters. When searching for an algorithm to solve an LPN instance, we make use of the existing techniques and optimize th ...

Springer-Verlag Berlin2016

How to Sequentialize Independent Parallel Attacks? - Biased Distributions Have a Phase Transition

Serge Vaudenay, Sonia Mihaela Bogos

We assume a scenario where an attacker can mount several independent attacks on a single CPU. Each attack can be run several times in independent ways. Each attack can succeed after a given number of steps with some given and known probability. A natural q ...

2015

Primeless Factoring-Based Cryptography

Serge Vaudenay, Sonia Mihaela Bogos

Factoring-based public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off process ...

2013

Primeless Modular Cryptography (Extended Abstract)

Serge Vaudenay, Sonia Mihaela Bogos

Most of the known public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off proce ...

2012

Cryptanalysis of the Double-Moduli Cryptosystem

Serge Vaudenay, Sonia Mihaela Bogos

In this article we present a lattice attack done on a NTRU-like scheme introduced by Verkhovsky in [1]. We show how, based on the relation between the public and private key, we can construct an attack which allows any passive adversary to decrypt the encr ...

2012