List oblivious transfer and applications to round-optimal black-box multiparty coin tossing

DOI10.1007/978-3-031-38557-5_15MaRDI QIDQ6186600zbMATH OpenOpenAlexFDO

Authors Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner

Publication date 2 February 2024

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

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

zbMATH Keywords

list two-party computationround complexity

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• On the round complexity of black-box secure MPC
• Round-optimal black-box two-party computation
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• Separating two-round secure computation from oblivious transfer
• What Security Can We Achieve Within 4 Rounds?

Cites work

• A new approach to round-optimal secure multiparty computation
• Advances in Cryptology – CRYPTO 2004
• Alternative Protocols for Generalized Oblivious Transfer
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Constant round non-malleable protocols using one way functions
• Constant-round non-malleable commitments from sub-exponential one-way functions
• Efficient oblivious transfer protocols
• Founding Cryptography on Oblivious Transfer – Efficiently
• Four round secure computation without setup
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 2009981 (Why is no real title available?)
• On Robust Combiners for Oblivious Transfer and Other Primitives
• On the round complexity of black-box secure MPC
• Promise zero knowledge and its applications to round optimal MPC
• Round optimal black-box ``commit-and-prove
• Round optimal secure multiparty computation from minimal assumptions
• Round-optimal and communication-efficient multiparty computation
• Round-optimal multi-party computation with identifiable abort
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• The Exact Round Complexity of Secure Computation
• Two-message statistically sender-private OT from LWE

Cited in

(4)

• Round-optimal black-box multiparty computation from polynomial-time assumptions
• QuietOT: lightweight oblivious transfer with a public-key setup
• Broadcast-optimal secure computation from black-box oblivious transfer
• Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH

This page was built for publication: List oblivious transfer and applications to round-optimal black-box multiparty coin tossing

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