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

DOI10.1007/978-3-031-38557-5_15OpenAlexW4385654295MaRDI QIDQ6186600

Luisa Siniscalchi, Hendrik Waldner, Rafail Ostrovsky, Michele Ciampi

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

round complexitylist two-party computation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Round optimal black-box ``commit-and-prove
• Two-message statistically sender-private OT from LWE
• A new approach to round-optimal secure multiparty computation
• Four round secure computation without setup
• Promise zero knowledge and its applications to round optimal MPC
• Round optimal secure multiparty computation from minimal assumptions
• On the round complexity of black-box secure MPC
• Round-optimal and communication-efficient multiparty computation
• Round-optimal multi-party computation with identifiable abort
• Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Founding Cryptography on Oblivious Transfer – Efficiently
• Advances in Cryptology – CRYPTO 2004
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Constant round non-malleable protocols using one way functions
• Alternative Protocols for Generalized Oblivious Transfer
• The Exact Round Complexity of Secure Computation
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation

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