Metraipolis › archive › dc_d62f893e0ef9

Oblivious transfer — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Oblivious_transfer
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T00:05:10.350Z
SHA-256 of the archived text
3bc4c217b0705f43cf28bb4c50bbf1f8babf2a54fdbb40b0cca97ce457ec6db8
Stable URL of this page
https://metraipolis.com/documento/dc_d62f893e0ef9

How to cite

Oblivious transfer — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Oblivious_transfer (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d62f893e0ef9 (Metraipolis archive dc_d62f893e0ef9, sha256 3bc4c217b0705f43cf28bb4c50bbf1f8babf2a54fdbb40b0cca97ce457ec6db8)
BibTeX
@misc{dcd62f893e0ef9,
  title = {Oblivious transfer — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Oblivious_transfer},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d62f893e0ef9; sha256 3bc4c217b0705f43cf28bb4c50bbf1f8babf2a54fdbb40b0cca97ce457ec6db8},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Oblivious_transfer. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In cryptography, an oblivious transfer (OT) protocol is a type of protocol in which a sender transfers one of potentially many pieces of information to a receiver, but remains oblivious as to what piece (if any) has been transferred. The first form of oblivious transfer was introduced in 1981 by Michael O. Rabin. In this form, the sender sends a message to the receiver with probability 1/2, while the sender remains oblivious as to whether or not the receiver received the message. Rabin's oblivious transfer scheme is based on the RSA cryptosystem. A more useful form of oblivious transfer called 1–2 oblivious transfer or "1 out of 2 oblivious transfer", was developed later by Shimon Even, Oded Goldreich, and Abraham Lempel, in order to build protocols for secure multiparty computation. It is generalized to "1 out of n oblivious transfer" where the user gets exactly one database element without the server getting to know which element was queried, and without the user knowing anything about the other elements that were not retrieved. The latter notion of oblivious transfer is a strengthening of private information retrieval, in which the database is not kept private. Claude Crépeau showed that Rabin's oblivious transfer is equivalent to 1–2 oblivious transfer. Further work has revealed oblivious transfer to be a fundamental and important problem in cryptography. It is considered one of the critical problems in the field, because of the importance of the applications that can be built based on it. In particular, it is complete for secure multiparty computation: that is, given an implementation of oblivious transfer it is possible to securely evaluate any polynomial time computable function without any additional primitive.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «zero-knowledge proof»).
Fonte: Wikipedia in inglese, voce «Oblivious transfer» — https://en.wikipedia.org/wiki/Oblivious_transfer
Wikidata Q2915383 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2915383
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Oblivious_transfer?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1374574926, consultata il 2026-10-05T23:26:53.245Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 6394765525bf0588de3974a94fba375a4b0ba2245934d740ee58ee0a26efcc6b