DROPS

Document

DOI: 10.4230/LIPIcs.ITC.2022.5

From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic

Authors: Varun Madathil, Chris Orsini, Alessandra Scafuro, and Daniele Venturi

Published in: LIPIcs, Volume 230, 3rd Conference on Information-Theoretic Cryptography (ITC 2022)

Abstract

We present an information-theoretic transformation from any 2-round OT protocol with only game-based security in the presence of malicious adversaries into a 4-round (which is known to be optimal) OT protocol with simulation-based security in the presence of malicious adversaries. Our transform is the first satisfying all of the following properties at the same time: - It is in the plain model, without requiring any setup assumption. - It only makes black-box usage of the underlying OT protocol. - It is information-theoretic, as it does not require any further cryptographic assumption (besides the existence of the underlying OT protocol). Additionally, our transform yields a cubic improvement in communication complexity over the best previously known transformation.

Cite as

Varun Madathil, Chris Orsini, Alessandra Scafuro, and Daniele Venturi. From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic. In 3rd Conference on Information-Theoretic Cryptography (ITC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 230, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{madathil_et_al:LIPIcs.ITC.2022.5,
  author =	{Madathil, Varun and Orsini, Chris and Scafuro, Alessandra and Venturi, Daniele},
  title =	{{From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic}},
  booktitle =	{3rd Conference on Information-Theoretic Cryptography (ITC 2022)},
  pages =	{5:1--5:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-238-9},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{230},
  editor =	{Dachman-Soled, Dana},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2022.5},
  URN =		{urn:nbn:de:0030-drops-164836},
  doi =		{10.4230/LIPIcs.ITC.2022.5},
  annote =	{Keywords: Oblivious Transfer, Black-Box compiler, Malicious Security, Plain Model}
}

Document

DOI: 10.4230/DagRep.9.1.88

Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042)

Authors: Jan Camenisch, Ralf Küsters, Anna Lysyanskaya, and Alessandra Scafuro

Published in: Dagstuhl Reports, Volume 9, Issue 1 (2019)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 19042 "Practical Yet Composably Secure Cryptographic Protocols". The workshop's main aim was to enhance the community's understanding of (1) what a good model was for how various protocols and systems co-exist in a larger system; (2) how to model important tasks and security protocols in such a model; (3) how to prove security of protocols in such a model.

Cite as

Jan Camenisch, Ralf Küsters, Anna Lysyanskaya, and Alessandra Scafuro. Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042). In Dagstuhl Reports, Volume 9, Issue 1, pp. 88-103, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@Article{camenisch_et_al:DagRep.9.1.88,
  author =	{Camenisch, Jan and K\"{u}sters, Ralf and Lysyanskaya, Anna and Scafuro, Alessandra},
  title =	{{Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042)}},
  pages =	{88--103},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{1},
  editor =	{Camenisch, Jan and K\"{u}sters, Ralf and Lysyanskaya, Anna and Scafuro, Alessandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.1.88},
  URN =		{urn:nbn:de:0030-drops-105710},
  doi =		{10.4230/DagRep.9.1.88},
  annote =	{Keywords: applied cryptography, cryptographic protocols, practical protocols, provably secure protocols, security models, universally composability}
}

Search Results

Documents authored by Scafuro, Alessandra

From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic

Abstract

Cite as

Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042)

Abstract

Cite as

Thanks for your feedback!

Could not send message