Identity Based Encryption Without Redundancy

DOI10.1007/11496137_20zbMath1126.68405OpenAlexW2121879207MaRDI QIDQ3593152

Jean-Jacques Quisquater, Benoît Libert

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

provable securityID-based encryptionredundancies

Mathematics Subject Classification ID

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

Related Items

An Efficient and Provably Secure Certificate-Based Encryption Scheme ⋮ New technique for chosen-ciphertext security based on non-interactive zero-knowledge ⋮ New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem ⋮ The Twin Diffie-Hellman Problem and Applications ⋮ A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model ⋮ The twin Diffie-Hellman problem and applications

Uses Software

• KEM-DEM