Revision as of 19:32, 28 January 2024 edit Jasonkresch (talk \| contribs) 59 edits m →Sample OPRF Protocol: removed space from pseudocode ← Previous edit		Revision as of 19:37, 28 January 2024 edit undo Jasonkresch (talk \| contribs) 59 edits m Added link for quantum attacks Next edit →
Line 70: // Unblind the response to produce the result ECPoint result = ECMultiply(serverResponse, iinverse); // Hash the unblinded result to complete OPRF calculation Line 104: Because the elliptic curve point multiplication is computationally difficult to invert (like the [[discrete logarithm]] problem, the client cannot feasibly learn the server's secret from the response it produces. Note, however, that this function is vulnerable to [[~~quantum_attack~~Shor%27s_algorithm\|attacks]] by [[quantum computers]]. A client or third party in possession of a quantum computer could solve for the server's secret knowing the result it produced for a given input. ==== RSA Blind Signatures ====

Oblivious pseudorandom function: Difference between revisions