Cryptography with constant computational overhead
From MaRDI portal
Recommendations
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Efficient non-interactive secure computation
- Cryptography with constant input locality
- Actively secure garbled circuits with constant communication overhead in the plain model
- Actively secure garbled circuits with constant communication overhead in the plain model
Cited in
(61)- Improved filter permutators for efficient FHE: better instances and implementations
- Quantum algorithms for the \(k\)-XOR problem
- Actively secure garbled circuits with constant communication overhead in the plain model
- On the complexity of random satisfiability problems with planted solutions
- Limits on adaptive security for attribute-based encryption
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Non-interactive secure computation of inner-product from LPN and LWE
- Oblivious transfer with constant computational overhead
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
- Indistinguishability obfuscation from well-founded assumptions
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Towards topology-hiding computation from oblivious transfer
- Rate-1, linear time and additively homomorphic UC commitments
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- On the minimum depth of circuits with linear number of wires encoding good codes
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- Cryptographic hardness of random local functions -- survey
- Fast pseudorandom functions based on expander graphs
- Binary AMD circuits from secure multiparty computation
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Ligero: lightweight sublinear arguments without a trusted setup
- A dichotomy for local small-bias generators
- Cryptographic primitives enforcing communication and storage complexity
- A framework for statistically sender private OT with optimal rate
- How to recover a secret with O(n) additions
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- On linear-size pseudorandom generators and hardcore functions
- Faster sounder succinct arguments and \textsf{IOP}s
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Pseudorandom functions: three decades later
- Lightweight transparent zero-knowledge proofs for cross-domain statements
- Cryptographic hardness of random local functions. Survey
- Cryptography with constant input locality
- Indistinguishability obfuscation
- Low-complexity cryptographic hash functions
- Asymptotically quasi-optimal cryptography
- Homomorphic encryption
- Verifiable random functions with optimal tightness
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- A systematic study of sparse LWE
- Lossy cryptography from code-based assumptions
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- More efficient oblivious transfer extensions
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- On the impossibility of ``succinct automata representation of hash functions
- Locally computable UOWHF with linear shrinkage
- Proving as fast as computing: succinct arguments with constant prover overhead
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- An efficient structural attack on NIST submission DAGS
- Algebraic attacks against random local functions and their countermeasures
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
This page was built for publication: Cryptography with constant computational overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549728)
