Advances in Cryptology - EUROCRYPT 2004
From MaRDI portal
Publication:5307256
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
Cited in
(only showing first 100 items - show all)- On the security of functional encryption in the generic group model
- Functional encryption against probabilistic queries: definition, construction and applications
- Constructions of CCA-Secure Revocable Identity-Based Encryption
- Anonymous certificate-based broadcast encryption with constant decryption cost
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Security-level switchable attribute-based encryption under the strictly weaker assumption family
- Efficient hybrid encryption from ID-based encryption
- Computing pairings using x-coordinates only
- Iterated random oracle: a universal approach for finding loss in security reduction
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
- Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
- Efficient public key encryption with equality test in the standard model
- Practical Chosen Ciphertext Secure Encryption from Factoring
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- An efficient IBE scheme with tight security reduction in the random oracle model
- Self-updatable encryption with short public parameters and its extensions
- Identity Based Group Signatures from Hierarchical Identity-Based Encryption
- Generalized hardness assumption for self-bilinear map with auxiliary information
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- A practical compiler for attribute-based encryption: new decentralized constructions and more
- Privacy-Aware Attribute-Based Encryption with User Accountability
- Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- Identity-based matchmaking encryption from standard assumptions
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Efficient identity-based encryption with hierarchical key-insulation from HIBE
- Certificateless message recovery signatures providing Girault's level-3 security
- On the bit security of the weak Diffie-Hellman problem
- Salvaging Merkle-Damgård for Practical Applications
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Batch verification of short signatures
- Advances in Cryptology – CRYPTO 2004
- Tightly secure (H)IBE in the random oracle model
- Efficient Identity-Based Encryption Without Random Oracles
- Verifiable Random Functions from Identity-Based Key Encapsulation
- A new framework for the design and analysis of identity-based identification schemes
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Non-zero inner product encryption with short ciphertexts and private keys
- A lattice-based certificateless public key encryption with equality test in standard model
- Efficient ID-Based Digital Signatures with Message Recovery
- An identity-based encryption scheme with compact ciphertexts
- Efficient selective identity-based encryption without random oracles
- Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks
- From selective to full security: semi-generic transformations in the standard model
- Reducing elliptic curve logarithms to logarithms in a finite field
- Identity-based broadcast encryption with shorter transmissions
- Attribute-based encryption schemes with constant-size ciphertexts
- Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
- Efficient attribute-based encryption with attribute revocation for assured data deletion
- New methods and abstractions for RSA-based forward secure signatures
- Forward-secure revocable identity-based encryption
- IRIBE: intrusion-resilient identity-based encryption
- Formal Security Treatments for Signatures from Identity-Based Encryption
- A provably secure certificate-based encryption scheme against malicious CA attacks in the standard model
- Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings
- Conditional Proxy Broadcast Re-Encryption
- All-but-many encryption
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey
- Security Analysis of the Strong Diffie-Hellman Problem
- 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
- Public key encryption with equality test via hash proof system
- Fully secure IBE with tighter reduction in prime order bilinear groups
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- How to construct secure proxy cryptosystem
- Pairings in Trusted Computing
- Fully secure functional encryption for inner products, from standard assumptions
- A strong provably secure IBE scheme without bilinear map
- Computing on authenticated data
- Generic Constructions of Stateful Public Key Encryption and Their Applications
- Privacy-preserving encryption scheme using DNA parentage test
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Robust property-preserving hash functions for Hamming distance and more
- On Constructing Pairing-Free Identity-Based Encryptions
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Upgrading to functional encryption
- Signcryption schemes with threshold unsigncryption, and applications
- The Twin Diffie-Hellman Problem and Applications
- Attribute-based re-encryption scheme in the standard model
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Public Key Cryptography - PKC 2006
- A timed-release proxy re-encryption scheme and its application to fairly-opened multicast communication
- Extensions of access structures and their cryptographic applications
- Secure Hierarchical Identity Based Encryption Scheme in the Standard Model
- Provably-secure time-bound hierarchical key assignment schemes
- New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem
- Programmable hash functions and their applications
- Robust encryption
- An identity-based key-encapsulation mechanism built on identity-based factors selection
- Doubly spatial encryption from DBDH
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs
- Public key encryption with equality test in the standard model
- Improved hidden vector encryption with short ciphertexts and tokens
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)
