Classical Cryptographic Protocols in a Quantum World

@inproceedings{Hallgren2011ClassicalCP,
  title={Classical Cryptographic Protocols in a Quantum World},
  author={Sean Hallgren and Adam D. Smith and Fang Song},
  booktitle={IACR Cryptol. ePrint Arch.},
  year={2011}
}
Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If we accept that quantum information processing is the most realistic model of physically feasible computation, then we must ask: what classical protocols remain secure against quantum attackers? Our main contribution is showing the existence… 
View PDF on arXiv
38 Citations
Highly Influential Citations
2
Background Citations
13
Methods Citations
3

Figures from this paper

38 Citations

On Classical Cryptographic Protocols in Post-Quantum World
  • I. Vajda
  • Computer Science, Mathematics
  • 2017
TLDR
The proposed technique (full factorization) aims at reducing the original protocol into a statisticallysecure protocol by turning it into a hybrid one where all cryptographic primitives are substituted by appropriate ideal functionalities.
Quantum cryptography beyond quantum key distribution
TLDR
This review article, aimed primarily at cryptographers unfamiliar with the quantum world, survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.
Quantum security analysis of a lattice-based oblivious transfer protocol
TLDR
This paper proves the security of the lattice-based OT protocol proposed by Peikert et al. (CRYPTO, 2008), which is universally composably secure under the assumption of learning with errors hardness, in the quantum setting, using three general quantum security analysis frameworks.
A Note on Quantum Security for Post-Quantum Cryptography
  • Fang Song
  • Computer Science, Mathematics
    PQCrypto
  • 2014
Shor’s quantum factoring algorithm and a few other efficient quantum algorithms break many classical crypto-systems. In response, people proposed post-quantum cryptography based on computational…
Quantum Security of Cryptographic Primitives
TLDR
This work proposes the first systematic classification of quantum security scenarios, and provides a novel framework for the quantum security (both in terms of indistinguishability and semantic security) of secret-key encryption schemes, and gives explicit secure constructions, as well as impossibility results.
Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
TLDR
The study of quantum-secure digital signatures and quantum chosen ciphertext security is initiated by allowing the adversary to issue quantum chosen message queries: given a superposition of messages, the adversary receives asuperposition of signatures on those messages.
Feasibility and Completeness of Cryptographic Tasks in the Quantum World
TLDR
This work studies the feasibility of realizing functionalities in the framework of universal composability, with respect to both computational and information-theoretic security, and shows that existing feasibility results carry over unchanged from the classical to the quantum world.
A Comprehensive Analysis of Quantum E-voting Protocols
TLDR
This paper systematize and evaluate the security of suggested e-voting protocols based on quantum technology, and examines the claims of these works concerning privacy, correctness and verifiability, and if they are correctly attributed to the proposed protocols.
Composable security in relativistic quantum cryptography
TLDR
It is shown that coin flipping can be constructed from the primitive channel with delay, biased coin flipping, bit commitment and channel with Delay are all impossible without further assumptions, and it is impossible to improve a channel withdelay.
General Properties of Quantum Bit Commitments
  • Jun Yan
  • Computer Science, Physics
  • 2021
TLDR
This work explores general properties of conditional quantum bit commitments that additionally rely on quantum computational hardness but without any mathematical structures, e.g. quantum-secure one-way functions and discovers that any interactive quantum bit commitment scheme can be compiled into a non-interactive one.
...
...

References

SHOWING 1-10 OF 99 REFERENCES
Improving the Security of Quantum Protocols via Commit-and-Open
TLDR
A general "compiler" improving the security of two-party quantum protocols is shown: if the original protocol is secure against an "almost honest" adversary, then the compiled protocol isSecure against an arbitrary computationally bounded (quantum) adversary.
Secure multi-party quantum computation
TLDR
This work uses a new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6 and gives a protocol which tolerates any t ξ n/4 cheating parties (out of n).
Unconditionally secure quantum bit commitment is impossible
TLDR
It is shown that the claim that quantum cryptography can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters, does not hold for any quantum bit commitment protocol.
Fully device-independent quantum key distribution.
TLDR
This work rigorously proves the device-independent security of a slight variant of Ekert's original entanglement-based protocol against the most general (coherent) attacks, and achieves a linear key rate and tolerates a constant noise rate in the devices.
Why quantum bit commitment and ideal quantum coin tossing are impossible
Feasibility and Completeness of Cryptographic Tasks in the Quantum World
TLDR
This work studies the feasibility of realizing functionalities in the framework of universal composability, with respect to both computational and information-theoretic security, and shows that existing feasibility results carry over unchanged from the classical to the quantum world.
Quantum-Secure Coin-Flipping and Applications
TLDR
This paper proves classical coin-flipping secure in the presence of quantum adversaries, and discusses how the protocol can be applied to a recently proposed method for improving the security of quantum protocols, resulting in an implementation without set-up assumptions.
Computational Collapse of Quantum State with Application to Oblivious Transfer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1-2 quantum oblivious…
Unconditional security in quantum cryptography
TLDR
Basic techniques to prove the unconditional security of quantum crypto graphy are described and a practical variation on the protocol in which the channel is noisy and photos may be lost during the transmission is considered.
Concurrent Composition in the Bounded Quantum Storage Model
TLDR
A statistically secure commitment protocol in the BQS-UC model that composes concurrently with other protocols and an (a-priori) polynomially-bounded number of instances of itself is presented.
...
...