Oblivious pseudorandom function: Difference between revisions

Content deleted Content added
ref 12 fix
m Verifiable OPRF: Made x an exponent.
Line 187:
Fortunately, most OPRFs support verifiability. For example, when using [[RSA]] blind signatures as the underlying construction, the client can, with the public key, verify the correctness of the resulting [[digital signature]].
 
When using [[Elliptic Curve]] or [[Diffie-Hellman]] based OPRFs, then knowing the public key ''y = g^<sup>x</sup>'', it is possible to use a second request to the OPRF server to create a [[zero-knowledge proof]] of correctness for the previous result.
 
=== Partially-oblivious PRF ===