activity
20242026
collaborators

8 papers

cs.CR2026

Simulation-Secure Functional Encryption in the Bounded Storage Model

Mohammed Barhoush, Louis Salvail

Functional encryption (FE) is a versatile paradigm that enables fine-grained access control over encrypted data. Despite its potential, achieving the gold standard of simulation-ba…

quant-ph2026

Separating Non-Interactive Classical Verification of Quantum Computation from Falsifiable Assumptions

Mohammed Barhoush, Tomoyuki Morimae, Ryo Nishimaki +1

Mahadev [SIAM J. Comput. 2022] introduced the first protocol for classical verification of quantum computation based on the Learning-with-Errors (LWE) assumption, achieving a 4-mes…

cs.CR2026

On the Impossibility of Simulation Security for Quantum Functional Encryption

Mohammed Barhoush, Arthur Mehta, Anne Müller +1

Functional encryption is a powerful cryptographic primitive that enables fine-grained access to encrypted data and underlies numerous applications. Although the ideal security noti…

quant-ph2026

How to Sign Quantum Messages

Mohammed Barhoush, Louis Salvail

Signing quantum messages has long been considered impossible even under computational assumptions. In this work, we challenge this notion and provide three innovative approaches to…

cs.CR2025

Separating Pseudorandom Generators from Logarithmic Pseudorandom States

Mohammed Barhoush

Pseudorandom generators (PRGs) are a foundational primitive in classical cryptography, underpinning a wide range of constructions. In the quantum setting, pseudorandom quantum stat…

cs.CR2025

Powerful Primitives in the Bounded Quantum Storage Model

Mohammed Barhoush, Louis Salvail

The bounded quantum storage model aims to achieve security against computationally unbounded adversaries that are restricted only with respect to their quantum memories. In this wo…