2 Search Results for "Venturi, Daniele"


Document
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
Track A: Algorithms, Complexity and Games
Cryptographic Reverse Firewalls for Interactive Proof Systems

Authors: Chaya Ganesh, Bernardo Magri, and Daniele Venturi

Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)


Abstract
We study interactive proof systems (IPSes) in a strong adversarial setting where the machines of honest parties might be corrupted and under control of the adversary. Our aim is to answer the following, seemingly paradoxical, questions: - Can Peggy convince Vic of the veracity of an NP statement, without leaking any information about the witness even in case Vic is malicious and Peggy does not trust her computer? - Can we avoid that Peggy fools Vic into accepting false statements, even if Peggy is malicious and Vic does not trust her computer? At EUROCRYPT 2015, Mironov and Stephens-Davidowitz introduced cryptographic reverse firewalls (RFs) as an attractive approach to tackling such questions. Intuitively, a RF for Peggy/Vic is an external party that sits between Peggy/Vic and the outside world and whose scope is to sanitize Peggy’s/Vic’s incoming and outgoing messages in the face of subversion of her/his computer, e.g. in order to destroy subliminal channels. In this paper, we put forward several natural security properties for RFs in the concrete setting of IPSes. As our main contribution, we construct efficient RFs for different IPSes derived from a large class of Sigma protocols that we call malleable. A nice feature of our design is that it is completely transparent, in the sense that our RFs can be directly applied to already deployed IPSes, without the need to re-implement them.

Cite as

Chaya Ganesh, Bernardo Magri, and Daniele Venturi. Cryptographic Reverse Firewalls for Interactive Proof Systems. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 55:1-55:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


Copy BibTex To Clipboard

@InProceedings{ganesh_et_al:LIPIcs.ICALP.2020.55,
  author =	{Ganesh, Chaya and Magri, Bernardo and Venturi, Daniele},
  title =	{{Cryptographic Reverse Firewalls for Interactive Proof Systems}},
  booktitle =	{47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
  pages =	{55:1--55:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-138-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{168},
  editor =	{Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.55},
  URN =		{urn:nbn:de:0030-drops-124621},
  doi =		{10.4230/LIPIcs.ICALP.2020.55},
  annote =	{Keywords: Subversion, Algorithm substitution attacks, Cryptographic reverse firewalls, Interactive proofs, Zero knowledge}
}
  • Refine by Author
  • 2 Venturi, Daniele
  • 1 Ganesh, Chaya
  • 1 Madathil, Varun
  • 1 Magri, Bernardo
  • 1 Orsini, Chris
  • Show More...

  • Refine by Classification
  • 1 Security and privacy → Cryptography
  • 1 Security and privacy → Information-theoretic techniques
  • 1 Theory of computation → Cryptographic protocols

  • Refine by Keyword
  • 1 Algorithm substitution attacks
  • 1 Black-Box compiler
  • 1 Cryptographic reverse firewalls
  • 1 Interactive proofs
  • 1 Malicious Security
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2020
  • 1 2022