Short Signatures from Weaker Assumptions

DOI10.1007/978-3-642-25385-0_35zbMath1227.94079OpenAlexW1499733894WikidataQ59163697 ScholiaQ59163697MaRDI QIDQ3102214

Tibor Jager, Dennis Hofheinz, Eike Kiltz

Publication date: 2 December 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_35

zbMATH Keywords

digital signaturesprogrammable hash functionsRSA assumption\(q\)-DH assumption

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More ⋮ Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Lattice-based programmable hash functions and applications ⋮ On the impossibility of purely algebraic signatures ⋮ Non-Interactive Key Exchange ⋮ Efficient digital signatures from RSA without random oracles ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Generic security-amplifying methods of ordinary digital signatures ⋮ Confined guessing: new signatures from standard assumptions ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ On subset-resilient hash function families