Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/B97182zbMATH Open1122.94355OpenAlexW2477185671MaRDI QIDQ5307256FDOQ5307256

Authors: Dan Boneh, Xavier Boyen 

Publication date: 25 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• Efficient selective identity-based encryption without random oracles
• Efficient Identity-Based Encryption Without Random Oracles
• Advances in Cryptology – CRYPTO 2004
• Practical Identity-Based Encryption Without Random Oracles
• An efficient IBE scheme with tight security reduction in the random oracle model

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (only showing first 100 items - show all)

• A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
• Generalized hardness assumption for self-bilinear map with auxiliary information
• Efficient public key encryption with equality test in the standard model
• Identity-based matchmaking encryption from standard assumptions
• Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
• Efficient identity-based encryption with hierarchical key-insulation from HIBE
• A lattice-based certificateless public key encryption with equality test in standard model
• Non-zero inner product encryption with short ciphertexts and private keys
• Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
• Efficient attribute-based encryption with attribute revocation for assured data deletion
• All-but-many encryption
• Public key encryption with equality test via hash proof system
• Predicate signatures from pair encodings via dual system proof technique
• Fully secure functional encryption with a large class of relations from the decisional linear assumption
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• Short signatures from Diffie-Hellman: realizing almost compact public key
• Signcryption schemes with threshold unsigncryption, and applications
• New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
• Robust encryption
• Doubly spatial encryption from DBDH
• Public key encryption with equality test in the standard model
• Leakage-resilient functional encryption via pair encodings
• Rerandomizable signatures under standard assumption
• Improved (hierarchical) inner-product encryption from lattices
• Compact E-Cash and Simulatable VRFs Revisited
• New Anonymity Notions for Identity-Based Encryption
• Generic constructions of revocable identity-based encryption
• Revocable policy-based chameleon hash
• Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
• Novel generic construction of leakage-resilient PKE scheme with CCA security
• (Dual) server-aided revocable attribute-based encryption with decryption key exposure resistance
• Identity-Based Online/Offline Encryption
• Novel updatable identity-based hash proof system and its applications
• Identity-based encryption with leakage-amplified chosen-ciphertext attacks security
• Time-and-ID-based proxy reencryption scheme
• Wildcarded identity-based encryption
• A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system
• Extended dual system group and shorter unbounded hierarchical identity based encryption
• New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
• Statistical ZAPR arguments from bilinear maps
• Flexible attribute-based proxy re-encryption for efficient data sharing
• Updatable public key encryption in the standard model
• Identity-based encryption and hierarchical identity-based encryption
• Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
• Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
• Verifiable random functions with optimal tightness
• Certificateless proxy re-encryption without pairings
• Secret handshakes with dynamic expressive matching policy
• Relations between semantic security and anonymity in identity-based encryption
• Practical chosen ciphertext secure encryption from factoring
• Adaptively secure MPC with sublinear communication complexity
• Generic construction of server-aided revocable hierarchical identity-based encryption
• Functional encryption for computational hiding in prime order groups via pair encodings
• Multi-identity management for identity-based cryptography
• Revocable identity-based encryption with server-aided ciphertext evolution
• Tag-KEM/DEM: A new framework for hybrid encryption
• Efficient statically-secure large-universe multi-authority attribute-based encryption
• Idealizing identity-based encryption
• Improved inner-product encryption with adaptive security and full attribute-hiding
• Efficient identity-based threshold decryption scheme from bilinear pairings
• New constructions of hinting PRGs, OWFs with encryption, and more
• Don't tamper with dual system encryption. Beyond polynomial related-key security of IBE
• Constructions of CCA-Secure Revocable Identity-Based Encryption
• Computing pairings using \(x\)-coordinates only
• Practical Chosen Ciphertext Secure Encryption from Factoring
• Privacy-Aware Attribute-Based Encryption with User Accountability
• An efficient IBE scheme with tight security reduction in the random oracle model
• Self-updatable encryption with short public parameters and its extensions
• Salvaging Merkle-Damgård for Practical Applications
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Batch verification of short signatures
• Certificateless message recovery signatures providing Girault's level-3 security
• On the bit security of the weak Diffie-Hellman problem
• CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
• Efficient ID-Based Digital Signatures with Message Recovery
• A new framework for the design and analysis of identity-based identification schemes
• Reducing elliptic curve logarithms to logarithms in a finite field
• An identity-based encryption scheme with compact ciphertexts
• Efficient selective identity-based encryption without random oracles
• Identity-based broadcast encryption with shorter transmissions
• Attribute-based encryption schemes with constant-size ciphertexts
• IRIBE: intrusion-resilient identity-based encryption
• A provably secure certificate-based encryption scheme against malicious CA attacks in the standard model
• Security Analysis of the Strong Diffie-Hellman Problem
• Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings
• A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
• Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
• On Constructing Pairing-Free Identity-Based Encryptions
• How to construct secure proxy cryptosystem
• The Twin Diffie-Hellman Problem and Applications
• A strong provably secure IBE scheme without bilinear map
• Robust property-preserving hash functions for Hamming distance and more
• Improved proxy re-encryption schemes with applications to secure distributed storage
• Predicate encryption supporting disjunctions, polynomial equations, and inner products
• Provably-secure time-bound hierarchical key assignment schemes
• Programmable hash functions and their applications
• Improved hidden vector encryption with short ciphertexts and tokens
• Inner-product encryption under standard assumptions

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004

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