Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311549
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient subtree-based encryption for fuzzy-entity data sharing
- Fully secure unbounded zero inner product encryption with short ciphertexts and keys
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Adaptively secure identity-based encryption from middle-product learning with errors
- Towards tightly secure lattice short signature and id-based encryption
- Identity-Based Parallel Key-Insulated Encryption Without Random Oracles: Security Notions and Construction
- Identity-Based Threshold Key-Insulated Encryption without Random Oracles
- Adaptively secure identity-based broadcast encryption with constant size private keys and ciphertexts from the subgroups
- Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
- Efficient Tate pairing computation using double-base chains
- Confined guessing: new signatures from standard assumptions
- Identity Based Encryption Without Redundancy
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- scientific article; zbMATH DE number 6492475 (Why is no real title available?)
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
- Deterministic public-key encryption for adaptively-chosen plaintext distributions
- Identity-based matchmaking encryption from standard assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Tightly secure (H)IBE in the random oracle model
- Efficient Identity-Based Encryption Without Random Oracles
- Ephemeral-secret-leakage secure ID-based three-party authenticated key agreement protocol for mobile distributed computing environments
- Cocks IBE scheme
- Proxy Re-signature Schemes Without Random Oracles
- 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
- Reducing elliptic curve logarithms to logarithms in a finite field
- Identity-based broadcast encryption with shorter transmissions
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Security proofs for identity-based identification and signature schemes
- Formal Security Treatments for Signatures from Identity-Based Encryption
- Locally verifiable signature and key aggregation
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- 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
- Beyond software watermarking: traitor-tracing for pseudorandom functions
- Lower bounds on assumptions behind registration-based encryption
- A strong provably secure IBE scheme without bilinear map
- Privacy-preserving encryption scheme using DNA parentage test
- On Constructing Pairing-Free Identity-Based Encryptions
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Adaptively secure distributed PRFs from LWE
- Secure Hierarchical Identity Based Encryption Scheme in the Standard Model
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- Programmable hash functions and their applications
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Fast, compact, and expressive attribute-based encryption
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Leakage-resilient functional encryption via pair encodings
- Fast, compact, and expressive attribute-based encryption
- Identity-Based Hierarchical Key-Insulated Encryption Without Random Oracles
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- A survey on functional encryption
- On tight security proofs for Schnorr signatures
- Secure identity-based encryption in the quantum random oracle model
- Lattice-based completely non-malleable public-key encryption in the standard model
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Cryptanalysis of an identity based broadcast encryption scheme without random oracles
- Augmented random oracles
- Generic constructions of revocable identity-based encryption
- Identity-Based Encryption Resilient to Auxiliary Leakage under the Decisional Linear Assumption
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- Fully CCA2 secure identity based broadcast encryption without random oracles
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Efficient IBE with tight reduction to standard assumption in the multi-challenge setting
- Semi-adaptive security and bundling functionalities made generic and easy
- Shorter identity-based encryption via asymmetric pairings
- Tightly Secure IBE Under Constant-Size Master Public Key
- Breaking an ID-based encryption based on discrete logarithm and factorization problems
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Protecting against key-exposure: strongly key-insulated encryption with optimal threshold
- An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Extended dual system group and shorter unbounded hierarchical identity based encryption
- Predictable arguments of knowledge
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Verifiable random functions from standard assumptions
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Identity-based encryption from LWE with more compact master public key
- Registered functional encryptions from pairings
- Time-lock puzzles with efficient batch solving
- Two-dimensional representation of cover free families and its applications: short signatures and more
- Compact structure-preserving signatures with almost tight security
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Verifiable random functions with optimal tightness
- Adaptively secure constrained pseudorandom functions in the standard model
- Secure administration of cryptographic role-based access control for large-scale cloud storage systems
- Attribute-based signatures
- An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model
- Cocks’ Identity-Based Encryption in the Standard Model, via Obfuscation Techniques (Short Paper)
- Secure public-key encryption scheme without random oracles
- Verifiable security of Boneh-Franklin identity-based encryption
- Relations between semantic security and anonymity in identity-based encryption
- Bonsai trees, or how to delegate a lattice basis
This page was built for publication: Advances in Cryptology – CRYPTO 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311549)
