Revocable identity-based encryption from codes with rank metric

DOI10.1007/978-3-319-76953-0_23MaRDI QIDQ2287544zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 21 January 2020

Full work available at URL https://doi.org/10.1007/978-3-319-76953-0_23

zbMATH Keywords

code-based cryptographyidentity-based encryptionkey revocationLRPC codesrank metricRSD problem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Identity-based encryption from codes with rank metric
• Revocable Identity-Based Encryption from Lattices
• Revocable identity-based encryption from the computational Diffie-Hellman problem
• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
• Efficient revocable identity-based encryption via subset difference methods

Cited in

(4)

• Identity-based encryption from codes with rank metric
• Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
• Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
• Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance

This page was built for publication: Revocable identity-based encryption from codes with rank metric

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