A PKI-based Framework for Establishing Efficient MPC Channels
Daniel Masny, Gaven J. Watson
Abstract
The Transport Layer Security (TLS) protocol is a fundamental building block for ensuring security on Internet. It provides an easy to use framework for the purposes of establishing an authenticated and secure channel between two parties that have never physically met. Nevertheless, TLS only provides a simple cryptographic functionality compared to more advanced protocols such as protocols for secure multiparty computation (MPC). In this work, we provide a framework for efficiently establishing channels for MPC over the Internet. We focus on MPC protocols in the oblivious transfer (OT) hybrid model such that it is sufficient to establish OT correlations for such a channel. We revisit and combine different notions of UC security proposed in both the MPC and authenticated key exchange settings. Through this work, we show how an OT protocol can be composed with a secure authenticator to ensure the authenticity of messages sent during the OT. In addition, we adapt and analyse non-interactive OTs based on dense key encapsulation mechanisms (KEMs) in the random oracle model, where the first message, i.e. public key, can be reused. These KEMs can be instantiated based on CDH, RSA and LWE and after a performance and security evaluation, it turns out that the resulting OT protocols are very competitive with the state of the art and are able to leverage existing PKIs.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 467f1fcc-e959-4f2e-ae56-d62d18e974b5Builds on3
- Endemic Oblivious TransferDaniel Masny, Peter RindalCCS 2019 · 50 citations
- Key Confirmation in Key Exchange: A Formal Treatment and Implications for TLS 1.3Marc Fischlin, Felix Günther, Benedikt Schmidt, Bogdan WarinschiS&P 2016 · 1 citation
- Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public FunctionsIan McQuoid, Mike Rosulek, Lawrence RoyCCS 2020
Related papers
- Password-Authenticated TLS via OPAQUE and Post-Handshake AuthenticationJulia Hesse, Stanislaw Jarecki, Hugo Krawczyk, Christopher A. WoodEUROCRYPT 2023 · 9 citations
- On the Round Complexity of Black-Box Secure MPCYuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram SrinivasanCRYPTO 2021 · 18 citations
- Two-Round Oblivious Transfer from CDH or LPNNico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny et al.EUROCRYPT 2020 · 52 citations
- List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin TossingMichele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik WaldnerCRYPTO 2023 · 4 citations
- Compact, Efficient and UC-Secure Isogeny-Based Oblivious TransferYi-Fu Lai, Steven D. Galbraith, Cyprien Delpech de Saint GuilhemEUROCRYPT 2021 · 43 citations
