Signatures with Tight Multi-user Security from Search Assumptions

DOI10.1007/978-3-030-59013-0_24MaRDI QIDQ6485996zbMATH OpenFDO

Authors Jia-xin Pan, Magnus Ringerud

Publication date 22 December 2022

Published in 1511.94187 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59013-0_24

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A generic construction of tightly secure signatures in the multi-user setting
• Security of signature schemes in a multi-user setting
• More efficient digital signatures with tight multi-user security
• Tightly secure non-interactive multisignatures in the plain public key model
• Security for Signcryption: The Multi-User Model
• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
• Tightly secure signatures and public-key encryption
• Tightly Secure Signatures and Public-Key Encryption
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• scientific article; zbMATH DE number 1842500

Cited in

(9)

• MPSign: a signature from small-secret middle-product learning with errors
• More efficient digital signatures with tight multi-user security
• A generic construction of tightly secure signatures in the multi-user setting
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• Toothpicks: more efficient fork-free two-round multi-signatures
• Count corruptions, not users: improved tightness for signatures, encryption and authenticated key exchange
• Security of signature schemes in a multi-user setting
• Putting multi into multi-signatures: tight security for multiple signers
• Generic construction for tightly-secure signatures from discrete log

This page was built for publication: Signatures with Tight Multi-user Security from Search Assumptions

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