Khashayar Barooti

Public-Key Encryption with Quantum Keys
K. Barooti, A. B. Grilo, L. Huguenin, G. Malavolta, O. Sattath, H. Vu, M. Walter
TCC 2023 (to appear)
[preprint]

▼

A short description of this work:

In this paper we introduce the notion of public-key encryption where the keys are allowed to be quantum states (named qPKE). We define the apporopriate security notions and propose 3 constructions:

a qPKE scheme with reusable public-keys providing IND-CCA2 security from one-way functions
a one-shot qPKE scheme providing IND-CCA1 security from pseudorandom function-like states
a qPKE scheme with reusable public-keys providing IND-CPA security based on PRFS with proof of destruction

On the negative side, borrowing techniques from shadow tomography, we prove that qPKE can not guarantee information-theoretic security.

On Active Attack Detection in Messaging with Immediate Decryption
K. Barooti, D. Collins, S. Colombo, L. Huguenin, S. Vaudenay
CRYPTO 2023
[preprint]

▼

A short description of this work:

I suggest looking at Daniel's amazing thread to know more about this result :)

How hard is it to fake entanglement? A complexity theoretic view of nonlocality and its applications to delegating quantum computation
K. Barooti, G. Gluch, M. Renou
[preprint]

Additional text for publication 7.

Breaking a Classical Barrier for Classifying Arbitrary Test Examples in the Quantum Model
K. Barooti, G. Gluch, R. Urbanke
AISTATS 2023, Poster appeared @ QIP22
[preprint]

Additional text for publication 2.

New Attacks on LowMC instances with a Single Plaintext/Ciphertext pair
S. Banik, K. Barooti, S. Vaudenay, H. Yan
ASIACRYPT 2021

▼

A short description of this work:

We improve the results from [BBDV20] to show that using enumerations techniques for boolean functions, one can mount a 2-step meet-in-the-middle attack on instances of LowMC with even more number of S-boxes.

Cryptanalysis of LowMC instances using single plaintext/ciphertext pair
S. Banik, K. Barooti, B. Durak, S. Vaudenay
TOSC 2020 (FSE 2022)
**Best Paper Award**
[preprint]

▼

A short description of this work:

We show that reducing the number of non-linear operations in a block cipher used for signatures built using the MPC-in-the-head paradigm can lead to serious security concerns. For the case of PICNIC and LowMC, we demonstrate 2 attacks on instances with small number of S-boxes using a simple linearization technique.

Cryptanalysis of Plantlet
S. Banik, K. Barooti, T. Isobe
TOSC 2020 (FSE 2020)
[preprint]

Additional text for publication 5.

Khashayar Barooti's Website

About Me:

Publications and Preprints:

A short description of this work:

A short description of this work:

A short description of this work:

A short description of this work:

Cryptanalysis challenges:

Teaching:

Where to find me: