Statistical security in two-party computation revisited

DOI10.1007/978-3-031-22365-5_7zbMath1528.68131OpenAlexW4312531083MaRDI QIDQ6114269

Sikhar Patranabis, Pratik Sarkar, Saikrishna Badrinarayanan

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_7

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (4)

Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Statistical security in two-party computation revisited ⋮ Best of both worlds. Revisiting the spymasters double agent problem ⋮ A framework for statistically sender private OT with optimal rate

Cites Work

• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Bit commitment using pseudorandomness
• A proof of security of Yao's protocol for two-party computation
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Two-message statistically sender-private OT from LWE
• 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
• Promise zero knowledge and its applications to round optimal MPC
• How to construct constant-round zero-knowledge proof systems for NP
• Statistical ZAP arguments
• Statistical Zaps and new oblivious transfer protocols
• Compact, efficient and UC-secure isogeny-based oblivious transfer
• Two-round oblivious transfer from CDH or LPN
• Round optimal secure multiparty computation from minimal assumptions
• On statistical security in two-party computation
• Cryptographic group actions and applications
• Oblivious transfer from trapdoor permutations in minimal rounds
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Maliciously Circuit-Private FHE
• Round-Optimal Black-Box Two-Party Computation
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Oblivious Transfer Is Symmetric
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Advances in Cryptology – CRYPTO 2004
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Zaps and Their Applications
• Which Languages Have 4-Round Zero-Knowledge Proofs?
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Circuit-Private Multi-key FHE
• The Exact Round Complexity of Secure Computation
• Two Round Multiparty Computation via Multi-key FHE
• Round-optimal secure multi-party computation
• Statistical security in two-party computation revisited
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Statistically sender-private OT from LPN and derandomization

This page was built for publication: Statistical security in two-party computation revisited