Additive randomized encodings and their applications
From MaRDI portal
Publication:6186592
DOI10.1007/978-3-031-38557-5_7OpenAlexW4385654010MaRDI QIDQ6186592FDOQ6186592
Authors: Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin 
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38557-5_7
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
- Identity-Based Encryption from the Weil Pairing
- Analysis of Boolean Functions
- Cryptography in $NC^0$
- A minimal model for secure computation (extended abstract)
- Title not available (Why is that?)
- On the (im)possibility of obfuscating programs
- Obfuscation for evasive functions
- Non-interactive secure multiparty computation
- Best possible information-theoretic MPC
- Non-interactive multiparty computation without correlated randomness
- Garbled circuits as randomized encodings of functions: a primer
- Perfect secure computation in two rounds
- How to garble arithmetic circuits
- Distributed differential privacy via shuffling
- Low-complexity cryptographic hash functions
- Private aggregation from fewer anonymous messages
- Uncovering algebraic structures in the MPC landscape
- Title not available (Why is that?)
- Resettably Secure Computation
- Stateless Cryptographic Protocols
- Quadratic multiparty randomized encodings beyond honest majority and their applications
Cited In (1)
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)
