scientific article; zbMATH DE number 2086626

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800244.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (47)

Broadcast-optimal two round MPC with an honest majority ⋮ Perfect secure computation in two rounds ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Statistical Randomized Encodings: A Complexity Theoretic View ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Fine-grained secure computation ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ On \(d\)-multiplicative secret sharing ⋮ (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Efficient NIZKs for algebraic sets ⋮ From private simultaneous messages to zero-information Arthur-Merlin protocols and back ⋮ Additive randomized encodings and their applications ⋮ A framework for statistically sender private OT with optimal rate ⋮ Indistinguishability obfuscation ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Information-theoretically secure MPC against mixed dynamic adversaries ⋮ On actively-secure elementary MPC reductions ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Foundations of Homomorphic Secret Sharing ⋮ Perfect Secure Computation in Two Rounds ⋮ Functional encryption for cubic polynomials and implementation ⋮ Minimizing locality of one-way functions via semi-private randomized encodings ⋮ Secure computation without computers ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ Key-dependent message security: generic amplification and completeness ⋮ On the power of secure two-party computation ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Unnamed Item ⋮ Cryptography with constant input locality ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Broadcast-optimal two-round MPC

This page was built for publication: