Constant-round YOSO MPC without setup

DOI10.62056/AE5W4FE-3MaRDI QIDQ7326397zbMATH OpenFDO

Authors Sebastian Kolby, Divya Ravi, Sophia Yakoubov

Publication date 9 September 2026

Published in Unnamed Author (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AE5W4FE-3

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Blockchains enable non-interactive MPC
• Broadcast-optimal two round MPC with an honest majority
• Broadcast-optimal two-round MPC
• Can a public blockchain keep a secret?
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Cryptography in the multi-string model
• Cryptography in the Multi-string Model
• Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
• Fluid MPC: secure multiparty computation with dynamic participants
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• How to share a secret
• scientific article; zbMATH DE number 1808209 (Why is no real title available?)
• scientific article; zbMATH DE number 2043334 (Why is no real title available?)
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• Multiparty computation with low communication, computation and interaction via threshold FHE
• On lattices, learning with errors, random linear codes, and cryptography
• Perfect MPC over layered graphs
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Random-index PIR and applications
• Round-optimal secure multiparty computation with honest majority
• SCALES. MPC with small clients and larger ephemeral servers
• Secure computation on the web: computing without simultaneous interaction
• Secure multiparty computation from threshold encryption based on class groups
• Taming adaptivity in YOSO protocols: the modular way
• Two-round multiparty secure computation from minimal assumptions
• Universally composable security: a new paradigm for cryptographic protocols
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles

This page was built for publication: Constant-round YOSO MPC without setup

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