Robust additive randomized encodings from IO and pseudo-non-linear codes
From MaRDI portal
Publication:6653025
DOI10.1007/978-3-031-68397-8_4MaRDI QIDQ6653025
Publication date: 13 December 2024
Cites Work
- Non-interactive multiparty computation without correlated randomness
- Non-Interactive Secure Multiparty Computation
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Circular-Secure Encryption from Decision Diffie-Hellman
- Resettably Secure Computation
- The Discrete Logarithm Hides $O(\log n)$ Bits
- Perfect Secure Computation in Two Rounds
- Public-key cryptosystems from the worst-case shortest vector problem
- A sieve algorithm for the shortest lattice vector problem
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Stateless Cryptographic Protocols
- Classical hardness of learning with errors
- Cryptography in $NC^0$
- On lattices, learning with errors, random linear codes, and cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Statistically sender-private OT from LPN and derandomization
- Additive randomized encodings and their applications
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)
