Additive randomized encodings and their applications

DOI10.1007/978-3-031-38557-5_7OpenAlexW4385654010MaRDI QIDQ6186592

Yuval Ishai, Eyal Kushilevitz, Shai Halevi, 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

zbMATH Keywords

shuffle modelnon-interactive secure computationrobust computational ARE

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best possible information-theoretic MPC
• Non-interactive multiparty computation without correlated randomness
• Private aggregation from fewer anonymous messages
• Distributed differential privacy via shuffling
• Uncovering algebraic structures in the MPC landscape
• A minimal model for secure computation (extended abstract)
• Non-Interactive Secure Multiparty Computation
• Resettably Secure Computation
• Identity-Based Encryption from the Weil Pairing
• Garbled Circuits as Randomized Encodings of Functions: a Primer
• Perfect Secure Computation in Two Rounds
• Analysis of Boolean Functions
• On the (im)possibility of obfuscating programs
• How to Garble Arithmetic Circuits
• Stateless Cryptographic Protocols
• Obfuscation for Evasive Functions
• Cryptography in $NC^0$
• Quadratic multiparty randomized encodings beyond honest majority and their applications

This page was built for publication: Additive randomized encodings and their applications