Instantiating the Hash-then-evaluate paradigm: Strengthening PRFs, PCFs, and OPRFs
Gespeichert in:
| Titel: | Instantiating the Hash-then-evaluate paradigm: Strengthening PRFs, PCFs, and OPRFs |
|---|---|
| Autoren: | Brzuska, Chris, Couteau, Geoffroy, Egger, Christoph, 1989, Karanko, Pihla, Meyer, Pierre |
| Quelle: | Cryptography and Communications. 17(5):1325-1366 |
| Schlagwörter: | Pseudorandom functions, Extremely lossy functions, Pseudorandom correlation functions, Random oracle model |
| Beschreibung: | We instantiate the hash-then-evaluate paradigm for pseudorandom functions (PRFs), PRF(k,x):=wPRF(k,RO(x)), which builds a PRF PRF from a weak PRF wPRF via a public pre-processing random oracle RO. In applications to secure multiparty computation (MPC), only the low-complexity wPRF performs secret-depending operations. Our construction replaces RO by f(kH,elf(x)), where f is a non-adaptive PRF and the key kH is public and thus known to the distinguishing adversary. We show that, perhaps surprisingly, several existing weak PRF candidates are plausibly also secure when their inputs are generated by f(kH,elf(.)). Firstly, analogous cryptanalysis applies (because pseudorandomness of f implies good statistical properties) and/or secondly an attack against the weak PRF with such pseudorandom inputs generated by f would imply surprising results such as key agreement from the hardness of the high-noise version of the Learning Parity with Noise (LPN) when implementing both wPRF and f from this assumption. Our simple transformation of replacing RO(·) public pre-processing by f(kH,elf(x)) public pre-processing applies to the entire family of PRF-style functions. Specifically, we obtain results for oblivious PRFs, which are a core building block for password-based authenticated key exchange (PAKE) and private set intersection (PSI) protocols, and we also obtain results for pseudorandom correlation functions (PCF), which are a key tool for silent oblivious transfer (OT) extension. |
| Dateibeschreibung: | electronic |
| Zugangs-URL: | https://research.chalmers.se/publication/547958 https://research.chalmers.se/publication/547958/file/547958_Fulltext.pdf |
| Datenbank: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | FullText | Text: Availability: 0 CustomLinks: – Url: https://research.chalmers.se/publication/547958# Name: EDS - SwePub (s4221598) Category: fullText Text: View record in SwePub – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edsswe&genre=article&issn=19362447&ISBN=&volume=17&issue=5&date=20250101&spage=1325&pages=1325-1366&title=Cryptography and Communications&atitle=Instantiating%20the%20Hash-then-evaluate%20paradigm%3A%20Strengthening%20PRFs%2C%20PCFs%2C%20and%20OPRFs&aulast=Brzuska%2C%20Chris&id=DOI:10.1007/s12095-025-00825-3 Name: Full Text Finder Category: fullText Text: Full Text Finder Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif MouseOverText: Full Text Finder – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Brzuska%20C Name: ISI Category: fullText Text: Nájsť tento článok vo Web of Science Icon: https://imagesrvr.epnet.com/ls/20docs.gif MouseOverText: Nájsť tento článok vo Web of Science |
|---|---|
| Header | DbId: edsswe DbLabel: SwePub An: edsswe.oai.research.chalmers.se.4fc619f3.f167.4583.97f8.ebcb67efddd9 RelevancyScore: 1115 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1114.736328125 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Instantiating the Hash-then-evaluate paradigm: Strengthening PRFs, PCFs, and OPRFs – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Brzuska%2C+Chris%22">Brzuska, Chris</searchLink><br /><searchLink fieldCode="AR" term="%22Couteau%2C+Geoffroy%22">Couteau, Geoffroy</searchLink><br /><searchLink fieldCode="AR" term="%22Egger%2C+Christoph%22">Egger, Christoph</searchLink>, 1989<br /><searchLink fieldCode="AR" term="%22Karanko%2C+Pihla%22">Karanko, Pihla</searchLink><br /><searchLink fieldCode="AR" term="%22Meyer%2C+Pierre%22">Meyer, Pierre</searchLink> – Name: TitleSource Label: Source Group: Src Data: <i>Cryptography and Communications</i>. 17(5):1325-1366 – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Pseudorandom+functions%22">Pseudorandom functions</searchLink><br /><searchLink fieldCode="DE" term="%22Extremely+lossy+functions%22">Extremely lossy functions</searchLink><br /><searchLink fieldCode="DE" term="%22Pseudorandom+correlation+functions%22">Pseudorandom correlation functions</searchLink><br /><searchLink fieldCode="DE" term="%22Random+oracle+model%22">Random oracle model</searchLink> – Name: Abstract Label: Description Group: Ab Data: We instantiate the hash-then-evaluate paradigm for pseudorandom functions (PRFs), PRF(k,x):=wPRF(k,RO(x)), which builds a PRF PRF from a weak PRF wPRF via a public pre-processing random oracle RO. In applications to secure multiparty computation (MPC), only the low-complexity wPRF performs secret-depending operations. Our construction replaces RO by f(kH,elf(x)), where f is a non-adaptive PRF and the key kH is public and thus known to the distinguishing adversary. We show that, perhaps surprisingly, several existing weak PRF candidates are plausibly also secure when their inputs are generated by f(kH,elf(.)). Firstly, analogous cryptanalysis applies (because pseudorandomness of f implies good statistical properties) and/or secondly an attack against the weak PRF with such pseudorandom inputs generated by f would imply surprising results such as key agreement from the hardness of the high-noise version of the Learning Parity with Noise (LPN) when implementing both wPRF and f from this assumption. Our simple transformation of replacing RO(·) public pre-processing by f(kH,elf(x)) public pre-processing applies to the entire family of PRF-style functions. Specifically, we obtain results for oblivious PRFs, which are a core building block for password-based authenticated key exchange (PAKE) and private set intersection (PSI) protocols, and we also obtain results for pseudorandom correlation functions (PCF), which are a key tool for silent oblivious transfer (OT) extension. – Name: Format Label: File Description Group: SrcInfo Data: electronic – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/547958" linkWindow="_blank">https://research.chalmers.se/publication/547958</link><br /><link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/547958/file/547958_Fulltext.pdf" linkWindow="_blank">https://research.chalmers.se/publication/547958/file/547958_Fulltext.pdf</link> |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsswe&AN=edsswe.oai.research.chalmers.se.4fc619f3.f167.4583.97f8.ebcb67efddd9 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s12095-025-00825-3 Languages: – Text: English PhysicalDescription: Pagination: PageCount: 42 StartPage: 1325 Subjects: – SubjectFull: Pseudorandom functions Type: general – SubjectFull: Extremely lossy functions Type: general – SubjectFull: Pseudorandom correlation functions Type: general – SubjectFull: Random oracle model Type: general Titles: – TitleFull: Instantiating the Hash-then-evaluate paradigm: Strengthening PRFs, PCFs, and OPRFs Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Brzuska, Chris – PersonEntity: Name: NameFull: Couteau, Geoffroy – PersonEntity: Name: NameFull: Egger, Christoph – PersonEntity: Name: NameFull: Karanko, Pihla – PersonEntity: Name: NameFull: Meyer, Pierre IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 19362447 – Type: issn-print Value: 19362455 – Type: issn-locals Value: SWEPUB_FREE – Type: issn-locals Value: CTH_SWEPUB Numbering: – Type: volume Value: 17 – Type: issue Value: 5 Titles: – TitleFull: Cryptography and Communications Type: main |
| ResultId | 1 |