Pages that link to "Item:Q3000543"
From MaRDI portal
The following pages link to Functional Encryption: Definitions and Challenges (Q3000543):
Displaying 50 items.
- An efficient IBE scheme with tight security reduction in the random oracle model (Q264126) (← links)
- Self-updatable encryption with short public parameters and its extensions (Q264135) (← links)
- Generalized closest substring encryption (Q300391) (← links)
- Spatial encryption supporting non-monotone access structure (Q404924) (← links)
- Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
- Attribute-based encryption schemes with constant-size ciphertexts (Q417988) (← links)
- Anonymous spatial encryption under affine space delegation functionality with full security (Q506150) (← links)
- Strongly full-hiding inner product encryption (Q511916) (← links)
- Self-updatable encryption: time constrained access control with hidden attributes and better efficiency (Q511917) (← links)
- Secure computation without computers (Q517015) (← links)
- Verifiability-based conversion from CPA to CCA-secure predicate encryption (Q683914) (← links)
- A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation (Q780319) (← links)
- Post-quantum secure inner product functional encryption using multivariate public key cryptography (Q821514) (← links)
- Balancing access control and privacy for data deduplication via functional encryption (Q826391) (← links)
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption (Q887451) (← links)
- Revocable hierarchical identity-based encryption via history-free approach (Q906383) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Upgrading to functional encryption (Q1629441) (← links)
- Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Adaptively simulation-secure attribute-hiding predicate encryption (Q1710619) (← links)
- Decentralized multi-client functional encryption for inner product (Q1710623) (← links)
- Practical fully secure unrestricted inner product functional encryption modulo \(p\) (Q1710625) (← links)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions (Q1747658) (← links)
- Function-private functional encryption in the private-key setting (Q1747663) (← links)
- Leakage-resilient attribute based encryption in prime-order groups via predicate encodings (Q1752551) (← links)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- Predicate signatures from pair encodings via dual system proof technique (Q2009416) (← links)
- Fully secure functional encryption with a large class of relations from the decisional linear assumption (Q2010596) (← links)
- Functional encryption for cascade automata (Q2013591) (← links)
- Simple and efficient FE for quadratic functions (Q2043408) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts (Q2056698) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- Steel: composable hardware-based stateful and randomised functional encryption (Q2061984) (← links)
- Functional encryption for set intersection in the multi-client setting (Q2068378) (← links)
- Verifiable registration-based encryption (Q2096501) (← links)
- Functional encryption for attribute-weighted sums from \(k\)-Lin (Q2096503) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Dynamic decentralized functional encryption (Q2096508) (← links)
- Access control encryption from group encryption (Q2117042) (← links)
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency (Q2124234) (← links)
- Multi-input quadratic functional encryption from pairings (Q2139634) (← links)
