Follow
Christian Schaffner
Christian Schaffner
University of Amsterdam & QuSoft
Verified email at uva.nl - Homepage
Title
Cited by
Cited by
Year
The operational meaning of min-and max-entropy
R Koenig, R Renner, C Schaffner
Arxiv preprint ArXiv:0807.1338, 2008
7092008
Random oracles in a quantum world
D Boneh, Ö Dagdelen, M Fischlin, A Lehmann, C Schaffner, M Zhandry
Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011
5102011
Leftover hashing against quantum side information
M Tomamichel, C Schaffner, A Smith, R Renner
IEEE Transactions on Information Theory 57 (8), 5524-5535, 2011
3162011
Cryptography in the bounded-quantum-storage model
IB Damgård, S Fehr, L Salvail, C Schaffner
SIAM Journal on Computing 37 (6), 1865-1890, 2008
2822008
Quantum cryptography beyond quantum key distribution
A Broadbent, C Schaffner
Designs, Codes and Cryptography 78, 351-382, 2016
2492016
Position-based quantum cryptography: Impossibility and constructions
H Buhrman, N Chandran, S Fehr, R Gelles, V Goyal, R Ostrovsky, ...
SIAM Journal on Computing 43 (1), 150-178, 2014
2072014
A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
E Kiltz, V Lyubashevsky, C Schaffner
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
1932018
Security of the Fiat-Shamir transformation in the quantum random-oracle model
J Don, S Fehr, C Majenz, C Schaffner
Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019
1732019
Cryptography from noisy storage
S Wehner, C Schaffner, BM Terhal
Physical review letters 100 (22), 220502, 2008
1572008
A tight high-order entropic quantum uncertainty relation with applications
IB Damgård, S Fehr, R Renner, L Salvail, C Schaffner
Proceedings of the 27th annual international cryptology conference on …, 2007
1262007
Using Simon's algorithm to attack symmetric-key cryptographic primitives
T Santoli, C Schaffner
arXiv preprint arXiv:1603.07856, 2016
1102016
Security and composability of randomness expansion from Bell inequalities
S Fehr, R Gelles, C Schaffner
Physical Review A 87 (1), 012335, 2013
1092013
Quantum homomorphic encryption for polynomial-sized circuits
Y Dulek, C Schaffner, F Speelman
Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016
1082016
Complete insecurity of quantum protocols for classical two-party computation
H Buhrman, M Christandl, C Schaffner
Physical review letters 109 (16), 160501, 2012
942012
Secure identification and QKD in the bounded-quantum-storage model
IB Damgård, S Fehr, L Salvail, C Schaffner
Annual International Cryptology Conference, 342-359, 2007
94*2007
Semantic security and indistinguishability in the quantum world
T Gagliardoni, A Hülsing, C Schaffner
Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016
832016
Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model
C Schaffner
Physical Review A 82 (3), 032308, 2010
612010
Implementation of two-party protocols in the noisy-storage model
S Wehner, M Curty, C Schaffner, HK Lo
Physical Review A 81 (5), 052336, 2010
592010
Improving the security of quantum protocols via commit-and-open
I Damgård, S Fehr, C Lunemann, L Salvail, C Schaffner
Annual International Cryptology Conference, 408-427, 2009
532009
The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography
H Buhrman, S Fehr, C Schaffner, F Speelman
Arxiv preprint arXiv:1109.2563, 2011
51*2011
The system can't perform the operation now. Try again later.
Articles 1–20