Round-optimal black-box two-party computation

DOI10.1007/978-3-662-48000-7_17MaRDI QIDQ3457073zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Round-optimal secure two-party computation from trapdoor permutations
• Round-optimal black-box secure computation from two-round malicious OT
• Advances in Cryptology – CRYPTO 2004
• On the round complexity of black-box secure MPC
• What Security Can We Achieve Within 4 Rounds?

Cites work

• (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
• A Framework for Efficient and Composable Oblivious Transfer
• Black-box constructions of composable protocols without set-up
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Constant-round black-box construction of composable multi-party computation protocol
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Efficient non-interactive secure computation
• Founding Cryptography on Oblivious Transfer – Efficiently
• How to share a secret
• Revisiting lower and upper bounds for selective decommitments
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Unconditionally secure and universally composable commitments from physical assumptions

Cited in

(32)

• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Round optimal black-box ``commit-and-prove
• Unbounded ABE via bilinear entropy expansion, revisited
• On secure two-party computation in three rounds
• Round-optimal secure two-party computation from trapdoor permutations
• Round-efficient black-box construction of composable multi-party computation
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
• What security can we achieve within 4 rounds?
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
• On the round complexity of black-box secure MPC
• On black-box extension of a non-interactive zero-knowledge proof system for secret equality
• Round-optimal black-box protocol compilers
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Oblivious transfer from trapdoor permutations in minimal rounds
• The feasibility of outsourced database search in the plain model
• What Security Can We Achieve Within 4 Rounds?
• Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Advances in Cryptology – CRYPTO 2004
• Constant round adaptively secure protocols in the tamper-proof hardware model
• On the exact round complexity of self-composable two-party computation
• Separating two-round secure computation from oblivious transfer
• 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
• List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
• Improved black-box constructions of composable secure computation
• Black-box constant-round secure 2PC with succinct communication
• Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH

This page was built for publication: Round-optimal black-box two-party computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457073)