Hidden Authentication Oblivious Transfer

Tzeng W. Efficient 1-out-of-n oblivious transfer schemes with universal usable parameters [J].IEEE Trans on Computers.2004, 53(2):232-240[2]Naor M and Pinkas B. Efficient oblivious transfer protocols. Proceedings of SODA 2001, SIAM Symposium on Discrete Algorithms, New York ACM, 2001: 448-457.[3]Li N, John C, and William H. Design of a role-based trust management framework. Proceedings of the 2002 IEEE Symposium on Security and Privacy, Los Alamitos, California, IEEE Computer Society Press, 2002: 114-130.[4]Bradshaw R, Holt J, and Seamons K. Concealing complex policies with hidden credentials. Eleventh ACM Conference on Computer and Communications Security, New York, ACM Press, 2004: 146-157.[5]Chu C and Tzeng W. Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries. Public Key Cryptography - PKC 2005: 8th International Workshop on Theory and Practice in Public Key Cryptography(Lecture Notes in Computer Science), Berlin, Springer-verlag, 2005, Vol. 3386: 23-26.[6]Boneh D and Franklin M. Identity-based encryption from the Weil pairing. Proceedings of Crypto 2001 (Lecture Notes in Computer Science), Berlin, Springer-verlag, 2001, Vol. 2139: 213-229.[7]Boldyreva A. Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme[J].Proceedings of the Public-Key Cryptography (PKC03) (Lecture Notes in Computer Science), Berlin, Springer-Verlag.2003, Vol. 2567:31-46