Tight Proofs for Signature Schemes without Random Oracles

DOI10.1007/978-3-642-20465-4_12zbMath1281.94087OpenAlexW1529156313MaRDI QIDQ3003383

Sven Schäge

Publication date: 27 May 2011

Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_12

zbMATH Keywords

standard modeltight securitySDHsignature classSRSA

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (15)

Another Look at Tightness ⋮ Tightly secure signatures and public-key encryption ⋮ Optimal tightness for chain-based unique signatures ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ On tight security proofs for Schnorr signatures ⋮ Attribute-based anonymous credential: optimization for single-use and multi-use ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Programmable hash functions and their applications ⋮ Tightly secure ring signatures in the standard model ⋮ Compact structure-preserving signatures with almost tight security ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Tight security for signature schemes without random oracles ⋮ Verifiable random functions with optimal tightness ⋮ Identity-based signatures in standard model ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach

This page was built for publication: Tight Proofs for Signature Schemes without Random Oracles