Secure and Robust Transmission and Verification of Unknown Quantum States in Minkowski Space

Kent, Adrian; Massar, Serge; Silman, Jonathan

doi:10.1038/srep03901

Cited by 2 publications

(2 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bit string commitments may be made using protocols involving the short distance transmission of classical or quantum data, with security based on relativistic signalling constraints [10,[22][23][24][25][26]. Such schemes need two or more user agents communicating with adjacent issuer agents; many configurations of agents are possible.…”

Section: (E) Privacy In Other Types Of Moneymentioning

confidence: 99%

“…Extensions of the scheme to allow present, future and past privacy raise new questions. Unconditionally secure bit commitment schemes can be proven secure, against both classical and quantum adversaries, assuming only the validity of quantum theory and special relativity, when used to commit a single bit, at least for a single round [10,[23][24][25][26]. These schemes are also unconditionally and composably secure against the receiver, Bob, since from his perspective the information he receives 11 for each committed bit is random, and is uncorrelated between commitments.…”

Section: Security and Practicality: Issues And Extensionsmentioning

confidence: 99%

See 1 more Smart Citation

S-money: virtual tokens for a relativistic economy

Kent

2019

Proc. R. Soc. A.

Self Cite

View full text Add to dashboard Cite

We propose definitions and implementations of "S-money" -virtual tokens designed for high value fast transactions on networks with relativistic or other trusted signalling constraints, defined by inputs that in general are made at many network points, some or all of which may be space-like separated. We argue that one significant way of characterising types of money in space-time is via the "summoning" tasks they can solve: that is, how flexibly the money can be propagated to a desired space-time point in response to relevant information received at various space-time points. We show that S-money is more flexible than standard quantum or classical money in the sense that it can solve deterministic summoning tasks that they cannot. It requires the issuer and user to have networks of agents with classical data storage and communication, but no long term quantum state storage, and is feasible with current technology. User privacy can be incorporated by secure bit commitment and zero knowledge proof protocols. The level of privacy feasible in given scenarios depends on efficiency and composable security questions that remain to be systematically addressed. NETWORKS AND AGENTSWe are interested in token schemes that allow some form of access -for example to goods, services, data, physical objects or environments. Depending on the context, such tokens might for example play the role of money, passwords, keys or passcards. They may be used by parties with many possible relationships. The parties may be individuals or may be networks of collaborating agents who trust one another.For illustration, we suppose that the scheme involves money issued by one agency, B (Bob, the Bank, or issuer) to another A (Alice, the Acquirer, or user). We suppose that A and B have pre-equipped themselves to carry out communications and transactions at a pre-agreed finite set of space-time points defining a network.A network point P here represents a small pre-agreed local space-time region around the point P , which can contain separate secure sites for user and issuer agents, and authenticated classical and/or quantum channels between these sites. All communications associated with a given network point must take place within the associated space-time region. Typically, when there is a natural fixed frame choice to describe the network, we assume that the spatial diameter of these regions is significantly smaller than the spatial separation between any pair of network points.Unless otherwise stated, we assume below that the only signalling constraint is the impossibility of superluminal communication, and that both A and B can send secure classical signals (for instance using one-time pads maintained by quantum key distribution) from any network point to any other network point within its future light cone.As usual in relativistic cryptography [9], we assume that each agency may be represented by a set of agents who are completely trusted and whose actions are coordinated, so that they can be identified as effectively a single party. The par...

show abstract

Section: (E) Privacy In Other Types Of Moneymentioning

confidence: 99%

Section: Security and Practicality: Issues And Extensionsmentioning

confidence: 99%

S-money: virtual tokens for a relativistic economy

Kent

2019

Proc. R. Soc. A.

Self Cite

View full text Add to dashboard Cite

show abstract

Spacetime-constrained oblivious transfer

Pitalúa-García¹

2016

Phys. Rev. A

View full text Add to dashboard Cite

In 1-out-of-2 oblivious transfer (OT), Alice inputs numbers x0, x1, Bob inputs a bit b and outputs x b . Secure OT requires that Alice and Bob learn nothing about b and xb, respectively. We define spacetime-constrained oblivious transfer (SCOT) as OT in Minkowski spacetime in which Bob must output x b within R b , where R0 and R1 are fixed spacelike separated spacetime regions. We show that unconditionally secure SCOT is impossible with classical protocols in Minkowski (or Galilean) spacetime, or with quantum protocols in Galilean spacetime. We describe a quantum SCOT protocol in Minkowski spacetime, and we show it unconditionally secure.

show abstract

Secure and Robust Transmission and Verification of Unknown Quantum States in Minkowski Space

Cited by 2 publications

References 54 publications

S-money: virtual tokens for a relativistic economy

S-money: virtual tokens for a relativistic economy

Spacetime-constrained oblivious transfer

Contact Info

Product

Resources

About