Making the identity-based Diffie-Hellman key exchange efficiently revocable

DOI10.1007/978-3-031-44469-2_9MaRDI QIDQ6619930zbMATH OpenFDO

Authors Kohei Nakagawa, Atsushi Fujioka, Akira Nagai, Junichi Tomida, Keita Xagawa, Kan Yasuda

Publication date 16 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-44469-2_9

zbMATH Keywords

ARM Cortex-M MCUelliptic-curve cryptographygeneral forking lemmaidentity-based authenticated-key exchangepairing-freeprotocol implementationsrandom oracle modelrevocable

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Revocable identity-based encryption from the computational Diffie-Hellman problem
• Making the Diffie-Hellman Protocol Identity-Based
• Efficient revocable identity-based encryption via subset difference methods
• Revocable IBE systems with almost constant-size key update
• One-round identity-based key exchange with perfect forward security

Cites work

• Adaptive-ID Secure Revocable Identity-Based Encryption
• Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
• Advances in Cryptology - EUROCRYPT 2004
• Constructions of CCA-Secure Revocable Identity-Based Encryption
• Efficient revocable identity-based encryption via subset difference methods
• Efficient revocable identity-based encryption with short public parameters
• Efficient signature generation by smart cards
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Ephemeral key leakage resilient and efficient ID-AKEs that can share identities, private and master keys
• Generic constructions of revocable identity-based encryption
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Identity-based cryptosystems and signature schemes
• Key dependent message security for revocable identity-based encryption and identity-based encryption
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
• Making the Diffie-Hellman Protocol Identity-Based
• New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
• Pairing-Friendly Elliptic Curves of Prime Order
• Public Key Cryptography - PKC 2005
• Revocable identity-based encryption from the computational Diffie-Hellman problem
• Revocable identity-based encryption revisited: security model and construction
• Security arguments for digital signatures and blind signatures
• Strongly secure identity-based authenticated key agreement protocols without bilinear pairings
• Strongly secure identity-based key exchange with single pairing operation
• Updating key size estimations for pairings

This page was built for publication: Making the identity-based Diffie-Hellman key exchange efficiently revocable

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