Efficient signature schemes with tight reductions to the Diffie-Hellman problems

DOI10.1007/S00145-007-0549-3zbMath1132.68027OpenAlexW2012986054MaRDI QIDQ2463446

Stanislaw Jarecki, Eu-Jin Goh, Nan Wang, Jonathan N. Katz

Publication date: 6 December 2007

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-007-0549-3

zbMATH Keywords

signature schemesDiffie-Hellman assumptiondiscrete algorithmefficient schemes

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (26)

Tightly secure signatures from lossy identification schemes ⋮ Decaf: Eliminating Cofactors Through Point Compression ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ How to sample a discrete Gaussian (and more) from a random oracle ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Tight security for the generic construction of identity-based signature (in the multi-instance setting) ⋮ New technique for chosen-ciphertext security based on non-interactive zero-knowledge ⋮ Lossy Identification Schemes from Decisional RSA ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Zero-knowledge argument for simultaneous discrete logarithms ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ A tightly secure ID-based signature scheme under DL assumption in AGM ⋮ A non-interactive deniable authentication scheme based on designated verifier proofs ⋮ Twinkle: threshold signatures from DDH with full adaptive security ⋮ Toothpicks: more efficient fork-free two-round multi-signatures ⋮ Realizing Hash-and-Sign Signatures under Standard Assumptions ⋮ Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model ⋮ Identity-Based Deterministic Signature Scheme without Forking-Lemma ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Identity-based signatures in standard model ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Short identity-based signatures with tight security from lattices

This page was built for publication: Efficient signature schemes with tight reductions to the Diffie-Hellman problems