Robust additive randomized encodings from IO and pseudo-non-linear codes
From MaRDI portal
Recommendations
- Additive randomized encodings and their applications
- Succinct randomized encodings and their applications
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Encoding functions with constant online rate or how to compress garbled circuits keys
- Output-compressing randomized encodings and applications
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A sieve algorithm for the shortest lattice vector problem
- Additive randomized encodings and their applications
- Circular-Secure Encryption from Decision Diffie-Hellman
- Classical hardness of learning with errors
- Cryptography in NC^0
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Indistinguishability obfuscation from well-founded assumptions
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Non-interactive multiparty computation without correlated randomness
- Non-interactive secure multiparty computation
- On lattices, learning with errors, random linear codes, and cryptography
- Perfect secure computation in two rounds
- Public-key cryptosystems from the worst-case shortest vector problem
- Resettably Secure Computation
- Stateless Cryptographic Protocols
- Statistically sender-private OT from LPN and derandomization
- The Discrete Logarithm Hides $O(\log n)$ Bits
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
Cited in
(2)
This page was built for publication: Robust additive randomized encodings from IO and pseudo-non-linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653025)
