scientific article; zbMATH DE number 2086626
From MaRDI portal
Publication:4737161
Recommendations
Cited in
(63)- Cryptography with constant input locality
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Perfect secure computation in two rounds
- On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
- 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
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- Adaptively simulation-secure attribute-hiding predicate encryption
- Minimizing locality of one-way functions via semi-private randomized encodings
- Functional encryption for cubic polynomials and implementation
- 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
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Broadcast-optimal two-round MPC
- Broadcast-optimal two round MPC with an honest majority
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- On the power of secure two-party computation
- 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
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Constant-Size Commitments to Polynomials and Their Applications
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- scientific article; zbMATH DE number 6351503 (Why is no real title available?)
- Zero-information protocols and unambiguity in Arthur-Merlin communication
- Statistical randomized encodings: a complexity theoretic view
- Improved Garbled Circuit: Free XOR Gates and Applications
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Foundations of homomorphic secret sharing
- Garbled circuits as randomized encodings of functions: a primer
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
- Perfect secure computation in two rounds
- Secure computation without computers
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
- On \(d\)-multiplicative secret sharing
- Actively secure arithmetic computation and VOLE with constant computational overhead
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Actively secure garbled circuits with constant communication overhead in the plain model
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Efficient NIZKs for algebraic sets
- Additive randomized encodings and their applications
- A framework for statistically sender private OT with optimal rate
- Indistinguishability obfuscation
- The round complexity of statistical MPC with optimal resiliency
- Compact NIZKs from standard assumptions on bilinear maps
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Improved polynomial secret-sharing schemes
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Additive randomized encodings from public key encryption
- Nondeterministic quasi-polynomial time is average-case hard for \textsf{ACC} circuits
- Honest majority GOD MPC with \(O(\operatorname{depth}(C))\) rounds and low online communication
- Robustness for space-bounded statistical zero knowledge
- Majority vs. approximate linear sum and average-case complexity below NC^1
- Succinct garbled circuits with low-depth garbling algorithms
- Key-dependent message security: generic amplification and completeness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737161)
