Maliciously-secure MrNISC in the plain model

DOI10.1007/978-3-031-30617-4_4OpenAlexW3204113604MaRDI QIDQ6061354

Aayush Jain, Ilan Komargodski, Rex Fernando

Publication date: 8 December 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-30617-4_4

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Reusable secure computation in the plain model

Cites Work

• Unnamed Item
• Unnamed Item
• Definitions and properties of zero-knowledge proof systems
• One-message zero knowledge and non-malleable commitments
• Statistical witness indistinguishability (and more) in two messages
• A new approach to round-optimal secure multiparty computation
• Four round secure computation without setup
• Round-optimal secure two-party computation from trapdoor permutations
• Round optimal concurrent MPC via strong simulation
• Statistical ZAP arguments
• Multiparty reusable non-interactive secure computation from LWE
• Unbounded multi-party computation from learning with errors
• Black-box non-interactive non-malleable commitments
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• Round optimal secure multiparty computation from minimal assumptions
• Reusable two-round MPC from DDH
• Mr NISC: multiparty reusable non-interactive secure computation
• Non-interactive non-malleability from quantum supremacy
• Two-round maliciously secure computation with super-polynomial simulation
• Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
• Counterexamples to Hardness Amplification beyond Negligible
• Concurrently Secure Computation in Constant Rounds
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Adaptive One-Way Functions and Applications
• Reusable Two-Round MPC from LPN
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
• Multi-collision resistance: a paradigm for keyless hash functions
• Advances in Cryptology – CRYPTO 2004
• Recursive composition and bootstrapping for SNARKS and proof-carrying data
• The Exact Round Complexity of Secure Computation
• Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
• Maliciously secure massively parallel computation for all-but-one corruptions

This page was built for publication: Maliciously-secure MrNISC in the plain model