157 citations · 815 across the 35 of their papers we have counts for
6 papers · 1 filter
Weak approximate unitary designs and applications to quantum encryption
Cécilia Lancien, Christian Majenz
Unitary -designs are the bread and butter of quantum information theory and beyond. An important issue in practice is that of efficiently constructing good approximations of suc…
Efficient simulation of random states and random unitaries
Gorjan Alagic, Christian Majenz, Alexander Russell
We consider the problem of efficiently simulating random quantum states and random unitary operators, in a manner which is convincing to unbounded adversaries with black-box oracle…
Secure Multi-party Quantum Computation with a Dishonest Majority
Yfke Dulek, Alex B. Grilo, Stacey Jeffery +2
The cryptographic task of secure multi-party (classical) computation has received a lot of attention in the last decades. Even in the extreme case where a computation is performed…
Non-malleability for quantum public-key encryption
Christian Majenz, Christian Schaffner, Jeroen van Wier
Non-malleability is an important security property for public-key encryption (PKE). Its significance is due to the fundamental unachievability of integrity and authenticity guarant…
Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability
Jan Czajkowski, Christian Majenz, Christian Schaffner +1
Game-playing proofs constitute a powerful framework for non-quantum cryptographic security arguments, most notably applied in the context of indifferentiability. An essential ingre…
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
Jelle Don, Serge Fehr, Christian Majenz +1
The famous Fiat-Shamir transformation turns any public-coin three-round interactive proof, i.e., any so-called sigma-protocol, into a non-interactive proof in the random-oracle mod…