Additive randomized encodings from public key encryption

DOI10.1007/978-3-032-01884-7_8MaRDI QIDQ6863906zbMATH OpenFDO

Authors Nir Bitansky, Saroja Erabelli, Rachit Garg

Publication date 4 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01884-7_8

zbMATH Keywords

non-interactive secure computationrobust computational AREshuffle model

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A minimal model for secure computation (extended abstract)
• Additive randomized encodings and their applications
• Circular-Secure Encryption from Decision Diffie-Hellman
• Cryptography in NC^0
• Garbled circuits as randomized encodings of functions: a primer
• scientific article; zbMATH DE number 2086626 (Why is no real title available?)
• New directions in cryptography
• Non-interactive multiparty computation without correlated randomness
• Non-interactive secure multiparty computation
• Perfect secure computation in two rounds
• Robust additive randomized encodings from IO and pseudo-non-linear codes
• Secure multi-party computation
• The Complexity of Public-Key Cryptography
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Uncovering algebraic structures in the MPC landscape

This page was built for publication: Additive randomized encodings from public key encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863906)