Efficient Identity-Based Encryption Without Random Oracles
From MaRDI portal
Publication:5385725
DOI10.1007/11426639_7zbMath1137.94360OpenAlexW1592092778MaRDI QIDQ5385725
Publication date: 6 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11426639_7
Related Items (only showing first 100 items - show all)
Efficient Identity-Based Outsider Anonymous Public-Key Trace and Revoke with Constant Ciphertext-Size and Fast Decryption ⋮ Generic Constructions of Revocable Identity-Based Encryption ⋮ Hierarchical Identity-Based Encryption with Tight Multi-challenge Security ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ A more efficient accountable authority IBE scheme under the DL assumption ⋮ Boneh-Boyen IBE ⋮ Hierarchical Conditional Proxy Re-Encryption: A New Insight of Fine-Grained Secure Data Sharing ⋮ New Proof for BKP IBE Scheme and Improvement in the MIMC Setting ⋮ Recovering Attacks Against Linear Sketch in Fuzzy Signature Schemes of ACNS 2015 and 2016 ⋮ Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions ⋮ Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ IBE Under $$k$$-LIN with Shorter Ciphertexts and Private Keys ⋮ Constructions of CCA-Secure Revocable Identity-Based Encryption ⋮ Reducing elliptic curve logarithms to logarithms in a finite field ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks ⋮ A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function ⋮ Practical Threshold Signatures Without Random Oracles ⋮ Formal Security Treatments for Signatures from Identity-Based Encryption ⋮ Traceable Identity-Based Group Signature ⋮ An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions ⋮ Efficient One-Round Key Exchange in the Standard Model ⋮ New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters ⋮ Certificate-Based Signature Schemes without Pairings or Random Oracles ⋮ Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Two Efficient Tag-Based Encryption Schemes on Lattices ⋮ New Certificateless Public Key Encryption Secure Against Malicious KGC Attacks in the Standard Model ⋮ SecHome: A Secure Large-Scale Smart Home System Using Hierarchical Identity Based Encryption ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Cost-Effective and Scalable Data Sharing in Cloud Storage Using Hierarchical Attribute-Based Encryption with Forward Security ⋮ Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model ⋮ Revocable Identity-Based Encryption Revisited: Security Model and Construction ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages ⋮ Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies ⋮ Efficient Certificateless KEM in the Standard Model ⋮ Factor-4 and 6 compression of cyclotomic subgroups of and ⋮ Tightly Secure IBE Under Constant-Size Master Public Key ⋮ Compact Group Signatures Without Random Oracles ⋮ Practical Identity-Based Encryption Without Random Oracles ⋮ Sequential Aggregate Signatures and Multisignatures Without Random Oracles ⋮ Programmable Hash Functions and Their Applications ⋮ Unlinkable Randomizable Signature and Its Application in Group Signature ⋮ Multi-Identity Single-Key Decryption without Random Oracles ⋮ Tracing Malicious Proxies in Proxy Re-encryption ⋮ Identity-Based Online/Offline Encryption ⋮ Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Generic constructions of integrated PKE and PEKS ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Proxy Re-signature Schemes Without Random Oracles ⋮ A Certificate-Based Proxy Cryptosystem with Revocable Proxy Decryption Power ⋮ Mutative Identity-Based Signatures or Dynamic Credentials Without Random Oracles ⋮ Attribute-Based Signatures ⋮ Identity-Based Threshold Key-Insulated Encryption without Random Oracles ⋮ CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption ⋮ Multi-identity management for identity-based cryptography ⋮ Adaptive-ID Secure Revocable Identity-Based Encryption ⋮ An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations ⋮ Practical Short Signature Batch Verification ⋮ Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening ⋮ Tightly secure hierarchical identity-based encryption ⋮ Realizing Hash-and-Sign Signatures under Standard Assumptions ⋮ Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme ⋮ Verifiable Random Functions from Identity-Based Key Encapsulation ⋮ Building Key-Private Public-Key Encryption Schemes ⋮ An efficient certificateless multi-receiver threshold decryption scheme ⋮ On the Theoretical Gap between Group Signatures with and without Unlinkability ⋮ Certified Encryption Revisited ⋮ Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems ⋮ Anonymity from Public Key Encryption to Undeniable Signatures ⋮ Verifiable Security of Boneh-Franklin Identity-Based Encryption ⋮ Efficient Identity-Based Signcryption in the Standard Model ⋮ Secure Obfuscation of Encrypted Verifiable Encrypted Signatures ⋮ Identity-Based Trace and Revoke Schemes ⋮ Security of Verifiably Encrypted Signatures and a Construction without Random Oracles ⋮ Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures ⋮ Identity Based Group Signatures from Hierarchical Identity-Based Encryption ⋮ Forward-Secure Group Signatures from Pairings ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Identity-Based Combined Public Key Schemes for Signature, Encryption, and Signcryption ⋮ New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts ⋮ Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs ⋮ Sanitizable Signatures Revisited ⋮ Secure Hierarchical Identity Based Encryption Scheme in the Standard Model ⋮ Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures ⋮ Optimal Online/Offline Signature: How to Sign a Message without Online Computation ⋮ Round-Optimal Blind Signatures from Waters Signatures ⋮ Secure Proxy Multi-signature Scheme in the Standard Model ⋮ Server-Aided Verification Signatures: Definitions and New Constructions ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings
This page was built for publication: Efficient Identity-Based Encryption Without Random Oracles
