Score:0

What is a efficient algorithm to compute e(u, v) in bilinear map

cd flag

My problem is about this paper Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost https://www.sciencedirect.com/science/article/pii/S0304397517309143

I don't know what is the "efficient algorithm" in section 3, paragraph 2, the second sentence of this paper.

Could you give me some explanation or related knowledge about this?

Score:1
ru flag

These schemes are usually instantiated with an elliptic curve pairing (Weil, Tate, Ate, Eta...) essentially based on Miller's algorithm on a pairing-friendly elliptic curve. Miller's algorithm uses polynomially many field operation to produce the output and hence is considered efficient. Further optimisations are possible.

I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.