Additive randomized encodings and their applications
From MaRDI portal
Publication:6186592
Recommendations
- Robust additive randomized encodings from IO and pseudo-non-linear codes
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- Succinct randomized encodings and their applications
- Statistical randomized encodings: a complexity theoretic view
- Encoding functions with constant online rate or how to compress garbled circuits keys
Cites work
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- scientific article; zbMATH DE number 7650419 (Why is no real title available?)
- A minimal model for secure computation (extended abstract)
- Analysis of Boolean Functions
- Best possible information-theoretic MPC
- Cryptography in $NC^0$
- Distributed differential privacy via shuffling
- Garbled circuits as randomized encodings of functions: a primer
- How to garble arithmetic circuits
- Identity-Based Encryption from the Weil Pairing
- Low-complexity cryptographic hash functions
- Non-interactive multiparty computation without correlated randomness
- Non-interactive secure multiparty computation
- Obfuscation for evasive functions
- On the (im)possibility of obfuscating programs
- Perfect secure computation in two rounds
- Private aggregation from fewer anonymous messages
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- Resettably Secure Computation
- Stateless Cryptographic Protocols
- Uncovering algebraic structures in the MPC landscape
This page was built for publication: Additive randomized encodings and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186592)