Revision as of 03:33, 2 February 2024 edit Jasonkresch (talk \| contribs) 59 edits Simplified opening sentence ← Previous edit		Revision as of 03:57, 2 February 2024 edit undo Jasonkresch (talk \| contribs) 59 edits m →Applications: changed word Next edit →
Line 31: These include [[PBKDF2\|password-based key derivation]], password-based [[key agreement]], password-hardening, untraceable [[CAPTCHA]]s, [[Password_manager\|password management]], [[Homomorphic_encryption\|homomorphic]] [[key management]], and [[Private_set_intersection\|private set intersection]].<ref name="oprf"/><ref>{{cite web \|last1=Krawczyk \|first1=Hugo \|title=Oblivious Pseudorandom Functions and Some (Magical) Applications \|url=https://www.cs.columbia.edu/~tal/4261/F19/hugo-columbia-oprf.pdf \|publisher=Columbia University \|access-date=31 January 2024}}</ref> An OPRF can be viewed as a special case of [[homomorphic encryption]], as it enables another party to compute a function over an [[Ciphertext\|encrypted input]] and produce a result (which remains encrypted) and ~~thereby~~therefore it learns nothing about what it computed. === Password-based key derivation ===

Oblivious pseudorandom function: Difference between revisions