Identity Based Encryption Without Redundancy

DOI10.1007/11496137_20MaRDI QIDQ3593152zbMATH OpenOpenAlexFDO

Authors Benoît Libert, Jean-Jacques Quisquater

Publication date 24 September 2007

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11496137_20

zbMATH Keywords

ID-based encryptionprovable securityredundancies

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Identity-based encryption
• Efficient Identity-Based Encryption with Tight Security Reduction
• Practical Identity-Based Encryption Without Random Oracles
• Idealizing identity-based encryption
• Identity based broadcast encryption without pairings
• Identity-based authenticated encryption with identity confidentiality

Cited in

(6)

• A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
• The twin Diffie-Hellman problem and applications
• New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
• New technique for chosen-ciphertext security based on non-interactive zero-knowledge
• An efficient and provably secure certificate-based encryption scheme
• The Twin Diffie-Hellman Problem and Applications

Describes a project that uses

Uses Software

• KEM-DEM

This page was built for publication: Identity Based Encryption Without Redundancy

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