A Practical and Tightly Secure Signature Scheme Without Hash Function

DOI10.1007/11967668_22zbMath1177.94183OpenAlexW1558807623MaRDI QIDQ5385962

Marc Joye, Benoît Chevallier-Mames

Publication date: 17 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.6168

zbMATH Keywords

standard modeldigital signaturestight reductionCramer-Shoup signature schemestrong RSA assumptionon-line/off-line signaturesGennaro-Halevi-Rabin signature scheme

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Tightly secure signatures and public-key encryption ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ How (not) to design strong-RSA signatures ⋮ Programmable hash functions and their applications ⋮ Programmable Hash Functions and Their Applications ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Tight security for signature schemes without random oracles ⋮ Identity-based signatures in standard model ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ An Efficient On-Line/Off-Line Signature Scheme without Random Oracles

This page was built for publication: A Practical and Tightly Secure Signature Scheme Without Hash Function