Pages that link to "Item:Q2914259"
From MaRDI portal
The following pages link to Functional Encryption with Bounded Collusions via Multi-party Computation (Q2914259):
Displaying 50 items.
- Strongly full-hiding inner product encryption (Q511916) (← links)
- Self-updatable encryption: time constrained access control with hidden attributes and better efficiency (Q511917) (← links)
- Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
- Traitor-tracing from LWE made simple and attribute-based (Q1631335) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← 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)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← 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)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- Functional encryption for Turing machines with dynamic bounded collusion from LWE (Q2139636) (← links)
- White box traitor tracing (Q2139638) (← links)
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience (Q2152060) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- Incompressible cryptography (Q2170026) (← links)
- Dynamic collusion bounded functional encryption from identity-based encryption (Q2170069) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Access control encryption with efficient verifiable sanitized decryption (Q2200529) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- A new approach to practical function-private inner product encryption (Q2317860) (← links)
- Efficient revocable identity-based encryption via subset difference methods (Q2402970) (← links)
- On the power of rewinding simulators in functional encryption (Q2407055) (← links)
- Applied homomorphic cryptography: examples (Q2416828) (← links)
- Adaptively secure inner product encryption from LWE (Q2691591) (← links)
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions (Q2692377) (← links)
- Decentralized multi-client functional encryption for set intersection with improved efficiency (Q2692968) (← links)
- Unclonable encryption, revisited (Q2695639) (← links)
- ABE for DFA from LWE against bounded collusions, revisited (Q2697861) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- Functional Encryption Without Obfuscation (Q2799106) (← links)
- Multi-input Functional Encryption and Its Application in Outsourcing Computation (Q2801771) (← links)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- Simulation-Based Secure Functional Encryption in the Random Oracle Model (Q2946439) (← links)
- Verifiable Functional Encryption (Q2953789) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy (Q3181033) (← links)
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
