The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, Paris, Wilkieand Woods 16] showed ho...
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
Argumentation is a reasoning model based on the construction of arguments and counterarguments (defeaters) then the selection of the most acceptable of them. In this paper, we pro...
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...