Efficient signature schemes with tight reductions to the Diffie-Hellman problems
From MaRDI portal
Publication:2463446
This paper presents an analysis of two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model. The technique is developed with sound theoretical details and it can be applied to a wide variety of settings to yield more efficient cryptographic schemes. No experiments are performed for illustration.
Recommendations
- scientific article; zbMATH DE number 2009970
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- Tight proofs for signature schemes without random oracles
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
Cited in
(54)- A non-interactive deniable authentication scheme based on designated verifier proofs
- Efficient undeniable signature schemes based on ideal arithmetic in quadratic orders
- Optimal security proofs for full domain hash. Revisited
- Zero-knowledge argument for simultaneous discrete logarithms
- Short identity-based signatures with tight security from lattices
- Efficient key recovery for all HFE signature variants
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- 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
- Identity-based signatures in standard model
- Short tightly secure signatures for signing a vector of group elements: a new approach
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Practical dynamic group signatures without knowledge extractors
- scientific article; zbMATH DE number 1618043 (Why is no real title available?)
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Optimal security proofs for signatures from identification schemes
- How to construct efficient signcryption schemes on elliptic curves
- Iterated random oracle: a universal approach for finding loss in security reduction
- Signcryption schemes based on the Diffie-Hellman problem
- Tight proofs for signature schemes without random oracles
- Identity-based deterministic signature scheme without forking-lemma
- Tightly secure signatures from lossy identification schemes
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
- Decaf: eliminating cofactors through point compression
- Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- scientific article; zbMATH DE number 2009970 (Why is no real title available?)
- scientific article; zbMATH DE number 1857534 (Why is no real title available?)
- Tighter Reductions for Forward-Secure Signature Schemes
- W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
- A constant-size signature scheme with tighter reduction from CDH assumption
- On methods of shortening ElGamal-type signatures
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
- Lossy identification schemes from decisional RSA
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- Security in Communication Networks
- Enhanced short signature scheme with hybrid problems
- Public Key Cryptography - PKC 2005
- Public Key Cryptography – PKC 2004
- Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice
- Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
- Half-aggregation of Schnorr signatures with tight reductions
- How to sample a discrete Gaussian (and more) from a random oracle
- A tightly secure ID-based signature scheme under DL assumption in AGM
- Twinkle: threshold signatures from DDH with full adaptive security
- Toothpicks: more efficient fork-free two-round multi-signatures
- T-Spoon: tightly secure two-round multi-signatures with key aggregation
- Tightly secure non-interactive BLS multi-signatures
- Count corruptions, not users: improved tightness for signatures, encryption and authenticated key exchange
- SoK: signatures with randomizable keys
- Aggregate signatures tightly secure under adaptive corruptions
- Putting multi into multi-signatures: tight security for multiple signers
This page was built for publication: Efficient signature schemes with tight reductions to the Diffie-Hellman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463446)
