Generic Fully Simulatable Adaptive Oblivious Transfer-Reference-Cited by-同舟云学术

Generic Fully Simulatable Adaptive Oblivious Transfer

Published:2015 Issue:1 Volume:E98.A Page:232-245
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

KUROSAWA Kaoru¹,NOJIMA Ryo²,PHONG Le Trieu²

Affiliation:

1. Department of Computer and Information Sciences, Ibaraki University

2. Security Fundamentals Laboratory, Network Security Research Institute, NICT

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E98.A/1/E98.A_232/_pdf

Reference31 articles.

1. [1] M. Ajtai, J. Komlós, and E. Szemerédi, “An O(n log n) sorting network,” STOC, pp.1-9. ACM, 1983.

2. [2] A. Boldyreva, “Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme,” Y. Desmedt, ed., Public Key Cryptography, Lect. Notes Comput. Sci., vol.2567, pp.31-46, Springer, 2003.

3. [3] J. Camenisch, G. Neven, and A. Shelat, “Simulatable adaptive oblivious transfer,” M. Naor, ed., EUROCRYPT, Lect. Notes Comput. Sci., vol.4515, pp.573-590, Springer, 2007.

4. [4] C.-K. Chu and W.-G. Tzeng, “Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries,” S. Vaudenay, ed., Public Key Cryptography, Lect. Notes Comput. Sci., vol.3386, pp.172-183, Springer, 2005.

5. [5] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to algorithms, second edition, MIT Press, 2001.