Round-Optimal Black-Box Two-Party Computation
From MaRDI portal
Publication:3457073
DOI10.1007/978-3-662-48000-7_17zbMath1352.94056OpenAlexW1472328655MaRDI QIDQ3457073
Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro
Publication date: 10 December 2015
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-48000-7_17
Related Items
On the round complexity of black-box secure MPC, Round-optimal fully black-box zero-knowledge arguments from one-way permutations, Round optimal black-box ``commit-and-prove, Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity, On black-box extension of a non-interactive zero-knowledge proof system for secret equality, Unbounded ABE via bilinear entropy expansion, revisited, Round-optimal black-box protocol compilers, A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement, Statistical security in two-party computation revisited, Round-optimal black-box secure computation from two-round malicious OT, Black-box anonymous commit-and-prove, Knowledge encryption and its applications to simulatable protocols with low round-complexity, Round-optimal black-box MPC in the plain model, Reusable secure computation in the plain model, Oblivious transfer from trapdoor permutations in minimal rounds, Computing boundary cycle of a pseudo-triangle polygon from its visibility graph, Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model, On the Exact Round Complexity of Self-composable Two-Party Computation, What security can we achieve within 4 rounds?, Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?, The Feasibility of Outsourced Database Search in the Plain Model, What Security Can We Achieve Within 4 Rounds?
Cites Work
- Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
- Black-Box Constructions of Composable Protocols without Set-Up
- (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
- Efficient Non-interactive Secure Computation
- How to share a secret
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Revisiting Lower and Upper Bounds for Selective Decommitments
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
