Revision as of 14:21, 31 January 2024 edit Jasonkresch (talk \| contribs) 59 edits Added see also section, and categories ← Previous edit		Revision as of 14:31, 31 January 2024 edit undo Jasonkresch (talk \| contribs) 59 edits m Added link to secure multi-party computation Next edit →
Line 3: == Overview == An Oblivious Pseudorandom Function (OPRF) is a [[Cryptography\|cryptographic]] function, similar to a [[HMAC\|keyed-hash function]], but with the distinction that an OPRF is [[Secure_multi-party_computation\|cooperatively ~~calculated~~computed]] by two parties.<ref name="oprf">{{cite journal \|last1=Casacuberta \|first1=Sílvia \|last2=Hesse \|first2=Julia \|last3=Lehmann \|first3=Anja \|title=SoK: Oblivious Pseudorandom Functions \|journal=Cryptology ePrint Archive \|date=2022 \|volume=Paper 2022/302 \|url=https://eprint.iacr.org/2022/302}}</ref> Specifically, an OPRF is any function with the following properties: Line 214: * [[Pseudorandom_function_family\|Pseudorandom Function]] * [[Oblivious Transfer]] * [[Secure_multi-party_computation\|Secure multi-party computation]] == References ==

Oblivious pseudorandom function: Difference between revisions