Pages that link to "Item:Q2152049"

The following pages link to The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049):

Displaying 11 items.

• Generic construction for tightly-secure signatures from discrete log (Q820557) (← links)
• Signed (group) Diffie-Hellman key exchange with tight security (Q2082164) (← links)
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols (Q2120075) (← links)
• One-more unforgeability of blind ECDSA (Q2148761) (← links)
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
• On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)
• Chain Reductions for Multi-signatures and the HBMS Scheme (Q6045076) (← links)
• Multi-user CDH problems and the concrete security of \(\mathsf{NAXOS}\) and \(\mathsf{X3DH}\) (Q6057198) (← links)
• Half-aggregation of Schnorr signatures with tight reductions (Q6109444) (← links)
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols (Q6570528) (← links)
• Rogue-instance security for batch knowledge proofs (Q6581786) (← links)