Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The Journal of Supercomputing

A generic construction to build simple oblivious transfer protocols from homomorphic encryption schemes

Saeid Esmaeilzade, Nasrollah Pakniat, Ziba Eslami

Published May 20, 2021• 7 citations
Publisher
DOI
10.1007/s11227-021-03826-0

Related papers

A simple generic construction to build oblivious transfer protocols from homomorphic encryption schemes.

Saeid Esmaeilzade, Ziba Eslami, Nasrollah Pakniat

•Jan 1, 2020•0 citations

Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption

Isheeta Nargis

Lecture notes in computer science•Jan 1, 2017•3 citations

Generic Fully Simulatable Adaptive Oblivious Transfer.

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong

Abstract. We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic methods can be extended to build universally composable (UC) secure, and leakage-resilient OT protocols.

•Jan 1, 2011•0 citations

Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols

Huafei Zhu

Lecture notes in computer science•Jan 1, 2008•0 citations

Generic Fully Simulatable Adaptive Oblivious Transfer

Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong

We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, and DCR. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. The constructions follow a novel designing approach called “blind permutation”, which completely differs from existing ones. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic methods can be extended to build universally composable (UC) secure OT protocols, with a loss in efficiency.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2015•0 citations

A Secure Protocol for the Oblivious Transfer (Extended Abstract)

Michael J. Fischer, Silvio M. Micali, Charles Rackoff

Journal of Cryptology•Jan 1, 1996•28 citations
Abstract. We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic methods can be extended to build universally composable (UC) secure, and leakage-resilient OT protocols.
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, and DCR. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. The constructions follow a novel designing approach called “blind permutation”, which completely differs from existing ones. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic methods can be extended to build universally composable (UC) secure OT protocols, with a loss in efficiency.