#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2007

2017

- This year (3)
- Last 5 years (16)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- André Chailloux, Iordanis Kerenidis
- 2009 50th Annual IEEE Symposium on Foundations of…
- 2009

Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit. Quantum information allows for protocols in the information theoretic setting where no dishonest party can perfectly cheat. The previously best-known quantum protocol by Ambain is achieved a cheating probability of at… (More)

- André Chailloux, Giannicola Scarpa
- ICALP
- 2014

- André Chailloux, Iordanis Kerenidis
- 2011 IEEE 52nd Annual Symposium on Foundations of…
- 2011

Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the information theoretic setting where no dishonest party can perfectly cheat. The previously best-known quantum protocol by Ambainis achieved a cheating probability of at most 3/4. On the other hand, Kitaev showed… (More)

We show that interactive and noninteractive zero-knowledge are equivalent in the ‘help model’ of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference string is generated by a probabilistic polynomial-time dealer who is given access to the statement to be proven. Our results do not rely on any unproven complexity assumptions and… (More)

Random Access Codes is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an n-bit string x, and wishes to encode x into a quantum state ρx, such that Bob, when receiving the state ρx, can choose any bit i ∈ [n] and recover the input bit xi with high probability. Here we… (More)

- J Silman, A Chailloux, N Aharon, I Kerenidis, S Pironio, S Massar
- Physical review letters
- 2011

In the distrustful quantum cryptography model the parties have conflicting interests and do not trust one another. Nevertheless, they trust the quantum devices in their labs. The aim of the device-independent approach to cryptography is to do away with the latter assumption, and, consequently, significantly increase security. It is an open question whether… (More)

- Dorit Aharonov, André Chailloux, Maor Ganz, Iordanis Kerenidis, Loïck Magnin
- SIAM J. Comput.
- 2016

God does not play dice. He flips coins instead.” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be… (More)

- André Chailloux, Or Sattath
- 2012 IEEE 27th Conference on Computational…
- 2012

In this paper, we study variants of the canonical Local Hamiltonian problem where, in addition, the witness is promised to be separable. We define two variants of the Local Hamiltonian problem. The input for the Separable Local Hamiltonian problem is the same as the Local Hamiltonian problem, i.e. a local Hamiltonian and two energies a and b, but the… (More)

- Anna Pappa, André Chailloux, Stephanie Wehner, Eleni Diamanti, Iordanis Kerenidis
- Physical review letters
- 2012

Future quantum information networks will consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and, hence,… (More)

- André Chailloux, Iordanis Kerenidis, Bill Rosgen
- computational complexity
- 2011

Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and in the quantum regime, we examine computationally secure commitment schemes. In this paper we study worst-case complexity assumptions that imply quantum bit commitment schemes. First, we show that QSZK… (More)