scientific article
From MaRDI portal
Publication:3549728
zbMath1231.94050MaRDI QIDQ3549728
Eyal Kushilevitz, Amit Sahai, Yuval Ishai, Rafail Ostrovsky
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (45)
On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ An efficient structural attack on NIST submission DAGS ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ A dichotomy for local small-bias generators ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Cryptographic hardness of random local functions. Survey ⋮ Asymptotically quasi-optimal cryptography ⋮ Locally computable UOWHF with linear shrinkage ⋮ More efficient oblivious transfer extensions ⋮ Improved filter permutators for efficient FHE: better instances and implementations ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ Oblivious transfer with constant computational overhead ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ Algebraic Attacks against Random Local Functions and Their Countermeasures ⋮ How to recover a secret with \(O(n)\) additions ⋮ A framework for statistically sender private OT with optimal rate ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ Indistinguishability obfuscation ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ Verifiable random functions with optimal tightness ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments ⋮ Unnamed Item ⋮ Pseudorandom Functions: Three Decades Later ⋮ Homomorphic Encryption ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
This page was built for publication:
