Advances in Cryptology - EUROCRYPT 2004
From MaRDI portal
Publication:5307256
DOI10.1007/b97182zbMath1122.94355OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307256
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
Related Items
A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model, Generic Constructions of Revocable Identity-Based Encryption, The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO, CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles, Boneh-Boyen IBE, Sakai-Kasahara IBE, New Proof for BKP IBE Scheme and Improvement in the MIMC Setting, Generic Framework for Attribute-Based Group Signature, Reducing elliptic curve logarithms to logarithms in a finite field, Witness-succinct universally-composable SNARKs, A practical compiler for attribute-based encryption: new decentralized constructions and more, Unique-path identity based encryption with applications to strongly secure messaging, Functional encryption against probabilistic queries: definition, construction and applications, GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs, On the security of functional encryption in the generic group model, Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey, On Constructing Pairing-Free Identity-Based Encryptions, Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors, Optimal generic attack against basic Boneh-Boyen signatures, Forward-secure encryption with fast forwarding, You can sign but not decrypt: hierarchical integrated encryption and signature, Identity-based matchmaking encryption from standard assumptions, Identity-Based Encryption Resilient to Auxiliary Leakage under the Decisional Linear Assumption, A survey on functional encryption, Lattice-based programmable hash functions and applications, Complementary set encryption for privacy-preserving data consolidation, Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys, Blind Identity-Based Encryption and Simulatable Oblivious Transfer, Revocable Identity-Based Encryption Revisited: Security Model and Construction, Improved (Hierarchical) Inner-Product Encryption from Lattices, Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs, Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits, Constraining Pseudorandom Functions Privately, Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash, Tightly Secure IBE Under Constant-Size Master Public Key, Private Puncturable PRFs from Standard Lattice Assumptions, A Timed-Release Proxy Re-encryption Scheme and Its Application to Fairly-Opened Multicast Communication, Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption, Identity-Based Online/Offline Encryption, Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption, Watermarking cryptographic functionalities from standard lattice assumptions, Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation, Discrete logarithm problems with auxiliary inputs, Generic constructions of integrated PKE and PEKS, Efficient ID-Based Digital Signatures with Message Recovery, The Twin Diffie-Hellman Problem and Applications, 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, Adaptive oblivious transfer with access control from lattice assumptions, Practical Chosen Ciphertext Secure Encryption from Factoring, Realizing Hash-and-Sign Signatures under Standard Assumptions, Salvaging Merkle-Damgård for Practical Applications, Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme, Verifiable Random Functions from Identity-Based Key Encapsulation, Adaptively secure MPC with sublinear communication complexity, Building Key-Private Public-Key Encryption Schemes, Conditional Proxy Broadcast Re-Encryption, On the Theoretical Gap between Group Signatures with and without Unlinkability, Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems, New Anonymity Notions for Identity-Based Encryption, New Anonymity Notions for Identity-Based Encryption, Chosen-Ciphertext Secure Proxy Re-encryption without Pairings, Secure Hierarchical Identity Based Encryption Scheme in the Standard Model, Optimal Online/Offline Signature: How to Sign a Message without Online Computation, Unnamed Item, Another Look at Tightness, Short Transitive Signatures for Directed Trees, Short Attribute-Based Signatures for Threshold Predicates, Extended dual system group and shorter unbounded hierarchical identity based encryption, Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles, Predicate encryption supporting disjunctions, polynomial equations, and inner products, Semi-adaptive Security and Bundling Functionalities Made Generic and Easy, How to construct secure proxy cryptosystem, An Efficient and Provably Secure Certificate-Based Encryption Scheme, Certificateless Proxy Re-Encryption Without Pairings, Improved Identity-Based Online/Offline Encryption, Constructions of CCA-Secure Revocable Identity-Based Encryption, Efficient revocable identity-based encryption with short public parameters, Efficient revocable identity-based encryption via subset difference methods, Public key encryption with equality test in the standard model, Short signatures from Diffie-Hellman: realizing almost compact public key, Adaptively secure certificate-based broadcast encryption and its application to cloud storage service, Forward-secure revocable identity-based encryption, Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption, Blind key-generation attribute-based encryption for general predicates, Simulation-based selective opening security for receivers under chosen-ciphertext attacks, Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, Towards Tightly Secure Lattice Short Signature and Id-Based Encryption, Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting, Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps, Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice, Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction, CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts, Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks, Formal Security Treatments for Signatures from Identity-Based Encryption, Generic Constructions of Stateful Public Key Encryption and Their Applications, Generic constructions of identity-based and certificateless kEMs, Short signatures without random oracles and the SDH assumption in bilinear groups, Wildcarded identity-based encryption, Inner-product encryption under standard assumptions, Improved hidden vector encryption with short ciphertexts and tokens, Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions, Ring-based identity based encryption -- asymptotically shorter MPK and tighter security, Updatable public key encryption in the standard model, New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters, Signcryption schemes with threshold unsigncryption, and applications, Identity-Based Blind Signature from Lattices in Standard Model, Transforming Hidden Vector Encryption Schemes from Composite to Prime Order Groups, Improved proxy re-encryption schemes with applications to secure distributed storage, SecHome: A Secure Large-Scale Smart Home System Using Hierarchical Identity Based Encryption, Generic Construction of Bounded-Collusion IBE via Table-Based ID-to-Key Map, Certificateless threshold cryptosystem secure against chosen-ciphertext attack, Adaptively Secure Non-interactive Threshold Cryptosystems, Tag-KEM/DEM: A new framework for hybrid encryption, Security Analysis of the Strong Diffie-Hellman Problem, Practical Identity-Based Encryption Without Random Oracles, Programmable Hash Functions and Their Applications, An Efficient ID-Based Proxy Signature Scheme from Pairings, Multi-Identity Single-Key Decryption without Random Oracles, Universally Composable Adaptive Oblivious Transfer, Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems, Pairings in Trusted Computing, Tracing Malicious Proxies in Proxy Re-encryption, Revocable Hierarchical Identity-Based Encryption: History-Free Update, Security Against Insiders, and Short Ciphertexts, Zero-Knowledge Authenticated Order Queries and Order Statistics on a List, A provably secure certificate-based encryption scheme against malicious CA attacks in the standard model, Novel updatable identity-based hash proof system and its applications, Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography, Secure administration of cryptographic role-based access control for large-scale cloud storage systems, Déjà Q: Encore! Un Petit IBE, Fully Secure IBE with Tighter Reduction in Prime Order Bilinear Groups, Identity-based encryption with leakage-amplified chosen-ciphertext attacks security, A multi-authority approach to various predicate encryption types, Leakage-Resilient Functional Encryption via Pair Encodings, Secret Handshakes with Dynamic Expressive Matching Policy, Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions, Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information, Anonymous Encryption with Partial-Order Subset Delegation Functionality, Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model, Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem, Compact E-Cash and Simulatable VRFs Revisited, Identity Based Group Signatures from Hierarchical Identity-Based Encryption, Forward-Secure Group Signatures from Pairings, Revocable identity-based encryption with server-aided ciphertext evolution, Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys, Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees, Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes, Fully Secure Functional Encryption for Inner Products, from Standard Assumptions, Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming, Privacy-Aware Attribute-Based Encryption with User Accountability, Attribute-based re-encryption scheme in the standard model, An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem, Ciphertext-Policy Delegatable Hidden Vector Encryption and Its Application to Searchable Encryption in Multi-user Setting, On the Efficient Implementation of Pairing-Based Protocols, Publicly Verifiable Secret Sharing for Cloud-Based Key Management, A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems, New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts, Robust Encryption, Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, Public key encryption with equality test via hash proof system, Short tightly secure signatures for signing a vector of group elements: a new approach, Time-and-ID-based proxy reencryption scheme, Computing on authenticated data, Privacy-preserving encryption scheme using DNA parentage test, An efficient IBE scheme with tight security reduction in the random oracle model, Self-updatable encryption with short public parameters and its extensions, Tight chosen ciphertext attack (CCA)-secure hybrid encryption scheme with full public verifiability, Efficient subtree-based encryption for fuzzy-entity data sharing, Upgrading to functional encryption, Tightly secure signatures and public-key encryption, Certificateless signcryption scheme in the standard model, Revocable policy-based chameleon hash, Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions, Revocable hierarchical identity-based encryption with shorter private keys and update keys, Rerandomizable signatures under standard assumption, Bonsai trees, or how to delegate a lattice basis, Batch verification of short signatures, An identity-based encryption scheme with compact ciphertexts, Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications, Shorter identity-based encryption via asymmetric pairings, Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks, Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings, Certificateless message recovery signatures providing Girault's level-3 security, On the bit security of the weak Diffie-Hellman problem, Functional encryption for computational hiding in prime order groups via pair encodings, Forward-secure ID based digital signature scheme with forward-secure private key generator, Anonymous certificate-based broadcast encryption with constant decryption cost, Attribute-based encryption schemes with constant-size ciphertexts, Intrusion-resilient identity-based signatures: concrete scheme in the standard model and generic construction, Relations between semantic security and anonymity in identity-based encryption, Cryptanalysis of an identity based broadcast encryption scheme without random oracles, Efficient traceable signatures in the standard model, Identity-based revocation system: enhanced security model and scalable bounded IBRS construction with short parameters, Practical chosen ciphertext secure encryption from factoring, Revocable hierarchical identity-based encryption via history-free approach, Provably-secure time-bound hierarchical key assignment schemes, Programmable hash functions and their applications, Adaptively secure identity-based broadcast encryption with constant size private keys and ciphertexts from the subgroups, Improved inner-product encryption with adaptive security and full attribute-hiding, Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions, Tight security for the generic construction of identity-based signature (in the multi-instance setting), Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption, Security-level switchable attribute-based encryption under the strictly weaker assumption family, Efficient identity-based threshold decryption scheme from bilinear pairings, New technique for chosen-ciphertext security based on non-interactive zero-knowledge, (Dual) server-aided revocable attribute-based encryption with decryption key exposure resistance, Creation of identity-based digital signature schemes from bilinear maps, Identity-based broadcast encryption with shorter transmissions, Chosen ciphertext secure fuzzy identity based encryption without ROM, Efficient public key encryption with equality test in the standard model, Efficient selective identity-based encryption without random oracles, An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem, New methods and abstractions for RSA-based forward secure signatures, Efficient identity-based encryption with hierarchical key-insulation from HIBE, Strongly secure authenticated key exchange from factoring, codes, and lattices, Secure public-key encryption scheme without random oracles, Security analysis of an identity-based strongly unforgeable signature scheme, All-but-many encryption, Self-updatable encryption: time constrained access control with hidden attributes and better efficiency, Computational friendly attribute-based encryptions with short ciphertext, Forward-secure identity-based encryption with direct chosen-ciphertext security in the standard model, New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem, IRIBE: intrusion-resilient identity-based encryption, A new framework for the design and analysis of identity-based identification schemes, Robust encryption, Doubly spatial encryption from DBDH, Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search, Flexible attribute-based proxy re-encryption for efficient data sharing, Anonymous HIBE with short ciphertexts: full security in prime order groups, Efficient attribute-based encryption with attribute revocation for assured data deletion, 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, Hidden attribute-based signatures without anonymity revocation, Revocable hierarchical identity-based encryption, Efficient hybrid encryption from ID-based encryption, Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism, Fully CCA2 secure identity based broadcast encryption without random oracles, Extensions of access structures and their cryptographic applications, An identity-based strongly unforgeable signature without random oracles from bilinear pairings, A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system, Research on attacking a special elliptic curve discrete logarithm problem, Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption, Novel generic construction of leakage-resilient PKE scheme with CCA security, Pairings for cryptographers, Revocable hierarchical identity-based encryption with adaptive security, A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model, Computing pairings using \(x\)-coordinates only, A strong provably secure IBE scheme without bilinear map, Verifiable random functions: relations to identity-based key encapsulation and new constructions, New constructions of statistical NIZKs: dual-mode DV-NIZKs and more, Statistical ZAPR arguments from bilinear maps, Robust property-preserving hash functions for Hamming distance and more, Generic construction of server-aided revocable hierarchical identity-based encryption, Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance, Verifiable random functions with optimal tightness, Identity-based authenticated encryption with identity confidentiality, Wildcarded identity-based encryption from lattices, Direct chosen-ciphertext secure identity-based key encapsulation without random oracles, The twin Diffie-Hellman problem and applications, 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, New constructions of hinting PRGs, OWFs with encryption, and more, Don't tamper with dual system encryption. Beyond polynomial related-key security of IBE, Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
