474 citations · 2.5k across the 45 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CR2010★ 1 cited
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters
Anne Broadbent, Stacey Jeffery, Alain Tapp
We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial comple…
quant-ph2010★ 4 cited
QMIP = MIP*
Anne Broadbent, Joseph Fitzsimons, Elham Kashefi
The way entanglement influences the power of quantum and classical multi-prover interactive proof systems is a long-standing open question. We show that the class of languages reco…