Generic Fully Simulatable Adaptive Oblivious Transfer
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.1 pp.232-245
- Publication Date
- 2015/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E98.A.232
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Foundation
Authors
Kaoru KUROSAWA
Ibaraki University
Ryo NOJIMA
Network Security Research Institute, NICT
Le Trieu PHONG
Network Security Research Institute, NICT
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kaoru KUROSAWA, Ryo NOJIMA, Le Trieu PHONG, "Generic Fully Simulatable Adaptive Oblivious Transfer" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 1, pp. 232-245, January 2015, doi: 10.1587/transfun.E98.A.232.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.232/_p
Copy
@ARTICLE{e98-a_1_232,
author={Kaoru KUROSAWA, Ryo NOJIMA, Le Trieu PHONG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Generic Fully Simulatable Adaptive Oblivious Transfer},
year={2015},
volume={E98-A},
number={1},
pages={232-245},
abstract={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.},
keywords={},
doi={10.1587/transfun.E98.A.232},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Generic Fully Simulatable Adaptive Oblivious Transfer
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 232
EP - 245
AU - Kaoru KUROSAWA
AU - Ryo NOJIMA
AU - Le Trieu PHONG
PY - 2015
DO - 10.1587/transfun.E98.A.232
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2015
AB - 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.
ER -
English
