Black-box reusable NISC with random oracles

DOI10.1007/978-3-031-30617-4_3MaRDI QIDQ6061353

Akshayaram Srinivasan, Amit Sahai, Yuval Ishai, Dakshita Khurana

Publication date: 8 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

zbMATH Keywords

reusable NISC protocol for general functions

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25) Communication theory (94A05) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-key fully-homomorphic encryption in the plain model
• Multiparty reusable non-interactive secure computation from LWE
• Unbounded multi-party computation from learning with errors
• Reusable two-round MPC from DDH
• On the round complexity of black-box secure MPC
• Round-optimal black-box protocol compilers
• Reusable non-interactive secure computation
• Efficient Non-interactive Secure Computation
• Black-Box Constructions of Protocols for Secure Computation
• Founding Cryptography on Oblivious Transfer – Efficiently
• Universally-Composable Two-Party Computation in Two Rounds
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Reusable Two-Round MPC from LPN
• Non-interactive Secure 2PC in the Offline/Online and Batch Settings
• Non-Interactive Secure Computation Based on Cut-and-Choose
• Advances in Cryptology - CRYPTO 2003
• Authenticated garbling from simple correlations
• Round-optimal black-box secure computation from two-round malicious OT

This page was built for publication: Black-box reusable NISC with random oracles