Universally composable password-hardened encryption

DOI10.1007/978-981-95-5119-4_8MaRDI QIDQ7232691zbMATH OpenFDO

Authors Behzad Abdolmaleki, Ruben Baecker, Paul Gerhart, Mike Graf, Mojtaba Khalili, Daniel Rausch, Dominique Schröder

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5119-4_8

zbMATH Keywords

secure TPHE scheme,

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• scientific article; zbMATH DE number 1304288 (Why is no real title available?)
• scientific article; zbMATH DE number 1962163 (Why is no real title available?)
• A Secure Threshold Anonymous Password-Authenticated Key Exchange Protocol
• A fully-adaptive threshold partially-oblivious PRF
• An algebraic framework for Diffie-Hellman assumptions
• Constructive cryptography -- a primer. (Abstract)
• Efficient password authenticated key exchange via oblivious transfer
• GNUC: a new universal composability framework
• How to share a secret
• Key homomorphic PRFs and their applications
• Key rotation for authenticated encryption
• Memento: how to reconstruct your secrets from a single password in a hostile environment
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• Password-authenticated public-key encryption
• Perfect Non-interactive Zero Knowledge for NP
• Practical threshold password-authenticated secret sharing protocol
• Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key
• Robust password-protected secret sharing
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Round-reduced modular construction of asymmetric password-authenticated key exchange
• Separating symmetric and asymmetric password-authenticated key exchange
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
• The IITM model: a simple and expressive model for universal composability
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The ``Quantum annoying property of password-authenticated key exchange protocols
• Threshold PAKE with security against compromise of all servers
• Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions
• Universally composable security
• Updatable encryption with post-compromise security
• Virtual smart cards: how to sign with a password and a server
• iUC: flexible universal composability made simple

This page was built for publication: Universally composable password-hardened encryption

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