Quantum one time programs
This presentation is the property of its rightful owner.
Sponsored Links
1 / 55

Quantum one-time programs PowerPoint PPT Presentation


  • 67 Views
  • Uploaded on
  • Presentation posted in: General

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?.

Download Presentation

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


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?


What is a one time program1

What is a one-time program?


What is a one time program2

What is a one-time program?


What is a one time program3

What is a one-time program?

BANG!


What is a one time program4

What is a one-time program?


Otps cannot be achieved by software

OTPs cannot be achieved by software


Does quantum information suffice

Does quantum information suffice?

Ux

Ux*


What about secure hardware

What about secure hardware?


Secure hardware one time memory

Secure hardware: one-time memory


Secure hardware one time memory1

Secure hardware: one-time memory


Secure hardware one time memory2

Secure hardware: one-time memory

BANG!


Secure hardware one time memory3

Secure hardware: one-time memory


Advantages of one time memories

Advantages of one-time memories


Non interactive two party computation

Non-interactive two-party computation

one-way

communication


Non interactive two party computation1

Non-interactive two-party computation


Non interactive two party computation2

Non-interactive two-party computation


Non interactive two party computation3

Non-interactive two-party computation

BANG!


Non interactive two party computation4

Non-interactive two-party computation


Why ni2pc

Why NI2PC?


Quantum one time programs1

Quantum one-time programs

one-way

communication


Quantum one time programs2

Quantum one-time programs


Quantum one time programs3

Quantum one-time programs


Quantum one time programs4

Quantum one-time programs


What s known about classical otps

What’s known about classical OTPs


Our primary result

quantum

Our primary result:


Our primary result in more detail

|fi

|yi

|mi

Our primary result... in more detail


Our primary result in more detail1

|fi

|yi

|mi

Our primary result... in more detail


Our primary result in more detail2

|fi

|yi

|mi

Our primary result... in more detail

B


Our primary result in more detail3

|fi

|yi

|mi

Our primary result... in more detail

B


Completeness requirement

Completeness requirement

C


Security requirement

Security requirement

F

SIMULATOR


Security requirement1

Security requirement

|fi

|yi

|mi


Overview honest receiver

Overview: honest receiver


1 use otms to build a reactive cotp

|fi

|yi

|mi

1. Use OTMs to build a reactive COTP


From otms to cotps

|fi

|yi

|mi

From OTMs to COTPs...


And from cotps to reactive cotps

|fi

|yi

|mi

...and from COTPs to reactive COTPs


2 quantum authentication schemes

2. Quantum authentication schemes

TAMPERING


3 quantum computing on authentica ted data qcad

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


Life is not that easy

Life is not that easy


Life is not that easy1

Life is not that easy


Life is not that easy2

Life is not that easy

See Michael Ben-Or’s talk

from Wednesday


Schemes that admit qcad

Schemes that admit QCAD


Schemes that admit qcad1

Schemes that admit QCAD

See Michael Ben-Or’s talk

from Wednesday


4 cotp for classical interaction

4. COTP for classical interaction

A

B

C


4 cotp for classical interaction1

4. COTP for classical interaction

How does the receiver

non-interactively (de-)authenticate

his input without learning

the key??

A

B

C


5 teleport through de authentication

5. Teleport-through-(de)-authentication

trash


A qotp consists of

teleport

auth

A

|mi

|0i

teleport

de-auth

A QOTP consists of:


Security a simulator for our qotp

Security: a simulator for our QOTP

|yi

|fi

|mi

F

SIMULATOR


Simulator in pictures

Simulator in pictures

F

A

|0i

|mi

|0i


Trivial one time programs

Trivial one-time programs


Trivial one time programs1

Trivial one-time programs

f


Unlockable classical functions

Unlockable classical functions


Unlockable quantum channels

Unlockable quantum channels


The end

The end

Thank you for your attention!

BANG!

extended abstract: Cryptology ePrint Archive, Report 2013/343

full version (old): arXiv:1211.1080 [quant-ph]


  • Login