A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption

DOI10.1007/978-3-030-95312-6_2MaRDI QIDQ2152147zbMATH OpenOpenAlexFDO

Authors Benoît Chevallier-Mames

Publication date 6 July 2022

Full work available at URL https://doi.org/10.1007/978-3-030-95312-6_2

zbMATH Keywords

discrete logarithm problempublic-key cryptographyrandom oracle modelstandard modelcorrelation intractabilitysignature schemesDiffie-Hellman problemBoneh-Boyen signature schemeEDL signature scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 2009970
• Short signatures without random oracles and the SDH assumption in bilinear groups
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Advances in Cryptology - EUROCRYPT 2004

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 177613 (Why is no real title available?)
• scientific article; zbMATH DE number 1303139 (Why is no real title available?)
• scientific article; zbMATH DE number 1031000 (Why is no real title available?)
• scientific article; zbMATH DE number 1942415 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• scientific article; zbMATH DE number 2009973 (Why is no real title available?)
• scientific article; zbMATH DE number 1759781 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• scientific article; zbMATH DE number 1842501 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• scientific article; zbMATH DE number 1406783 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A Practical and Tightly Secure Signature Scheme Without Hash Function
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A taxonomy of pairing-friendly elliptic curves
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient signature generation by smart cards
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• From obfuscation to the security of Fiat-Shamir for proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Identity-Based Encryption from the Weil Pairing
• Identity-based encryption from the Diffie-Hellman assumption
• Impossibility Proofs for RSA Signatures in the Standard Model
• Improving the exact security of digital signature schemes
• New directions in cryptography
• New generation of secure and practical RSA-based signatures
• Non-interactive composition of sigma-protocols via Share-then-Hash
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
• On the Generic Insecurity of the Full Domain Hash
• On the exact security of Schnorr-type signatures in the random oracle model
• Pairing-Friendly Elliptic Curves of Prime Order
• Programmable hash functions and their applications
• Public Key Cryptography - PKC 2006
• Public Key Cryptography – PKC 2004
• Random oracles with(out) programmability
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Security Analysis of the Strong Diffie-Hellman Problem
• Security proofs for signature schemes
• Short and Stateless Signatures from the RSA Assumption
• Short signatures from the Weil pairing
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Signatures from sequential-OR proofs
• The Cramer-Shoup Strong-RSA Signature Scheme Revisited
• The Eta Pairing Revisited
• The exact security of digital signatures -- how to sign with RSA and Rabin
• The random oracle methodology, revisited.

Cited in

(1)

• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction

This page was built for publication: A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152147)