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)

• Efficient hybrid encryption from ID-based encryption
• Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
• A practical compiler for attribute-based encryption: new decentralized constructions and more
• An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
• Identity Based Group Signatures from Hierarchical Identity-Based Encryption
• Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
• Verifiable Random Functions from Identity-Based Key Encapsulation
• Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks
• Formal Security Treatments for Signatures from Identity-Based Encryption
• Conditional Proxy Broadcast Re-Encryption
• Pairings in Trusted Computing
• Fully secure functional encryption for inner products, from standard assumptions
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Secure Hierarchical Identity Based Encryption Scheme in the Standard Model
• Upgrading to functional encryption
• Extensions of access structures and their cryptographic applications
• Multi-Identity Single-Key Decryption without Random Oracles
• Constraining pseudorandom functions privately
• Private puncturable PRFs from standard lattice assumptions
• Short tightly secure signatures for signing a vector of group elements: a new approach
• Revocable hierarchical identity-based encryption with adaptive security
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
• Déjà Q: encore! Un petit IBE
• Cryptanalysis of an identity based broadcast encryption scheme without random oracles
• Simulation-based selective opening security for receivers under chosen-ciphertext attacks
• From selective IBE to full IBE and selective HIBE
• A Separation Between Selective and Full-Identity Security Notions for Identity-Based Encryption
• Algebraic partitioning: fully compact and (almost) tightly secure cryptography
• Semi-adaptive security and bundling functionalities made generic and easy
• Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
• Verifiable random functions: relations to identity-based key encapsulation and new constructions
• The twin Diffie-Hellman problem and applications
• Tightly Secure IBE Under Constant-Size Master Public Key
• Bounds in various generalized settings of the discrete logarithm problem
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks
• Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
• Certificateless threshold cryptosystem secure against chosen-ciphertext attack
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Efficient traceable signatures in the standard model
• Efficient completely non-malleable and RKA secure public key encryptions
• Revocable hierarchical identity-based encryption via history-free approach
• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
• Revocable hierarchical identity-based encryption with shorter private keys and update keys
• New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
• CCA secure encryption supporting authorized equality test on ciphertexts in standard model and its applications
• An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment
• Identity-based encryption secure against selective opening attack
• Secure public-key encryption scheme without random oracles
• On the efficient implementation of pairing-based protocols
• Bonsai trees, or how to delegate a lattice basis
• Research on attacking a special elliptic curve discrete logarithm problem
• Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
• Anonymous HIBE with short ciphertexts: full security in prime order groups
• Chosen ciphertext secure fuzzy identity based encryption without ROM
• An Efficient ID-Based Proxy Signature Scheme from Pairings
• Identity-based authenticated encryption with identity confidentiality
• Revocable hierarchical identity-based encryption: history-free update, security against insiders, and short ciphertexts
• Efficient subtree-based encryption for fuzzy-entity data sharing
• Revocable hierarchical identity-based encryption
• Forward-secure ID based digital signature scheme with forward-secure private key generator
• Towards tightly secure lattice short signature and id-based encryption
• Tight security for the generic construction of identity-based signature (in the multi-instance setting)
• Identity-Based Threshold Key-Insulated Encryption without Random Oracles
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• Forward-secure identity-based encryption with direct chosen-ciphertext security in the standard model
• Wildcarded identity-based encryption from lattices
• Anonymous certificate-based broadcast encryption with constant decryption cost
• 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

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)