Skip to main content
Cryptography

Return to Question

deleted 13 characters in body
Source Link
Maarten Bodewes ♦
Maarten Bodewes ♦
  • 94.5k
  • 13
  • 165
  • 319

We all know that OPRF is a two-party protocol, where Alice inputs $X = {x_1, ..., x_n}$, Bob has no input, and after executing the OPRF protocol, Alice gets $F_k(x_i)$, and Bob receives a pseudorandom key $K$. 

I wonder if it is possible to construct a permutation(shuffle) OPRF, where Alice inputs $X$, Bob inputs a random permutation $\pi$, and after the protocol ends, Alice gets $F_k(x_{(\pi(i))})$, and Bob receives the pseudorandom key $K$. 

Are there any works that implement such a protocol now? Or are there any similar works that achieve the goal with it? Thank you answer !

We all know that OPRF is a two-party protocol, where Alice inputs $X = {x_1, ..., x_n}$, Bob has no input, and after executing the OPRF protocol, Alice gets $F_k(x_i)$, and Bob receives a pseudorandom key $K$. I wonder if it is possible to construct a permutation(shuffle) OPRF, where Alice inputs $X$, Bob inputs a random permutation $\pi$, and after the protocol ends, Alice gets $F_k(x_{(\pi(i))})$, and Bob receives the pseudorandom key $K$. Are there any works that implement such a protocol now? Or are there any similar works that achieve the goal with it? Thank you answer !

We know that OPRF is a two-party protocol, where Alice inputs $X = {x_1, ..., x_n}$, Bob has no input, and after executing the OPRF protocol, Alice gets $F_k(x_i)$, and Bob receives a pseudorandom key $K$. 

I wonder if it is possible to construct a permutation(shuffle) OPRF, where Alice inputs $X$, Bob inputs a random permutation $\pi$, and after the protocol ends, Alice gets $F_k(x_{(\pi(i))})$, and Bob receives the pseudorandom key $K$. 

Are there any works that implement such a protocol now? Or are there any similar works that achieve the goal with it?

Source Link
song
song
  • 11
  • 2

How to construct a permutation (shuffle) oblivious pseudorandom function?

We all know that OPRF is a two-party protocol, where Alice inputs $X = {x_1, ..., x_n}$, Bob has no input, and after executing the OPRF protocol, Alice gets $F_k(x_i)$, and Bob receives a pseudorandom key $K$. I wonder if it is possible to construct a permutation(shuffle) OPRF, where Alice inputs $X$, Bob inputs a random permutation $\pi$, and after the protocol ends, Alice gets $F_k(x_{(\pi(i))})$, and Bob receives the pseudorandom key $K$. Are there any works that implement such a protocol now? Or are there any similar works that achieve the goal with it? Thank you answer !