Fetching the paper…
Reading the bibliography…
Relativistic protocols have been proposed to overcome some impossibility results in classical and quantum cryptography.
The operator tensor formulation of quantum theory
Hardy, L · 1971
Earlier work this paper cites.
Coin flipping by telephone a protocol for solving impossible problems
Blum, M · 1983
Earlier work this paper cites.
Founding crytpography on oblivious transfer
Kilian, J · 1988
Earlier work this paper cites.
Unconditionally Secure Quantum Bit Commitment is Impossible
Mayers, D · 1997
Earlier work this paper cites.
Is Quantum Bit Commitment Really Possible?
Lo, H.-K. & Chau, H. F · 1997
Earlier work this paper cites.
Why quantum bit commitment and ideal quantum coin tossing are impossible
Lo, H.-K. & Chau, H · 1998
Earlier work this paper cites.
Unconditionally secure bit commitment
Kent, A · 1999
Earlier work this paper cites.
Universally composable security: A new paradigm for cryptographic protocols
Canetti, R · 2001
Earlier work this paper cites.
Universally Composable Commitments
Canetti, R. & Fischlin, M · 2001
Earlier work this paper cites.
Probability Theories with Dynamic Causal Structure: A New Framework for Quantum Gravity (2005)
Hardy, L · 2005
Earlier work this paper cites.
Cryptography in the bounded-quantum-storage model
Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C · 2008
Earlier work this paper cites.
Optimal Quantum Strong Coin Flipping
Chailloux, A. & Kerenidis, I · 2009
Earlier work this paper cites.
Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J. & Kashefi, E · 2009
Cited alongside, same era.
Theoretical framework for quantum networks
Chiribella, G., D’Ariano, G. M. & Perinotti, P · 2009
Cited alongside, same era.
Universally Composable Quantum Multi-party Computation
Unruh, D · 2010
Cited alongside, same era.
On a measure of distance for quantum strategies (2010)
Gutoski, G · 2010
Cited alongside, same era.
Abstract Cryptography
Maurer, U. & Renner, R · 2011
Cited alongside, same era.
Concurrent composition in the bounded quantum storage model
Unruh, D · 2011
Cited alongside, same era.
Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
Quantum computations without definite causal structure
Chiribella, G., D’Ariano, G. M., Perinotti, P. & Valiron, B · 2013
Later among the works it cites.
Cryptographic security of quantum key distribution (2014)
Portmann, C. & Renner, R · 2014
Later among the works it cites.
Composable Security of Delegated Quantum Computation , 406–425 (Springer Berlin Heidelberg, Berlin, Heidelberg, 2014)
Dunjko, V., Fitzsimons, J. F., Portmann, C. & Renner, R · 2014
Later among the works it cites.
Computational Advantage from Quantum-Controlled Ordering of Gates
Araújo, M., Costa, F. & Brukner, Č · 2014
Later among the works it cites.
Practical Relativistic Bit Commitment
Lunghi, T. et al · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Kent, A · 2012
Cited alongside, same era.
Everlasting multi-party computation
Unruh, D · 2012
Cited alongside, same era.
Quantum computation with programmable connections between gates (2011)
Colnaghi, T., D’Ariano, G. M., Perinotti, P. & Facchini, S · 2012
Cited alongside, same era.
Quantum correlations with no causal order
Oreshkov, O., Costa, F. & Brukner, Č · 2012
Cited alongside, same era.
Secure Bit Commitment From Relativistic Constraints
Kaniewski, J., Tomamichel, M., Hanggi, E. & Wehner, S · 2013
Cited alongside, same era.
Unfair coin tossing
Demay, G. & Maurer, U · 2013
Cited alongside, same era.
Kaniewski, J · 2015
Later among the works it cites.
Arbitrarily long relativistic bit commitment
Chakraborty, K., Chailloux, A. & Leverrier, A · 2015
Later among the works it cites.
Experimental superposition of orders of quantum gates 6
Procopio, L. M. et al · 2015
Later among the works it cites.
Blind quantum computing with two almost identical states (2016)
Dunjko, V. & Kashefi, E · 2016
Later among the works it cites.
Causal Boxes: Quantum Information-Processing Systems Closed under Composition
Portmann, C., Matt, C., Maurer, U., Renner, R. & Tackmann, B · 2017
Closest in time.
Experimental verification of an indefinite causal order
Rubino, G. et al · 2017
Closest in time.
Bell’s Theorem for Temporal Order (2017)
Zych, M., Costa, F., Pikovski, I. & Brukner, C · 2017
Closest in time.