On tightly secure primitives in the multi-instance setting

DOI10.1007/978-3-030-17253-4_20MaRDI QIDQ2289224zbMATH OpenOpenAlexFDO

Authors Ngoc Khanh Nguyen, Dennis Hofheinz

Publication date 28 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17253-4_20

zbMATH Keywords

signature schemestight reductions in cryptography

Mathematics Subject Classification ID

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

Recommendations

• On the impossibility of tight cryptographic reductions
• Another look at tightness
• How to prove security of a signature with a tighter security reduction
• On the Security Loss in Cryptographic Reductions
• Memory lower bounds of reductions revisited

Cited in

(7)

• Everybody's a target: scalability in public-key encryption
• Tightness subtleties for multi-user PKE notions
• OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss
• Another look at tightness
• Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
• On the impossibility of tight cryptographic reductions
• Lifting standard model reductions to common setup assumptions

This page was built for publication: On tightly secure primitives in the multi-instance setting

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