1 / 55

Quantum one-time programs

Quantum one-time programs. Anne Broadbent Gus Gutoski Douglas Stebila. extended abstract: Cryptology ePrint Archive, Report 2013/343 full version (old): arXiv:1211.1080 [quant-ph]. August 9, 2013, QCrypt, Waterloo. What is a one-time program?. What is a one-time program?.

symona
Télécharger la présentation

Quantum one-time programs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Quantum one-time programs Anne Broadbent Gus Gutoski Douglas Stebila extended abstract: Cryptology ePrint Archive, Report 2013/343 full version (old): arXiv:1211.1080 [quant-ph] August 9, 2013, QCrypt, Waterloo

  2. What is a one-time program?

  3. What is a one-time program?

  4. What is a one-time program?

  5. What is a one-time program? BANG!

  6. What is a one-time program?

  7. OTPs cannot be achieved by software

  8. Does quantum information suffice? Ux Ux*

  9. What about secure hardware?

  10. Secure hardware: one-time memory

  11. Secure hardware: one-time memory

  12. Secure hardware: one-time memory BANG!

  13. Secure hardware: one-time memory

  14. Advantages of one-time memories

  15. Non-interactive two-party computation one-way communication

  16. Non-interactive two-party computation

  17. Non-interactive two-party computation

  18. Non-interactive two-party computation BANG!

  19. Non-interactive two-party computation

  20. Why NI2PC?

  21. Quantum one-time programs one-way communication

  22. Quantum one-time programs

  23. Quantum one-time programs

  24. Quantum one-time programs

  25. What’s known about classical OTPs

  26. quantum Our primary result:

  27. |fi |yi |mi Our primary result... in more detail

  28. |fi |yi |mi Our primary result... in more detail

  29. |fi |yi |mi Our primary result... in more detail B

  30. |fi |yi |mi Our primary result... in more detail B

  31. Completeness requirement C

  32. Security requirement F SIMULATOR

  33. Security requirement |fi |yi |mi

  34. Overview: honest receiver

  35. |fi |yi |mi 1. Use OTMs to build a reactive COTP

  36. |fi |yi |mi From OTMs to COTPs...

  37. |fi |yi |mi ...and from COTPs to reactive COTPs

  38. 2. Quantum authentication schemes TAMPERING

  39. 3. Quantum computing on authentica-ted data (QCAD)

  40. Life is not that easy

  41. Life is not that easy

  42. Life is not that easy See Michael Ben-Or’s talk from Wednesday

  43. Schemes that admit QCAD

  44. Schemes that admit QCAD See Michael Ben-Or’s talk from Wednesday

  45. 4. COTP for classical interaction A B C

  46. 4. COTP for classical interaction How does the receiver non-interactively (de-)authenticate his input without learning the key?? A B C

  47. 5. Teleport-through-(de)-authentication trash

  48. teleport auth A |mi |0i teleport de-auth A QOTP consists of:

  49. Security: a simulator for our QOTP |yi |fi |mi F SIMULATOR

  50. Simulator in pictures F A |0i |mi |0i

More Related