Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)

DOI10.1007/978-3-031-38554-4_8arXiv2304.10480OpenAlexW4385654045MaRDI QIDQ6190138

Akshayaram Srinivasan, Dakshita Khurana, James Bartusek

Publication date: 6 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2304.10480

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Cites Work

• Quantum cryptography: public key distribution and coin tossing
• Pseudorandom quantum states
• Two-round MPC: information-theoretic and black-box
• Round optimal black-box ``commit-and-prove
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Non-interactive zero knowledge from sub-exponential DDH
• Oblivious transfer is in MiniQCrypt
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
• On the round complexity of secure quantum computation
• One-way functions imply secure computation in a quantum world
• Hidden cosets and applications to unclonable cryptography
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• Non-interactive batch arguments for NP from standard assumptions
• SNARGs for P from sub-exponential DDH and QR
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Cryptography from one-way communication: on completeness of finite channels
• Somewhere statistical soundness, post-quantum security, and SNARGs
• The random oracle methodology, revisited
• Correcting Quantum Errors with Entanglement
• Cryptography with One-Way Communication
• Sampling in a Quantum Population, and Applications
• Founding Cryptography on Oblivious Transfer – Efficiently
• Quantum cryptography based on Bell’s theorem
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Coding theorem and strong converse for quantum channels
• Algorithms and Computation
• Secure Computation on the Web: Computing without Simultaneous Interaction
• Fiat-Shamir: from practice to theory
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
• Quantum garbled circuits
• SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
• Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
• Cryptography from pseudorandom quantum states
• Quantum commitments and signatures without one-way functions
• Classically verifiable NIZK for QMA with preprocessing
• Unnamed Item
• Unnamed Item

This page was built for publication: Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)