A fully-adaptive threshold partially-oblivious PRF

DOI10.1007/978-3-032-01901-1_18MaRDI QIDQ6862735zbMATH OpenFDO

Authors Ruben Baecker, Paul Gerhart, Daniel Rausch, Dominique Schröder

Publication date 6 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01901-1_18

zbMATH Keywords

adaptive securityuniversal composabilitythreshold cryptographypartially-oblivious PRF

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
• An algebraic framework for Diffie-Hellman assumptions
• An analysis of the algebraic group model
• Constructive cryptography -- a primer. (Abstract)
• GNUC: a new universal composability framework
• How to share a secret
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Security analysis of the WhatsApp end-to-end encrypted backup protocol
• TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
• The IITM model: a simple and expressive model for universal composability
• The algebraic group model and its applications
• Threshold PAKE with security against compromise of all servers
• Threshold raccoon: practical threshold signatures from standard lattice assumptions
• Universally composable security
• iUC: flexible universal composability made simple

Cited in

(1)

• Universally composable password-hardened encryption

This page was built for publication: A fully-adaptive threshold partially-oblivious PRF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862735)