{'fraction_non_alphanumeric': 0.02413793103448276, 'fraction_numerical': 0.005747126436781609, 'mean_word_length': 5.5, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
AN EFFICIENT PROTOCOL FOR RESTRICTED ADAPTIVE OBLIVIOUS TRANSFER

Restricted adaptive oblivious transfer was introduced by Herranz in 2011, which is the main approach to protect user privacy in e-transactions involving operations on digital confidential data or sensitive information. There are many practical applications for restricted adaptive oblivious transfer, such as medical or financial data access, pay-per-view TV, and so on. However, so far as we know, there are only two protocols for restricted adaptive oblivious transfers which were both proposed by Herranz [8]. Furthermore, these two protocols are very expensive. In this paper, we propose a new protocol for restricted adaptive oblivious transfer by using fully homomorphic encryption. Compared with Herranz’s constructions, our protocol is more efficient in the cost of communication and computation.