Identity-based matchmaking encryption from standard assumptions
From MaRDI portal
Publication:6135441
Recommendations
- Identity-based matchmaking encryption without random oracles
- Match me if you can: matchmaking encryption and its applications
- Match me if you can: matchmaking encryption and its applications
- Efficient (anonymous) compact HIBE from standard assumptions
- Shorter identity-based encryption via asymmetric pairings
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Bonsai trees, or how to delegate a lattice basis
- Decentralizing attribute-based encryption
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dual System Encryption via Predicate Encodings
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Hierarchical Predicate Encryption for Inner-Products
- Homomorphic Encryption and Signatures from Vector Decomposition
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Identity-based matchmaking encryption from standard assumptions
- Identity-based matchmaking encryption without random oracles
- Improved dual system ABE in prime-order groups via predicate encodings
- Match me if you can: matchmaking encryption and its applications
- New proof methods for attribute-based encryption: achieving full security through selective techniques
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
- Shorter IBE and signatures via asymmetric pairings
- Shorter identity-based encryption via asymmetric pairings
- Some key techniques on pairing vector spaces
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Trapdoors for hard lattices and new cryptographic constructions
- Unbounded HIBE and Attribute-Based Encryption
Cited in
(10)- A feasibility evaluation of fair and privacy-enhanced matchmaking with identity linked wishes
- Match me if you can: matchmaking encryption and its applications
- Match me if you can: matchmaking encryption and its applications
- Multi-key and multi-input predicate encryption from learning with errors
- Identity-based matchmaking encryption from standard assumptions
- Identity-based matchmaking encryption without random oracles
- CCA-secure identity-based matchmaking encryption from standard assumptions
- Identity-based matchmaking encryption with stronger security and instantiation on lattices
- Bilateral access control abe from lattices and application to AB-ME
- Identity-based signature and identity-based matchmaking encryption from lattices
This page was built for publication: Identity-based matchmaking encryption from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135441)
