University of Cambridge > Talks.cam > CQIF Seminar > One-out-of-m spacetime-constrained oblivious transfer

One-out-of-m spacetime-constrained oblivious transfer

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Adrian Kent.

In one-out-of-m spacetime-constrained oblivious transfer (SCOT), Alice and Bob agree on m pairwise spacelike separated spacetime regions R_0,R_1,..., R_{m-1} in close-to-Minkowski spacetime; Alice inputs a message x_i in the causal past of a spacetime point Q_i of R_i, for i\in{0,1,...,m-1}; Bob inputs b\in{0,1,...,m-1} in the intersection of the causal pasts of Q_0,Q_1,...,Q_{m-1} and outputs x_b in R_b; Alice remains oblivious to b anywhere in spacetime; and Bob cannot obtain x_i in R_i and x_j in R_j for any pair of different numbers i,j\in{0,1,...,m-1}. We introduce unconditionally secure one-out-of-m SCOT protocols extending previous one-out-of-two SCOT protocols, for arbitrary m >= 2.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity