Better Two-Round Adaptive Multi-party Computation
From MaRDI portal
Publication:5738763
DOI10.1007/978-3-662-54388-7_14zbMath1400.94130OpenAlexW2573396131MaRDI QIDQ5738763
Muthuramakrishnan Venkitasubramaniam, Oxana Poburinnaya, Ran Canetti
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_14
Related Items (6)
Two-round adaptively secure multiparty computation from standard assumptions ⋮ Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Broadcast-optimal two-round MPC
Cites Work
- Optimal-rate non-committing encryption
- Computationally private randomizing polynomials and their applications
- Fully Succinct Garbled RAM
- Leakage-Tolerant Interactive Protocols
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- How to Generate and Use Universal Samplers
- Perfectly Secure Oblivious RAM without Random Oracles
- On Invertible Sampling and Adaptive Security
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Universally composable two-party and multi-party secure computation
- Perfect Non-interactive Zero Knowledge for NP
- Universally Composable Security with Global Setup
- Equivocating Yao
- Fully homomorphic encryption using ideal lattices
- How to use indistinguishability obfuscation
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Two-Round Secure MPC from Indistinguishability Obfuscation
This page was built for publication: Better Two-Round Adaptive Multi-party Computation
