The following pages link to (Q4737161):
Displaying 41 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Secure computation without computers (Q517015) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- Adaptively simulation-secure attribute-hiding predicate encryption (Q1710619) (← links)
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin (Q2188962) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Information-theoretically secure MPC against mixed dynamic adversaries (Q2695650) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- (Q3191596) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5918800) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
