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

DOI10.1007/978-3-030-95312-6_2zbMath1492.94185OpenAlexW4210485746MaRDI QIDQ2152147

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

standard modeldiscrete logarithm problemsignature schemespublic-key cryptographyrandom oracle modelcorrelation intractabilityDiffie-Hellman problemBoneh-Boyen signature schemeEDL signature scheme

Mathematics Subject Classification ID

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

Cites Work

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

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