1 citations · 2 across the 11 of their papers we have counts for
13 papers
Quantum Cryptomania with Classical Communication without One-Way Functions
Mohammed Barhoush, Amit Behera
In classical cryptography, one-way functions are necessary for most of cryptography. In the quantum world, however, Kretschmer at {TQC'21} and subsequent works have demonstrated th…
Separating Quantum Indistinguishability Obfuscation from Falsifiable Assumptions
Mohammed Barhoush, Tomoyuki Morimae, Ramis Movassagh
Quantum indistinguishability obfuscation (qIO) aims to make a quantum circuit unintelligible while preserving its functionality. It serves as a foundational primitive for advanced…
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…
On the Feasibility of Simulation-Secure 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…
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…
MicroCrypt Assumptions with Quantum Input Sampling and Pseudodeterminism: Constructions and Separations
Mohammed Barhoush, Ryo Nishimaki, Takashi Yamakawa
We investigate two natural relaxations of quantum cryptographic primitives. The first involves quantum input sampling, where inputs are generated by a quantum algorithm rather than…
Quantum Cheques
Mohammed Barhoush, Louis Salvail
Publicly-verifiable quantum money has been a central and challenging goal in quantum cryptography. To this day, no constructions exist based on standard assumptions. In this study,…
Signatures From Pseudorandom States via -PRFs
Mohammed Barhoush, Amit Behera, Lior Ozer +2
Different flavors of quantum pseudorandomness have proven useful for various cryptographic applications, with the compelling feature that these primitives are potentially weaker th…
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…
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…
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…
Homotopy and Homology at Infinity and at the Boundary
Mohammed Barhoush
In this paper we study the relationship between the homology and homotopy of a space at infinity and at its boundary. Firstly, we prove that if a locally connected, connected, -…
On the Number of Representations for Simple Lie Groups
Mohammed Barhoush
The growth rate function counts the number of irreducible representations of simple complex Lie groups of dimension . While no explicit formula is known for this function,…