Reusable garbled circuits and succinct functional encryption
From MaRDI portal
Recommendations
- Stronger security for reusable garbled circuits, general definitions and attacks
- Functional encryption for bounded collusions, revisited
- Functional Encryption for Turing Machines
- Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits
- Succinct randomized encodings and their applications
Cited in
(only showing first 100 items - show all)- Impossibility of simulation secure functional encryption even with random oracles
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Proofs of Work from worst-case assumptions
- Stronger security for reusable garbled circuits, general definitions and attacks
- Privacy-free garbled circuits for formulas: size zero and information-theoretic
- Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Function-private functional encryption in the private-key setting
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Functional encryption for cubic polynomials and implementation
- Functional encryption for cascade automata
- Candidate iO from homomorphic encryption schemes
- Combiners for functional encryption, unconditionally
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Tightly CCA-secure inner product functional encryption scheme
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Unbounded multi-party computation from learning with errors
- Threshold garbled circuits and ad hoc secure computation
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Candidate obfuscation via oblivious LWE sampling
- Multi-client functional encryption for separable functions
- Amplifying the security of functional encryption, unconditionally
- Succinct non-interactive secure computation
- Deniable fully homomorphic encryption from learning with errors
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- CCA secure \textit{a posteriori} openable encryption in the standard model
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Unclonable polymers and their cryptographic applications
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
- Optimal bounded-collusion secure functional encryption
- From FE combiners to secure MPC and back
- Attribute based encryption for deterministic finite automata from DLIN
- Access control encryption with efficient verifiable sanitized decryption
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Constrained pseudorandom functions from functional encryption
- A new approach to practical function-private inner product encryption
- Reusable garbled Turing machines without FHE
- On the power of rewinding simulators in functional encryption
- Toward non-interactive zero-knowledge proofs for NP from LWE
- A survey of lattice based expressive attribute based encryption
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
- Decentralized multi-client functional encryption for set intersection with improved efficiency
- Partitioned searchable encryption
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Output-compressing randomized encodings and applications
- Functional Encryption for Turing Machines
- Multi-input functional encryption and its application in outsourcing computation
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- Network oblivious transfer
- Adaptively secure garbled circuits from one-way functions
- Fully secure functional encryption for inner products, from standard assumptions
- How to run Turing machines on encrypted data
- Multi-input functional encryption with unbounded-message security
- Verifiable functional encryption
- Reactive garbling: foundation, instantiation, application
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Deniable Attribute Based Encryption for Branching Programs from LWE
- From cryptomania to obfustopia through secret-key functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Compactness vs collusion resistance in functional encryption
- Efficient inner product encryption with simulation-based security
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Practical order-revealing encryption with limited leakage
- Garbled circuits as randomized encodings of functions: a primer
- Adaptive simulation security for inner product functional encryption
- Reusable garbled deterministic finite automata from learning with errors
- Strongly full-hiding inner product encryption
- Self-updatable encryption: time constrained access control with hidden attributes and better efficiency
- Collusion resistant traitor tracing from learning with errors
- Functional encryption for cascade automata (extended abstract)
- Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
- From Minicrypt to Obfustopia via private-key functional encryption
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Multi-input inner-product functional encryption from pairings
- On Removing Graded Encodings from Functional Encryption
- Functional encryption: deterministic to randomized functions from simple assumptions
- Cryptography with updates
- Simple and generic constructions of succinct functional encryption
- On the complexity of compressing obfuscation
- Obfustopia built on secret-key functional encryption
- White-box cryptography with global device binding from message-recoverable signatures and token-based obfuscation
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Candidate iO from homomorphic encryption schemes
- Unbounded predicate inner product functional encryption from pairings
- Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Fully-secure MPC with minimal trust
- Collusion-resistant functional encryption for RAMs
This page was built for publication: Reusable garbled circuits and succinct functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495826)
