Idealizing identity-based encryption

DOI10.1007/978-3-662-48797-6_21MaRDI QIDQ2811144zbMATH OpenOpenAlexFDO

Authors Dennis Hofheinz, Christian Matt, Ueli M. Maurer

Publication date 10 June 2016

Published in Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48797-6_21

zbMATH Keywords

identity-based encryptionimpossibility resultscomposabilitydefinitions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Practical Identity-Based Encryption Without Random Oracles
• Efficient selective identity-based encryption without random oracles
• Advances in Cryptology - EUROCRYPT 2004
• Universally composable identity-based encryption
• Relations Among Notions of Security for Identity Based Encryption Schemes

Cited in

(6)

• Overcoming impossibility results in composable security using interval-wise guarantees
• Forward-secure revocable identity-based encryption
• Universally composable identity-based encryption
• Identity Based Encryption Without Redundancy
• Making the Diffie-Hellman Protocol Identity-Based
• A Framework for Identity-Based Encryption with Almost Tight Security

This page was built for publication: Idealizing identity-based encryption

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