Verifiable functional encryption
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Attribute-based encryption for circuits
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Delegatable homomorphic encryption with applications to secure outsourcing of computation
- Derandomization in Cryptography
- Efficient Identity-Based Encryption Without Random Oracles
- Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure accountable-authority identity-based encryption
- Fully secure functional encryption with general relations from the decisional linear assumption
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Fuzzy Identity-Based Encryption
- Identity-Based Encryption from the Weil Pairing
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation: from approximate to exact
- Multi-input inner-product functional encryption from pairings
- Non-interactive Zaps and New Techniques for NIZK
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate encryption for circuits from LWE
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Reusable garbled circuits and succinct functional encryption
- Verifiable functional encryption
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
Cited in
(30)- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Mergeable functional encryption
- More efficient verifiable functional encryption
- Multi-input non-interactive functional encryption: constructions and applications
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Escrow-free encryption supporting cryptographic workflow
- Verifiable functional encryption
- Verifiable Inner Product Encryption Scheme
- A survey on functional encryption
- Functional Encryption for Turing Machines
- Verifiable decentralized multi-client functional encryption for inner product
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- Cryptographically resilient functions
- CRYPTAUTOMATA WITH FUNCTIONAL KEYS
- (Multi-input) \textsf{FE} for randomized functionalities, revisited
- Adaptively secure streaming functional encryption
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Deniable Functional Encryption
- COA-secure obfuscation and applications
- Lightweight, maliciously secure verifiable function secret sharing
- Steel: composable hardware-based stateful and randomised functional encryption
- Generic anamorphic encryption, revisited: new limitations and constructions
- Publicly auditable functional encryption
- Vector and functional commitments from lattices
- Verifiable functional encryption using Intel SGX
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Dynamic decentralized functional encryption
- Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
This page was built for publication: Verifiable functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953789)
