The following pages link to Multi-input Functional Encryption (Q5418717):
Displaying 50 items.
- Strongly full-hiding inner product encryption (Q511916) (← links)
- A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation (Q780319) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Upgrading to functional encryption (Q1629441) (← links)
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- Decentralized multi-client functional encryption for inner product (Q1710623) (← 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)
- Fully secure functional encryption with a large class of relations from the decisional linear assumption (Q2010596) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- Functional encryption for set intersection in the multi-client setting (Q2068378) (← links)
- Functional encryption for attribute-weighted sums from \(k\)-Lin (Q2096503) (← links)
- Dynamic decentralized functional encryption (Q2096508) (← links)
- Multi-input quadratic functional encryption from pairings (Q2139634) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- Decentralized multi-client functional encryption for set intersection with improved efficiency (Q2692968) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Multi-party functional encryption (Q2697858) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Cutting-Edge Cryptography Through the Lens of Secret Sharing (Q2799105) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- Multi-input Functional Encryption and Its Application in Outsourcing Computation (Q2801771) (← links)
- Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682) (← links)
- Simulation-Based Secure Functional Encryption in the Random Oracle Model (Q2946439) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- Achieving IND-CCA Security for Functional Encryption for Inner Products (Q2980849) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Verifiable Computation for Randomized Algorithm (Q3179479) (← links)
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
- Revocation in Publicly Verifiable Outsourced Computation (Q3454572) (← links)
- Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116) (← links)
- Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More (Q3457126) (← links)
- Practical Order-Revealing Encryption with Limited Leakage (Q4639494) (← links)
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials (Q5041154) (← links)
- Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper) (Q5056018) (← links)
- A New Functional Encryption for Multidimensional Range Query (Short Paper) (Q5056029) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Ad Hoc PSM Protocols: Secure Computation Without Coordination (Q5270377) (← links)
