Feasibility and Completeness of Cryptographic Tasks in the Quantum World

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Theory of Cryptography Conference

• Publication date

  2013-03-03

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-36594-2_16
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Quantum cryptography: Public key distribution and coin tossing

  2014cited by this paper
• Actively Secure Two-Party Evaluation of Any Quantum Operation

  2012cited by this paper
• Complete Insecurity of Quantum Protocols for Classical Two-Party Computation

  2012cited by this paper
• Universal Composability from Essentially Any Trusted Setup

  2012cited by this paper
• Impossibility of Growing Commitments

  2011cited by this paper
• Fully Simulatable Quantum-Secure Coin-Flipping and Applications

  2011cited by this paper
• Two Provers in Isolation

  2011cited by this paper
• Classical Cryptographic Protocols in a Quantum World

  2011cited by this paper
• Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions

  2011cited by this paper
• A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security

  2010influential reference
• Complexity of Multiparty Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation

  2009cited by this paper
• Improving the Security of Quantum Protocols via Commit-and-Open

  2009cited by this paper
• Composability in quantum cryptography

  2009cited by this paper
• Universally Composable Quantum Multi-party Computation

  2009influential reference
• Sampling in a Quantum Population, and Applications

  2009cited by this paper
• On the Power of Two-Party Quantum Cryptography

  2009cited by this paper
• Founding Cryptography on Oblivious Transfer - Efficiently

  2008cited by this paper
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations

  2008cited by this paper
• Testing for Concise Representations

  2007cited by this paper
• Cryptography from Sunspots: How to Use an Imperfect Reference String

  2007cited by this paper
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware

  2007cited by this paper
• Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority

  2006cited by this paper
• Brief history of quantum cryptography: a personal perspective

  2005cited by this paper
• Zero-knowledge against quantum attacks

  2005cited by this paper
• Universally Composable Privacy Amplification Against Quantum Adversaries

  2004cited by this paper
• Universally composable protocols with relaxed set-up assumptions

  2004cited by this paper
• On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

  2003cited by this paper
• Secure multi-party quantum computation

  2002cited by this paper
• Universally composable two-party and multi-party secure computation

  2002cited by this paper
• Universally Composable Commitments

  2001influential reference
• Authentication of quantum messages

  2001cited by this paper
• Universally composable security: a new paradigm for cryptographic protocols

  2001cited by this paper
• Security and Composition of Multiparty Cryptographic Protocols

  2000cited by this paper
• Simple proof of security of the BB84 quantum key distribution protocol

  2000cited by this paper
• Unconditional security of quantum key distribution over arbitrarily long distances

  1998cited by this paper
• Unconditional security in quantum cryptography

  1998cited by this paper
• Is Quantum Bit Commitment Really Possible?

  1996cited by this paper
• Unconditionally secure quantum bit commitment is impossible

  1996cited by this paper
• Insecurity of Quantum Secure Computations

  1996cited by this paper
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  1995cited by this paper
• Practical Quantum Oblivious Transfer

  1991cited by this paper
• Founding crytpography on oblivious transfer

  1988cited by this paper
• Equivalence Between Two Flavours of Oblivious Transfers

  1987cited by this paper
• Coin flipping by telephone

  1984cited by this paper

• Quantum CCA-Secure PKE, Revisited

  2025cites this paper
• Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority

  2023cites this paper
• Quantum Oblivious Transfer: A Short Review

  2022cites this paper
• Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds

  2021cites this paper
• On query-to-communication lifting for adversary bounds

  2020influential citation
• Oblivious Transfer is in MiniQCrypt

  2020cites this paper
• Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness

  2020cites this paper
• On the Everlasting Security of Password-Authenticated Quantum Key Exchange

  2019cites this paper
• Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation

  2018cites this paper
• Méthodes pour la réduction d’attaques actives à passives en cryptographie quantique

  2018influential citation
• Quantum security analysis of a lattice-based oblivious transfer protocol

  2017cites this paper
• Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications

  2016cites this paper
• Computational Security of Quantum Encryption

  2016cites this paper
• Quantifying the Leakage of Quantum Protocols for Classical Two-Party Cryptography

  2015cites this paper
• Quantum cryptography beyond quantum key distribution

  2015cites this paper
• Quantum One-Time Memories from Stateless Hardware

  2015cites this paper
• A Note on Quantum Security for Post-Quantum Cryptography

  2014cites this paper
• Classical Cryptographic Protocols in a Quantum World

  2011cites this paper
• in Lecture Notes in Computer Science ( 2013 ) : Volumes 7126 – ? ?

  year unknowncites this paper
• A Bibliography of Papers in Lecture Notes in Computer Science (2013): Volumes 7126–??

  year unknowncites this paper